Home
last modified time | relevance | path

Searched refs:seq1 (Results 1 – 25 of 45) sorted by relevance

12

/third_party/boost/boost/parameter/aux_/preprocessor/
Dseq_merge.hpp9 #define BOOST_PARAMETER_AUX_PP_SEQ_MERGE_0(seq0, seq1) seq1 argument
15 #define BOOST_PARAMETER_AUX_PP_SEQ_MERGE_1(seq0, seq1) \ argument
16 BOOST_PP_SEQ_PUSH_FRONT(seq1, BOOST_PP_SEQ_HEAD(seq0))
19 #define BOOST_PARAMETER_AUX_PP_SEQ_MERGE_2(seq0, seq1) \ argument
21 BOOST_PARAMETER_AUX_PP_SEQ_MERGE_1(BOOST_PP_SEQ_TAIL(seq0), seq1) \
26 #define BOOST_PARAMETER_AUX_PP_SEQ_MERGE_3(seq0, seq1) \ argument
28 BOOST_PARAMETER_AUX_PP_SEQ_MERGE_2(BOOST_PP_SEQ_TAIL(seq0), seq1) \
33 #define BOOST_PARAMETER_AUX_PP_SEQ_MERGE_4(seq0, seq1) \ argument
35 BOOST_PARAMETER_AUX_PP_SEQ_MERGE_3(BOOST_PP_SEQ_TAIL(seq0), seq1) \
40 #define BOOST_PARAMETER_AUX_PP_SEQ_MERGE_5(seq0, seq1) \ argument
[all …]
/third_party/boost/libs/unordered/test/unordered/
Dequality_tests.cpp33 #define UNORDERED_EQUALITY_SET_TEST(seq1, op, seq2) \ argument
36 BOOST_PP_SEQ_FOR_EACH(UNORDERED_SET_INSERT, set1, seq1) \
41 #define UNORDERED_EQUALITY_MULTISET_TEST(seq1, op, seq2) \ argument
44 BOOST_PP_SEQ_FOR_EACH(UNORDERED_SET_INSERT, set1, seq1) \
49 #define UNORDERED_EQUALITY_MAP_TEST(seq1, op, seq2) \ argument
52 BOOST_PP_SEQ_FOR_EACH(UNORDERED_MAP_INSERT, map1, seq1) \
57 #define UNORDERED_EQUALITY_MULTIMAP_TEST(seq1, op, seq2) \ argument
60 BOOST_PP_SEQ_FOR_EACH(UNORDERED_MAP_INSERT, map1, seq1) \
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/text/kernels/
Dtruncate_sequence_pair_op.cc29 std::shared_ptr<Tensor> seq1 = input[0]; in Compute() local
31 CHECK_FAIL_RETURN_UNEXPECTED(seq1->shape().Rank() == 1 && seq2->shape().Rank() == 1, in Compute()
33 dsize_t length1 = seq1->shape()[0]; in Compute()
49 RETURN_IF_NOT_OK(slice1->Compute(seq1, &outSeq1)); in Compute()
51 outSeq1 = std::move(seq1); in Compute()
/third_party/boost/libs/algorithm/doc/
Dequal.qbk20 auto seq1 = { 0, 1, 2 };
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 …as the entries in `seq1` - but that's not all that's in `seq2`. But in the second case, the algori…
Dmismatch.qbk20 auto seq1 = { 0, 1, 2 };
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 …e as the entries in `seq1` - but that's not all that's in `seq2`. In the second case, the algorith…
/third_party/boost/boost/spirit/home/support/algorithm/
Dany.hpp54 any(Sequence1 const& seq1, Sequence2& seq2, F f) in any() argument
57 fusion::begin(seq1) in any()
59 , fusion::end(seq1) in any()
Dany_if_ns_so.hpp68 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()
Dany_ns.hpp74 any_ns(Sequence1 const& seq1, Sequence2& seq2, F f) in any_ns() argument
77 fusion::begin(seq1) in any_ns()
79 , fusion::end(seq1) in any_ns()
Dany_ns_so.hpp78 any_ns_so(Sequence1 const& seq1, Sequence2& seq2, F f) in any_ns_so() argument
81 fusion::begin(seq1) in any_ns_so()
83 , fusion::end(seq1) in any_ns_so()
Dany_if_ns.hpp67 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()
Dany_if.hpp199 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()
/third_party/boost/boost/fusion/view/transform_view/
Dtransform_view.hpp62 , seq1(in_seq1) in transform_view()
67 first1_type first1() const { return fusion::begin(seq1); } in first1()
71 last1_type last1() const { return fusion::end(seq1); } in last1()
76 typename mpl::if_<traits::is_view<Sequence1>, Sequence1, Sequence1&>::type seq1; member
/third_party/boost/boost/fusion/view/joint_view/
Djoint_view.hpp61 : seq1(in_seq1) in joint_view()
66 first_type first() const { return fusion::begin(seq1); } in first()
76 typename mpl::if_<traits::is_view<Sequence1>, Sequence1, Sequence1&>::type seq1; member
/third_party/boost/boost/fusion/algorithm/transformation/
Dtransform.hpp47 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/gstreamer/gstplugins_good/tests/check/elements/
Drtpred.c759 guint16 seq0, seq1; in GST_START_TEST() local
770 seq1 = seq0 + 1; in GST_START_TEST()
777 _new_rtp_buffer (TRUE, 0, PT_MEDIA, seq1, timestamp0, 0xabe2b0b, in GST_START_TEST()
796 guint16 seq0, seq1; in GST_START_TEST() local
809 seq1 = seq0 + 1; in GST_START_TEST()
816 _new_rtp_buffer (TRUE, 0, PT_MEDIA, seq1, timestamp1, 0xabe2b0b, in GST_START_TEST()
834 guint16 seq0, seq1; in GST_START_TEST() local
846 seq1 = seq0 + 1; in GST_START_TEST()
853 _new_rtp_buffer (TRUE, 0, PT_MEDIA, seq1, timestamp1, 0xabe2b0b, in GST_START_TEST()
/third_party/boost/libs/fusion/test/sequence/
Dmisc.hpp103 typedef boost::mpl::push_back<seq0, int>::type seq1; typedef
104 BOOST_STATIC_ASSERT((boost::mpl::equal<seq1, target1>::value));
107 typedef boost::mpl::push_back<seq1, double>::type seq2;
/third_party/python/Lib/unittest/
Dcase.py936 def assertSequenceEqual(self, seq1, seq2, msg=None, seq_type=None): argument
952 if not isinstance(seq1, seq_type):
954 % (seq_type_name, safe_repr(seq1)))
963 len1 = len(seq1)
976 if seq1 == seq2:
981 _common_shorten_repr(seq1, seq2))
985 item1 = seq1[i]
1004 type(seq1) != type(seq2)):
1013 (len2, safe_repr(seq1[len2])))
1028 difflib.ndiff(pprint.pformat(seq1).splitlines(),
/third_party/mindspore/tests/ut/python/nn/
Dtest_container.py99 seq1 = nn.SequentialCell([relu, tanh])
100 out = seq1(input_me)
/third_party/python/Modules/clinic/
Ditertoolsmodule.c.h552 itertools_compress_impl(PyTypeObject *type, PyObject *seq1, PyObject *seq2);
563 PyObject *seq1; in itertools_compress() local
570 seq1 = fastargs[0]; in itertools_compress()
572 return_value = itertools_compress_impl(type, seq1, seq2); in itertools_compress()
/third_party/boost/boost/fusion/view/transform_view/detail/
Dat_impl.hpp57 return seq.f(boost::fusion::at<N>(seq.seq1), boost::fusion::at<N>(seq.seq2)); in call()
/third_party/glib/glib/tests/
Dsequence.c611 SequenceInfo *seq1 = RANDOM_SEQUENCE(); in run_random_tests() local
613 GSequenceIter *iter1 = get_random_iter (seq1, &link1); in run_random_tests()
625 g_queue_delete_link (seq1->queue, link1); in run_random_tests()
629 seq1->n_items--; in run_random_tests()
645 SequenceInfo *seq1 = RANDOM_SEQUENCE(); in run_random_tests() local
647 GSequenceIter *iter1 = get_random_iter (seq1, &link1); in run_random_tests()
658 get_item (iter2)->seq = seq1; in run_random_tests()
/third_party/musl/porting/liteos_m/kernel/src/regex/
Dregcomp.c1920 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local
1938 if (seq1 != NULL) in tre_expand_ast()
1939 seq1 = tre_ast_new_catenation(mem, seq1, copy); in tre_expand_ast()
1941 seq1 = copy; in tre_expand_ast()
1942 if (seq1 == NULL) in tre_expand_ast()
1984 if (seq1 == NULL) in tre_expand_ast()
1985 seq1 = seq2; in tre_expand_ast()
1987 seq1 = tre_ast_new_catenation(mem, seq1, seq2); in tre_expand_ast()
1988 if (seq1 == NULL) in tre_expand_ast()
1990 node->obj = seq1->obj; in tre_expand_ast()
[all …]
/third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/
Dregcomp.c1921 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local
1939 if (seq1 != NULL) in tre_expand_ast()
1940 seq1 = tre_ast_new_catenation(mem, seq1, copy); in tre_expand_ast()
1942 seq1 = copy; in tre_expand_ast()
1943 if (seq1 == NULL) in tre_expand_ast()
1985 if (seq1 == NULL) in tre_expand_ast()
1986 seq1 = seq2; in tre_expand_ast()
1988 seq1 = tre_ast_new_catenation(mem, seq1, seq2); in tre_expand_ast()
1989 if (seq1 == NULL) in tre_expand_ast()
1991 node->obj = seq1->obj; in tre_expand_ast()
[all …]
/third_party/musl/porting/uniproton/kernel/src/regex/
Dregcomp.c1920 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local
1938 if (seq1 != NULL) in tre_expand_ast()
1939 seq1 = tre_ast_new_catenation(mem, seq1, copy); in tre_expand_ast()
1941 seq1 = copy; in tre_expand_ast()
1942 if (seq1 == NULL) in tre_expand_ast()
1984 if (seq1 == NULL) in tre_expand_ast()
1985 seq1 = seq2; in tre_expand_ast()
1987 seq1 = tre_ast_new_catenation(mem, seq1, seq2); in tre_expand_ast()
1988 if (seq1 == NULL) in tre_expand_ast()
1990 node->obj = seq1->obj; in tre_expand_ast()
[all …]
/third_party/musl/src/regex/
Dregcomp.c1920 tre_ast_node_t *seq1 = NULL, *seq2 = NULL; in tre_expand_ast() local
1938 if (seq1 != NULL) in tre_expand_ast()
1939 seq1 = tre_ast_new_catenation(mem, seq1, copy); in tre_expand_ast()
1941 seq1 = copy; in tre_expand_ast()
1942 if (seq1 == NULL) in tre_expand_ast()
1984 if (seq1 == NULL) in tre_expand_ast()
1985 seq1 = seq2; in tre_expand_ast()
1987 seq1 = tre_ast_new_catenation(mem, seq1, seq2); in tre_expand_ast()
1988 if (seq1 == NULL) in tre_expand_ast()
1990 node->obj = seq1->obj; in tre_expand_ast()
[all …]

12