Searched refs:Rank (Results 1 – 15 of 15) sorted by relevance
| /external/marisa-trie/lib/marisa/ |
| D | rank.h | 8 class Rank {
10 Rank() : abs_(0), rel_lo_(0), rel_hi_(0) {} in Rank() function
|
| D | bitvector.cc | 160 Vector<Rank> ranks; in build()
344 const Rank &rank = ranks_[i / 512]; in rank1()
413 const Rank &rank = ranks_[rank_id]; in select0()
497 const Rank &rank = ranks_[rank_id]; in select1()
|
| D | bitvector.h | 86 Vector<Rank> ranks_;
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| D | rank.h | 8 class Rank {
10 Rank() : abs_(0), rel_lo_(0), rel_hi_(0) {} in Rank() function
|
| D | bitvector.cc | 160 Vector<Rank> ranks; in build()
344 const Rank &rank = ranks_[i / 512]; in rank1()
414 const Rank &rank = ranks_[rank_id]; in select0()
499 const Rank &rank = ranks_[rank_id]; in select1()
|
| D | bitvector.h | 86 Vector<Rank> ranks_;
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | Reassociate.cpp | 52 unsigned Rank; member
54 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {} in ValueEntry()
57 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start. in operator <()
71 dbgs() << ", #" << Ops[i].Rank << "] "; in PrintOps()
310 if (unsigned Rank = ValueRankMap[I]) in getRank() local
311 return Rank; // Rank already known? in getRank()
317 unsigned Rank = 0, MaxRank = RankMap[I->getParent()]; in getRank() local
319 i != e && Rank != MaxRank; ++i) in getRank()
320 Rank = std::max(Rank, getRank(I->getOperand(i))); in getRank()
326 ++Rank; in getRank()
[all …]
|
| /external/deqp/framework/platform/X11/ |
| D | tcuX11GlxPlatform.cpp | 450 class Rank class
453 Rank (void) : m_value(0), m_bitsLeft(64) {} in Rank() function in tcu::x11::glx::Rank
463 void Rank::add (size_t bits, deUint32 value) in add()
470 void Rank::sub (size_t bits, deUint32 value) in sub()
484 Rank rank; in configRank()
|
| /external/eigen/doc/ |
| D | TutorialLinearAlgebra.dox | 218 \section TutorialLinAlgRankRevealing Rank-revealing decompositions
225 Rank-revealing decompositions offer at least a rank() method. They can also offer convenience metho…
|
| D | TopicLinearAlgebraDecompositions.dox | 22 <th>Rank-revealing</th>
|
| D | QuickReference.dox | 643 Rank 1 and rank K update: \n
651 Rank 2 update: (\f$ M \mathrel{{+}{=}} s u v^* + s v u^* \f$)
|
| /external/marisa-trie/v0_1_5/tests/ |
| D | unit-test.cc | 87 marisa_alpha::Rank rank; in TestRank()
|
| /external/marisa-trie/tests/ |
| D | unit-test.cc | 85 marisa::Rank rank; in TestRank()
|
| /external/clang/lib/Sema/ |
| D | SemaOverload.cpp | 109 Rank[(int)ICK_Num_Conversion_Kinds] = { in GetConversionRank() local
135 return Rank[(int)Kind]; in GetConversionRank()
192 ImplicitConversionRank Rank = ICR_Exact_Match; in getRank() local
193 if (GetConversionRank(First) > Rank) in getRank()
194 Rank = GetConversionRank(First); in getRank()
195 if (GetConversionRank(Second) > Rank) in getRank()
196 Rank = GetConversionRank(Second); in getRank()
197 if (GetConversionRank(Third) > Rank) in getRank()
198 Rank = GetConversionRank(Third); in getRank()
199 return Rank; in getRank()
|
| /external/ceres-solver/docs/source/ |
| D | solving.rst | 2236 Rank of the Jacobian
|