/third_party/boost/boost/xpressive/detail/dynamic/ |
D | parser_traits.hpp | 101 regex_constants::compiler_token_type get_token(FwdIter &begin, FwdIter end) in get_token() 104 if(this->eat_ws_(begin, end) == end) in get_token() 109 switch(*begin) in get_token() 111 case BOOST_XPR_CHAR_(char_type, '\\'): return this->get_escape_token(++begin, end); in get_token() 112 case BOOST_XPR_CHAR_(char_type, '.'): ++begin; return token_any; in get_token() 113 case BOOST_XPR_CHAR_(char_type, '^'): ++begin; return token_assert_begin_line; in get_token() 114 case BOOST_XPR_CHAR_(char_type, '$'): ++begin; return token_assert_end_line; in get_token() 115 case BOOST_XPR_CHAR_(char_type, '('): ++begin; return token_group_begin; in get_token() 116 case BOOST_XPR_CHAR_(char_type, ')'): ++begin; return token_group_end; in get_token() 117 case BOOST_XPR_CHAR_(char_type, '|'): ++begin; return token_alternate; in get_token() [all …]
|
D | parse_charset.hpp | 73 parse_escape(FwdIter &begin, FwdIter end, CompilerTraits &tr) in parse_escape() argument 85 BOOST_XPR_ENSURE_(begin != end, error_escape, "unexpected end of pattern found"); in parse_escape() 92 esc.class_ = rxtraits.lookup_classname(begin, begin + 1, icase); in parse_escape() 99 if(-1 != rxtraits.value(*begin, 8)) in parse_escape() 101 esc.ch_ = converter(toi(begin, end, rxtraits, 8, 0777)); in parse_escape() 105 switch(*begin) in parse_escape() 110 ++begin; in parse_escape() 115 ++begin; in parse_escape() 119 BOOST_XPR_ENSURE_(++begin != end, error_escape, "unexpected end of pattern found"); in parse_escape() 122 … rxtraits.in_range(BOOST_XPR_CHAR_(char_type, 'a'), BOOST_XPR_CHAR_(char_type, 'z'), *begin) in parse_escape() [all …]
|
/third_party/boost/libs/algorithm/string/test/ |
D | find_test.cpp | 34 vector<int> vec1( str1.begin(), str1.end() ); in find_test() 53 ( (nc_result.begin()-str1.begin()) == 3) && in find_test() 54 ( (nc_result.end()-str1.begin()) == 6) ); in find_test() 58 ( (cv_result.begin()-str1.begin()) == 3) && in find_test() 59 ( (cv_result.end()-str1.begin()) == 6) ); in find_test() 63 ( (cv_result.begin()-str1.begin()) == 6) && in find_test() 64 ( (cv_result.end()-str1.begin()) == 9) ); in find_test() 67 BOOST_CHECK(( (ch_result.begin() - pch1 ) == 3) && ( (ch_result.end() - pch1 ) == 6 ) ); in find_test() 74 ( (nc_result.begin()-str1.begin()) == 15) && in find_test() 75 ( (nc_result.end()-str1.begin()) == 18) ); in find_test() [all …]
|
/third_party/boost/boost/numeric/odeint/algebra/ |
D | range_algebra.hpp | 39 detail::for_each1( boost::begin( s1 ) , boost::end( s1 ) , in for_each1() 46 detail::for_each2( boost::begin( s1 ) , boost::end( s1 ) , in for_each2() 47 boost::begin( s2 ) , op ); in for_each2() 53 …detail::for_each3( boost::begin( s1 ) , boost::end( s1 ) , boost::begin( s2 ) , boost::begin( s3 )… in for_each3() 59 …detail::for_each4( boost::begin( s1 ) , boost::end( s1 ) , boost::begin( s2 ) , boost::begin( s3 )… in for_each4() 65 …il::for_each5( boost::begin( s1 ) , boost::end( s1 ) , boost::begin( s2 ) , boost::begin( s3 ) , b… in for_each5() 71 …ch6( boost::begin( s1 ) , boost::end( s1 ) , boost::begin( s2 ) , boost::begin( s3 ) , boost::begi… in for_each6() 77 …:begin( s1 ) , boost::end( s1 ) , boost::begin( s2 ) , boost::begin( s3 ) , boost::begin( s4 ) , b… in for_each7() 83 …begin( s1 ) , boost::end( s1 ) , boost::begin( s2 ) , boost::begin( s3 ) , boost::begin( s4 ) , bo… in for_each8() 89 …begin( s1 ) , boost::end( s1 ) , boost::begin( s2 ) , boost::begin( s3 ) , boost::begin( s4 ) , bo… in for_each9() [all …]
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
D | charconv_parse.cc | 249 int ConsumeDigits(const char* begin, const char* end, int max_digits, T* out, in ConsumeDigits() argument 256 const char* const original_begin = begin; in ConsumeDigits() 261 while (!*out && end != begin && *begin == '0') ++begin; in ConsumeDigits() 265 (end - begin > max_digits) ? begin + max_digits : end; in ConsumeDigits() 266 while (begin < significant_digits_end && IsDigit<base>(*begin)) { in ConsumeDigits() 269 auto digit = static_cast<T>(ToDigit<base>(*begin)); in ConsumeDigits() 274 ++begin; in ConsumeDigits() 277 while (begin < end && IsDigit<base>(*begin)) { in ConsumeDigits() 278 dropped_nonzero = dropped_nonzero || (*begin != '0'); in ConsumeDigits() 279 ++begin; in ConsumeDigits() [all …]
|
/third_party/abseil-cpp/absl/strings/internal/ |
D | charconv_parse.cc | 249 std::size_t ConsumeDigits(const char* begin, const char* end, int max_digits, in ConsumeDigits() argument 256 const char* const original_begin = begin; in ConsumeDigits() 261 while (!*out && end != begin && *begin == '0') ++begin; in ConsumeDigits() 265 (end - begin > max_digits) ? begin + max_digits : end; in ConsumeDigits() 266 while (begin < significant_digits_end && IsDigit<base>(*begin)) { in ConsumeDigits() 269 auto digit = static_cast<T>(ToDigit<base>(*begin)); in ConsumeDigits() 274 ++begin; in ConsumeDigits() 277 while (begin < end && IsDigit<base>(*begin)) { in ConsumeDigits() 278 dropped_nonzero = dropped_nonzero || (*begin != '0'); in ConsumeDigits() 279 ++begin; in ConsumeDigits() [all …]
|
/third_party/abseil-cpp/absl/algorithm/ |
D | algorithm_test.cc | 32 EXPECT_TRUE(absl::equal(v1.begin(), v1.end(), v2.begin(), v2.end())); in TEST() 33 EXPECT_FALSE(absl::equal(v1.begin(), v1.end(), v3.begin(), v3.end())); in TEST() 34 EXPECT_FALSE(absl::equal(v1.begin(), v1.end(), v4.begin(), v4.end())); in TEST() 43 EXPECT_TRUE(absl::equal(lst1.begin(), lst1.end(), lst2.begin(), lst2.end())); in TEST() 44 EXPECT_FALSE(absl::equal(lst1.begin(), lst1.end(), lst3.begin(), lst3.end())); in TEST() 45 EXPECT_FALSE(absl::equal(lst1.begin(), lst1.end(), lst4.begin(), lst4.end())); in TEST() 53 EXPECT_FALSE(absl::equal(v1.begin(), v1.end(), empty1.begin(), empty1.end())); in TEST() 54 EXPECT_FALSE(absl::equal(empty1.begin(), empty1.end(), v1.begin(), v1.end())); in TEST() 56 absl::equal(empty1.begin(), empty1.end(), empty2.begin(), empty2.end())); in TEST() 61 std::list<int> lst1{v1.begin(), v1.end()}; in TEST() [all …]
|
/third_party/skia/third_party/externals/abseil-cpp/absl/algorithm/ |
D | algorithm_test.cc | 32 EXPECT_TRUE(absl::equal(v1.begin(), v1.end(), v2.begin(), v2.end())); in TEST() 33 EXPECT_FALSE(absl::equal(v1.begin(), v1.end(), v3.begin(), v3.end())); in TEST() 34 EXPECT_FALSE(absl::equal(v1.begin(), v1.end(), v4.begin(), v4.end())); in TEST() 43 EXPECT_TRUE(absl::equal(lst1.begin(), lst1.end(), lst2.begin(), lst2.end())); in TEST() 44 EXPECT_FALSE(absl::equal(lst1.begin(), lst1.end(), lst3.begin(), lst3.end())); in TEST() 45 EXPECT_FALSE(absl::equal(lst1.begin(), lst1.end(), lst4.begin(), lst4.end())); in TEST() 53 EXPECT_FALSE(absl::equal(v1.begin(), v1.end(), empty1.begin(), empty1.end())); in TEST() 54 EXPECT_FALSE(absl::equal(empty1.begin(), empty1.end(), v1.begin(), v1.end())); in TEST() 56 absl::equal(empty1.begin(), empty1.end(), empty2.begin(), empty2.end())); in TEST() 61 std::list<int> lst1{v1.begin(), v1.end()}; in TEST() [all …]
|
/third_party/boost/libs/algorithm/test/ |
D | empty_search_test.cpp | 28 cs.begin (), cs.end (), estr.begin (), estr.end ()) in BOOST_AUTO_TEST_CASE() 29 == std::make_pair(cs.begin(), cs.begin()) in BOOST_AUTO_TEST_CASE() 34 cs.begin (), cs.end (), estr.begin (), estr.end ()) in BOOST_AUTO_TEST_CASE() 35 == std::make_pair(cs.begin(), cs.begin()) in BOOST_AUTO_TEST_CASE() 40 cs.begin (), cs.end (), estr.begin (), estr.end ()) in BOOST_AUTO_TEST_CASE() 41 == std::make_pair(cs.begin(), cs.begin()) in BOOST_AUTO_TEST_CASE() 47 estr.begin (), estr.end (), str.begin (), str.end ()) in BOOST_AUTO_TEST_CASE() 53 estr.begin (), estr.end (), str.begin (), str.end ()) in BOOST_AUTO_TEST_CASE() 59 estr.begin (), estr.end (), str.begin (), str.end ()) in BOOST_AUTO_TEST_CASE() 66 str.begin (), str.end (), estr.begin (), estr.end ()) in BOOST_AUTO_TEST_CASE() [all …]
|
D | apply_permutation_test.cpp | 28 ba::apply_permutation(vec.begin(), vec.end(), order.begin(), order.end()); in BOOST_AUTO_TEST_CASE() 29 BOOST_CHECK_EQUAL_COLLECTIONS(vec.begin(), vec.end(), result.begin(), result.end()); in BOOST_AUTO_TEST_CASE() 38 ba::apply_permutation(vec.begin(), vec.end(), order.begin(), order.end()); in BOOST_AUTO_TEST_CASE() 39 BOOST_CHECK_EQUAL_COLLECTIONS(vec.begin(), vec.end(), result.begin(), result.end()); in BOOST_AUTO_TEST_CASE() 48 ba::apply_permutation(vec.begin(), vec.end(), order.begin(), order.end()); in BOOST_AUTO_TEST_CASE() 49 BOOST_CHECK_EQUAL_COLLECTIONS(vec.begin(), vec.end(), result.begin(), result.end()); in BOOST_AUTO_TEST_CASE() 58 ba::apply_permutation(vec.begin(), vec.end(), order.begin(), order.end()); in BOOST_AUTO_TEST_CASE() 59 BOOST_CHECK_EQUAL_COLLECTIONS(vec.begin(), vec.end(), result.begin(), result.end()); in BOOST_AUTO_TEST_CASE() 68 ba::apply_permutation(vec.begin(), vec.end(), order.begin(), order.end()); in BOOST_AUTO_TEST_CASE() 69 BOOST_CHECK_EQUAL_COLLECTIONS(vec.begin(), vec.end(), result.begin(), result.end()); in BOOST_AUTO_TEST_CASE() [all …]
|
/third_party/boost/boost/lexical_cast/detail/ |
D | inf_nan.hpp | 53 inline bool parse_inf_nan_impl(const CharT* begin, const CharT* end, T& value in parse_inf_nan_impl() argument 59 if (begin == end) return false; in parse_inf_nan_impl() 65 bool const has_minus = (*begin == minus); in parse_inf_nan_impl() 66 if (has_minus || *begin == plus) { in parse_inf_nan_impl() 67 ++ begin; in parse_inf_nan_impl() 70 if (end - begin < 3) return false; in parse_inf_nan_impl() 71 if (lc_iequal(begin, lc_nan, lc_NAN, 3)) { in parse_inf_nan_impl() 72 begin += 3; in parse_inf_nan_impl() 73 if (end != begin) { in parse_inf_nan_impl() 76 if (end - begin < 2) return false; // bad input in parse_inf_nan_impl() [all …]
|
/third_party/json/test/src/ |
D | unit-algorithms.cpp | 44 CHECK(std::all_of(j_array.begin(), j_array.end(), [](const json & value) 48 CHECK(std::all_of(j_object.begin(), j_object.end(), [](const json & value) 56 CHECK(std::any_of(j_array.begin(), j_array.end(), [](const json & value) 60 CHECK(std::any_of(j_object.begin(), j_object.end(), [](const json & value) 68 CHECK(std::none_of(j_array.begin(), j_array.end(), [](const json & value) 72 CHECK(std::none_of(j_object.begin(), j_object.end(), [](const json & value) 105 std::for_each(j_array.begin(), j_array.end(), add17); 113 CHECK(std::count(j_array.begin(), j_array.end(), json(true)) == 1); 118 CHECK(std::count_if(j_array.begin(), j_array.end(), [](const json & value) 122 CHECK(std::count_if(j_array.begin(), j_array.end(), [](const json&) [all …]
|
/third_party/boost/libs/compute/test/ |
D | test_reduce_by_key.cpp | 39 boost::compute::reduce_by_key(keys_input.begin(), keys_input.end(), values_input.begin(), in BOOST_AUTO_TEST_CASE() 40 keys_output.begin(), values_output.begin(), queue); in BOOST_AUTO_TEST_CASE() 57 bc::reduce_by_key(keys_input.begin(), keys_input.end(), values_input.begin(), in BOOST_AUTO_TEST_CASE() 58 keys_output.begin(), values_output.begin(), queue); in BOOST_AUTO_TEST_CASE() 66 bc::inclusive_scan(keys_input.begin(), keys_input.end(), keys_input.begin(), queue); in BOOST_AUTO_TEST_CASE() 68 bc::reduce_by_key(keys_input.begin(), keys_input.end(), values_input.begin(), in BOOST_AUTO_TEST_CASE() 69 keys_output.begin(), values_output.begin(), queue); in BOOST_AUTO_TEST_CASE() 83 bc::reduce_by_key(keys_input.begin(), keys_input.end(), values_input.begin(), in BOOST_AUTO_TEST_CASE() 84 keys_output.begin(), values_output.begin(), queue); in BOOST_AUTO_TEST_CASE() 101 bc::reduce_by_key(keys_input.begin(), keys_input.end(), values_input.begin(), in BOOST_AUTO_TEST_CASE() [all …]
|
D | test_binary_search.cpp | 29 boost::compute::vector<int>::iterator first = vector.begin() + 128; in BOOST_AUTO_TEST_CASE() 44 … BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(0), queue) == false); in BOOST_AUTO_TEST_CASE() 45 BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(1), queue) == true); in BOOST_AUTO_TEST_CASE() 46 BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(2), queue) == true); in BOOST_AUTO_TEST_CASE() 47 … BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(3), queue) == false); in BOOST_AUTO_TEST_CASE() 48 BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(4), queue) == true); in BOOST_AUTO_TEST_CASE() 49 BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(5), queue) == true); in BOOST_AUTO_TEST_CASE() 50 … BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(6), queue) == false); in BOOST_AUTO_TEST_CASE() 51 BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(7), queue) == true); in BOOST_AUTO_TEST_CASE() 52 … BOOST_CHECK(boost::compute::binary_search(vector.begin(), vector.end(), int(8), queue) == false); in BOOST_AUTO_TEST_CASE() [all …]
|
D | test_merge.cpp | 33 boost::compute::copy_n(data1, 4, v1.begin(), queue); in BOOST_AUTO_TEST_CASE() 34 boost::compute::copy_n(data2, 4, v2.begin(), queue); in BOOST_AUTO_TEST_CASE() 35 boost::compute::fill(v3.begin(), v3.end(), 0, queue); in BOOST_AUTO_TEST_CASE() 39 v1.begin(), v1.end(), in BOOST_AUTO_TEST_CASE() 40 v2.begin(), v2.end(), in BOOST_AUTO_TEST_CASE() 41 v3.begin(), in BOOST_AUTO_TEST_CASE() 48 v2.begin(), v2.end(), in BOOST_AUTO_TEST_CASE() 49 v1.begin(), v1.end(), in BOOST_AUTO_TEST_CASE() 50 v3.begin(), in BOOST_AUTO_TEST_CASE() 57 v1.begin(), v1.end(), in BOOST_AUTO_TEST_CASE() [all …]
|
/third_party/boost/libs/range/test/algorithm_test/ |
D | merge.cpp | 35 = std::merge(cont1.begin(), cont1.end(), in test() 36 cont2.begin(), cont2.end(), in test() 37 reference_target.begin()); in test() 42 = boost::merge(cont1, cont2, test_target.begin()); in test() 45 std::distance<iterator_t>(reference_target.begin(), reference_it), in test() 46 std::distance<iterator_t>(test_target.begin(), test_it) in test() 50 reference_target.begin(), reference_target.end(), in test() 51 test_target.begin(), test_target.end() in test() 55 cont2, test_target.begin()); in test() 58 std::distance<iterator_t>(reference_target.begin(), reference_it), in test() [all …]
|
/third_party/boost/libs/range/test/test_driver/ |
D | range_return_test_driver.hpp | 53 BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(), in test() 54 test.begin(), test.end() ); in test() 56 BOOST_CHECK_EQUAL( std::distance(test.begin(), test_it), in test() 57 std::distance(reference.begin(), reference_it) ); in test() 74 BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(), in test() 75 test.begin(), test.end() ); in test() 84 std::distance(test.begin(), test_it), in test() 85 std::distance(reference.begin(), reference_it) + 1); in test() 103 BOOST_CHECK_EQUAL_COLLECTIONS( reference.begin(), reference.end(), in test() 104 test.begin(), test.end() ); in test() [all …]
|
/third_party/boost/libs/range/test/ |
D | adl_conformance.cpp | 38 inline typename Range::iterator begin( Range& r ) in begin() function 44 inline typename Range::iterator begin( const Range& r ) in begin() function 52 inline typename Range::iterator begin( Range& r ) in begin() function 54 using range_detail::begin; // create ADL hook in begin() 55 return begin( r ); in begin() 59 inline typename Range::iterator begin( const Range& r ) in begin() function 61 using range_detail::begin; // create ADL hook in begin() 62 return begin( r ); in begin() 75 iterator begin() { return unused; } in begin() function 76 iterator begin() const { return unused; } in begin() function [all …]
|
/third_party/boost/boost/xpressive/ |
D | regex_compiler.hpp | 118 compile(InputIter begin, InputIter end, flag_type flags = regex_constants::ECMAScript) in compile() 121 return this->compile_(begin, end, flags, category()); in compile() 130 return this->compile(boost::begin(pat), boost::end(pat), flags); in compile() 136 compile(char_type const *begin, flag_type flags = regex_constants::ECMAScript) in compile() 138 BOOST_ASSERT(0 != begin); in compile() 139 char_type const *end = begin + std::char_traits<char_type>::length(begin); in compile() 140 return this->compile(begin, end, flags); in compile() 145 basic_regex<BidiIter> compile(char_type const *begin, std::size_t size, flag_type flags) in compile() 147 BOOST_ASSERT(0 != begin); in compile() 148 char_type const *end = begin + size; in compile() [all …]
|
/third_party/boost/libs/test/test/utils-ts/ |
D | algorithm-test.cpp | 56 … TEST_SURROUND_EXPRESSION(utu::mismatch( cs1.begin(), cs1.end(), cs2.begin(), cs2.end() ).first - … in BOOST_AUTO_TEST_CASE() 59 … TEST_SURROUND_EXPRESSION(utu::mismatch( cs1.begin(), cs1.end(), cs2.begin(), cs2.end() ).first - … in BOOST_AUTO_TEST_CASE() 62 … TEST_SURROUND_EXPRESSION(utu::mismatch( cs1.begin(), cs1.end(), cs2.begin(), cs2.end() ).first - … in BOOST_AUTO_TEST_CASE() 66 …UND_EXPRESSION(utu::mismatch( cs1.begin(), cs1.end(), cs2.begin(), cs2.end(), REF_FUN( predicate )… in BOOST_AUTO_TEST_CASE() 76 …RROUND_EXPRESSION(utu::find_first_not_of( cs.begin(), cs.end(), another.begin(), another.end() ) -… in BOOST_AUTO_TEST_CASE() 80 …ESSION(utu::find_first_not_of( cs.begin(), cs.end(), another.begin(), another.end(), REF_FUN( pred… in BOOST_AUTO_TEST_CASE() 83 …BOOST_TEST( utu::find_last_not_of( cs.begin(), cs.end(), another.begin(), another.end() ) == cs.en… in BOOST_AUTO_TEST_CASE() 93 …ST_SURROUND_EXPRESSION(utu::find_last_of( cs.begin(), cs.end(), another.begin(), another.end() ) -… in BOOST_AUTO_TEST_CASE() 96 …_EXPRESSION(utu::find_last_of( cs.begin(), cs.end(), another.begin(), another.end(), REF_FUN( pred… in BOOST_AUTO_TEST_CASE() 99 …BOOST_TEST( utu::find_last_of( cs.begin(), cs.end(), another.begin(), another.end() ) == cs.end() … in BOOST_AUTO_TEST_CASE() [all …]
|
/third_party/boost/boost/move/algo/detail/ |
D | pdqsort.hpp | 110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() argument 113 if (begin == end) return true; in partial_insertion_sort() 116 for (Iter cur = begin + 1; cur != end; ++cur) { in partial_insertion_sort() 127 while (sift != begin && comp(tmp, *--sift_1)); in partial_insertion_sort() 156 pdqsort_detail::pair<Iter, bool> partition_right(Iter begin, Iter end, Compare comp) { in partition_right() argument 160 T pivot(boost::move(*begin)); in partition_right() 162 Iter first = begin; in partition_right() 171 if (first - 1 == begin) while (first < last && !comp(*--last, pivot)); in partition_right() 189 *begin = boost::move(*pivot_pos); in partition_right() 200 inline Iter partition_left(Iter begin, Iter end, Compare comp) { in partition_left() argument [all …]
|
/third_party/boost/libs/circular_buffer/test/ |
D | base_test.cpp | 19 circular_buffer<MyInteger>::iterator it = cb.begin(); in iterator_constructor_and_assign_test() 42 circular_buffer<Dummy>::iterator it = cb.begin(); in iterator_reference_test() 43 circular_buffer<Dummy>::const_iterator cit = cb.begin() + 1; in iterator_reference_test() 59 circular_buffer<MyInteger>::iterator it1 = cb.begin() + 2; in iterator_difference_test() 60 circular_buffer<MyInteger>::iterator it2 = cb.begin() + 3; in iterator_difference_test() 61 circular_buffer<MyInteger>::const_iterator begin = cb.begin(); in iterator_difference_test() local 64 BOOST_TEST(begin - begin == 0); in iterator_difference_test() 65 BOOST_TEST(end - cb.begin() == 5); in iterator_difference_test() 67 BOOST_TEST(begin - cb.end() == -5); in iterator_difference_test() 68 BOOST_TEST(it1 - cb.begin() == 2); in iterator_difference_test() [all …]
|
D | soft_iterator_invalidation.cpp | 23 circular_buffer<int>::iterator it = cb.begin(); in validity_example_test() 41 circular_buffer<int>::iterator it1 = cb.begin(); in validity_insert_test() 42 circular_buffer<int>::iterator it2 = cb.begin() + 1; in validity_insert_test() 43 circular_buffer<int>::iterator it3 = cb.begin() + 2; in validity_insert_test() 45 cb.insert(cb.begin() + 1, 4); in validity_insert_test() 60 cb.insert(cb.begin() + 1, 5); in validity_insert_test() 84 circular_buffer<int>::iterator it1 = cb.begin(); in validity_insert_n_test() 85 circular_buffer<int>::iterator it2 = cb.begin() + 1; in validity_insert_n_test() 86 circular_buffer<int>::iterator it3 = cb.begin() + 2; in validity_insert_n_test() 88 cb.insert(cb.begin() + 1, 2, 4); in validity_insert_n_test() [all …]
|
/third_party/boost/tools/quickbook/src/ |
D | glob.cpp | 34 glob_iterator begin = pattern.begin(); in check_glob() local 37 while (begin != end) { in check_glob() 38 if (*begin < 32 || (*begin & 0x80)) is_ascii = false; in check_glob() 40 switch (*begin) { in check_glob() 42 check_glob_escape(begin, end); in check_glob() 46 check_glob_range(begin, end); in check_glob() 55 ++begin; in check_glob() 60 ++begin; in check_glob() 62 if (begin != end && *begin == '*') { in check_glob() 68 ++begin; in check_glob() [all …]
|
/third_party/boost/libs/numeric/odeint/examples/thrust/ |
D | lorenz_parameters.cu | 74 boost::begin( x ) , in operator ()() 75 boost::begin( x ) + m_N , in operator ()() 76 boost::begin( x ) + 2 * m_N , in operator ()() 77 m_beta.begin() , in operator ()() 78 boost::begin( dxdt ) , in operator ()() 79 boost::begin( dxdt ) + m_N , in operator ()() 80 boost::begin( dxdt ) + 2 * m_N ) ) , in operator ()() 82 boost::begin( x ) + m_N , in operator ()() 83 boost::begin( x ) + 2 * m_N , in operator ()() 84 boost::begin( x ) + 3 * m_N , in operator ()() [all …]
|