| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| basicblock.h | 18 // Our implementation of the code generator uses a "Less" operator to
23 class Less {
25 Less(const T& data,
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkPtrRecorder.cpp | 21 bool SkPtrSet::Less(const Pair& a, const Pair& b) {
34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
|
| SkPathHeap.h | 59 static bool Less(const LookupEntry& a, const LookupEntry& b) {
|
| SkBitmapHeap.cpp | 47 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a,
238 int index = SkTSearch<const LookupEntry, LookupEntry::Less>(
|
| /external/skia/src/core/ |
| SkPtrRecorder.cpp | 21 bool SkPtrSet::Less(const Pair& a, const Pair& b) {
34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
|
| SkPathHeap.h | 59 static bool Less(const LookupEntry& a, const LookupEntry& b) {
|
| SkBitmapHeap.cpp | 47 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a,
238 int index = SkTSearch<const LookupEntry, LookupEntry::Less>(
|
| /external/chromium_org/third_party/WebKit/Source/wtf/unicode/ |
| Collator.h | 45 enum Result { Equal = 0, Greater = 1, Less = -1 };
|
| /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
| bignum.h | 81 static bool Less(const Bignum& a, const Bignum& b) {
|
| /external/chromium_org/v8/src/ |
| bignum.h | 55 static bool Less(const Bignum& a, const Bignum& b) {
|
| /external/llvm/bindings/ocaml/target/ |
| llvm_target.ml | 19 | Less
|
| /external/llvm/include/llvm/Support/ |
| CodeGen.h | 47 Less, // -O1
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
| lp_bld_init.c | 95 * - 1: Less (-O1)
104 Less, // -O1
453 /* For simulating less capable machines */
|
| /external/clang/include/clang/Basic/ |
| ABI.h | 76 bool Less(const VirtualAdjustment &RHS) const {
99 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
144 bool Less(const VirtualAdjustment &RHS) const {
167 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
|
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_init.c | 95 * - 1: Less (-O1)
104 Less, // -O1
453 /* For simulating less capable machines */
|
| /external/chromium_org/gpu/command_buffer/service/ |
| buffer_manager.h | 84 // A less functor provided for std::map so it can find ranges.
85 struct Less {
167 typedef std::map<Range, GLuint, Range::Less> RangeToMaxValueMap;
|
| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGLProgramDesc.h | 101 static bool Less(const GrGLProgramDesc& a, const GrGLProgramDesc& b) {
|
| /external/skia/src/gpu/gl/ |
| GrGLProgramDesc.h | 102 static bool Less(const GrGLProgramDesc& a, const GrGLProgramDesc& b) {
|
| /external/llvm/include/llvm/MC/MCParser/ |
| MCAsmLexer.h | 51 Less, LessEqual, LessLess, LessGreater,
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| 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/openfst/src/include/fst/ |
| 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/llvm/utils/TableGen/ |
| CodeGenRegisters.h | 59 struct Less {
68 typedef std::map<CodeGenSubRegIndex*, CodeGenSubRegIndex*, Less> CompMap;
119 CodeGenSubRegIndex::Less> SubRegMap;
173 // less than RegBank.getNumTopoSigs(). Registers with the same TopoSig have
209 struct Less {
218 typedef std::set<const CodeGenRegister*, Less> Set;
|
| /external/skia/tests/ |
| PathOpsSkpClipTest.cpp | [all...] |
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsSkpClipTest.cpp | 690 bool Less(const SortByName& a, const SortByName& b);
691 bool Less(const SortByName& a, const SortByName& b) {
720 int idx = SkTSearch<SortByName, Less>(sorted[0].begin(), count, &name, sizeof(&name));
924 if (SkTSearch<SortByName, Less>(sorted.get()[dirNo - firstDirNo].begin(),
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.apache.lucene_1.9.1.v20100518-1140.jar | |
