| /dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/rectangle_tree/ |
| H A D | hilbert_r_tree_descent_heuristic_impl.hpp | 26 size_t bestIndex = 0; in ChooseDescentNode() local
28 for (bestIndex = 0; bestIndex < node->NumChildren() - 1; bestIndex++) in ChooseDescentNode()
29 if (node->Child(bestIndex).AuxiliaryInfo().HilbertValue(). in ChooseDescentNode()
33 return bestIndex; in ChooseDescentNode()
41 size_t bestIndex = 0; in ChooseDescentNode() local
43 for (bestIndex = 0; bestIndex < node->NumChildren() - 1; bestIndex++) in ChooseDescentNode()
44 if (node->Child(bestIndex).AuxiliaryInfo().HilbertValue(). in ChooseDescentNode()
48 return bestIndex; in ChooseDescentNode()
|
| H A D | r_plus_tree_descent_heuristic_impl.hpp | 27 size_t bestIndex = 0; in ChooseDescentNode() local
31 for (bestIndex = 0; bestIndex < node->NumChildren(); bestIndex++) in ChooseDescentNode()
33 if (node->Child(bestIndex).Bound().Contains( in ChooseDescentNode()
35 return bestIndex; in ChooseDescentNode()
40 for (bestIndex = 0; bestIndex < node->NumChildren(); bestIndex++) in ChooseDescentNode()
43 node->Child(bestIndex).Bound(); in ChooseDescentNode()
50 if (j == bestIndex) in ChooseDescentNode()
90 assert(bestIndex < node->NumChildren()); in ChooseDescentNode()
92 return bestIndex; in ChooseDescentNode()
|
| H A D | r_plus_plus_tree_descent_heuristic_impl.hpp | 27 for (size_t bestIndex = 0; bestIndex < node->NumChildren(); bestIndex++) in ChooseDescentNode() local
29 if (node->Child(bestIndex).AuxiliaryInfo().OuterBound().Contains( in ChooseDescentNode()
31 return bestIndex; in ChooseDescentNode()
|
| H A D | r_star_tree_descent_heuristic_impl.hpp | 36 size_t bestIndex = 0; in ChooseDescentNode() local
75 bestIndex = i; in ChooseDescentNode()
84 return bestIndex; in ChooseDescentNode()
98 size_t bestIndex = 0; in ChooseDescentNode() local
125 bestIndex = i; in ChooseDescentNode()
138 bestIndex = 0; in ChooseDescentNode()
152 return bestIndex; in ChooseDescentNode()
173 size_t bestIndex = 0; in ChooseDescentNode() local
199 bestIndex = i; in ChooseDescentNode()
211 bestIndex = 0; in ChooseDescentNode()
[all …]
|
| H A D | r_tree_descent_heuristic_impl.hpp | 29 int bestIndex = 0; in ChooseDescentNode() local
52 bestIndex = i; in ChooseDescentNode()
57 bestIndex = i; in ChooseDescentNode()
61 return bestIndex; in ChooseDescentNode()
73 int bestIndex = 0; in ChooseDescentNode() local
99 bestIndex = i; in ChooseDescentNode()
104 bestIndex = i; in ChooseDescentNode()
108 return bestIndex; in ChooseDescentNode()
|
| /dports/irc/smuxi/smuxi-1.1/lib/db4o-net/Db4objects.Db4o/Db4objects.Db4o/Internal/Fieldindex/ |
| H A D | FieldIndexProcessor.cs | 20 IIndexedNode bestIndex = SelectBestIndex(); in Run()
21 if (null == bestIndex) in Run()
25 if (bestIndex.ResultSize() > 0) in Run()
27 IIndexedNode resolved = ResolveFully(bestIndex); in Run()
38 private IIndexedNode ResolveFully(IIndexedNode bestIndex) in ResolveFully() argument
40 if (null == bestIndex) in ResolveFully()
44 if (bestIndex.IsResolved()) in ResolveFully()
46 return bestIndex; in ResolveFully()
48 return ResolveFully(bestIndex.Resolve()); in ResolveFully()
|
| /dports/editors/ted/Ted-2.23/docFont/ |
| H A D | utilMatchFont.c | 286 int bestIndex; in docFontFindLegacyEncodings() local
306 bestCount= 0; bestIndex= -1; in docFontFindLegacyEncodings()
324 bestIndex= csIdx; in docFontFindLegacyEncodings()
329 if ( bestIndex > 0 ) in docFontFindLegacyEncodings()
334 { bestIndex= 0; } in docFontFindLegacyEncodings()
338 while( bestIndex >= 0 ) in docFontFindLegacyEncodings()
344 isUsed[bestIndex]= 1; in docFontFindLegacyEncodings()
346 bestCount= 0; bestIndex= -1; in docFontFindLegacyEncodings()
360 bestIndex= csIdx; in docFontFindLegacyEncodings()
367 while( bestIndex >= 0 ) in docFontFindLegacyEncodings()
[all …]
|
| /dports/devel/R-cran-caret/caret/R/ |
| H A D | selection.R | 121 bestIndex <- which.min(x[,metric]) functionVar
122 perf <- x[bestIndex,metric] + (x[bestIndex,paste(metric, "SD", sep = "")])/sqrt(num)
126 bestIndex <- which.max(x[,metric])
127 perf <- x[bestIndex,metric] - (x[bestIndex,paste(metric, "SD", sep = "")])/sqrt(num)
|
| /dports/devel/love/love-11.3/src/libraries/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/devel/love08/love-0.8.0/src/libraries/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/devel/love10/love-0.10.2/src/libraries/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/games/emptyepsilon/SeriousProton-EE-2021.06.23/src/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/devel/upp/upp/uppsrc/plugin/box2d/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| H A D | b2PolygonShape.h | 93 int32 bestIndex = 0; in GetSupport() local
100 bestIndex = i; in GetSupport()
105 return bestIndex; in GetSupport()
110 int32 bestIndex = 0; in GetSupportVertex() local
117 bestIndex = i; in GetSupportVertex()
122 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Box2D/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/graphics/py-box2d-py/box2d-py-2.3.8/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/devel/emscripten/emscripten-2.0.3/tests/third_party/box2d/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/games/openclaw/OpenClaw-0.0-51-gbac7730/ThirdParty/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/games/openclaw/OpenClaw-0.0-51-gbac7730/Box2D/Box2D_Install/include/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/games/openclaw/OpenClaw-0.0-51-gbac7730/Box2D/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/x11-toolkits/qml-box2d/qml-box2d-21e57f/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/games/kolf/kolf-21.12.3/external/Box2D/Collision/ |
| H A D | b2Distance.h | 109 int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/devel/juce/JUCE-f37e9a1/modules/juce_box2d/box2d/Collision/ |
| H A D | b2Distance.h | 109 juce::int32 bestIndex = 0; in GetSupport() local
116 bestIndex = i; in GetSupport()
121 return bestIndex; in GetSupport()
126 juce::int32 bestIndex = 0; in GetSupportVertex() local
133 bestIndex = i; in GetSupportVertex()
138 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/misc/box2d/box2d-2.4.1/include/box2d/ |
| H A D | b2_distance.h | 139 int32 bestIndex = 0; in GetSupport() local
146 bestIndex = i; in GetSupport()
151 return bestIndex; in GetSupport()
156 int32 bestIndex = 0; in GetSupportVertex() local
163 bestIndex = i; in GetSupportVertex()
168 return m_vertices[bestIndex]; in GetSupportVertex()
|
| /dports/games/zdoom/zdoom-2.8.1/src/ |
| H A D | SkylineBinPack.cpp | 268 int bestIndex; in InsertBottomLeft() local
269 Rect newNode = FindPositionForNewNodeBottomLeft(width, height, bestHeight, bestWidth, bestIndex); in InsertBottomLeft()
271 if (bestIndex != -1) in InsertBottomLeft()
277 AddSkylineLevel(bestIndex, newNode); in InsertBottomLeft()
293 bestIndex = -1; in FindPositionForNewNodeBottomLeft()
305 bestIndex = i; in FindPositionForNewNodeBottomLeft()
339 int bestIndex; in InsertMinWaste() local
342 if (bestIndex != -1) in InsertMinWaste()
348 AddSkylineLevel(bestIndex, newNode); in InsertMinWaste()
365 bestIndex = -1; in FindPositionForNewNodeMinWaste()
[all …]
|