Searched defs:less (Results 1 - 25 of 31) sorted by relevance

12

/external/chromium_org/content/browser/
H A Dstorage_partition_impl_map_unittest.cc32 StoragePartitionImplMap::StoragePartitionConfigLess less; local
35 EXPECT_TRUE(less(c1, c3));
36 EXPECT_TRUE(less(c1, c4));
37 EXPECT_TRUE(less(c3, c4));
38 EXPECT_TRUE(less(c4, c5));
39 EXPECT_TRUE(less(c4, c8));
40 EXPECT_TRUE(less(c6, c4));
41 EXPECT_TRUE(less(c6, c7));
42 EXPECT_TRUE(less(c8, c9));
45 EXPECT_FALSE(less(c
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Dcompare-objects.js49 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/clang/test/CXX/except/except.spec/
H A Dcanonical.cpp36 struct less struct in namespace:std
42 typedef __map_value_compare<int, short, less> __vc;
/external/chromium_org/third_party/re2/util/
H A Dsparse_set.h165 // sort(arr.begin(), arr.end(), arr.less);
166 static bool less(int a, int b) { return a < b; } function in class:re2::SparseSet
H A Dsparse_array.h156 // sort(arr.begin(), arr.end(), arr.less);
157 static bool less(const IndexValue& a, const IndexValue& b);
447 template<typename Value> bool SparseArray<Value>::less(const IndexValue& a, function in class:re2::SparseArray
/external/regex-re2/util/
H A Dsparse_set.h164 // sort(arr.begin(), arr.end(), arr.less);
165 static bool less(int a, int b) { return a < b; } function in class:re2::SparseSet
H A Dsparse_array.h156 // 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
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dprune.h89 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 Dqueue.h250 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/chromium_org/chrome/browser/safe_browsing/
H A Dsafe_browsing_store.cc16 bool sorted(CTI beg, CTI end, LESS less) { argument
19 if (less(*beg, *n))
104 // Scan prefixes forward until an item is not less than the current hash.
114 // If the current hash is also not less than the prefix, that implies they
144 // to qualify things. It becomes very arbitrary, though, and less
/external/chromium_org/third_party/skia/include/core/
H A DSkTSearch.h34 // 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/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialSolver.h111 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/skia/include/core/
H A DSkTSearch.h34 // 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/stlport/test/unit/
H A Dmvctor_declaration_test.cpp113 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 Dset_test.cpp58 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/chromium_org/third_party/skia/src/gpu/gl/
H A DGrGpuGL_program.cpp88 ProgDescLess less; local
89 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
/external/chromium_org/tools/traceline/traceline/
H A Dassembler.h79 less = 12, enumerator in enum:Condition
/external/skia/src/gpu/gl/
H A DGrGpuGL_program.cpp88 ProgDescLess less; local
89 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
/external/stlport/stlport/stl/
H A D_function_base.h70 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/chromium_org/third_party/mesa/src/src/glsl/
H A Dlower_variable_index_to_cond_assign.cpp303 ir_expression *less = local
307 ir_if *if_less = new(this->mem_ctx) ir_if(less);
/external/llvm/lib/TableGen/
H A DTGLexer.h39 less, greater, // < > enumerator in enum:llvm::tgtok::TokKind
/external/mesa3d/src/glsl/
H A Dlower_variable_index_to_cond_assign.cpp303 ir_expression *less = local
307 ir_if *if_less = new(this->mem_ctx) ir_if(less);
/external/stlport/stlport/stl/pointers/
H A D_set.h36 _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/chromium_org/third_party/skia/src/pathops/
H A DSkOpSegment.cpp616 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/src/pathops/
H A DSkOpSegment.cpp616 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...]

Completed in 2531 milliseconds

12