| /external/libfuse/lib/modules/ |
| D | iconv.c | 32 struct iconv *ic; member
42 static int iconv_convpath(struct iconv *ic, const char *path, char **newpathp, in iconv_convpath() argument
66 pthread_mutex_lock(&ic->lock); in iconv_convpath()
68 res = iconv(fromfs ? ic->fromfs : ic->tofs, (char **) &path, in iconv_convpath()
90 pthread_mutex_unlock(&ic->lock); in iconv_convpath()
96 iconv(fromfs ? ic->fromfs : ic->tofs, NULL, NULL, NULL, NULL); in iconv_convpath()
97 pthread_mutex_unlock(&ic->lock); in iconv_convpath()
105 struct iconv *ic = iconv_get(); in iconv_getattr() local
107 int err = iconv_convpath(ic, path, &newpath, 0); in iconv_getattr()
109 err = fuse_fs_getattr(ic->next, newpath, stbuf, fi); in iconv_getattr()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 27 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local
32 …urn (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(i… in test_constexpr()
33 …&& (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)))… in test_constexpr()
34 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)))… in test_constexpr()
35 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)))… in test_constexpr()
36 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)))… in test_constexpr()
37 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)))… in test_constexpr()
53 int ic[] = {7}; in main() local
56 forward_iterator<const int*>(ic), in main()
57 forward_iterator<const int*>(ic + 1)) == in main()
[all …]
|
| D | find_first_of_pred.pass.cpp | 29 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local
34 …n (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
35 … (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), e… in test_constexpr()
36 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)),… in test_constexpr()
37 … (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), e… in test_constexpr()
38 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)),… in test_constexpr()
39 … (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), e… in test_constexpr()
56 int ic[] = {7}; in main() local
59 forward_iterator<const int*>(ic), in main()
60 forward_iterator<const int*>(ic + 1), in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 26 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local
31 …urn (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(i… in test_constexpr()
32 …&& (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)))… in test_constexpr()
33 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)))… in test_constexpr()
34 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)))… in test_constexpr()
35 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)))… in test_constexpr()
36 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)))… in test_constexpr()
52 int ic[] = {7}; in main() local
55 forward_iterator<const int*>(ic), in main()
56 forward_iterator<const int*>(ic + 1)) == in main()
[all …]
|
| D | find_first_of_pred.pass.cpp | 28 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local
33 …n (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
34 … (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), e… in test_constexpr()
35 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)),… in test_constexpr()
36 … (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), e… in test_constexpr()
37 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)),… in test_constexpr()
38 … (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), e… in test_constexpr()
55 int ic[] = {7}; in main() local
58 forward_iterator<const int*>(ic), in main()
59 forward_iterator<const int*>(ic + 1), in main()
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | graph_properties.cc | 364 InferenceContext* ic, const std::vector<ShapeHandle>& shapes) { in ReplaceUnknownDimFromConstWithUnknownDim() argument
368 if (!ic->RankKnown(shape)) { in ReplaceUnknownDimFromConstWithUnknownDim()
374 for (int32 i = 0; i < ic->Rank(shape); ++i) { in ReplaceUnknownDimFromConstWithUnknownDim()
375 DimensionHandle dim = ic->Dim(shape, i); in ReplaceUnknownDimFromConstWithUnknownDim()
376 if (ic->ValueKnown(dim) && ic->Value(dim) == kUnknownDimFromConst) { in ReplaceUnknownDimFromConstWithUnknownDim()
378 dims.push_back(ic->UnknownDim()); in ReplaceUnknownDimFromConstWithUnknownDim()
387 converted_shapes[i] = ic->MakeShape(dims); in ReplaceUnknownDimFromConstWithUnknownDim()
394 TensorProto MakeTensorProtoFromShape(InferenceContext* ic, in MakeTensorProtoFromShape() argument
401 if (ic->Rank(shape) == 1) { in MakeTensorProtoFromShape()
402 shape_proto->add_dim()->set_size(ic->Rank(tensor_as_shape)); in MakeTensorProtoFromShape()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate.pass.cpp | 57 int ic[] = {0, 1, 2}; in test() local
58 const int sc = static_cast<int>(sizeof(ic)/sizeof(ic[0])); in test()
59 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test()
60 assert(base(r) == ic+sc); in test()
61 assert(ic[0] == 0); in test()
62 assert(ic[1] == 1); in test()
63 assert(ic[2] == 2); in test()
64 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test()
65 assert(base(r) == ic+2); in test()
66 assert(ic[0] == 1); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate.pass.cpp | 54 int ic[] = {0, 1, 2}; in test() local
55 const int sc = static_cast<int>(sizeof(ic)/sizeof(ic[0])); in test()
56 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test()
57 assert(base(r) == ic+sc); in test()
58 assert(ic[0] == 0); in test()
59 assert(ic[1] == 1); in test()
60 assert(ic[2] == 2); in test()
61 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test()
62 assert(base(r) == ic+2); in test()
63 assert(ic[0] == 1); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| D | find_end.pass.cpp | 27 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local
32 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
33 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == F… in test_constexpr()
34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr()
35 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr()
36 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == R… in test_constexpr()
37 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == R… in test_constexpr()
|
| D | find_end_pred.pass.cpp | 37 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local
42 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
43 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) … in test_constexpr()
44 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
45 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) … in test_constexpr()
46 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) … in test_constexpr()
47 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) … in test_constexpr()
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| D | find_end.pass.cpp | 26 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local
31 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
32 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == F… in test_constexpr()
33 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr()
34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr()
35 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == R… in test_constexpr()
36 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == R… in test_constexpr()
|
| D | find_end_pred.pass.cpp | 36 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local
41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr()
42 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) … in test_constexpr()
43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr()
44 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) … in test_constexpr()
45 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) … in test_constexpr()
46 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) … in test_constexpr()
|
| /external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
| D | p7.cpp | 13 void test_capture_constness(int i, const int ic) { in test_capture_constness() argument
14 (void)[i,ic] ()->void { in test_capture_constness()
16 float &fr2 = check_const_int(ic); in test_capture_constness()
21 float &fr2 = check_const_int(ic); in test_capture_constness()
24 (void)[i,ic] () mutable ->void { in test_capture_constness()
26 float &fr = check_const_int(ic); in test_capture_constness()
31 float &fr = check_const_int(ic); in test_capture_constness()
34 (void)[&i,&ic] ()->void { in test_capture_constness()
36 float &fr = check_const_int(ic); in test_capture_constness()
41 float &fr = check_const_int(ic); in test_capture_constness()
|
| /external/llvm-project/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
| D | p7.cpp | 13 void test_capture_constness(int i, const int ic) { in test_capture_constness() argument
14 (void)[i,ic] ()->void { in test_capture_constness()
16 float &fr2 = check_const_int(ic); in test_capture_constness()
21 float &fr2 = check_const_int(ic); in test_capture_constness()
24 (void)[i,ic] () mutable ->void { in test_capture_constness()
26 float &fr = check_const_int(ic); in test_capture_constness()
31 float &fr = check_const_int(ic); in test_capture_constness()
34 (void)[&i,&ic] ()->void { in test_capture_constness()
36 float &fr = check_const_int(ic); in test_capture_constness()
41 float &fr = check_const_int(ic); in test_capture_constness()
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch.pass.cpp | 31 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
35 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic)); in test_constexpr()
36 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr()
39 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)); in test_constexpr()
40 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr()
43 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); in test_constexpr()
44 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
47 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); in test_constexpr()
48 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
51 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); in test_constexpr()
[all …]
|
| D | mismatch_pred.pass.cpp | 36 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
40 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), eq); in test_constexpr()
41 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr()
44 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq); in test_constexpr()
45 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr()
48 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); in test_constexpr()
49 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
52 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); in test_constexpr()
53 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
56 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); in test_constexpr()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch.pass.cpp | 30 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
34 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic)); in test_constexpr()
35 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr()
38 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)); in test_constexpr()
39 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr()
42 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); in test_constexpr()
43 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
46 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); in test_constexpr()
47 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
50 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); in test_constexpr()
[all …]
|
| D | mismatch_pred.pass.cpp | 35 int ic[] = {1, 3, 5, 7}; in test_constexpr() local
39 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), eq); in test_constexpr()
40 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr()
43 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq); in test_constexpr()
44 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr()
47 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); in test_constexpr()
48 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr()
51 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); in test_constexpr()
52 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr()
55 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); in test_constexpr()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 70 int ic[] = {0, 0, 0}; in test() local
71 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
72 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); in test()
73 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); in test()
74 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); in test()
75 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); in test()
76 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); in test()
79 (void)std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0); in test()
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 71 int ic[] = {0, 0, 0}; in test() local
72 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
73 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); in test()
74 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); in test()
75 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); in test()
76 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); in test()
77 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); in test()
80 (void)std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0); in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| D | merge.pass.cpp | 54 int* ic = new int[2*N]; in test() local
60 InIter2(ib), InIter2(ib+N), OutIter(ic)); in test()
61 assert(base(r) == ic+2*N); in test()
62 assert(ic[0] == 0); in test()
63 assert(ic[2*N-1] == static_cast<int>(2*N-1)); in test()
64 assert(std::is_sorted(ic, ic+2*N)); in test()
65 delete [] ic; in test()
73 int* ic = new int[2*N]; in test() local
75 ic[i] = i; in test()
76 std::shuffle(ic, ic+2*N, randomness); in test()
[all …]
|
| D | merge_comp.pass.cpp | 59 int* ic = new int[2*N]; in test() local
68 InIter2(ib), InIter2(ib+N), OutIter(ic), pred); in test()
69 assert(base(r) == ic+2*N); in test()
70 assert(ic[0] == static_cast<int>(2*N-1)); in test()
71 assert(ic[2*N-1] == 0); in test()
72 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
74 delete [] ic; in test()
82 int* ic = new int[2*N]; in test() local
84 ic[i] = i; in test()
85 std::shuffle(ic, ic+2*N, randomness); in test()
[all …]
|
| /external/python/cpython2/Lib/plat-mac/ |
| D | ic.py | 164 def __init__(self, signature='Pyth', ic=None): argument
165 if ic:
166 self.ic = ic
168 self.ic = icglue.ICStart(signature)
169 if hasattr(self.ic, 'ICFindConfigFile'):
170 self.ic.ICFindConfigFile()
175 self.ic.ICBegin(icReadOnlyPerm)
176 num = self.ic.ICCountPref()
178 rv.append(self.ic.ICGetIndPref(i+1))
179 self.ic.ICEnd()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| D | reverse.pass.cpp | 39 int ic[] = {0, 1, 2}; in test() local
40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
41 std::reverse(Iter(ic), Iter(ic+sc)); in test()
42 assert(ic[0] == 2); in test()
43 assert(ic[1] == 1); in test()
44 assert(ic[2] == 0); in test()
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| D | reverse.pass.cpp | 39 int ic[] = {0, 1, 2}; in test() local
40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
41 std::reverse(Iter(ic), Iter(ic+sc)); in test()
42 assert(ic[0] == 2); in test()
43 assert(ic[1] == 1); in test()
44 assert(ic[2] == 0); in test()
|