Home
last modified time | relevance | path

Searched refs:leaves (Results 1 – 25 of 127) sorted by relevance

123456

/external/zopfli/src/zopfli/
Dkatajainen.c106 Node* leaves, int numsymbols, NodePool* pool, int index, char final) { in BoundaryPM() argument
123 InitNode(leaves[lastcount].weight, lastcount + 1, 0, newchain); in BoundaryPM()
126 if (lastcount < numsymbols && sum > leaves[lastcount].weight) { in BoundaryPM()
128 InitNode(leaves[lastcount].weight, lastcount + 1, oldchain->tail, in BoundaryPM()
134 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0); in BoundaryPM()
135 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0); in BoundaryPM()
146 NodePool* pool, const Node* leaves, int maxbits, Node* (*lists)[2]) { in InitLists() argument
150 InitNode(leaves[0].weight, 1, 0, node0); in InitLists()
151 InitNode(leaves[1].weight, 2, 0, node1); in InitLists()
163 static void ExtractBitLengths(Node* chain, Node* leaves, unsigned* bitlengths) { in ExtractBitLengths() argument
[all …]
/external/v8/test/mjsunit/compiler/
Dexpression-trees.js33 function makeTrees(op, leaves) { argument
34 var len = leaves.length;
37 return leaves;
44 var leftTrees = makeTrees(op, leaves.slice(0, i));
45 var rightTrees = makeTrees(op, leaves.slice(i, len));
/external/opencv3/modules/objdetect/src/
Dcascadedetect_convert.cpp105 std::vector<float> leaves; member
175 node.left = -(int)weak.leaves.size(); in convert()
176 weak.leaves.push_back((float)leftValNode); in convert()
185 node.right = -(int)weak.leaves.size(); in convert()
186 weak.leaves.push_back((float)rightValNode); in convert()
229 int nnodes = (int)c.nodes.size(), nleaves = (int)c.leaves.size(); in convert()
235 newfs << c.leaves[k]; in convert()
Dcascadedetect.hpp220 std::vector<float> leaves; member in cv::CascadeClassifierImpl::Data
509 float* cascadeLeaves = &cascade.data.leaves[0]; in predictOrdered()
551 float* cascadeLeaves = &cascade.data.leaves[0]; in predictCategorical()
Dcascadedetect.cpp1119 copyVectorToUMat(data.leaves, uleaves); in ocl_detectMultiScaleNoGrouping()
1647 leaves.reserve(leaves.size() + leafValues.size()); in read()
1675 leaves.push_back((float)*internalNodesIter); in read()
1692 leaves[leafOfs], leaves[leafOfs+1])); in read()
/external/junit/src/org/junit/experimental/max/
DMaxCore.java97 List<Description> leaves= findLeaves(request); in sortRequest()
98 Collections.sort(leaves, fHistory.testComparator()); in sortRequest()
99 return constructLeafRequest(leaves); in sortRequest()
102 private Request constructLeafRequest(List<Description> leaves) { in constructLeafRequest() argument
104 for (Description each : leaves) in constructLeafRequest()
/external/opencv3/modules/ml/src/
Dgbt.cpp559 CvDTreeNode** leaves;
561 leaves = GetLeaves( tree, leaves_count);
568 if (leaves[i] == predictions[j]) samples_in_leaf++;
573 leaves[i]->value = 0.0;
583 if (leaves[i] == predictions[j])
588 leaves[i]->value = value;
613 leaves[i] = 0;
615 delete[] leaves;
755 void CvGBTrees::leaves_get( CvDTreeNode** leaves, int& count, CvDTreeNode* node )
757 if (node->left != NULL) leaves_get(leaves, count, node->left);
[all …]
/external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/
Dt051treeRewriteASTtWalker.g11 | INT // leaves it alone, returning $a.start
/external/opencv3/modules/cudaobjdetect/src/cuda/
Dlbp.cu200 …: stages(_stages), nstages(_nstages), nodes(_nodes), leaves(_leaves), subsets(_subsets), features(… in Cascade()
219 sum += leaves[idx]; in operator ()()
236 const float* leaves; member
/external/llvm/test/CodeGen/ARM/
Dpeephole-bitcast.ll8 ; Peephole leaves a dead vmovsr instruction behind, and depends on linear scan
Dvldm-liveness.ll10 ; third position. However, this leaves the instruction defining s3 with a stray
/external/llvm/test/CodeGen/PowerPC/
Ddelete-node.ll3 ; The DAGCombiner leaves behind a dead node in this testcase. Currently
/external/llvm/test/Transforms/Inline/
Dcrash-lifetime-marker.ll3 ; InlineFunction would assert inside the loop that leaves lifetime markers if
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DANTLRParseTree.m35 * end up as the leaves of this tree and rule nodes are the interior nodes.
122 /** Print out the leaves of this tree, which means printing original
/external/elfutils/
DREADME4 This leaves byte ordering aside. While assuming this the code can be
/external/llvm/test/Transforms/Reassociate/
Dno-op.ll3 ; When there is nothing to do, or not much to do, check that reassociate leaves
/external/llvm/test/CodeGen/X86/
Daddr-mode-matcher.ll42 ; node becomes identical to %load2. CSE replaces %load1 which leaves its
/external/opencv3/modules/objdetect/src/opencl/
Dcascadedetect.cl155 __global const float* leaves = leaves0;
194 for( i = 0; i < ntrees; i++, node += NODE_COUNT, leaves += NODE_COUNT+1 )
217 s += leaves[-idx];
249 __global const float* leaves = leaves0 + stages[stageIdx].first*(NODE_COUNT+1);
317 partsum += leaves[i*3-idx];
/external/cros/system_api/dbus/power_manager/
Dpolicy.proto120 // preserved after scaling. A value of 1.0 (or less) leaves delays
131 // |screen_dim_ms| delay leaves delays unchanged.
/external/bison/m4/
Dlib-ld.m456 # gcc leaves a trailing carriage return which upsets mingw
/external/dnsmasq/dbus/
DDBus-interface94 specified by via the DBus, but it leaves any servers specified via the
/external/libexif/auto-m4/
Dlib-ld.m452 # gcc leaves a trailing carriage return which upsets mingw
/external/mesa3d/docs/
DMESA_multithread_makecurrent.spec34 objects in parallel, and leaves synchronization for write access
/external/clang/include/clang/AST/
DTypeNodes.def114 // These types are always leaves in the type hierarchy.
/external/curl/packages/vms/
Dclean_gnv_curl.com5 $! The GNV environment leaves behind some during the configure and build

123456