| /external/opencv/cv/src/ |
| cvkdtree.cpp | 121 std::vector<int> inbounds; local
125 inbounds));
126 std::copy(inbounds.begin(),
127 inbounds.begin() + std::min((int)inbounds.size(), rn),
129 return inbounds.size();
|
| _cvkdtree.hpp | 431 std::vector < __valuetype > &inbounds) const {
437 find_ortho_range(n.left, bounds_min, bounds_max, inbounds);
439 find_ortho_range(n.right, bounds_min, bounds_max, inbounds);
442 inbounds.push_back(nodes[i].value);
447 // return all points that lie within the given bounds; inbounds is cleared
450 std::vector < __valuetype > &inbounds) const {
451 inbounds.clear();
452 find_ortho_range(root_node, bounds_min, bounds_max, inbounds);
453 return inbounds.size();
|
| /external/llvm/lib/Analysis/ |
| StratifiedSets.h | 121 assert(inbounds(Index));
129 bool inbounds(StratifiedIndex Idx) const { return Idx < Links.size(); } function in class:llvm::StratifiedSets
540 assert(inbounds(Idx1) && inbounds(Idx2));
561 assert(inbounds(Idx1) && inbounds(Idx2));
609 assert(inbounds(LowerIndex) && inbounds(UpperIndex));
689 bool inbounds(StratifiedIndex N) const { return N < Links.size(); }
|
| CFLAliasAnalysis.cpp | 606 bool inbounds(Node NodeIndex) const { return NodeIndex < NodeImpls.size(); } function in class:__anon14644::WeightedBidirectionalGraph
690 assert(inbounds(From));
691 assert(inbounds(To));
709 assert(inbounds(StartNode));
[all...] |
| /external/llvm/utils/vim/ |
| llvm.vim | 29 syn keyword llvmStatement icmp inbounds indirectbr insertelement insertvalue
|
| /external/llvm/lib/AsmParser/ |
| LLLexer.cpp | 552 KEYWORD(inbounds);
|
| /external/llvm/test/Bindings/OCaml/ |
| core.ml | [all...] |
| /prebuilts/tools/common/m2/repository/com/squareup/haha/haha/1.3/ |
| haha-1.3.jar | |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm.mli | [all...] |
