Home
last modified time | relevance | path

Searched refs:branching (Results 1 – 25 of 32) sorted by relevance

12

/external/opencv3/modules/flann/include/opencv2/flann/
Dkmeans_index.h57 KMeansIndexParams(int branching = 32, int iterations = 11,
62 (*this)["branching"] = branching;
282 , branching(_branching) in KMeansDistanceComputer()
303 for (int j=1; j<branching; ++j) { in operator()
327 const int branching; variable
714 …void computeClustering(KMeansNodePtr node, int* indices, int indices_length, int branching, int le… in computeClustering() argument
719 if (indices_length < branching) { in computeClustering()
726 cv::AutoBuffer<int> centers_idx_buf(branching); in computeClustering()
729 (this->*chooseCenters)(branching, indices, indices_length, centers_idx, centers_length); in computeClustering()
731 if (centers_length<branching) { in computeClustering()
[all …]
Dhierarchical_clustering_index.h56 HierarchicalClusteringIndexParams(int branching = 32,
62 (*this)["branching"] = branching;
681 … void computeClustering(NodePtr node, int* dsindices, int indices_length, int branching, int level) in computeClustering() argument
693 std::vector<int> centers(branching); in computeClustering()
697 (this->*chooseCenters)(branching, dsindices, indices_length, &centers[0], centers_length); in computeClustering()
699 if (centers_length<branching) { in computeClustering()
711 node->childs = pool.allocate<NodePtr>(branching); in computeClustering()
714 for (int i=0; i<branching; ++i) { in computeClustering()
726 computeClustering(node->childs[i],dsindices+start, end-start, branching, level+1); in computeClustering()
Dminiflann.hpp91 CompositeIndexParams(int trees = 4, int branching = 32, int iterations = 11,
103 HierarchicalClusteringIndexParams(int branching = 32,
109 KMeansIndexParams(int branching = 32, int iterations = 11,
Dcomposite_index.h47 CompositeIndexParams(int trees = 4, int branching = 32, int iterations = 11,
54 (*this)["branching"] = branching;
/external/llvm/test/CodeGen/X86/
Dswitch-default-only.ll3 ; No need for branching when the default and only destination follows
Dx32-function_pointer-3.ll20 ; register. We need to zero-extend %edi to %rdi before branching via %rdi.
Dloop-blocks.ll3 ; These tests check for loop branching structure, and that the loop align
Dtail-opts.ll61 ; redundant branching.
Dblock-placement.ll520 ; even though the probability of 'then' branching to the 'exit' block is very
/external/opencv3/modules/flann/src/
Dminiflann.cpp212 CompositeIndexParams::CompositeIndexParams(int trees, int branching, int iterations, in CompositeIndexParams() argument
220 p["branching"] = branching; in CompositeIndexParams()
245 KMeansIndexParams::KMeansIndexParams(int branching, int iterations, in KMeansIndexParams() argument
251 p["branching"] = branching; in KMeansIndexParams()
260 HierarchicalClusteringIndexParams::HierarchicalClusteringIndexParams(int branching , in HierarchicalClusteringIndexParams() argument
267 p["branching"] = branching; in HierarchicalClusteringIndexParams()
/external/llvm/test/Transforms/SimplifyCFG/
Dswitch-to-select-multiple-edge-per-block-phi.ll12 ; branching multiple times to the same block
/external/llvm/docs/
DBlockFrequencyTerminology.rst47 The probability of branching from block A to block B is 7/15, and the
48 probability of branching from block A to block C is 8/15.
DHowToReleaseLLVM.rst84 #. Remind developers that the release branching is imminent and to refrain from
/external/autotest/site_utils/autoupdate/
Drelease_config.ini5 # is closely related to the actual tree branching history, it may be that the
/external/llvm/test/CodeGen/ARM/
Dtail-opts.ll15 ; redundant branching.
/external/llvm/test/CodeGen/SystemZ/
Dstrcmp-02.ll47 ; branching.
Dstrcmp-01.ll46 ; branching.
Dmemcmp-02.ll105 ; an integer and for branching.
Dmemcmp-01.ll104 ; an integer and for branching.
Dint-cmp-48.ll7 ; Check a simple branching use of TM.
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/
DREADME.rst171 The boto project uses the `gitflow`_ model for branching.
207 .. _gitflow: http://nvie.com/posts/a-successful-git-branching-model/
/external/gemmlowp/meta/
DREADME56 This approach allowed moving all unnecessary branching and conditional execution
/external/libhevc/common/arm/
Dihevc_inter_pred_chroma_horz_w16out.s137 bne outer_loop_4 @ this branching happens when the width is 2 or 6
153 …beq outer_loop_ht_4 @this branching happens when the height is a a multiple of…
/external/mesa3d/src/glsl/
DREADME56 but it can support function calls and dynamic branching. A 965 vertex
/external/skia/site/dev/contrib/
Dsimd.md35 … usual comparison operators, and a `.thenElse()` method acting as a non-branching ternary `?:` ope…

12