Home
last modified time | relevance | path

Searched refs:Index1 (Results 1 – 4 of 4) sorted by relevance

/external/eigen/unsupported/Eigen/src/BVH/
DBVAlgorithms.h95 typedef typename BVH1::Index Index1; in BVIntersect() typedef
109 …std::vector<std::pair<Index1, Index2> > todo(1, std::make_pair(tree1.getRootIndex(), tree2.getRoot… in BVIntersect()
238 typedef typename BVH1::Index Index1; in BVMinimize() typedef
242 typedef std::pair<Scalar, std::pair<Index1, Index2> > QueueElement; //first element is priority in BVMinimize()
/external/llvm/lib/Option/
DArgList.cpp368 unsigned Index1 = MakeIndex(String1); in MakeIndex() local
369 assert(Index0 + 1 == Index1 && "Unexpected non-consecutive indices!"); in MakeIndex()
370 (void) Index1; in MakeIndex()
/external/llvm/lib/Analysis/
DCFLAliasAnalysis.cpp259 StratifiedIndex Index1, in getIndexRelation() argument
261 if (Index1 == Index2) in getIndexRelation()
264 const auto *Current = &Sets.getLink(Index1); in getIndexRelation()
271 Current = &Sets.getLink(Index1); in getIndexRelation()
/external/clang/lib/AST/
DASTImporter.cpp1008 if (Optional<unsigned> Index1 = findAnonymousStructOrUnionIndex(D1)) { in IsStructurallyEquivalent() local
1010 if (*Index1 != *Index2) in IsStructurallyEquivalent()
2588 if (Optional<unsigned> Index1 in VisitRecordDecl() local
2592 if (*Index1 != *Index2) in VisitRecordDecl()