| /external/valgrind/main/none/tests/s390x/ |
| cgij.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| cgrj.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| cij.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| clgij.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| clgrj.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| clij.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| clrj.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| crj.stdout.exp | 7 less or equal
8 less or equal
10 less than
13 less or equal
14 less or equal
16 less than
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/performance/ui/ |
| messages.properties | 14 standardError = Standard error on this test is {0} (should be less than {1} to become reliable!)
|
| /libcore/luni/src/main/java/java/util/ |
| DualPivotQuicksort.java | 45 * If the length of an array to be sorted is less than this
166 int less = left + 1; // The index of first element of center part local
181 * less k great
185 * all in (left, less) < pivot1
186 * pivot1 <= all in [less, k) <= pivot2
192 for (int k = less; k <= great; k++) {
195 if (k != less) {
196 a[k] = a[less];
197 a[less] = ak;
199 less++
444 int less = left + 1; \/\/ The index of first element of center part local
739 int less = left + 1; \/\/ The index of first element of center part local
1032 int less = left + 1; \/\/ The index of first element of center part local
1327 int less = left + 1; \/\/ The index of first element of center part local
1700 int less = left + 1; \/\/ The index of first element of center part local
2073 int less = left + 1; \/\/ The index of first element of center part local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes_comp.pass.cpp | 37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()));
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>()));
40 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), std::less<int>()));
42 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>()));
43 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>()));
45 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2), std::less<int>()));
46 assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2), std::less<int>()));
48 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+1), std::less<int>()));
49 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(id), Iter2(id+2), std::less<int>()))
[all...] |
| /dalvik/vm/compiler/template/armv5te/ |
| TEMPLATE_CMPL_DOUBLE.S | 22 mvncc r0, #0 @ (less than) r1<- -1
23 moveq r0, #0 @ (equal) r1<- 0, trumps less than
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.cons/ |
| alloc.pass.cpp | 23 typedef std::less<int> C;
|
| compare.pass.cpp | 23 typedef test_compare<std::less<int> > C;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.cons/ |
| alloc.pass.cpp | 23 typedef std::less<int> C;
|
| compare.pass.cpp | 23 typedef test_compare<std::less<int> > C;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/multiset.cons/ |
| alloc.pass.cpp | 23 typedef std::less<int> C;
|
| compare.pass.cpp | 23 typedef test_compare<std::less<int> > C;
|
| compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > C;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/set/set.cons/ |
| alloc.pass.cpp | 23 typedef std::less<int> C;
|
| compare.pass.cpp | 23 typedef test_compare<std::less<int> > C;
|
| compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > C;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| ctor_comp.pass.cpp | 21 std::priority_queue<int, std::vector<int, stack_allocator<int, 10> > > q((std::less<int>()));
|
| ctor_iter_iter_comp_cont.pass.cpp | 24 std::priority_queue<int> q(a+n/2, a+n, std::less<int>(), v);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/function.objects/comparisons/ |
| less.pass.cpp | 12 // less
20 typedef std::less<int> F;
|
