/external/stlport/stlport/stl/ |
H A D | _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<_T [all...] |
/external/stlport/stlport/stl/pointers/ |
H A D | _set.h | 36 _STLP_EXPORT template struct _STLP_CLASS_DECLSPEC less<void*>; variable in typeref:struct:_STLP_CLASS_DECLSPEC 44 _STLP_EXPORT_TEMPLATE_CLASS _DbgCompare<void*, less<void*> >; 46 _STLP_EXPORT_TEMPLATE_CLASS _Rb_tree<void*, _DbgCompare<void*, less<void*> >, void*, _Identity<void*>, 50 _STLP_EXPORT_TEMPLATE_CLASS _Rb_tree<void*, less<void*>, void*, _Identity<void*>, 55 template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>), 302 template <class _Key, _STLP_DFL_TMPL_PARAM(_Compare, less<_Key>),
|
/external/stlport/test/unit/ |
H A D | 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>()) );
|
H A D | set_test.cpp | 58 set<int, less<int> > s; 70 typedef set<int, less<int> > int_set; 96 set<int, less<int> > s; 214 struct less<SetTestClass> { struct in namespace:std 285 typedef set<int, less<int>, StackAllocator<int> > SetInt; 286 less<int> intLess;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | 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)) {
|
H A D | queue.h | 250 StateWeightCompare(const vector<Weight>* weights, const L &less) argument 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; 587 delete less; 619 ArcFilter filter, Less *less, 646 SccQueueType(const Fst<A> &fst, const vector<StateId> &scc, vector<QueueType> *queue_type, ArcFilter filter, Less *less, bool *all_trivial, bool *unweighted) argument [all...] |
/external/skia/src/gpu/gl/ |
H A D | GrGpuGL_program.cpp | 88 ProgDescLess less; local 89 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
|
/external/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 616 int less = -1; local 619 while (&span[less + 1] - fTs.begin() > 0 && AlmostEqualUlps(span[less].fPt, pt)) { 621 double tInterval = newT - span[less].fT; 628 --less; 642 ++less; 644 while (more - 1 > less && span[more].fPt == span[more - 1].fPt 648 if (less == more) { 651 if (precisely_negative(span[more].fT - span[less].fT)) { 655 bool tiny = span[less] [all...] |
/external/skia/include/core/ |
H A D | SkTSearch.h | 34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is 39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument 55 if (less(*elem, key)) 62 if (less(*elem, key)) { 65 } else if (less(key, *elem)) { 71 // Adapts a less-than function to a functor.
|
/external/regex-re2/util/ |
H A D | sparse_array.h | 156 // sort(arr.begin(), arr.end(), arr.less); 157 static bool less(const IndexValue& a, const IndexValue& b); 446 template<typename Value> bool SparseArray<Value>::less(const IndexValue& a, function in class:re2::SparseArray
|
H A D | sparse_set.h | 164 // sort(arr.begin(), arr.end(), arr.less); 165 static bool less(int a, int b) { return a < b; } function in class:re2::SparseSet
|
/external/openfst/src/include/fst/ |
H A D | prune.h | 135 NaturalLess<Weight> less; local 140 if (!less(limit, (*fdistance)[s])) { 151 if (less(limit, Times(idistance[s], fst->Final(s)))) 162 if (less(limit, weight)) { 167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) 236 NaturalLess<Weight> less; 237 if (less(opts.weight_threshold, Weight::One()) || 277 if (!less(limit, Times(idistance[s], ifst.Final(s)))) 288 if (less(limit, weight)) continue; 294 if (less(Time [all...] |
H A D | queue.h | 282 StateWeightCompare(const vector<Weight>& weights, const L &less) argument 283 : weights_(weights), less_(less) {} 567 NaturalLess<Weight> *less = 0; local 570 less = new NaturalLess<Weight>; 571 comp = new Compare(*distance, *less); 576 SccQueueType(fst, scc_, &queue_types, filter, less, &all_trivial, 583 delete less; 592 delete less; 624 delete less; 656 ArcFilter filter, Less *less, 688 SccQueueType(const Fst<A> &fst, const vector<StateId> &scc, vector<QueueType> *queue_type, ArcFilter filter, Less *less, bool *all_trivial, bool *unweighted) argument 752 AStarWeightCompare(const vector<Weight>& weights, const L &less, const E &estimate) argument [all...] |
/external/mesa3d/src/glsl/ |
H A D | lower_variable_index_to_cond_assign.cpp | 303 ir_expression *less = local 307 ir_if *if_less = new(this->mem_ctx) ir_if(less);
|
/external/llvm/lib/AsmParser/ |
H A D | LLToken.h | 29 less, greater, // < > enumerator in enum:llvm::lltok::Kind
|
/external/llvm/lib/TableGen/ |
H A D | TGLexer.h | 39 less, greater, // < > enumerator in enum:llvm::tgtok::TokKind
|
/external/eigen/unsupported/Eigen/src/Polynomials/ |
H A D | PolynomialSolver.h | 111 std::less<Scalar> less; local 112 return selectComplexRoot_withRespectToNorm( less ); 239 std::less<Scalar> less; local 240 return selectRealRoot_withRespectToAbsRealPart( less, hasArealRoot, absImaginaryThreshold ); 285 std::less<Scalar> less; local 286 return selectRealRoot_withRespectToRealPart( less, hasArealRoot, absImaginaryThreshold );
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.equinox.p2.metadata_2.0.0.v20100601.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.ui.ide_3.6.2.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/clang/test/CXX/except/except.spec/ |
H A D | canonical.cpp | 36 struct less struct in namespace:std 42 typedef __map_value_compare<int, short, less> __vc;
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | compare-objects.js | 49 function test(a, b, less, greater) { 57 assertEquals(lt(a, b), less); 60 assertEquals(gt(b, a), less); 66 var less = obj1 < obj2; variable 69 test(obj1, obj2, less, greater); 70 test(obj1, obj2, less, greater); 71 test(obj1, obj2, less, greater); 73 test(obj1, obj2, less, greater); 74 test(obj1, obj2, less, greater); 77 test(obj1, obj2, less, greate 85 var less = obj1 < obj2; variable 96 var less = obj1 < obj2; variable 103 var less = true; variable [all...] |
/external/chromium_org/v8/src/arm64/ |
H A D | code-stubs-arm64.cc | 176 // Exponents less than this should have been handled by the Fcvt case. 255 __ Mov(result, GREATER); // Things aren't less than themselves. 642 // Call the native; it returns -1 (less), 0 (equal), or 1 (greater) 2312 // Check that the third argument is a positive smi less than the subject 3865 Register less = x11; local 3867 __ Mov(less, Smi::FromInt(LESS)); 3869 __ CmovX(result, less, lt); 3941 // Returns -1 (less), 0 (equal), or 1 (greater) tagged as a small integer.
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkTSearch.h | 34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is 39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument 55 if (less(*elem, key)) 62 if (less(*elem, key)) { 65 } else if (less(key, *elem)) { 71 // Adapts a less-than function to a functor.
|
/external/chromium_org/third_party/skia/src/gpu/gl/ |
H A D | GrGpuGL_program.cpp | 89 ProgDescLess less; local 90 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 620 int less = -1; local 624 while (&span[less + 1] - fTs.begin() > 0 && AlmostEqualUlps(span[less].fPt, pt)) { 626 double tInterval = newT - span[less].fT; 633 --less; 648 ++less; 650 while (more - 1 > less && span[more].fPt == span[more - 1].fPt 654 if (less == more) { 657 if (precisely_negative(span[more].fT - span[less].fT)) { 661 bool tiny = span[less] [all...] |