Searched defs:ic (Results 1 - 25 of 87) sorted by relevance

1234

/external/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dfind_first_of.pass.cpp33 int ic[] = {7}; local
36 forward_iterator<const int*>(ic),
37 forward_iterator<const int*>(ic + 1)) ==
41 forward_iterator<const int*>(ic),
42 forward_iterator<const int*>(ic)) ==
46 forward_iterator<const int*>(ic),
47 forward_iterator<const int*>(ic+1)) ==
H A Dfind_first_of_pred.pass.cpp36 int ic[] = {7}; local
39 forward_iterator<const int*>(ic),
40 forward_iterator<const int*>(ic + 1),
45 forward_iterator<const int*>(ic),
46 forward_iterator<const int*>(ic),
51 forward_iterator<const int*>(ic),
52 forward_iterator<const int*>(ic+1),
/external/libcxx/test/algorithms/alg.sorting/alg.merge/
H A Dmerge.pass.cpp32 int* ic = new int[2*N]; local
38 InIter2(ib), InIter2(ib+N), OutIter(ic));
39 assert(base(r) == ic+2*N);
40 assert(ic[0] == 0);
41 assert(ic[2*N-1] == 2*N-1);
42 assert(std::is_sorted(ic, ic+2*N));
43 delete [] ic;
51 int* ic = new int[2*N]; local
53 ic[
[all...]
H A Dmerge_comp.pass.cpp35 int* ic = new int[2*N]; local
43 InIter2(ib), InIter2(ib+N), OutIter(ic), std::greater<int>());
44 assert(base(r) == ic+2*N);
45 assert(ic[0] == 2*N-1);
46 assert(ic[2*N-1] == 0);
47 assert(std::is_sorted(ic, ic+2*N, std::greater<int>()));
48 delete [] ic;
56 int* ic = new int[2*N]; local
58 ic[
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/
H A Dreverse.pass.cpp39 int ic[] = {0, 1, 2}; local
40 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
41 std::reverse(Iter(ic), Iter(ic+sc));
42 assert(ic[0] == 2);
43 assert(ic[1] == 1);
44 assert(ic[2] == 0);
H A Dreverse_copy.pass.cpp42 const int ic[] = {0, 1, 2}; local
43 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc));
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/
H A Dsearch_n.pass.cpp59 int ic[] = {0, 0, 0}; local
60 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
61 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic));
62 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic));
63 assert(std::search_n(Iter(ic), Ite
[all...]
H A Dsearch_n_pred.pass.cpp124 int ic[] = {0, 0, 0}; local
125 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
126 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic));
129 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic));
132 assert(std::search_n(Iter(ic), Ite
[all...]
H A Dsearch.pass.cpp42 int ic[] = {1}; local
43 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1));
H A Dsearch_pred.pass.cpp77 int ic[] = {1}; local
78 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1));
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/
H A Dincludes.pass.cpp31 int ic[] = {1, 2}; local
32 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
44 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2)));
H A Dincludes_comp.pass.cpp32 int ic[] = {1, 2}; local
33 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
45 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>()));
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/
H A Dset_intersection.pass.cpp34 int ic[20]; local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
42 Iter2(ia), Iter2(ia+sa), OutIter(ic));
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
H A Dset_intersection_comp.pass.cpp36 int ic[20]; local
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
H A Dset_symmetric_difference.pass.cpp35 int ic[20]; local
39 Iter2(ib), Iter2(ib+sb), OutIter(ic));
40 assert(base(ce) - ic == sr);
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 Iter2(ia), Iter2(ia+sa), OutIter(ic));
44 assert(base(ce) - ic == sr);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
H A Dset_symmetric_difference_comp.pass.cpp37 int ic[20]; local
42 OutIter(ic), std::less<int>());
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
47 OutIter(ic), std::less<int>());
48 assert(base(ce) - ic == sr);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/
H A Dset_union.pass.cpp34 int ic[20]; local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
42 Iter2(ia), Iter2(ia+sa), OutIter(ic));
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
H A Dset_union_comp.pass.cpp36 int ic[20]; local
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftcid.c69 FT_Bool ic = 0; local
80 error = service->get_is_cid( face, &ic);
84 *is_cid = ic;
/external/chromium_org/third_party/libjingle/source/talk/base/
H A Dscopedptrcollection_unittest.cc78 InstanceCounter* ic = new InstanceCounter(&num_instances_); local
79 collection_->PushBack(ic);
81 collection_->Remove(ic);
85 delete ic;
/external/chromium_org/third_party/webrtc/base/
H A Dscopedptrcollection_unittest.cc61 InstanceCounter* ic = new InstanceCounter(&num_instances_); local
62 collection_->PushBack(ic);
64 collection_->Remove(ic);
68 delete ic;
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/
H A Dp7.cpp13 void test_capture_constness(int i, const int ic) { argument
14 (void)[i,ic] ()->void {
16 float &fr2 = check_const_int(ic);
21 float &fr2 = check_const_int(ic);
24 (void)[i,ic] () mutable ->void {
26 float &fr = check_const_int(ic);
31 float &fr = check_const_int(ic);
34 (void)[&i,&ic] ()->void {
36 float &fr = check_const_int(ic);
41 float &fr = check_const_int(ic);
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate.pass.cpp55 int ic[] = {0, 1, 2}; local
56 const unsigned sc = sizeof(ic)/sizeof(ic[0]);
57 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc));
58 assert(base(r) == ic+sc);
59 assert(ic[0] == 0);
60 assert(ic[1] == 1);
61 assert(ic[
253 std::unique_ptr<int> ic[3]; local
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/
H A Dset_difference.pass.cpp34 int ic[20]; local
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
44 Iter2(ia), Iter2(ia+sa), OutIter(ic));
45 assert(base(ce) - ic == srr);
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
H A Dset_difference_comp.pass.cpp36 int ic[20]; local
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
46 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
47 assert(base(ce) - ic == srr);
48 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);

Completed in 324 milliseconds

1234