HomeSort by relevance Sort by last modified time
    Searched refs:less (Results 1 - 25 of 120) sorted by null

1 2 3 4 5

  /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...]
  /dalvik/vm/compiler/template/armv5te/
TEMPLATE_CMPL_DOUBLE.S 21 mvncc r0, #0 @ (less than) r1<- -1
22 moveq r0, #0 @ (equal) r1<- 0, trumps less than
TEMPLATE_CMPL_FLOAT.S 41 mvncc r0, #0 @ (less than) r0<- -1
42 moveq r0, #0 @ (equal) r0<- 0, trumps less than
  /external/stlport/stlport/stl/
_function_base.h 70 struct less : public binary_function<_Tp,_Tp,bool> struct in inherits:binary_function,__stlport_class
72 /* less is the default template parameter for many STL containers, to fully use
73 * the move constructor feature we need to know that the default less is just a
76 , public __stlport_class<less<_Tp> >
82 void _M_swap_workaround(less<_Tp>& __x) {}
88 struct __type_traits<less<_Tp> > {
90 typedef typename _IsSTLportClass<less<_Tp> >::_Ret _STLportLess;
92 enum { _Is = _IsSTLportClass<less<_Tp> >::_Is };
106 less<_Tp> __less(_Tp* ) { return less<_Tp>();
    [all...]
  /ndk/sources/android/stlport/stlport/stl/
_function_base.h 70 struct less : public binary_function<_Tp,_Tp,bool> struct in inherits:binary_function,__stlport_class
72 /* less is the default template parameter for many STL containers, to fully use
73 * the move constructor feature we need to know that the default less is just a
76 , public __stlport_class<less<_Tp> >
82 void _M_swap_workaround(less<_Tp>& __x) {}
88 struct __type_traits<less<_Tp> > {
90 typedef typename _IsSTLportClass<less<_Tp> >::_Ret _STLportLess;
92 enum { _Is = _IsSTLportClass<less<_Tp> >::_Is };
106 less<_Tp> __less(_Tp* ) { return less<_Tp>();
    [all...]
  /external/astl/tests/
test_functional.cpp 46 EXPECT_TRUE(std::less<int>()(5, 10));
  /external/bzip2/
bzmore 10 *less) more=less ;;
  /external/stlport/test/unit/
less_test.cpp 34 sort(array, array + 4, less<int>());
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>());
queue_test.cpp 35 priority_queue<int, deque<int>, less<int> > q;
setdiff_test.cpp 79 back_inserter(diff), less<char>());
129 set_difference(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2), back_inserter(diff), less<char>());
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>()) );
setinter_test.cpp 73 back_inserter(inter), less<char>());
setunion_test.cpp 76 back_inserter(diff), less<char>());
  /ndk/sources/android/stlport/test/unit/
less_test.cpp 34 sort(array, array + 4, less<int>());
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>());
queue_test.cpp 35 priority_queue<int, deque<int>, less<int> > q;
setdiff_test.cpp 79 back_inserter(diff), less<char>());
129 set_difference(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2), back_inserter(diff), less<char>());
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/vm/mterp/x86/
OP_FILLED_NEW_ARRAY.S 21 # less frequent path, so we'll redo some work
  /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)) {
queue.h 240 // Given a vector that maps from states to weights and a Less
246 typedef L Less;
250 StateWeightCompare(const vector<Weight>* weights, const L &less)
251 : weights_(weights), less_(less) {}
529 NaturalLess<Weight> *less = 0; local
532 less = new NaturalLess<Weight>;
533 comp = new Compare(distance, *less);
538 SccQueueType(fst, scc_, &queue_types, filter, less, &all_trivial,
545 delete less;
554 delete less;
    [all...]
  /external/astl/include/
functional 66 FUNCTIONAL_BINARY_COMPARAISON(less, <)
  /dalvik/vm/mterp/x86-atom/
OP_CMPL_FLOAT.S 55 movl $$0xFFFFFFFF, (rFP, rINST, 4) # vAA<- less than
OP_CMP_LONG.S 50 movl $$0xFFFFFFFF, (rFP, rINST, 4) # vAA<- less than

Completed in 371 milliseconds

1 2 3 4 5