Update of /cvsroot/boost/boost/boost/xpressive/detail/utility
In directory sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv20508/detail/utility
Modified Files:
symbols.hpp
Log Message:
consistent unix line endings
Index: symbols.hpp
===================================================================
RCS file: /cvsroot/boost/boost/boost/xpressive/detail/utility/symbols.hpp,v
retrieving revision 1.4
retrieving revision 1.5
diff -u -d -r1.4 -r1.5
--- symbols.hpp 14 Jul 2007 07:36:26 -0000 1.4
+++ symbols.hpp 20 Jul 2007 15:26:08 -0000 1.5
@@ -1,194 +1,194 @@
-///////////////////////////////////////////////////////////////////////////////
-/// \file symbols.hpp
-/// Contains the Ternary Search Trie implementation.
-/// Based on the following papers:
-/// J. Bentley and R. Sedgewick. (1998) Ternary search trees. Dr. Dobbs Journal
-/// G. Badr and B.J. Oommen. (2005) Self-Adjusting of Ternary Search Tries
Using
-/// Conditional Rotations and Randomized Heuristics
-//
-// Copyright 2007 David Jenkins. Distributed under the Boost
-// Software License, Version 1.0. (See accompanying file
-// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-
-#ifndef BOOST_XPRESSIVE_DETAIL_SYMBOLS_HPP_DRJ_06_11_2007
-#define BOOST_XPRESSIVE_DETAIL_SYMBOLS_HPP_DRJ_06_11_2007
-
-// MS compatible compilers support #pragma once
-#if defined(_MSC_VER) && (_MSC_VER >= 1020)
-# pragma once
-#endif
-
-#include <boost/range/iterator.hpp>
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
-#include <boost/intrusive_ptr.hpp>
-#include <boost/xpressive/detail/utility/counted_base.hpp>
-
-namespace boost { namespace xpressive { namespace detail
-{
-
-
///////////////////////////////////////////////////////////////////////////////
- // symbols (using a ternary search trie)
- //
- template<typename Map>
- struct symbols
- {
- typedef typename range_value<Map>::type::first_type key_type;
- typedef typename range_value<Map>::type::second_type value_type;
- typedef typename range_value<key_type>::type char_type;
- typedef typename range_iterator<Map const>::type iterator;
- typedef typename range_iterator<key_type const>::type key_iterator;
- typedef value_type const *result_type;
-
- symbols()
- : root(0)
- {}
-
- // copies of this symbols table share the TST
-
- template<typename Trans>
- void load(Map const &map, Trans trans)
- {
- if(0 == this->root)
- {
- iterator begin = boost::begin(map);
- iterator end = boost::end(map);
- for(; begin != end; ++begin)
- {
- key_iterator kbegin = boost::begin(begin->first);
- key_iterator kend = boost::end(begin->first);
- this->root = this->insert(this->root, kbegin, kend,
&begin->second, trans);
- }
- }
- }
-
- template<typename BidiIter, typename Trans>
- result_type operator ()(BidiIter &begin, BidiIter end, Trans trans)
const
- {
- return this->search(begin, end, trans);
- }
-
- template<typename Sink>
- void peek(Sink const &sink) const
- {
- this->peek_(this->root, sink);
- }
-
- private:
- struct node;
- typedef intrusive_ptr<node> node_ptr;
-
- struct node
- : counted_base<node>
- {
- node()
- : counted_base<node>()
- , ch(0)
- , lo(0)
- , eq(0)
- , hi(0)
- , result(0)
- {}
-
- char_type ch;
- node_ptr lo;
- node_ptr eq;
- node_ptr hi;
- result_type result;
- };
-
- template<typename Trans>
- node_ptr insert(node_ptr const &pp, key_iterator &begin, key_iterator
end, result_type r, Trans trans) const
- {
- node_ptr p = pp;
- char_type c1 = 0;
-
- if(begin != end)
- {
- c1 = trans(*begin);
- }
-
- if(!p)
- {
- p = new node;
- p->ch = c1;
- }
-
- if(c1 < p->ch)
- {
- p->lo = this->insert(p->lo, begin, end, r, trans);
- }
- else if(c1 == p->ch)
- {
- if(0 == c1)
- {
- p->result = r;
- }
- else
- {
- p->eq = this->insert(p->eq, ++begin, end, r, trans);
- }
- }
- else
- {
- p->hi = this->insert(p->hi, begin, end, r, trans);
- }
-
- return p;
- }
-
- template<typename BidiIter, typename Trans>
- result_type search(BidiIter &begin, BidiIter end, Trans trans) const
- {
- const node* p = this->root.get();
- result_type r = (0 == p->ch ? p->result : 0);
- if (begin == end)
- return r;
-
- BidiIter isave = begin;
- char_type c1 = trans(*begin);
- while(p)
- {
- if(c1 == p->ch)
- {
- ++begin;
- p = p->eq.get();
- if (0 == p->ch)
- {
- isave = begin;
- r = p->result;
- }
- if(begin == end)
- break;
- c1 = trans(*begin);
- }
- else if(c1 < p->ch)
- {
- p = p->lo.get();
- }
- else // (c1 > p->ch)
- {
- p = p->hi.get();
- }
- }
- begin = isave;
- return r;
- }
-
- template<typename Sink>
- void peek_(node_ptr const &p, Sink const &sink) const
- {
- if(p)
- {
- sink(p->ch);
- this->peek_(p->lo, sink);
- this->peek_(p->hi, sink);
- }
- }
-
- node_ptr root;
- };
-
-}}} // namespace boost::xpressive::detail
-
-#endif
+///////////////////////////////////////////////////////////////////////////////
+/// \file symbols.hpp
+/// Contains the Ternary Search Trie implementation.
+/// Based on the following papers:
+/// J. Bentley and R. Sedgewick. (1998) Ternary search trees. Dr. Dobbs Journal
+/// G. Badr and B.J. Oommen. (2005) Self-Adjusting of Ternary Search Tries
Using
+/// Conditional Rotations and Randomized Heuristics
+//
+// Copyright 2007 David Jenkins. Distributed under the Boost
+// Software License, Version 1.0. (See accompanying file
+// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
+#ifndef BOOST_XPRESSIVE_DETAIL_SYMBOLS_HPP_DRJ_06_11_2007
+#define BOOST_XPRESSIVE_DETAIL_SYMBOLS_HPP_DRJ_06_11_2007
+
+// MS compatible compilers support #pragma once
+#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+# pragma once
+#endif
+
+#include <boost/range/iterator.hpp>
+#include <boost/range/begin.hpp>
+#include <boost/range/end.hpp>
+#include <boost/intrusive_ptr.hpp>
+#include <boost/xpressive/detail/utility/counted_base.hpp>
+
+namespace boost { namespace xpressive { namespace detail
+{
+
+
///////////////////////////////////////////////////////////////////////////////
+ // symbols (using a ternary search trie)
+ //
+ template<typename Map>
+ struct symbols
+ {
+ typedef typename range_value<Map>::type::first_type key_type;
+ typedef typename range_value<Map>::type::second_type value_type;
+ typedef typename range_value<key_type>::type char_type;
+ typedef typename range_iterator<Map const>::type iterator;
+ typedef typename range_iterator<key_type const>::type key_iterator;
+ typedef value_type const *result_type;
+
+ symbols()
+ : root(0)
+ {}
+
+ // copies of this symbols table share the TST
+
+ template<typename Trans>
+ void load(Map const &map, Trans trans)
+ {
+ if(0 == this->root)
+ {
+ iterator begin = boost::begin(map);
+ iterator end = boost::end(map);
+ for(; begin != end; ++begin)
+ {
+ key_iterator kbegin = boost::begin(begin->first);
+ key_iterator kend = boost::end(begin->first);
+ this->root = this->insert(this->root, kbegin, kend,
&begin->second, trans);
+ }
+ }
+ }
+
+ template<typename BidiIter, typename Trans>
+ result_type operator ()(BidiIter &begin, BidiIter end, Trans trans)
const
+ {
+ return this->search(begin, end, trans);
+ }
+
+ template<typename Sink>
+ void peek(Sink const &sink) const
+ {
+ this->peek_(this->root, sink);
+ }
+
+ private:
+ struct node;
+ typedef intrusive_ptr<node> node_ptr;
+
+ struct node
+ : counted_base<node>
+ {
+ node()
+ : counted_base<node>()
+ , ch(0)
+ , lo(0)
+ , eq(0)
+ , hi(0)
+ , result(0)
+ {}
+
+ char_type ch;
+ node_ptr lo;
+ node_ptr eq;
+ node_ptr hi;
+ result_type result;
+ };
+
+ template<typename Trans>
+ node_ptr insert(node_ptr const &pp, key_iterator &begin, key_iterator
end, result_type r, Trans trans) const
+ {
+ node_ptr p = pp;
+ char_type c1 = 0;
+
+ if(begin != end)
+ {
+ c1 = trans(*begin);
+ }
+
+ if(!p)
+ {
+ p = new node;
+ p->ch = c1;
+ }
+
+ if(c1 < p->ch)
+ {
+ p->lo = this->insert(p->lo, begin, end, r, trans);
+ }
+ else if(c1 == p->ch)
+ {
+ if(0 == c1)
+ {
+ p->result = r;
+ }
+ else
+ {
+ p->eq = this->insert(p->eq, ++begin, end, r, trans);
+ }
+ }
+ else
+ {
+ p->hi = this->insert(p->hi, begin, end, r, trans);
+ }
+
+ return p;
+ }
+
+ template<typename BidiIter, typename Trans>
+ result_type search(BidiIter &begin, BidiIter end, Trans trans) const
+ {
+ const node* p = this->root.get();
+ result_type r = (0 == p->ch ? p->result : 0);
+ if (begin == end)
+ return r;
+
+ BidiIter isave = begin;
+ char_type c1 = trans(*begin);
+ while(p)
+ {
+ if(c1 == p->ch)
+ {
+ ++begin;
+ p = p->eq.get();
+ if (0 == p->ch)
+ {
+ isave = begin;
+ r = p->result;
+ }
+ if(begin == end)
+ break;
+ c1 = trans(*begin);
+ }
+ else if(c1 < p->ch)
+ {
+ p = p->lo.get();
+ }
+ else // (c1 > p->ch)
+ {
+ p = p->hi.get();
+ }
+ }
+ begin = isave;
+ return r;
+ }
+
+ template<typename Sink>
+ void peek_(node_ptr const &p, Sink const &sink) const
+ {
+ if(p)
+ {
+ sink(p->ch);
+ this->peek_(p->lo, sink);
+ this->peek_(p->hi, sink);
+ }
+ }
+
+ node_ptr root;
+ };
+
+}}} // namespace boost::xpressive::detail
+
+#endif
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2005.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Boost-cvs mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/boost-cvs
