| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/spill_tree/ |
| H A D | spill_dual_tree_traverser_impl.hpp | 53 referenceNode, in Traverse() argument
66 (referenceNode.Parent() != NULL) && in Traverse()
67 (referenceNode.Parent()->Overlap()) && in Traverse()
110 Traverse(*queryNode.Left(), referenceNode); in Traverse()
120 Traverse(*queryNode.Right(), referenceNode); in Traverse()
126 if (Defeatist && referenceNode.Overlap()) in Traverse()
130 if (bestChild < referenceNode.NumChildren()) in Traverse()
153 st.Traverse(queryIndex, referenceNode); in Traverse()
237 if (Defeatist && referenceNode.Overlap()) in Traverse()
241 if (bestChild < referenceNode.NumChildren()) in Traverse()
[all …]
|
| H A D | spill_single_tree_traverser_impl.hpp | 49 referenceNode, in Traverse() argument
56 (referenceNode.Parent() != NULL) && in Traverse()
57 (referenceNode.Parent()->Overlap())) in Traverse()
59 Traverse(queryIndex, *referenceNode.Parent(), true); in Traverse()
61 else if (referenceNode.IsLeaf() || bruteForce) in Traverse()
68 if (Defeatist && referenceNode.Overlap()) in Traverse()
84 Traverse(queryIndex, *referenceNode.Left()); in Traverse()
91 Traverse(queryIndex, *referenceNode.Right()); in Traverse()
98 Traverse(queryIndex, *referenceNode.Right()); in Traverse()
104 Traverse(queryIndex, *referenceNode.Left()); in Traverse()
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/binary_space_tree/ |
| H A D | dual_tree_traverser_impl.hpp | 51 referenceNode) in Traverse() argument
72 if (queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
76 const size_t refEnd = referenceNode.Begin() + referenceNode.Count(); in Traverse()
91 numBaseCases += referenceNode.Count(); in Traverse()
104 Traverse(*queryNode.Left(), referenceNode); in Traverse()
114 Traverse(*queryNode.Right(), referenceNode); in Traverse()
135 Traverse(queryNode, *referenceNode.Left()); in Traverse()
144 Traverse(queryNode, *referenceNode.Right()); in Traverse()
152 Traverse(queryNode, *referenceNode.Right()); in Traverse()
161 Traverse(queryNode, *referenceNode.Left()); in Traverse()
[all …]
|
| H A D | single_tree_traverser_impl.hpp | 49 referenceNode) in Traverse() argument
52 if (referenceNode.IsLeaf()) in Traverse()
54 const size_t refEnd = referenceNode.Begin() + referenceNode.Count(); in Traverse()
55 for (size_t i = referenceNode.Begin(); i < refEnd; ++i) in Traverse()
61 if (referenceNode.Parent() == NULL) in Traverse()
63 const double rootScore = rule.Score(queryIndex, referenceNode); in Traverse()
73 double leftScore = rule.Score(queryIndex, *referenceNode.Left()); in Traverse()
79 Traverse(queryIndex, *referenceNode.Left()); in Traverse()
92 Traverse(queryIndex, *referenceNode.Right()); in Traverse()
111 Traverse(queryIndex, *referenceNode.Left()); in Traverse()
[all …]
|
| H A D | breadth_first_dual_tree_traverser_impl.hpp | 80 rootFrame.referenceNode = &referenceRoot; in Traverse()
115 BinarySpaceTree& referenceNode = *currentFrame.referenceNode; in Traverse() local
120 double score = rule.Score(queryNode, referenceNode); in Traverse()
130 if (queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
134 const size_t refEnd = referenceNode.Begin() + referenceNode.Count(); in Traverse()
145 for (size_t ref = referenceNode.Begin(); ref < refEnd; ++ref) in Traverse()
148 numBaseCases += referenceNode.Count(); in Traverse()
151 else if ((!queryNode.IsLeaf()) && referenceNode.IsLeaf()) in Traverse()
162 else if (queryNode.IsLeaf() && (!referenceNode.IsLeaf())) in Traverse()
181 QueueFrameType fll = { queryNode.Left(), referenceNode.Left(), in Traverse()
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/range_search/ |
| H A D | range_search_rules_impl.hpp | 93 (referenceNode.Parent() != NULL) && in Score()
94 (referenceNode.Point(0) == referenceNode.Parent()->Point(0))) in Score()
100 lastReferenceIndex = referenceNode.Point(0); in Score()
113 referenceNode.Stat().LastDistance() = baseCase; in Score()
129 AddResult(queryIndex, referenceNode); in Score()
168 lastReferenceIndex = referenceNode.Point(0); in Score()
177 - referenceNode.FurthestDescendantDistance(); in Score()
179 + referenceNode.FurthestDescendantDistance(); in Score()
207 traversalInfo.LastReferenceNode() = &referenceNode; in Score()
251 (queryIndex == referenceNode.Descendant(i))) in AddResult()
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/octree/ |
| H A D | dual_tree_traverser_impl.hpp | 37 Traverse(Octree& queryNode, Octree& referenceNode) in Traverse() argument
57 if (queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
65 const double score = rule.Score(q, referenceNode); in Traverse()
72 const size_t rBegin = referenceNode.Point(0); in Traverse()
77 numBaseCases += referenceNode.NumPoints(); in Traverse()
80 else if (!queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
93 Traverse(queryNode.Child(i), referenceNode); in Traverse()
100 arma::vec scores(referenceNode.NumChildren()); in Traverse()
102 tis(referenceNode.NumChildren()); in Traverse()
130 arma::vec scores(referenceNode.NumChildren()); in Traverse()
[all …]
|
| H A D | single_tree_traverser_impl.hpp | 34 Traverse(const size_t queryIndex, Octree& referenceNode) in Traverse() argument
37 if (referenceNode.NumChildren() == 0) in Traverse()
39 const size_t refBegin = referenceNode.Point(0); in Traverse()
40 const size_t refEnd = refBegin + referenceNode.NumPoints(); in Traverse()
47 if (referenceNode.Parent() == NULL) in Traverse()
49 const double rootScore = rule.Score(queryIndex, referenceNode); in Traverse()
60 arma::vec scores(referenceNode.NumChildren()); in Traverse()
62 scores[i] = rule.Score(queryIndex, referenceNode.Child(i)); in Traverse()
77 Traverse(queryIndex, referenceNode.Child(sortedIndices[i])); in Traverse()
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/kmeans/ |
| H A D | pelleg_moore_kmeans_rules_impl.hpp | 52 TreeType& referenceNode) in Score() argument
57 if (referenceNode.Parent() == NULL || in Score()
61 referenceNode.Stat().Blacklist() = in Score()
62 referenceNode.Parent()->Stat().Blacklist(); in Score()
68 arma::accu(referenceNode.Stat().Blacklist()); in Score()
77 if (referenceNode.Stat().Blacklist()[i] == 0) in Score()
106 cornerPoint(d) = referenceNode.Bound()[d].Hi(); in Score()
121 referenceNode.Stat().Blacklist()[c] = 1; in Score()
131 referenceNode.Stat().Centroid(); in Score()
143 if (referenceNode.Stat().Blacklist()[c] == 1) in Score()
[all …]
|
| H A D | dual_tree_kmeans_rules_impl.hpp | 109 TreeType& referenceNode) in Score() argument
130 const double refParentDist = referenceNode.ParentDistance(); in Score()
190 if (traversalInfo.LastReferenceNode() == referenceNode.Parent()) in Score()
195 else if (traversalInfo.LastReferenceNode() == &referenceNode) in Score()
224 queryNode.MinDistance(referenceNode)); in Score()
228 queryNode.Stat().Pruned() += referenceNode.NumDescendants(); in Score()
270 oldFromNewCentroids[referenceNode.Descendant(0)] : in Score()
271 referenceNode.Descendant(0); in Score()
287 traversalInfo.LastReferenceNode() = &referenceNode; in Score()
306 TreeType& referenceNode, in Rescore() argument
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/ |
| H A D | greedy_single_tree_traverser_impl.hpp | 33 TreeType& referenceNode) in Traverse() argument
36 for (size_t i = 0; i < referenceNode.NumPoints(); ++i) in Traverse()
37 rule.BaseCase(queryIndex, referenceNode.Point(i)); in Traverse()
39 size_t bestChild = rule.GetBestChild(queryIndex, referenceNode); in Traverse()
44 if (!referenceNode.IsLeaf()) in Traverse()
45 numDescendants = referenceNode.Child(bestChild).NumDescendants(); in Traverse()
47 numDescendants = referenceNode.NumPoints(); in Traverse()
53 if (!referenceNode.IsLeaf()) in Traverse()
58 numPrunes += referenceNode.NumChildren() - 1; in Traverse()
60 Traverse(queryIndex, referenceNode.Child(bestChild)); in Traverse()
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/rann/ |
| H A D | ra_search_rules_impl.hpp | 146 TreeType& referenceNode) in Score() argument
150 &referenceNode); in Score()
159 TreeType& referenceNode, in Score() argument
173 TreeType& referenceNode, in Score() argument
202 if (!referenceNode.IsLeaf()) in Score()
269 TreeType& referenceNode, in Rescore() argument
306 if (!referenceNode.IsLeaf()) in Rescore()
363 TreeType& referenceNode) in Score() argument
400 TreeType& referenceNode, in Score() argument
439 TreeType& referenceNode, in Score() argument
[all …]
|
| H A D | ra_search_rules.hpp | 109 double Score(const size_t queryIndex, TreeType& referenceNode);
135 TreeType& referenceNode,
156 TreeType& referenceNode,
177 double Score(TreeType& queryNode, TreeType& referenceNode);
200 TreeType& referenceNode,
226 TreeType& referenceNode,
321 TreeType& referenceNode,
329 TreeType& referenceNode,
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/neighbor_search/sort_policies/ |
| H A D | furthest_neighbor_sort_impl.hpp | 22 const TreeType* referenceNode) in BestNodeToNodeDistance() argument
26 return queryNode->MaxDistance(*referenceNode); in BestNodeToNodeDistance()
32 const TreeType* referenceNode, in BestNodeToNodeDistance() argument
35 return queryNode->MaxDistance(*referenceNode, centerToCenterDistance); in BestNodeToNodeDistance()
41 const TreeType* referenceNode, in BestNodeToNodeDistance() argument
45 return queryNode->MaxDistance(*referenceNode, centerToCenterDistance) + in BestNodeToNodeDistance()
52 const TreeType* referenceNode) in BestPointToNodeDistance() argument
56 return referenceNode->MaxDistance(point); in BestPointToNodeDistance()
62 const TreeType* referenceNode, in BestPointToNodeDistance() argument
65 return referenceNode->MaxDistance(point, pointToCenterDistance); in BestPointToNodeDistance()
|
| H A D | nearest_neighbor_sort_impl.hpp | 22 const TreeType* referenceNode) in BestNodeToNodeDistance() argument
26 return queryNode->MinDistance(*referenceNode); in BestNodeToNodeDistance()
32 const TreeType* referenceNode, in BestNodeToNodeDistance() argument
35 return queryNode->MinDistance(*referenceNode, centerToCenterDistance); in BestNodeToNodeDistance()
52 const TreeType* referenceNode) in BestPointToNodeDistance() argument
56 return referenceNode->MinDistance(point); in BestPointToNodeDistance()
62 const TreeType* referenceNode, in BestPointToNodeDistance() argument
65 return referenceNode->MinDistance(point, pointToCenterDistance); in BestPointToNodeDistance()
|
| H A D | nearest_neighbor_sort.hpp | 55 const TreeType* referenceNode);
65 const TreeType* referenceNode,
82 const TreeType* referenceNode,
93 const TreeType* referenceNode);
103 const TreeType* referenceNode,
111 static size_t GetBestChild(const VecType& queryPoint, TreeType& referenceNode) in GetBestChild() argument
113 return referenceNode.GetNearestChild(queryPoint); in GetBestChild()
121 static size_t GetBestChild(const TreeType& queryNode, TreeType& referenceNode) in GetBestChild() argument
123 return referenceNode.GetNearestChild(queryNode); in GetBestChild()
|
| H A D | furthest_neighbor_sort.hpp | 51 const TreeType* referenceNode);
61 const TreeType* referenceNode,
78 const TreeType* referenceNode,
89 const TreeType* referenceNode);
99 const TreeType* referenceNode,
107 static size_t GetBestChild(const VecType& queryPoint, TreeType& referenceNode) in GetBestChild() argument
109 return referenceNode.GetFurthestChild(queryPoint); in GetBestChild()
117 static size_t GetBestChild(const TreeType& queryNode, TreeType& referenceNode) in GetBestChild() argument
119 return referenceNode.GetFurthestChild(queryNode); in GetBestChild()
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/rectangle_tree/ |
| H A D | dual_tree_traverser_impl.hpp | 67 if (queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
76 referenceNode); in Traverse()
81 for (size_t ref = 0; ref < referenceNode.Count(); ++ref) in Traverse()
84 numBaseCases += referenceNode.Count(); in Traverse()
87 else if (!queryNode.IsLeaf() && referenceNode.IsLeaf()) in Traverse()
96 Traverse(queryNode.Child(i), referenceNode); in Traverse()
101 else if (queryNode.IsLeaf() && !referenceNode.IsLeaf()) in Traverse()
108 for (size_t i = 0; i < referenceNode.NumChildren(); ++i) in Traverse()
111 nodesAndScores[i].node = &(referenceNode.Child(i)); in Traverse()
143 for (size_t i = 0; i < referenceNode.NumChildren(); ++i) in Traverse()
[all …]
|
| H A D | single_tree_traverser_impl.hpp | 50 const RectangleTree& referenceNode) in Traverse() argument
53 if (referenceNode.IsLeaf()) in Traverse()
55 for (size_t i = 0; i < referenceNode.Count(); ++i) in Traverse()
56 rule.BaseCase(queryIndex, referenceNode.Point(i)); in Traverse()
63 std::vector<NodeAndScore> nodesAndScores(referenceNode.NumChildren()); in Traverse()
64 for (size_t i = 0; i < referenceNode.NumChildren(); ++i) in Traverse()
66 nodesAndScores[i].node = &(referenceNode.Child(i)); in Traverse()
74 for (size_t i = 0; i < referenceNode.NumChildren(); ++i) in Traverse()
83 numPrunes += referenceNode.NumChildren() - i; in Traverse()
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/kde/ |
| H A D | kde_rules_impl.hpp | 113 depthAlpha = CalculateAlpha(&referenceNode); in Score()
138 referenceNode.Parent() != NULL && in Score()
139 referenceNode.Parent()->Point(0) == referenceNode.Point(0)) in Score()
263 if (referenceNode.IsLeaf()) in Score()
276 if (referenceNode.IsLeaf()) in Score()
319 depthAlpha = CalculateAlpha(&referenceNode); in Score()
339 lastReferenceIndex = referenceNode.Point(0); in Score()
591 referenceNode.Stat().AccumAlpha() = 0; in Score()
592 referenceNode.Stat().AccumError() = 0; in Score()
603 referenceNode.Stat().AccumAlpha() = 0; in Score()
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/neighbor_search/ |
| H A D | neighbor_search_rules_impl.hpp | 113 TreeType& referenceNode) in Score() argument
126 if ((referenceNode.Parent() != NULL) && in Score()
127 (referenceNode.Point(0) == referenceNode.Parent()->Point(0))) in Score()
133 referenceNode.Stat().LastDistance() = baseCase; in Score()
137 referenceNode.FurthestDescendantDistance()); in Score()
142 &referenceNode); in Score()
166 return SortPolicy::GetBestChild(queryNode, referenceNode); in GetBestChild()
191 TreeType& referenceNode) in Score() argument
318 referenceNode.FurthestDescendantDistance()); in Score()
321 lastReferenceIndex = referenceNode.Point(0); in Score()
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/fastmks/ |
| H A D | fastmks_rules_impl.hpp | 136 if (referenceNode.Parent() != NULL) in Score()
139 const double parentDist = referenceNode.ParentDistance(); in Score()
175 referenceNode.Parent() != NULL && in Score()
176 referenceNode.Point(0) == referenceNode.Parent()->Point(0)) in Score()
188 referenceNode.Center(refCenter); in Score()
193 referenceNode.Stat().LastKernel() = kernelEval; in Score()
236 const double refParentDist = referenceNode.ParentDistance(); in Score()
340 lastReferenceIndex = referenceNode.Point(0); in Score()
358 referenceNode.Center(refCenter); in Score()
394 referenceNode.Stat().SelfKernel(); in Score()
[all …]
|
| /dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/dom/ |
| H A D | NodeIterator.cpp | 163 void NodeIterator::updateForNodeRemoval(Node* removedNode, NodePointer& referenceNode) const in updateForNodeRemoval()
174 bool willRemoveReferenceNode = removedNode == referenceNode.node; in updateForNodeRemoval()
175 …bool willRemoveReferenceNodeAncestor = referenceNode.node && referenceNode.node->isDescendantOf(re… in updateForNodeRemoval()
179 if (referenceNode.isPointerBeforeNode) { in updateForNodeRemoval()
189 referenceNode.node = node; in updateForNodeRemoval()
203 referenceNode.node = node; in updateForNodeRemoval()
204 referenceNode.isPointerBeforeNode = false; in updateForNodeRemoval()
218 referenceNode.node = node; in updateForNodeRemoval()
228 referenceNode.node = node; in updateForNodeRemoval()
|
| /dports/graphics/opencollada/OpenCOLLADA-1.6.68/COLLADAMaya/src/ |
| H A D | COLLADAMayaReferenceManager.cpp | 93 MObject referenceNode = getReferenceNode ( filename ); in initialize() local
94 if ( referenceNode != MObject::kNullObj ) processReference ( referenceNode ); in initialize()
109 void ReferenceManager::processReference ( const MObject& referenceNode ) in processReference() argument
112 MFnDependencyNode referenceNodeFn ( referenceNode, &status ); in processReference()
119 reference->referenceNode = referenceNode; in processReference()
124 getRootObjects ( referenceNode, reference->paths, subReferences ); in processReference()
277 const MObject& referenceNode, in getRootObjects() argument
284 MFnDependencyNode referenceNodeFn(referenceNode); in getRootObjects()
363 bool isIn(const MDagPath & dagPath, const MObject & referenceNode) in isIn() argument
391 if (isIn(dagPath, referenceNode)) { in getTopLevelReferenceNode()
[all …]
|
| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/cover_tree/ |
| H A D | dual_tree_traverser_impl.hpp | 43 CoverTree& referenceNode) in Traverse() argument
50 rootRefEntry.referenceNode = &referenceNode; in Traverse()
53 rootRefEntry.score = rule.Score(queryNode, referenceNode); in Traverse()
55 referenceNode.Point()); in Traverse()
58 refMap[referenceNode.Scale()].push_back(rootRefEntry); in Traverse()
122 CoverTree* refNode = frame.referenceNode; in Traverse()
145 rule.BaseCase(queryNode.Point(), pointVector[i].referenceNode->Point()); in Traverse()
185 CoverTree* refNode = frame.referenceNode; in PruneMap()
238 CoverTree* refNode = frame.referenceNode; in PruneMap()
312 CoverTree* refNode = frame.referenceNode; in ReferenceRecursion()
[all …]
|