HomeSort by relevance Sort by last modified time
    Searched refs:Less (Results 1 - 25 of 31) sorted by null

1 2

  /external/webkit/Source/JavaScriptCore/wtf/unicode/
CollatorDefault.cpp 65 return (*lhs > *rhs) ? Greater : Less;
70 return (lhsLength > rhsLength) ? Greater : Less;
Collator.h 46 enum Result { Equal = 0, Greater = 1, Less = -1 };
  /external/llvm/include/llvm/Support/
CodeGen.h 44 Less, // -O1
  /external/clang/include/clang/Tooling/
Refactoring.h 87 class Less {
106 typedef std::set<Replacement, Replacement::Less> Replacements;
  /external/llvm/utils/TableGen/
SequenceToOffsetTable.h 33 /// @tparam Less A stable comparator for SeqT elements.
34 template<typename SeqT, typename Less = std::less<typename SeqT::value_type> >
41 Less L;
CodeGenRegisters.h 53 struct Less {
62 typedef std::map<CodeGenSubRegIndex*, CodeGenSubRegIndex*, Less> CompMap;
103 CodeGenSubRegIndex::Less> SubRegMap;
157 // less than RegBank.getNumTopoSigs(). Registers with the same TopoSig have
193 struct Less {
202 typedef std::set<const CodeGenRegister*, Less> Set;
CodeGenRegisters.cpp 845 CodeGenRegister::Less());
    [all...]
  /external/llvm/include/llvm/MC/MCParser/
MCAsmLexer.h 49 Less, LessEqual, LessLess, LessGreater,
  /external/v8/src/
bignum.h 78 static bool Less(const Bignum& a, const Bignum& b) {
bignum-dtoa.cc 191 // If the remainder of the division is less than the distance to the lower
200 in_delta_room_minus = Bignum::Less(*numerator, *delta_minus);
224 // Remaining digits are less than .5. -> Round down (== do nothing).
379 // The computed number undershoots by less than 0.631 (when we compute log3
  /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/llvm/lib/Target/
TargetMachineC.cpp 108 OL = CodeGenOpt::Less;
  /frameworks/compile/libbcc/lib/AndroidBitcode/
ABCCompilerDriver.cpp 72 mCompilerConfig->setOptimizationLevel(llvm::CodeGenOpt::Less);
  /system/core/libcutils/tests/memset_mips/
memset_omips.S 38 slti t1, a2, 8 # Less than 8?
  /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/clang/lib/Tooling/
Refactoring.cpp 82 bool Replacement::Less::operator()(const Replacement &R1,
  /frameworks/compile/libbcc/tools/bcc_compat/
Main.cpp 199 case '1': config->setOptimizationLevel(llvm::CodeGenOpt::Less); break;
  /external/llvm/tools/llc/
llc.cpp 254 case '1': OLvl = CodeGenOpt::Less; break;
  /external/jmonkeyengine/engine/src/core/com/jme3/material/
RenderState.java 98 * The test succeeds if the input value is less than the reference value.
100 Less,
102 * The test succeeds if the input value is less than or equal to
518 * The input pixel's depth value must be less than or equal than
    [all...]
  /external/llvm/tools/lli/
lli.cpp 368 case '1': OLvl = CodeGenOpt::Less; break;
  /external/llvm/tools/llvm-mc/
llvm-mc.cpp 297 case AsmToken::Less: Out->os() << "Less"; break;
  /frameworks/compile/libbcc/tools/bcc/
Main.cpp 205 case '1': config->setOptimizationLevel(llvm::CodeGenOpt::Less); break;
  /external/chromium/testing/gmock/include/gmock/
gmock-spec-builders.h 515 class Less {
522 typedef ::std::set<Expectation, Less> Set;
    [all...]
  /external/v8/test/cctest/
test-bignum.cc     [all...]
  /external/llvm/tools/opt/
opt.cpp 517 return CodeGenOpt::Less;

Completed in 459 milliseconds

1 2