| /external/zopfli/src/zopfli/ |
| D | katajainen.c | 106 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/tensorflow/tensorflow/python/autograph/pyct/ |
| D | cfg.py | 270 self.leaves = set()
330 for leaf in self.leaves:
371 self.leaves = set((node,))
388 self.leaves = set()
445 self.leaves = set()
464 self.leaves |= self._connect_jump_to_finally_sections(exit_)
489 self._connect_nodes(self.leaves, self.section_entry[section_id])
497 self.leaves = set((self.section_entry[section_id],))
523 self.cond_leaves[section_id].append(self.leaves)
524 self.leaves = self.cond_entry[section_id]
[all …]
|
| /external/tensorflow/tensorflow/core/lib/random/ |
| D | weighted_picker.cc | 147 int32* leaves = level_[num_levels_ - 1]; in SetAllWeights() local
148 for (int i = 0; i < N_; i++) leaves[i] = weight; in SetAllWeights()
149 for (int i = N_; i < LevelSize(num_levels_ - 1); i++) leaves[i] = 0; in SetAllWeights()
159 int32* leaves = level_[num_levels_ - 1]; in SetWeightsFromArray() local
160 for (int i = 0; i < N_; i++) leaves[i] = weights[i]; in SetWeightsFromArray()
161 for (int i = N_; i < LevelSize(num_levels_ - 1); i++) leaves[i] = 0; in SetWeightsFromArray()
|
| /external/junit/src/main/java/org/junit/experimental/max/ |
| D | MaxCore.java | 100 List<Description> leaves = findLeaves(request); in sortRequest() local
101 Collections.sort(leaves, history.testComparator()); in sortRequest()
102 return constructLeafRequest(leaves); in sortRequest()
105 private Request constructLeafRequest(List<Description> leaves) { in constructLeafRequest() argument
107 for (Description each : leaves) { in constructLeafRequest()
|
| /external/tensorflow/tensorflow/contrib/graph_editor/ |
| D | util.py | 110 def flatten_tree(tree, leaves=None): argument
120 if leaves is None:
121 leaves = []
124 flatten_tree(child, leaves)
127 flatten_tree(child, leaves)
129 leaves.append(tree)
130 return leaves
|
| /external/python/cpython3/Lib/lib2to3/ |
| D | btm_utils.py | 91 for l in self.leaves():
96 def leaves(self): member in MinNode
99 yield from child.leaves()
|
| D | btm_matcher.py | 83 def run(self, leaves): argument
101 for leaf in leaves:
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | Containment.java | 47 HashSet<String> leaves = new HashSet<String>();
48 addLeaves(s, leaves, containers); in addLeaves() argument
49 leavesToContainers.putAll(leaves, s); in leavesToContainers.putAll() argument
|
| /external/python/cpython2/Lib/lib2to3/ |
| D | btm_utils.py | 91 for l in self.leaves():
96 def leaves(self): member in MinNode
99 for x in child.leaves():
|
| D | btm_matcher.py | 83 def run(self, leaves): argument
101 for leaf in leaves:
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/proto/ |
| D | tree_config.proto | 32 // The original layer of leaves before that layer was converted to a split.
117 // leaves.
128 // leaves.
|
| /external/boringssl/src/crypto/x509/ |
| D | make_many_constraints.go | 133 leaves := []struct {
145 for i, leaf := range leaves {
|
| /external/u-boot/fs/ubifs/ |
| D | Kconfig | 5 Make the verbose messages from UBIFS stop printing. This leaves
|
| /external/antlr/runtime/JavaScript/tests/functional/ |
| D | t051treeRewriteASTtWalker.g | 11 | INT // leaves it alone, returning $a.start
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_attr_destroy/ |
| D | coverage.txt | 9 Note: pthread_attr_destroy leaves a lot up to the implementation of threads
|
| /external/curl/docs/cmdline-opts/ |
| D | trace-ascii.d | 10 This is very similar to --trace, but leaves out the hex part and only shows
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | ParseTree.m | 35 * 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/swiftshader/third_party/LLVM/test/CodeGen/PowerPC/ |
| D | delete-node.ll | 3 ; The DAGCombiner leaves behind a dead node in this testcase. Currently
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/ |
| D | peephole-bitcast.ll | 8 ; Peephole leaves a dead vmovsr instruction behind, and depends on linear scan
|
| /external/swiftshader/third_party/LLVM/test/CodeGen/ARM/ |
| D | peephole-bitcast.ll | 6 ; Peephole leaves a dead vmovsr instruction behind, and depends on linear scan
|
| /external/bcc/src/cc/frontends/p4/test/ |
| D | README.txt | 4 and leaves garbage namespaces or links
|
| /external/llvm/test/CodeGen/ARM/ |
| D | peephole-bitcast.ll | 8 ; Peephole leaves a dead vmovsr instruction behind, and depends on linear scan
|
| /external/llvm/test/Transforms/Inline/ |
| D | crash-lifetime-marker.ll | 3 ; InlineFunction would assert inside the loop that leaves lifetime markers if
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/PowerPC/ |
| D | delete-node.ll | 3 ; The DAGCombiner leaves behind a dead node in this testcase. Currently
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | delete-node.ll | 3 ; The DAGCombiner leaves behind a dead node in this testcase. Currently
|