Searched refs:NodePtr (Results 1 – 4 of 4) sorted by relevance
| /OK3568_Linux_fs/external/xserver/dix/ |
| H A D | atom.c | 66 } NodeRec, *NodePtr; typedef
69 static NodePtr atomRoot = NULL;
71 static NodePtr *nodeTable;
76 NodePtr *np; in MakeAtom()
102 NodePtr nd; in MakeAtom()
118 NodePtr *table; in MakeAtom()
120 table = reallocarray(nodeTable, tableLength, 2 * sizeof(NodePtr)); in MakeAtom()
152 NodePtr node; in NameForAtom()
168 FreeAtom(NodePtr patom) in FreeAtom()
201 nodeTable = xallocarray(InitialTableSize, sizeof(NodePtr)); in InitAtoms()
|
| /OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/ |
| H A D | kdtree_index.h | 92 tree_roots_ = new NodePtr[trees_]; in dataset_()
161 tree_roots_ = new NodePtr[trees_]; in loadIndex()
241 typedef Node* NodePtr; typedef
242 typedef BranchStruct<NodePtr, DistanceType> BranchSt;
247 void save_tree(FILE* stream, NodePtr tree) in save_tree()
259 void load_tree(FILE* stream, NodePtr& tree) in load_tree()
281 NodePtr divideTree(int* ind, int count) in divideTree()
283 NodePtr node = pool_.allocate<Node>(); // allocate memory in divideTree()
472 …void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, NodePtr node, Distan… in searchLevel()
500 NodePtr bestChild = (diff < 0) ? node->child1 : node->child2; in searchLevel()
[all …]
|
| H A 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 …]
|
| H A D | kdtree_single_index.h | 274 typedef Node* NodePtr; typedef
284 typedef BranchStruct<NodePtr, DistanceType> BranchSt;
290 void save_tree(FILE* stream, NodePtr tree) in save_tree()
302 void load_tree(FILE* stream, NodePtr& tree) in load_tree()
340 NodePtr divideTree(int left, int right, BoundingBox& bbox) in divideTree()
342 NodePtr node = pool_.allocate<Node>(); // allocate memory in divideTree()
543 …void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, const NodePtr node, … in searchLevel()
565 NodePtr bestChild; in searchLevel()
566 NodePtr otherChild; in searchLevel()
617 NodePtr root_node_;
|