/third_party/boost/libs/intrusive/test/ |
D | generic_multiset_test.hpp | 259 std::pair<const_iterator, const_iterator> const_range; in test_find() local 276 …const_range = const_testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_u… in test_find() 277 BOOST_TEST (const_range == const_testset.bounded_range (1, 2, any_less(), true, false)); in test_find() 278 BOOST_TEST (const_range.first->value_ == 1); in test_find() 279 BOOST_TEST (const_range.second->value_ == 2); in test_find() 280 BOOST_TEST (boost::intrusive::iterator_distance (const_range.first, const_range.second) == 1); in test_find() 293 …const_range = const_testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_u… in test_find() 294 BOOST_TEST (const_range == const_testset.bounded_range (1, 2, any_less(), false, true)); in test_find() 295 BOOST_TEST (const_range.first->value_ == 2); in test_find() 296 BOOST_TEST (const_range.second->value_ == 3); in test_find() [all …]
|
D | generic_set_test.hpp | 341 std::pair<const_iterator, const_iterator> const_range; in test_find() local 359 …const_range = const_testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_u… in test_find() 360 BOOST_TEST (const_range == const_testset.bounded_range (1, 2, any_less(), true, false)); in test_find() 361 BOOST_TEST (const_range.first->value_ == 1); in test_find() 362 BOOST_TEST (const_range.second->value_ == 2); in test_find() 363 BOOST_TEST (boost::intrusive::iterator_distance (const_range.first, const_range.second) == 1); in test_find() 376 …const_range = const_testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_u… in test_find() 377 BOOST_TEST (const_range == const_testset.bounded_range (1, 2, any_less(), false, true)); in test_find() 378 BOOST_TEST (const_range.first->value_ == 2); in test_find() 379 BOOST_TEST (const_range.second->value_ == 3); in test_find() [all …]
|
/third_party/boost/libs/bimap/example/ |
D | unconstrained_collection.cpp | 67 typedef std::pair<const_iterator,const_iterator> const_range; in main() typedef 71 const_range r = m.range( "one" <= _key, _key <= "two" ); in main()
|
/third_party/boost/boost/range/ |
D | concepts.hpp | 299 void const_constraints(const Rng& const_range) in const_constraints() 301 const_iterator ci1 = boost::begin(const_range); in const_constraints() 302 const_iterator ci2 = boost::end(const_range); in const_constraints()
|
/third_party/boost/libs/numeric/odeint/test/ |
D | const_range.hpp | 35 struct const_range struct
|
D | symplectic_steppers.cpp | 115 const_range< num_steppers , mpl::_2 >
|
/third_party/boost/boost/spirit/home/support/utree/ |
D | utree.hpp | 358 typedef boost::iterator_range<const_iterator> const_range; typedef in boost::spirit::utree 460 utree(const_range, shallow_tag);
|
/third_party/boost/libs/spirit/test/karma/ |
D | utree2.cpp | 62 rule<output_iterator, utree::const_range()> r1list; in main()
|
/third_party/protobuf/src/google/protobuf/ |
D | map_test.cc | 918 const_range = const_map_.equal_range(key); in TEST_F() local 919 EXPECT_TRUE(const_map_.find(key) == const_range.first); in TEST_F() 920 EXPECT_TRUE(++const_map_.find(key) == const_range.second); in TEST_F() 922 const_range = const_map_.equal_range(key_missing); in TEST_F() 923 EXPECT_TRUE(const_map_.end() == const_range.first); in TEST_F() 924 EXPECT_TRUE(const_map_.end() == const_range.second); in TEST_F()
|
/third_party/boost/boost/spirit/home/support/utree/detail/ |
D | utree_detail2.hpp | 819 inline utree::utree(const_range r, shallow_tag) in utree()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
D | SROA.cpp | 252 using const_range = iterator_range<const_iterator>; typedef in llvm::sroa::AllocaSlices
|
/third_party/mesa3d/docs/relnotes/ |
D | 19.1.0.rst | 676 - st/nine: Propagate const_range to context
|