ceph/src/boost/libs/iterator/test/indirect_iterator_test.cpp

   1 //  (C) Copyright Jeremy Siek 1999.
   2 // Distributed under the Boost Software License, Version 1.0. (See
   3 // accompanying file LICENSE_1_0.txt or copy at
   4 // http://www.boost.org/LICENSE_1_0.txt)
   5
   6 //  Revision History
   7 //  22 Nov 2002 Thomas Witt
   8 //       Added interoperability check.
   9 //  08 Mar 2001   Jeremy Siek
  10 //       Moved test of indirect iterator into its own file. It to
  11 //       to be in iterator_adaptor_test.cpp.
  12
  13 #include <boost/config.hpp>
  14 #include <iostream>
  15 #include <algorithm>
  16
  17 #include <boost/iterator/indirect_iterator.hpp>
  18 #include <boost/iterator/iterator_concepts.hpp>
  19 #include <boost/iterator/new_iterator_tests.hpp>
  20
  21 #include <boost/detail/workaround.hpp>
  22
  23 #include <boost/concept_archetype.hpp>
  24 #include <boost/concept_check.hpp>
  25 #include <boost/shared_ptr.hpp>
  26 #include <boost/utility.hpp>
  27
  28 #include <boost/mpl/has_xxx.hpp>
  29
  30 #include <boost/detail/lightweight_test.hpp>
  31
  32 #include <vector>
  33 #include <stdlib.h>
  34 #include <set>
  35 #include <iterator>
  36
  37 #if !defined(__SGI_STL_PORT)                            \
  38     && (defined(BOOST_MSVC_STD_ITERATOR)                \
  39         || BOOST_WORKAROUND(_CPPLIB_VER, <= 310)        \
  40         || BOOST_WORKAROUND(__GNUC__, <= 2))
  41
  42 // std container random-access iterators don't support mutable/const
  43 // interoperability (but may support const/mutable interop).
  44 # define NO_MUTABLE_CONST_STD_SET_ITERATOR_INTEROPERABILITY
  45
  46 #endif
  47
  48
  49 template <class T> struct see_type;
  50 template <int I> struct see_val;
  51
  52 struct my_iterator_tag : public std::random_access_iterator_tag { };
  53
  54 using boost::dummyT;
  55
  56 typedef std::vector<int> storage;
  57 typedef std::vector<int*> pointer_ra_container;
  58 typedef std::set<storage::iterator> iterator_set;
  59
  60 template <class Container>
  61 struct indirect_iterator_pair_generator
  62 {
  63     typedef boost::indirect_iterator<typename Container::iterator> iterator;
  64
  65     typedef boost::indirect_iterator<
  66         typename Container::iterator
  67       , typename iterator::value_type const
  68     > const_iterator;
  69 };
  70
  71 void more_indirect_iterator_tests()
  72 {
  73     storage store(1000);
  74     std::generate(store.begin(), store.end(), rand);
  75
  76     pointer_ra_container ptr_ra_container;
  77     iterator_set iter_set;
  78
  79     for (storage::iterator p = store.begin(); p != store.end(); ++p)
  80     {
  81         ptr_ra_container.push_back(&*p);
  82         iter_set.insert(p);
  83     }
  84
  85     typedef indirect_iterator_pair_generator<pointer_ra_container> indirect_ra_container;
  86
  87     indirect_ra_container::iterator db(ptr_ra_container.begin());
  88     indirect_ra_container::iterator de(ptr_ra_container.end());
  89     BOOST_TEST(static_cast<std::size_t>(de - db) == store.size());
  90     BOOST_TEST(db + store.size() == de);
  91     indirect_ra_container::const_iterator dci = db;
  92
  93     BOOST_TEST(dci == db);
  94
  95 #ifndef NO_MUTABLE_CONST_RA_ITERATOR_INTEROPERABILITY
  96     BOOST_TEST(db == dci);
  97 #endif
  98
  99     BOOST_TEST(dci != de);
 100     BOOST_TEST(dci < de);
 101     BOOST_TEST(dci <= de);
 102
 103 #ifndef NO_MUTABLE_CONST_RA_ITERATOR_INTEROPERABILITY
 104     BOOST_TEST(de >= dci);
 105     BOOST_TEST(de > dci);
 106 #endif
 107
 108     dci = de;
 109     BOOST_TEST(dci == de);
 110
 111     boost::random_access_iterator_test(db + 1, store.size() - 1, boost::next(store.begin()));
 112
 113     *db = 999;
 114     BOOST_TEST(store.front() == 999);
 115
 116     // Borland C++ is getting very confused about the typedefs here
 117     typedef boost::indirect_iterator<iterator_set::iterator> indirect_set_iterator;
 118     typedef boost::indirect_iterator<
 119         iterator_set::iterator
 120       , iterator_set::iterator::value_type const
 121     > const_indirect_set_iterator;
 122
 123     indirect_set_iterator sb(iter_set.begin());
 124     indirect_set_iterator se(iter_set.end());
 125     const_indirect_set_iterator sci(iter_set.begin());
 126     BOOST_TEST(sci == sb);
 127
 128 # ifndef NO_MUTABLE_CONST_STD_SET_ITERATOR_INTEROPERABILITY
 129     BOOST_TEST(se != sci);
 130 # endif
 131
 132     BOOST_TEST(sci != se);
 133     sci = se;
 134     BOOST_TEST(sci == se);
 135
 136     *boost::prior(se) = 888;
 137     BOOST_TEST(store.back() == 888);
 138     BOOST_TEST(std::equal(sb, se, store.begin()));
 139
 140     boost::bidirectional_iterator_test(boost::next(sb), store[1], store[2]);
 141     BOOST_TEST(std::equal(db, de, store.begin()));
 142 }
 143
 144 // element_type detector; defaults to true so the test passes when
 145 // has_xxx isn't implemented
 146 BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_element_type, element_type, true)
 147
 148 int
 149 main()
 150 {
 151   dummyT array[] = { dummyT(0), dummyT(1), dummyT(2),
 152                      dummyT(3), dummyT(4), dummyT(5) };
 153   const int N = sizeof(array)/sizeof(dummyT);
 154
 155 # if BOOST_WORKAROUND(BOOST_MSVC, == 1200)
 156   boost::shared_ptr<dummyT> zz((dummyT*)0);  // Why? I don't know, but it suppresses a bad instantiation.
 157 # endif
 158
 159   typedef std::vector<boost::shared_ptr<dummyT> > shared_t;
 160   shared_t shared;
 161
 162   // Concept checks
 163   {
 164     typedef boost::indirect_iterator<shared_t::iterator> iter_t;
 165
 166     BOOST_STATIC_ASSERT(
 167         has_element_type<
 168             std::iterator_traits<shared_t::iterator>::value_type
 169         >::value
 170         );
 171
 172     typedef boost::indirect_iterator<
 173         shared_t::iterator
 174       , boost::iterator_value<shared_t::iterator>::type const
 175     > c_iter_t;
 176
 177 # ifndef NO_MUTABLE_CONST_RA_ITERATOR_INTEROPERABILITY
 178     boost::function_requires< boost_concepts::InteroperableIteratorConcept<iter_t, c_iter_t> >();
 179 # endif
 180   }
 181
 182   // Test indirect_iterator_generator
 183   {
 184       for (int jj = 0; jj < N; ++jj)
 185           shared.push_back(boost::shared_ptr<dummyT>(new dummyT(jj)));
 186
 187       dummyT* ptr[N];
 188       for (int k = 0; k < N; ++k)
 189           ptr[k] = array + k;
 190
 191       typedef boost::indirect_iterator<dummyT**> indirect_iterator;
 192
 193       typedef boost::indirect_iterator<dummyT**, dummyT const>
 194           const_indirect_iterator;
 195
 196       indirect_iterator i(ptr);
 197       boost::random_access_iterator_test(i, N, array);
 198
 199       boost::random_access_iterator_test(
 200           boost::indirect_iterator<shared_t::iterator>(shared.begin())
 201           , N, array);
 202
 203       boost::random_access_iterator_test(boost::make_indirect_iterator(ptr), N, array);
 204
 205       // check operator->
 206       assert((*i).m_x == i->foo());
 207
 208       const_indirect_iterator j(ptr);
 209       boost::random_access_iterator_test(j, N, array);
 210
 211       dummyT const*const* const_ptr = ptr;
 212       boost::random_access_iterator_test(boost::make_indirect_iterator(const_ptr), N, array);
 213
 214       boost::const_nonconst_iterator_test(i, ++j);
 215
 216       more_indirect_iterator_tests();
 217   }
 218   return boost::report_errors();
 219 }