Searched refs:NodePtr (Results 1 – 6 of 6) sorted by relevance
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| D | kdtree_index.h | 92 tree_roots_ = new NodePtr[trees_]; in dataset_()
156 tree_roots_ = new NodePtr[trees_]; in loadIndex()
236 typedef Node* NodePtr; typedef
237 typedef BranchStruct<NodePtr, DistanceType> BranchSt;
242 void save_tree(FILE* stream, NodePtr tree) in save_tree()
254 void load_tree(FILE* stream, NodePtr& tree) in load_tree()
276 NodePtr divideTree(int* ind, int count) in divideTree()
278 NodePtr node = pool_.allocate<Node>(); // allocate memory in divideTree()
467 …void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, NodePtr node, Distan… in searchLevel()
495 NodePtr bestChild = (diff < 0) ? node->child1 : node->child2; in searchLevel()
[all …]
|
| D | hierarchical_clustering_index.h | 388 root = new NodePtr[trees_]; in dataset()
523 root = new NodePtr[trees_]; in loadIndex()
563 NodePtr node = branch.node; in findNeighbors()
606 typedef Node* NodePtr; typedef
613 typedef BranchStruct<NodePtr, DistanceType> BranchSt;
617 void save_tree(FILE* stream, NodePtr node, int num) in save_tree()
632 void load_tree(FILE* stream, NodePtr& node, int num) in load_tree()
642 node->childs = pool.allocate<NodePtr>(branching_); in load_tree()
681 … void computeClustering(NodePtr node, int* dsindices, int indices_length, int branching, int level) in computeClustering()
711 node->childs = pool.allocate<NodePtr>(branching); in computeClustering()
[all …]
|
| D | kdtree_single_index.h | 273 typedef Node* NodePtr; typedef
283 typedef BranchStruct<NodePtr, DistanceType> BranchSt;
289 void save_tree(FILE* stream, NodePtr tree) in save_tree()
301 void load_tree(FILE* stream, NodePtr& tree) in load_tree()
339 NodePtr divideTree(int left, int right, BoundingBox& bbox) in divideTree()
341 NodePtr node = pool_.allocate<Node>(); // allocate memory in divideTree()
542 …void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, const NodePtr node, … in searchLevel()
564 NodePtr bestChild; in searchLevel()
565 NodePtr otherChild; in searchLevel()
616 NodePtr root_node_;
|
| /external/llvm/include/llvm/ADT/ |
| D | ilist.h | 205 pointer NodePtr;
223 explicit ilist_iterator(pointer NP) : NodePtr(NP) {}
224 explicit ilist_iterator(reference NR) : NodePtr(&NR) {}
225 ilist_iterator() : NodePtr(nullptr) {}
231 : NodePtr(RHS.getNodePtrUnchecked()) {}
237 NodePtr = RHS.getNodePtrUnchecked();
241 void reset(pointer NP) { NodePtr = NP; }
245 return NodePtr;
249 return *NodePtr;
255 return NodePtr == RHS.getNodePtrUnchecked();
[all …]
|
| D | FoldingSet.h | 611 FoldingSetNode *NodePtr;
617 return NodePtr == RHS.NodePtr;
620 return NodePtr != RHS.NodePtr;
629 return *static_cast<T*>(NodePtr);
633 return static_cast<T*>(NodePtr);
|
| /external/llvm/lib/Support/ |
| D | FoldingSet.cpp | 419 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in FoldingSetIteratorImpl()
424 void *Probe = NodePtr->getNextInBucket(); in advance()
427 NodePtr = NextNodeInBucket; in advance()
438 NodePtr = static_cast<FoldingSetNode*>(*Bucket); in advance()
|