| /external/zopfli/src/zopfli/ |
| katajainen.c | 33 Nodes forming chains. Also used to represent leaves.
38 int count; /* Leaf symbol index, or number of leaves before this chain. */
98 leaves: The leaves, one per symbol.
99 numsymbols: Number of leaves.
106 Node* leaves, int numsymbols, NodePool* pool, int index, char final) {
123 InitNode(leaves[lastcount].weight, lastcount + 1, 0, newchain);
126 if (lastcount < numsymbols && sum > leaves[lastcount].weight) {
128 InitNode(leaves[lastcount].weight, lastcount + 1, oldchain->tail,
134 BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0)
192 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); local
[all...] |
| /external/junit/src/org/junit/experimental/max/ |
| MaxCore.java | 97 List<Description> leaves= findLeaves(request);
98 Collections.sort(leaves, fHistory.testComparator());
99 return constructLeafRequest(leaves);
102 private Request constructLeafRequest(List<Description> leaves) {
104 for (Description each : leaves)
|
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| expression-trees.js | 31 // strings, return an array of all binary tree strings with the leaves
33 function makeTrees(op, leaves) {
34 var len = leaves.length;
37 return leaves;
41 // Split the leaves into left and right subtrees in all possible
44 var leftTrees = makeTrees(op, leaves.slice(0, i));
45 var rightTrees = makeTrees(op, leaves.slice(i, len));
58 // All possible bitwise OR trees with six leaves, i.e. CatalanNumber[5] = 42,
|
| simple-bailouts.js | 40 // trees with <= 4 leaves.
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/codeview/ |
| cv-type.c | 455 /* Leaves use a bit of meta-programming to encode formats: each character
476 /*@null@*/ /*@only@*/ cv_leaf **leaves; member in struct:cv_type
673 type->leaves = NULL;
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_matcher.py | 5 leaves to the root of the AST and returns a set of nodes for further
83 def run(self, leaves):
94 The leaves of the AST tree to be matched
101 for leaf in leaves:
|
| btm_utils.py | 35 pattern tree. This method must be run for all leaves until the
55 #probably should check the number of leaves
91 for l in self.leaves():
96 def leaves(self): member in class:MinNode
97 "Generator that returns the leaves of the tree"
99 for x in child.leaves():
|
| pytree.py | 215 def leaves(self): member in class:Base
217 for x in child.leaves():
406 def leaves(self): member in class:Leaf
|
| refactor.py | 429 match_set = self.BM.run(tree.leaves())
473 new_matches = self.BM.run(new.leaves())
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_matcher.py | 5 leaves to the root of the AST and returns a set of nodes for further
83 def run(self, leaves):
94 The leaves of the AST tree to be matched
101 for leaf in leaves:
|
| btm_utils.py | 35 pattern tree. This method must be run for all leaves until the
55 #probably should check the number of leaves
91 for l in self.leaves():
96 def leaves(self): member in class:MinNode
97 "Generator that returns the leaves of the tree"
99 for x in child.leaves():
|
| pytree.py | 215 def leaves(self): member in class:Base
217 for x in child.leaves():
406 def leaves(self): member in class:Leaf
|
| refactor.py | 429 match_set = self.BM.run(tree.leaves())
473 new_matches = self.BM.run(new.leaves())
|
| /external/chromium_org/v8/test/mjsunit/ |
| debug-constructor.js | 67 Debug.clearStepping(); // Clear stepping as the listener leaves it on.
74 Debug.clearStepping(); // Clear stepping as the listener leaves it on.
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| node.py | 99 def leaves(self): member in class:Node
102 for j in i.leaves():
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-386.js | 31 // a constant function, in the first call to the constructor, leaves
|
| regress-69.js | 28 // This tests a switch statement with only default clause leaves
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 189 self.assertEqual(list(n1.leaves()), [l1, l2, l3])
460 leaves = [la, lb, lc, ld, le, lf]
461 root = pytree.Node(1000, leaves)
471 self.assertEqual([x[0] for x in pw.generate_matches(leaves)],
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 189 self.assertEqual(list(n1.leaves()), [l1, l2, l3])
460 leaves = [la, lb, lc, ld, le, lf]
461 root = pytree.Node(1000, leaves)
471 self.assertEqual([x[0] for x in pw.generate_matches(leaves)],
|
| /external/chromium_org/tools/binary_size/template/ |
| D3SymbolTreeMap.js | 570 var leaves = this._currentNodes.filter(function(datum){
574 .data(leaves, function(datum) { return datum.id; })
580 // Define enter/update/exit for leaves
663 .data(leaves, function(datum) { return 'leaf-' + datum.id; })
673 console.log(leaves.length + ' leaves layed out.');
[all...] |
| /external/chromium_org/third_party/mesa/src/docs/ |
| MESA_multithread_makecurrent.spec | 34 objects in parallel, and leaves synchronization for write access
|
| /external/mesa3d/docs/ |
| MESA_multithread_makecurrent.spec | 34 objects in parallel, and leaves synchronization for write access
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/ |
| tree-rewrite.rb | 568 | INT // leaves it alone, returning $a.start
1000 | INT // leaves it alone, returning $a.start
[all...] |
| /external/chromium_org/tools/grit/grit/node/ |
| base.py | 426 '''Returns a list of all subnodes (recursing to all leaves) of this node
|
| /external/chromium_org/chrome/renderer/resources/extensions/ |
| app_window_custom_bindings.js | 390 // the same as undefined in the browser and leaves the constraint unchanged.
|
