| /external/chromium/third_party/icu/source/test/intltest/ |
| decoll.cpp | 88 { Collator::LESS, Collator::LESS },
89 { Collator::EQUAL, Collator::LESS },
93 { Collator::EQUAL, Collator::LESS },
95 { Collator::LESS, Collator::LESS },
98 { Collator::LESS, Collator::LESS },
|
| frcoll.cpp | 78 Collator::LESS,
79 Collator::LESS,
80 Collator::LESS, /*Collator::GREATER,*/
81 Collator::LESS,
84 Collator::LESS,
86 Collator::LESS, /*Collator::GREATER,*/
88 Collator::LESS,
89 Collator::LESS
175 expected = Collator::LESS;
194 doTest(myCollation, testBugs[i], testBugs[j], Collator::LESS);
[all...] |
| encoll.cpp | 134 Collator::LESS,
135 Collator::LESS, /*Collator::GREATER,*/
136 Collator::LESS,
140 Collator::LESS,
141 Collator::LESS,
142 Collator::LESS,
143 Collator::LESS, /*Collator::GREATER,*/ /* 10 */
145 Collator::LESS,
147 Collator::LESS,
151 Collator::LESS,
[all...] |
| /external/icu4c/test/intltest/ |
| decoll.cpp | 88 { Collator::LESS, Collator::LESS },
89 { Collator::EQUAL, Collator::LESS },
93 { Collator::EQUAL, Collator::LESS },
95 { Collator::LESS, Collator::LESS },
98 { Collator::LESS, Collator::LESS },
|
| frcoll.cpp | 78 Collator::LESS,
79 Collator::LESS,
80 Collator::LESS, /*Collator::GREATER,*/
81 Collator::LESS,
84 Collator::LESS,
86 Collator::LESS, /*Collator::GREATER,*/
88 Collator::LESS,
89 Collator::LESS
175 expected = Collator::LESS;
194 doTest(myCollation, testBugs[i], testBugs[j], Collator::LESS);
[all...] |
| encoll.cpp | 134 Collator::LESS,
135 Collator::LESS, /*Collator::GREATER,*/
136 Collator::LESS,
140 Collator::LESS,
141 Collator::LESS,
142 Collator::LESS,
143 Collator::LESS, /*Collator::GREATER,*/ /* 10 */
145 Collator::LESS,
147 Collator::LESS,
151 Collator::LESS,
[all...] |
| /external/stlport/test/unit/ |
| perm_test.cpp | 191 next_permutation(v1.begin(), v1.end(), less<char>());
195 next_permutation(v1.begin(), v1.end(), less<char>());
199 next_permutation(v1.begin(), v1.end(), less<char>());
203 next_permutation(v1.begin(), v1.end(), less<char>());
207 next_permutation(v1.begin(), v1.end(), less<char>());
211 next_permutation(v1.begin(), v1.end(), less<char>());
215 next_permutation(v1.begin(), v1.end(), less<char>());
219 next_permutation(v1.begin(), v1.end(), less<char>());
223 next_permutation(v1.begin(), v1.end(), less<char>());
|
| less_test.cpp | 34 sort(array, array + 4, less<int>());
|
| mvctor_declaration_test.cpp | 113 struct less<struct_with_specialized_less> { struct in namespace:std
142 struct __move_traits<less<struct_with_specialized_less> > {
293 //For associative containers it is important that less is correctly recognize as
294 //the STLport less or a user specialized less:
296 CPPUNIT_ASSERT( is_move_complete(less<char>()) );
298 CPPUNIT_ASSERT( !is_move_complete(less<struct_with_specialized_less>()) );
|
| /ndk/sources/android/stlport/test/unit/ |
| perm_test.cpp | 191 next_permutation(v1.begin(), v1.end(), less<char>());
195 next_permutation(v1.begin(), v1.end(), less<char>());
199 next_permutation(v1.begin(), v1.end(), less<char>());
203 next_permutation(v1.begin(), v1.end(), less<char>());
207 next_permutation(v1.begin(), v1.end(), less<char>());
211 next_permutation(v1.begin(), v1.end(), less<char>());
215 next_permutation(v1.begin(), v1.end(), less<char>());
219 next_permutation(v1.begin(), v1.end(), less<char>());
223 next_permutation(v1.begin(), v1.end(), less<char>());
|
| less_test.cpp | 34 sort(array, array + 4, less<int>());
|
| mvctor_declaration_test.cpp | 113 struct less<struct_with_specialized_less> { struct in namespace:std
142 struct __move_traits<less<struct_with_specialized_less> > {
293 //For associative containers it is important that less is correctly recognize as
294 //the STLport less or a user specialized less:
296 CPPUNIT_ASSERT( is_move_complete(less<char>()) );
298 CPPUNIT_ASSERT( !is_move_complete(less<struct_with_specialized_less>()) );
|
| /dalvik/tests/084-class-init/src/ |
| IntHolder.java | 26 * exception if the initial value is less than zero.
|
| /dalvik/vm/compiler/template/armv5te-vfp/ |
| TEMPLATE_CMPG_DOUBLE_VFP.S | 31 mvnmi r0, #0 @ (less than) r0<- -1
|
| TEMPLATE_CMPG_FLOAT_VFP.S | 30 mvnmi r0, #0 @ (less than) r0<- -1
|
| /dalvik/vm/mterp/x86/ |
| OP_AGET.S | 4 * Array get, 32 bits or less. vAA <- vBB[vCC].
|
| OP_APUT.S | 4 * Array put, 32 bits or less. vBB[vCC] <- vAA
|
| /external/bzip2/ |
| bzmore | 10 *less) more=less ;;
|
| /external/nist-sip/java/gov/nist/javax/sip/header/extensions/ |
| MinSE.java | 84 * less than 2**31.
88 * @throws InvalidArgumentException if supplied value is less than zero.
|
| SessionExpires.java | 59 * less than 2**31.
63 * @throws InvalidArgumentException if supplied value is less than zero.
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| prune.h | 89 NaturalLess<Weight> less; local
93 if (less(ceiling, Times((*idistance)[state], (*fdistance)[state]))) {
104 if(less(ceiling, weight)) {
109 if (less(ceiling, Times((*idistance)[state], fst->Final(state))))
172 NaturalLess<Weight> less; local
188 if (less(ceiling, Times((*idistance)[state], (*fdistance)[state])))
193 if (!less(ceiling, Times((*idistance)[state], ifst.Final(state))))
213 if (!less(ceiling, weight)) {
|
| /external/zlib/contrib/asm586/ |
| README.586 | 12 less than the amount of variance between subsequent executions).
19 with MMX, which suffers much less from L1-cache contention, but I have
|
| /libcore/luni/src/main/java/java/util/ |
| NavigableSet.java | 75 * Returns the biggest element less than the specified one, or null if no
80 * @return the biggest element less than the specified one, or null if no
90 * Returns the biggest element less than or equal to the specified one, or
95 * @return the biggest element less than or equal to the specified one, or
121 * start element but less than (or equal to, depends on endInclusive) the
150 * contains elements less than (or equal to, depends on endInclusive) the
|
| /libcore/luni/src/main/java/java/nio/ |
| ReadWriteDirectByteBuffer.java | 145 * The offset of short array, must be no less than zero and no
148 * The number of <code>short</code>s to write, must be no less
152 * If <code>remaining()</code> is less than
185 * The offset of int array, must be no less than zero and no
188 * The number of <code>int</code>s to write, must be no less
192 * If <code>remaining()</code> is less than
225 * The offset of float array, must be no less than zero and no
228 * The number of <code>float</code>s to write, must be no less
232 * If <code>remaining()</code> is less than
|
| /external/webkit/JavaScriptCore/wtf/ |
| AVLTree.h | 124 // You pick 28 because MN(28) is 832,039, which is less than or equal to 1,000,000, and MN(29) is 1,346,268, which is strictly greater than 1,000,000.
136 LESS = 2,
138 LESS_EQUAL = EQUAL | LESS,
187 if (st & LESS)
191 // Key can be less than key of starting node.
326 // take the less branch. branch[0] gives branch from root, and
352 // less from the node at depth N, if true branch greater.
356 // greater subtree has one more node than it's less subtree.
365 // The algorithm relies on a stack of nodes whose less subtree has
414 // We've completed a less subtree
[all...] |
