|
Chris@16
|
1 /*-----------------------------------------------------------------------------+
|
|
Chris@16
|
2 Copyright (c) 2007-2010: Joachim Faulhaber
|
|
Chris@16
|
3 +------------------------------------------------------------------------------+
|
|
Chris@16
|
4 Distributed under the Boost Software License, Version 1.0.
|
|
Chris@16
|
5 (See accompanying file LICENCE.txt or copy at
|
|
Chris@16
|
6 http://www.boost.org/LICENSE_1_0.txt)
|
|
Chris@16
|
7 +-----------------------------------------------------------------------------*/
|
|
Chris@16
|
8 #ifndef BOOST_ICL_MAPALGO_HPP_JOFA_080225
|
|
Chris@16
|
9 #define BOOST_ICL_MAPALGO_HPP_JOFA_080225
|
|
Chris@16
|
10
|
|
Chris@16
|
11 #include <boost/mpl/and.hpp>
|
|
Chris@16
|
12 #include <boost/mpl/or.hpp>
|
|
Chris@16
|
13 #include <boost/mpl/not.hpp>
|
|
Chris@16
|
14 #include <boost/icl/detail/notate.hpp>
|
|
Chris@16
|
15 #include <boost/icl/detail/set_algo.hpp>
|
|
Chris@16
|
16
|
|
Chris@16
|
17 #ifdef BOOST_MSVC
|
|
Chris@16
|
18 #pragma warning(push)
|
|
Chris@16
|
19 #pragma warning(disable:4127) // conditional expression is constant
|
|
Chris@16
|
20 #endif
|
|
Chris@16
|
21
|
|
Chris@16
|
22 namespace boost{namespace icl
|
|
Chris@16
|
23 {
|
|
Chris@16
|
24 namespace Map
|
|
Chris@16
|
25 {
|
|
Chris@16
|
26
|
|
Chris@16
|
27 template <class ObjectT, class CoObjectT>
|
|
Chris@16
|
28 bool intersects(const ObjectT& left, const CoObjectT& right)
|
|
Chris@16
|
29 {
|
|
Chris@16
|
30 typedef typename CoObjectT::const_iterator co_iterator;
|
|
Chris@16
|
31 co_iterator right_common_lower_, right_common_upper_;
|
|
Chris@16
|
32 if(!Set::common_range(right_common_lower_, right_common_upper_, right, left))
|
|
Chris@16
|
33 return false;
|
|
Chris@16
|
34
|
|
Chris@16
|
35 co_iterator right_ = right_common_lower_;
|
|
Chris@16
|
36 while(right_ != right_common_upper_)
|
|
Chris@16
|
37 if(!(left.find(key_value<CoObjectT>(right_++))==left.end()))
|
|
Chris@16
|
38 return true;
|
|
Chris@16
|
39
|
|
Chris@16
|
40 return false;
|
|
Chris@16
|
41 }
|
|
Chris@16
|
42
|
|
Chris@16
|
43
|
|
Chris@16
|
44 template<class MapT>
|
|
Chris@16
|
45 typename MapT::const_iterator next_proton(typename MapT::const_iterator& iter_, const MapT& object)
|
|
Chris@16
|
46 {
|
|
Chris@16
|
47 while( iter_ != object.end()
|
|
Chris@16
|
48 && (*iter_).second == identity_element<typename MapT::codomain_type>::value())
|
|
Chris@16
|
49 ++iter_;
|
|
Chris@16
|
50
|
|
Chris@16
|
51 return iter_;
|
|
Chris@16
|
52 }
|
|
Chris@16
|
53
|
|
Chris@16
|
54 /** Function template <tt>lexicographical_equal</tt> implements
|
|
Chris@16
|
55 lexicographical equality except for identity_elementic content values. */
|
|
Chris@16
|
56 template<class MapT>
|
|
Chris@16
|
57 bool lexicographical_distinct_equal(const MapT& left, const MapT& right)
|
|
Chris@16
|
58 {
|
|
Chris@16
|
59 if(&left == &right)
|
|
Chris@16
|
60 return true;
|
|
Chris@16
|
61
|
|
Chris@16
|
62 typename MapT::const_iterator left_ = left.begin();
|
|
Chris@16
|
63 typename MapT::const_iterator right_ = right.begin();
|
|
Chris@16
|
64
|
|
Chris@16
|
65 left_ = next_proton(left_, left);
|
|
Chris@16
|
66 right_ = next_proton(right_, right);
|
|
Chris@16
|
67
|
|
Chris@16
|
68 while(left_ != left.end() && right_ != right.end())
|
|
Chris@16
|
69 {
|
|
Chris@16
|
70 if(!(left_->first == right_->first && left_->second == right_->second))
|
|
Chris@16
|
71 return false;
|
|
Chris@16
|
72
|
|
Chris@16
|
73 ++left_;
|
|
Chris@16
|
74 ++right_;
|
|
Chris@16
|
75 left_ = next_proton(left_, left);
|
|
Chris@16
|
76 right_ = next_proton(right_, right);
|
|
Chris@16
|
77 }
|
|
Chris@16
|
78
|
|
Chris@16
|
79 return left_ == left.end() && right_ == right.end();
|
|
Chris@16
|
80 }
|
|
Chris@16
|
81
|
|
Chris@16
|
82 } // namespace Map
|
|
Chris@16
|
83 }} // namespace boost icl
|
|
Chris@16
|
84
|
|
Chris@16
|
85 #ifdef BOOST_MSVC
|
|
Chris@16
|
86 #pragma warning(pop)
|
|
Chris@16
|
87 #endif
|
|
Chris@16
|
88
|
|
Chris@16
|
89 #endif
|
|
Chris@16
|
90
|
