| /external/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 33 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)) ==
|
| find_first_of_pred.pass.cpp | 36 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/ |
| merge.pass.cpp | 32 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[i] = i
[all...] |
| merge_comp.pass.cpp | 35 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[i] = i
[all...] |
| /external/chromium_org/third_party/webrtc/base/ |
| scopedptrcollection_unittest.cc | 61 InstanceCounter* ic = new InstanceCounter(&num_instances_); local
62 collection_->PushBack(ic);
64 collection_->Remove(ic);
68 delete ic;
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 39 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);
|
| reverse_copy.pass.cpp | 42 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/ |
| search_n.pass.cpp | 59 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), Iter(ic+sc), 2, 0) == Iter(ic))
[all...] |
| search_n_pred.pass.cpp | 124 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), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic))
[all...] |
| search_pred.pass.cpp | 77 int ic[] = {1}; local
78 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1));
|
| search.pass.cpp | 42 int ic[] = {1}; local
43 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1));
|
| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 31 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)));
|
| includes_comp.pass.cpp | 32 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/ |
| set_intersection.pass.cpp | 34 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);
|
| set_intersection_comp.pass.cpp | 36 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/ |
| set_symmetric_difference.pass.cpp | 35 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);
|
| set_symmetric_difference_comp.pass.cpp | 37 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/ |
| set_union.pass.cpp | 34 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);
|
| set_union_comp.pass.cpp | 36 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);
|
| /art/runtime/ |
| utf.cc | 28 int ic; local
29 while ((ic = *utf8++) != '\0') {
31 if ((ic & 0x80) == 0) {
37 if ((ic & 0x20) == 0) {
|
| /external/chromium_org/v8/src/ |
| code-factory.cc | 9 #include "src/ic/ic.h"
38 Handle<Code> ic = mode == SLOPPY local
41 return Callable(ic, StoreDescriptor(isolate));
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 55 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[2] == 2)
253 std::unique_ptr<int> ic[3]; local
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 34 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);
|
| set_difference_comp.pass.cpp | 36 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);
|
| /external/icu/icu4c/source/layout/ |
| IndicRearrangementProcessor2.cpp | 70 le_int32 ia, ib, ic, id, ix, x; local
167 ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
181 glyphStorage.setCharIndex(firstGlyph, ic, success);
188 ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
203 glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
211 ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
226 glyphStorage.setCharIndex(firstGlyph, ic, success);
236 ic = glyphStorage.getCharIndex(lastGlyph - 1, success);
252 glyphStorage.setCharIndex(firstGlyph + 1, ic, success);
318 ic = glyphStorage.getCharIndex(lastGlyph - 1, success)
[all...] |
