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

/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/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/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/skia/src/gpu/gl/
H A DGrGLGpuProgramCache.cpp89 ProgDescLess less; local
90 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
/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/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/util/
H A DUnicodePropertySymbolTable.java219 public enum Relation {less, leq, equal, geq, greater} enum constant in enum:UnicodePropertySymbolTable.Relation
235 case less: return comp < 0;
/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/openfst/src/include/fst/
H A Dprune.h135 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 Dqueue.h282 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/pdfium/third_party/bigint/
H A DBigInteger.hh26 less = BigUnsigned::less , member in class:BigInteger
107 bool operator < (const BigInteger &x) const { return compareTo(x) == less ; }
109 bool operator >=(const BigInteger &x) const { return compareTo(x) != less ; }
H A DBigUnsigned.hh23 enum CmpRes { less = -1, equal = 0, greater = 1 }; enumerator in enum:BigUnsigned::CmpRes
130 bool operator < (const BigUnsigned &x) const { return compareTo(x) == less ; }
132 bool operator >=(const BigUnsigned &x) const { return compareTo(x) != less ; }
158 * (3) Copy-less operations: `add', `subtract', etc.
250 * copy-less operations. The copy-less operations are responsible for making
/external/llvm/include/llvm/ADT/
H A DSTLExtras.h203 /// compares less than the first component of another std::pair.
211 /// compares less than the second component of another std::pair.
250 /// Adapt std::less<T> for array_pod_sort.
253 if (std::less<T>()(*reinterpret_cast<const T*>(P1),
256 if (std::less<T>()(*reinterpret_cast<const T*>(P2),
280 /// compared with std::less and can be moved with memcpy. If this isn't true,
284 /// default to std::less.
382 /// A functor like C++14's std::less<void> in its absence.
383 struct less { struct in namespace:llvm
/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/skia/src/gpu/
H A DGrResourceCache.cpp551 Less less; local
552 SkTQSort(fNonpurgeableResources.begin(), fNonpurgeableResources.end() - 1, less);
/external/llvm/lib/AsmParser/
H A DLLToken.h29 less, greater, // < > enumerator in enum:llvm::lltok::Kind
/external/v8/src/arm64/
H A Dcode-stubs-arm64.cc176 // 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/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.p2.metadata_2.0.0.v20100601.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.ui.ide_3.6.2.M20101117-0800.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 1923 milliseconds