//
// Copyright (C) 2007
// Fraunhofer Institute for Open Communication Systems (FOKUS)
-// Competence Center NETwork research (NET), St. Augustin, GERMANY
-// Stefan Bund <g0dil@berlios.de>
//
-// This program is free software; you can redistribute it and/or modify
-// it under the terms of the GNU General Public License as published by
-// the Free Software Foundation; either version 2 of the License, or
-// (at your option) any later version.
+// The contents of this file are subject to the Fraunhofer FOKUS Public License
+// Version 1.0 (the "License"); you may not use this file except in compliance
+// with the License. You may obtain a copy of the License at
+// http://senf.berlios.de/license.html
//
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-// GNU General Public License for more details.
+// The Fraunhofer FOKUS Public License Version 1.0 is based on,
+// but modifies the Mozilla Public License Version 1.1.
+// See the full license text for the amendments.
//
-// You should have received a copy of the GNU General Public License
-// along with this program; if not, write to the
-// Free Software Foundation, Inc.,
-// 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+// Software distributed under the License is distributed on an "AS IS" basis,
+// WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
+// for the specific language governing rights and limitations under the License.
+//
+// The Original Code is Fraunhofer FOKUS code.
+//
+// The Initial Developer of the Original Code is Fraunhofer-Gesellschaft e.V.
+// (registered association), Hansastraße 27 c, 80686 Munich, Germany.
+// All Rights Reserved.
+//
+// Contributor(s):
+// Stefan Bund <g0dil@berlios.de>
/** \file
\brief ListBParser inline template implementation */
// Custom includes
#define prefix_ inline
-///////////////////////////////cti.p///////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
-///////////////////////////////////////////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
// senf::detail::ListBParser_Policy<ElementParser,AuxPolicy>
template <class ElementParser, class AuxPolicy>
AuxPolicy::aux(0,i,s);
}
-///////////////////////////////////////////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
// senf::detail::ListBParser_Policy<ElementParser,BytesParser>
template <class ElementParser, class AuxPolicy>
-prefix_
-senf::detail::ListBParser_Policy<ElementParser,AuxPolicy>::container_policy::
-container_policy(parser_policy const & p)
- : AuxPolicy (p)
-{
- data_iterator const e (boost::next(parser_type::get(p).i(),parser_type::get(p).bytes()));
- data_iterator i (AuxPolicy::adjust(parser_type::get(p).i(), parser_type::get(p).state()));
- for( n_=0; i!=e;
- ++n_, std::advance(i,senf::bytes(ElementParser(i,parser_type::get(p).state())))) ;
- container_size_ = parser_type::get(p).data().size();
-}
-
-template <class ElementParser, class AuxPolicy>
prefix_ typename senf::detail::ListBParser_Policy<ElementParser,AuxPolicy>::container_policy::size_type
senf::detail::ListBParser_Policy<ElementParser,AuxPolicy>::container_policy::bytes(data_iterator i,
state_type s)
const
{
- return AuxPolicy::aux(i,s) + AuxPolicy::aux_bytes;
+ return AuxPolicy::WrapperPolicy::aux(i,s) + AuxPolicy::aux_bytes;
}
template <class ElementParser, class AuxPolicy>
{
n_ = 0;
container_size_ = s->size();
- AuxPolicy::aux(0,i,s);
+ AuxPolicy::WrapperPolicy::aux(0,i,s);
}
template <class ElementParser, class AuxPolicy>
erase(container_type & c, data_iterator p)
{
size_type b (senf::bytes(ElementParser(p,c.state())));
- AuxPolicy::aux( AuxPolicy::aux(c.i(), c.state())-b, c.i(), c.state());
+ AuxPolicy::WrapperPolicy::aux(
+ AuxPolicy::WrapperPolicy::aux(c.i(), c.state())-b, c.i(), c.state());
--n_;
// The container will be reduced by b bytes directly after this call
container_size_ = c.data().size()-b;
insert(container_type & c, data_iterator p)
{
size_type b (senf::bytes(ElementParser(p,c.state())));
- AuxPolicy::aux( AuxPolicy::aux(c.i(), c.state())+b, c.i(), c.state());
+ AuxPolicy::WrapperPolicy::aux(
+ AuxPolicy::WrapperPolicy::aux(c.i(), c.state())+b, c.i(), c.state());
++n_;
container_size_ = c.data().size();
}
{
if (container_size_ == c.data().size())
return;
- data_iterator i (AuxPolicy::adjust(c.i(), c.state()));
+#if 1
+ data_iterator i (AuxPolicy::WrapperPolicy::adjust(c.i(), c.state()));
data_iterator j (i);
for (size_type n (n_); n; --n, std::advance(j,senf::bytes(ElementParser(j,c.state())))) ;
- aux( std::distance(i,j), c.i(), c.state() );
+ AuxPolicy::WrapperPolicy::aux( std::distance(i,j), c.i(), c.state() );
+#else
+ AuxPolicy::WrapperPolicy::aux( aux(c.i(),c.state()) + c.data().size() - container_size_, c.i(), c.state() );
+#endif
container_size_ = c.data().size();
}
setBegin(container_type const & c, iterator_data & d)
const
{
- return AuxPolicy::adjust(c.i(), c.state());
+ return AuxPolicy::WrapperPolicy::adjust(c.i(), c.state());
}
template <class ElementParser, class AuxPolicy>
setEnd(container_type const & c, iterator_data & d)
const
{
- return boost::next(AuxPolicy::adjust(c.i(), c.state()),aux(c.i(),c.state()));
+ return boost::next(AuxPolicy::WrapperPolicy::adjust(c.i(), c.state()),AuxPolicy::WrapperPolicy::aux(c.i(),c.state()));
}
template <class ElementParser, class AuxPolicy>
const
{
return boost::next( container_type::iterator::get(d).i(),
- senf::bytes(ElementParser( container_type::iterator::get(d).i(),
+ senf::bytes(ElementParser( container_type::iterator::get(d).i(),
c.state() )) );
}
return container_type::iterator::get(d).i();
}
-///////////////////////////////cti.e///////////////////////////////////////
+//-/////////////////////////////////////////////////////////////////////////////////////////////////
#undef prefix_
\f