/external/marisa-trie/lib/marisa/ |
rank.h | 8 class Rank { 10 Rank() : abs_(0), rel_lo_(0), rel_hi_(0) {}
|
bitvector.h | 4 #include "rank.h" 86 Vector<Rank> ranks_;
|
bitvector.cc | 160 Vector<Rank> ranks; 344 const Rank &rank = ranks_[i / 512]; local 345 UInt32 offset = rank.abs(); 348 offset += rank.rel1(); 352 offset += rank.rel2(); 356 offset += rank.rel3(); 360 offset += rank.rel4(); 364 offset += rank.rel5(); 368 offset += rank.rel6() 413 const Rank &rank = ranks_[rank_id]; local 497 const Rank &rank = ranks_[rank_id]; local [all...] |
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
rank.h | 8 class Rank { 10 Rank() : abs_(0), rel_lo_(0), rel_hi_(0) {}
|
bitvector.h | 4 #include "rank.h" 86 Vector<Rank> ranks_;
|
bitvector.cc | 160 Vector<Rank> ranks; 344 const Rank &rank = ranks_[i / 512]; local 345 UInt32 offset = rank.abs(); 348 offset += rank.rel1(); 352 offset += rank.rel2(); 356 offset += rank.rel3(); 360 offset += rank.rel4(); 364 offset += rank.rel5(); 368 offset += rank.rel6() 414 const Rank &rank = ranks_[rank_id]; local 499 const Rank &rank = ranks_[rank_id]; local [all...] |
/external/llvm/lib/Transforms/Scalar/ |
Reassociate.cpp | 15 // In the implementation of this algorithm, constants are assigned rank = 0, 16 // function arguments are rank = 1, and other values are assigned ranks 18 // (starting at 2), which effectively gives values in deep loops higher rank 52 unsigned Rank; 54 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {} 57 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start. 71 dbgs() << ", #" << Ops[i].Rank << "] "; 136 // Sort the XorOpnd-Pointer in ascending order of symbolic-value-rank [all...] |
/external/marisa-trie/tests/ |
unit-test.cc | 6 #include <marisa/rank.h> 85 marisa::Rank rank; local 87 ASSERT(rank.abs() == 0); 88 ASSERT(rank.rel1() == 0); 89 ASSERT(rank.rel2() == 0); 90 ASSERT(rank.rel3() == 0); 91 ASSERT(rank.rel4() == 0); 92 ASSERT(rank.rel5() == 0); 93 ASSERT(rank.rel6() == 0) [all...] |
/external/marisa-trie/v0_1_5/tests/ |
unit-test.cc | 6 #include <marisa_alpha/rank.h> 87 marisa_alpha::Rank rank; local 89 ASSERT(rank.abs() == 0); 90 ASSERT(rank.rel1() == 0); 91 ASSERT(rank.rel2() == 0); 92 ASSERT(rank.rel3() == 0); 93 ASSERT(rank.rel4() == 0); 94 ASSERT(rank.rel5() == 0); 95 ASSERT(rank.rel6() == 0) [all...] |
/external/clang/lib/Sema/ |
SemaOverload.cpp | 136 /// GetConversionRank - Retrieve the implicit conversion rank 140 Rank[(int)ICK_Num_Conversion_Kinds] = { 166 return Rank[(int)Kind]; 219 /// getRank - Retrieve the rank of this standard conversion sequence 220 /// (C++ 13.3.3.1.1p3). The rank is the largest rank of each of the 223 ImplicitConversionRank Rank = ICR_Exact_Match; 224 if (GetConversionRank(First) > Rank) 225 Rank = GetConversionRank(First); 226 if (GetConversionRank(Second) > Rank) [all...] |