| /external/chromium_org/content/browser/ |
| storage_partition_impl_map_unittest.cc | 14 // Test that the Less comparison function is implemented properly to uniquely
32 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))
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| 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, greater)
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/ |
| canonical.cpp | 36 struct less struct in namespace:std
42 typedef __map_value_compare<int, short, less> __vc;
|
| /external/chromium_org/third_party/re2/util/ |
| sparse_set.h | 165 // sort(arr.begin(), arr.end(), arr.less);
166 static bool less(int a, int b) { return a < b; } function in class:re2::SparseSet
|
| sparse_array.h | 156 // 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/eigen/unsupported/Eigen/src/Polynomials/ |
| 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/openfst/src/include/fst/ |
| 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(Times(idistance[s], arc.weight)
[all...] |
| queue.h | 272 // Given a vector that maps from states to weights and a Less
278 typedef L Less;
282 StateWeightCompare(const vector<Weight>& weights, const L &less)
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;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| 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/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGpuGL_program.cpp | 35 return GrGLProgramDesc::Less(desc, entry->fProgram->getDesc());
40 return GrGLProgramDesc::Less(entry->fProgram->getDesc(), desc);
89 ProgDescLess less; local
90 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
184 SkASSERT(GrGLProgramDesc::Less(a, b));
185 SkASSERT(!GrGLProgramDesc::Less(b, a));
|
| /external/chromium_org/tools/traceline/traceline/ |
| assembler.h | 79 less = 12, enumerator in enum:Condition
|
| /external/mesa3d/src/glsl/ |
| 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/TableGen/ |
| TGLexer.h | 39 less, greater, // < > enumerator in enum:llvm::tgtok::TokKind
|
| /art/compiler/optimizing/ |
| code_generator_arm.cc | 1055 Label less, greater, done; local
[all...] |
| code_generator_x86.cc | 1016 Label less, greater, done; local
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| 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].fPt == span[more].fPt
[all...] |
| /external/llvm/lib/AsmParser/ |
| LLToken.h | 29 less, greater, // < > enumerator in enum:llvm::lltok::Kind
|
| /external/chromium_org/v8/src/arm64/ |
| code-stubs-arm64.cc | 176 // Exponents less than this should have been handled by the Fcvt case.
247 __ Mov(result, LESS);
255 __ Mov(result, GREATER); // Things aren't less than themselves.
257 __ Mov(result, LESS); // Things aren't greater than themselves.
279 __ Mov(result, LESS);
535 STATIC_ASSERT((LESS == -1) && (EQUAL == 0) && (GREATER == 1));
548 __ Mov(result, LESS);
636 ncr = LESS;
642 // Call the native; it returns -1 (less), 0 (equal), or 1 (greater)
3865 Register less = x11; local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.p2.metadata_2.0.0.v20100601.jar | |
| org.eclipse.ui.ide_3.6.2.M20101117-0800.jar | |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| pdfjs.js | [all...] |
