OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:NodePtr
(Results
1 - 8
of
8
) sorted by null
/system/core/include/sysutils/
List.h
74
typedef _Node const *
NodePtr
;
80
typedef _Node*
NodePtr
;
90
typedef typename Constness<U>::
NodePtr
_NodePtr;
/system/core/include/utils/
List.h
73
typedef _Node const *
NodePtr
;
79
typedef _Node*
NodePtr
;
89
typedef typename Constness<U>::
NodePtr
_NodePtr;
/system/keymaster/
List.h
73
typedef _Node const *
NodePtr
;
79
typedef _Node*
NodePtr
;
89
typedef typename Constness<U>::
NodePtr
_NodePtr;
/external/llvm/include/llvm/ADT/
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
);
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
...]
/external/opencv3/modules/flann/include/opencv2/flann/
hierarchical_clustering_index.h
388
root = new
NodePtr
[trees_];
523
root = new
NodePtr
[trees_];
563
NodePtr
node = branch.node;
606
typedef Node*
NodePtr
;
613
typedef BranchStruct<
NodePtr
, DistanceType> BranchSt;
617
void save_tree(FILE* stream,
NodePtr
node, int num)
632
void load_tree(FILE* stream,
NodePtr
& node, int num)
642
node->childs = pool.allocate<
NodePtr
>(branching_);
681
void computeClustering(
NodePtr
node, int* dsindices, int indices_length, int branching, int level)
711
node->childs = pool.allocate<
NodePtr
>(branching)
[
all
...]
kdtree_index.h
92
tree_roots_ = new
NodePtr
[trees_];
156
tree_roots_ = new
NodePtr
[trees_];
236
typedef Node*
NodePtr
;
237
typedef BranchStruct<
NodePtr
, DistanceType> BranchSt;
242
void save_tree(FILE* stream,
NodePtr
tree)
254
void load_tree(FILE* stream,
NodePtr
& tree)
276
NodePtr
divideTree(int* ind, int count)
278
NodePtr
node = pool_.allocate<Node>(); // allocate memory
467
void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec,
NodePtr
node, DistanceType mindist, int& checkCount, int maxCheck,
495
NodePtr
bestChild = (diff < 0) ? node->child1 : node->child2
[
all
...]
kdtree_single_index.h
273
typedef Node*
NodePtr
;
283
typedef BranchStruct<
NodePtr
, DistanceType> BranchSt;
289
void save_tree(FILE* stream,
NodePtr
tree)
301
void load_tree(FILE* stream,
NodePtr
& tree)
339
NodePtr
divideTree(int left, int right, BoundingBox& bbox)
341
NodePtr
node = pool_.allocate<Node>(); // allocate memory
542
void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, const
NodePtr
node, DistanceType mindistsq,
564
NodePtr
bestChild;
565
NodePtr
otherChild;
616
NodePtr
root_node_
[
all
...]
Completed in 232 milliseconds