| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| default.pass.cpp | 75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
|
| default.pred.pass.cpp | 87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| default.pass.cpp | 75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 81 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
82 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| hash.pred.pass.cpp | 96 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
97 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
99 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
133 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
134 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
136 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| pred.pass.cpp | 90 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
91 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
93 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
124 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
125 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
127 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| default.pass.cpp | 75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 80 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
81 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
83 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| hash.pred.pass.cpp | 93 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
94 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
96 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
127 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
128 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
130 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| pred.pass.cpp | 87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
121 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
122 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
124 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| default.pass.cpp | 76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 82 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
83 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
85 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
116 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
117 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
119 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| hash.pred.pass.cpp | 97 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
98 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
100 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
134 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
135 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
137 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| pred.pass.cpp | 91 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
92 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
94 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
125 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
126 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
128 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| default.pass.cpp | 76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3))
[all...] |
| hash.pass.cpp | 81 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
82 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| hash.pred.pass.cpp | 94 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
95 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
97 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
128 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
129 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
131 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| pred.pass.cpp | 88 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
89 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
91 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
122 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
123 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
125 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3)
[all...] |
| /external/apache-commons-bcel/src/main/java/org/apache/bcel/generic/ |
| BranchHandle.java | 97 public void setTarget( final InstructionHandle ih ) {
98 bi.setTarget(ih);
|
| MethodGen.java | 221 final InstructionHandle ih = il.findHandle(l.getStartPC()); local
222 if (ih != null) {
223 addLineNumber(ih, l.getLineNumber());
396 * @param ih instruction to tag
400 public LineNumberGen addLineNumber( final InstructionHandle ih, final int src_line ) {
401 final LineNumberGen l = new LineNumberGen(ih, src_line);
763 for (InstructionHandle ih = il.getStart(); ih != null; ih = next) {
764 next = ih.getNext()
1001 InstructionHandle ih = il.getStart(); local
[all...] |
| InstructionHandle.java | 125 final InstructionHandle ih = ih_list; local
126 ih_list = ih.next;
127 ih.setInstruction(i);
128 return ih;
|
| /external/apache-commons-bcel/src/test/java/org/apache/bcel/ |
| InstructionFinderTestCase.java | 55 for (final InstructionHandle ih : ihs)
57 size += ih.getInstruction().getLength();
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy.pass.cpp | 91 const int ih[] = {0, 1, 1}; local
92 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
94 r = std::unique_copy(InIter(ih), InIter(ih+sh), OutIter(jh));
|
| /external/slf4j/slf4j-api/src/test/java/org/slf4j/helpers/ |
| SubstitutableLoggerTest.java | 51 LoggerInvocationHandler ih = new LoggerInvocationHandler(); local
52 Logger proxyLogger = (Logger) Proxy.newProxyInstance(getClass().getClassLoader(), new Class[] { Logger.class }, ih);
58 expectedMethodSignatures.removeAll(ih.getInvokedMethodSignatures());
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 88 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
89 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
91 assert(std::search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3)) == Iter1(ih+3));
|
