/third_party/boost/libs/unordered/test/unordered/ |
D | equality_tests.cpp | 33 #define UNORDERED_EQUALITY_SET_TEST(seq1, op, seq2) \ argument 37 BOOST_PP_SEQ_FOR_EACH(UNORDERED_SET_INSERT, set2, seq2) \ 41 #define UNORDERED_EQUALITY_MULTISET_TEST(seq1, op, seq2) \ argument 45 BOOST_PP_SEQ_FOR_EACH(UNORDERED_SET_INSERT, set2, seq2) \ 49 #define UNORDERED_EQUALITY_MAP_TEST(seq1, op, seq2) \ argument 53 BOOST_PP_SEQ_FOR_EACH(UNORDERED_MAP_INSERT, map2, seq2) \ 57 #define UNORDERED_EQUALITY_MULTIMAP_TEST(seq1, op, seq2) \ argument 61 BOOST_PP_SEQ_FOR_EACH(UNORDERED_MAP_INSERT, map2, seq2) \
|
/third_party/boost/libs/ptr_container/test/ |
D | ptr_inserter.cpp | 43 PtrSequence seq2; in test_ptr_inserter_helper() local 50 ptr_container::ptr_back_inserter( seq2 ) ); in test_ptr_inserter_helper() 54 ptr_container::ptr_front_inserter( seq2 ) ); in test_ptr_inserter_helper() 55 BOOST_CHECK_EQUAL( seq.size()*2, seq2.size() ); in test_ptr_inserter_helper() 67 BOOST_CHECK_EQUAL( seq.size(), seq2.size() ); in test_ptr_inserter_helper()
|
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/text/kernels/ |
D | truncate_sequence_pair_op.cc | 30 std::shared_ptr<Tensor> seq2 = input[1]; in Compute() local 31 CHECK_FAIL_RETURN_UNEXPECTED(seq1->shape().Rank() == 1 && seq2->shape().Rank() == 1, in Compute() 34 dsize_t length2 = seq2->shape()[0]; in Compute() 57 RETURN_IF_NOT_OK(slice2->Compute(seq2, &outSeq2)); in Compute() 59 outSeq2 = std::move(seq2); in Compute()
|
/third_party/boost/boost/fusion/view/joint_view/ |
D | joint_view.hpp | 62 , seq2(in_seq2) in joint_view() 68 concat_type concat() const { return fusion::begin(seq2); } in concat() 70 concat_last_type concat_last() const { return fusion::end(seq2); } in concat_last() 77 typename mpl::if_<traits::is_view<Sequence2>, Sequence2, Sequence2&>::type seq2; member
|
/third_party/boost/libs/algorithm/doc/ |
D | equal.qbk | 21 auto seq2 = { 0, 1, 2, 3, 4 }; 23 std::equal ( seq1.begin (), seq1.end (), seq2.begin ()); // true 24 std::equal ( seq2.begin (), seq2.end (), seq1.begin ()); // Undefined behavior 25 std::equal ( seq1.begin (), seq1.end (), seq2.begin (), seq2.end ()); // false 28 …t the same. The first N entries in `seq2` are the same as the entries in `seq1` - but that's not a…
|
D | mismatch.qbk | 21 auto seq2 = { 0, 1, 2, 3, 4 }; 23 std::mismatch ( seq1.begin (), seq1.end (), seq2.begin ()); // <3, 3> 24 std::mismatch ( seq2.begin (), seq2.end (), seq1.begin ()); // Undefined behavior 25 std::mismatch ( seq1.begin (), seq1.end (), seq2.begin (), seq2.end ()); // <3, 3> 28 The first N entries in `seq2` are the same as the entries in `seq1` - but that's not all that's in …
|
/third_party/boost/boost/fusion/view/transform_view/ |
D | transform_view.hpp | 63 , seq2(in_seq2) in transform_view() 69 first2_type first2() const { return fusion::begin(seq2); } in first2() 73 last2_type last2() const { return fusion::end(seq2); } in last2() 77 typename mpl::if_<traits::is_view<Sequence2>, Sequence2, Sequence2&>::type seq2; member
|
/third_party/boost/boost/spirit/home/support/algorithm/ |
D | any_if_ns.hpp | 67 any_if_ns(Sequence1 const& seq1, Sequence2& seq2, F f, Pred) in any_if_ns() argument 70 fusion::begin(seq1), fusion::begin(seq2) in any_if_ns() 71 , fusion::end(seq1), fusion::end(seq2) in any_if_ns()
|
D | any_if_ns_so.hpp | 68 any_if_ns_so(Sequence1 const& seq1, Sequence2& seq2, F f, Pred) in any_if_ns_so() argument 71 fusion::begin(seq1), fusion::begin(seq2) in any_if_ns_so() 72 , fusion::end(seq1), fusion::end(seq2) in any_if_ns_so()
|
D | any.hpp | 54 any(Sequence1 const& seq1, Sequence2& seq2, F f) in any() argument 58 , fusion::begin(seq2) in any()
|
D | any_if.hpp | 199 any_if(Sequence1 const& seq1, Sequence2& seq2, F f, Pred) in any_if() argument 202 fusion::begin(seq1), fusion::begin(seq2) in any_if() 203 , fusion::end(seq1), fusion::end(seq2) in any_if()
|
D | any_ns_so.hpp | 78 any_ns_so(Sequence1 const& seq1, Sequence2& seq2, F f) in any_ns_so() argument 82 , fusion::begin(seq2) in any_ns_so()
|
D | any_ns.hpp | 74 any_ns(Sequence1 const& seq1, Sequence2& seq2, F f) in any_ns() argument 78 , fusion::begin(seq2) in any_ns()
|
/third_party/boost/boost/fusion/algorithm/transformation/ |
D | transform.hpp | 47 transform(Sequence1 const& seq1, Sequence2 const& seq2, F f) in transform() argument 49 return transform_view<Sequence1 const, Sequence2 const, F>(seq1, seq2, f); in transform()
|
/third_party/python/Lib/unittest/ |
D | case.py | 936 def assertSequenceEqual(self, seq1, seq2, msg=None, seq_type=None): argument 955 if not isinstance(seq2, seq_type): 957 % (seq_type_name, safe_repr(seq2))) 970 len2 = len(seq2) 976 if seq1 == seq2: 981 _common_shorten_repr(seq1, seq2)) 992 item2 = seq2[i] 1004 type(seq1) != type(seq2)): 1022 (len1, safe_repr(seq2[len1]))) 1029 pprint.pformat(seq2).splitlines()))
|
/third_party/python/Doc/c-api/ |
D | dict.rst | 228 .. c:function:: int PyDict_MergeFromSeq2(PyObject *a, PyObject *seq2, int override) 230 Update or merge into dictionary *a*, from the key-value pairs in *seq2*. 231 *seq2* must be an iterable object producing iterable objects of length 2, 237 def PyDict_MergeFromSeq2(a, seq2, override): 238 for key, value in seq2:
|
/third_party/musl/porting/liteos_m/kernel/src/regex/ |
D | regcomp.c | 1920 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local 1951 &pos_add, NULL, &seq2, &max_pos); in tre_expand_ast() 1954 seq2 = tre_ast_new_iter(mem, seq2, 0, -1, 0); in tre_expand_ast() 1955 if (seq2 == NULL) in tre_expand_ast() 1968 if (seq2 != NULL) in tre_expand_ast() 1969 seq2 = tre_ast_new_catenation(mem, copy, seq2); in tre_expand_ast() 1971 seq2 = copy; in tre_expand_ast() 1972 if (seq2 == NULL) in tre_expand_ast() 1977 seq2 = tre_ast_new_union(mem, tmp, seq2); in tre_expand_ast() 1978 if (seq2 == NULL) in tre_expand_ast() [all …]
|
/third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/ |
D | regcomp.c | 1921 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local 1952 &pos_add, NULL, &seq2, &max_pos); in tre_expand_ast() 1955 seq2 = tre_ast_new_iter(mem, seq2, 0, -1, 0); in tre_expand_ast() 1956 if (seq2 == NULL) in tre_expand_ast() 1969 if (seq2 != NULL) in tre_expand_ast() 1970 seq2 = tre_ast_new_catenation(mem, copy, seq2); in tre_expand_ast() 1972 seq2 = copy; in tre_expand_ast() 1973 if (seq2 == NULL) in tre_expand_ast() 1978 seq2 = tre_ast_new_union(mem, tmp, seq2); in tre_expand_ast() 1979 if (seq2 == NULL) in tre_expand_ast() [all …]
|
/third_party/musl/porting/uniproton/kernel/src/regex/ |
D | regcomp.c | 1920 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local 1951 &pos_add, NULL, &seq2, &max_pos); in tre_expand_ast() 1954 seq2 = tre_ast_new_iter(mem, seq2, 0, -1, 0); in tre_expand_ast() 1955 if (seq2 == NULL) in tre_expand_ast() 1968 if (seq2 != NULL) in tre_expand_ast() 1969 seq2 = tre_ast_new_catenation(mem, copy, seq2); in tre_expand_ast() 1971 seq2 = copy; in tre_expand_ast() 1972 if (seq2 == NULL) in tre_expand_ast() 1977 seq2 = tre_ast_new_union(mem, tmp, seq2); in tre_expand_ast() 1978 if (seq2 == NULL) in tre_expand_ast() [all …]
|
/third_party/musl/src/regex/ |
D | regcomp.c | 1920 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local 1951 &pos_add, NULL, &seq2, &max_pos); in tre_expand_ast() 1954 seq2 = tre_ast_new_iter(mem, seq2, 0, -1, 0); in tre_expand_ast() 1955 if (seq2 == NULL) in tre_expand_ast() 1968 if (seq2 != NULL) in tre_expand_ast() 1969 seq2 = tre_ast_new_catenation(mem, copy, seq2); in tre_expand_ast() 1971 seq2 = copy; in tre_expand_ast() 1972 if (seq2 == NULL) in tre_expand_ast() 1977 seq2 = tre_ast_new_union(mem, tmp, seq2); in tre_expand_ast() 1978 if (seq2 == NULL) in tre_expand_ast() [all …]
|
/third_party/python/Modules/clinic/ |
D | itertoolsmodule.c.h | 552 itertools_compress_impl(PyTypeObject *type, PyObject *seq1, PyObject *seq2); 564 PyObject *seq2; in itertools_compress() local 571 seq2 = fastargs[1]; in itertools_compress() 572 return_value = itertools_compress_impl(type, seq1, seq2); in itertools_compress()
|
/third_party/glib/glib/tests/ |
D | sequence.c | 612 SequenceInfo *seq2 = RANDOM_SEQUENCE(); in run_random_tests() local 614 GSequenceIter *iter2 = get_random_iter (seq2, &link2); in run_random_tests() 623 g_queue_insert_before (seq2->queue, link2, link1->data); in run_random_tests() 627 get_item (iter1)->seq = seq2; in run_random_tests() 630 seq2->n_items++; in run_random_tests() 646 SequenceInfo *seq2 = RANDOM_SEQUENCE(); in run_random_tests() local 648 GSequenceIter *iter2 = get_random_iter (seq2, &link2); in run_random_tests() 657 get_item (iter1)->seq = seq2; in run_random_tests()
|
/third_party/boost/libs/fusion/test/sequence/ |
D | misc.hpp | 107 typedef boost::mpl::push_back<seq1, double>::type seq2; typedef 108 BOOST_STATIC_ASSERT((boost::mpl::equal<seq2, target2>::value));
|
/third_party/boost/boost/fusion/view/transform_view/detail/ |
D | at_impl.hpp | 57 return seq.f(boost::fusion::at<N>(seq.seq1), boost::fusion::at<N>(seq.seq2)); in call()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/ |
D | pcg_engine_test.cc | 61 std::seed_seq seq2{rd(), rd(), rd()}; in TYPED_TEST() local 62 engine.seed(seq2); in TYPED_TEST()
|