| /dports/math/cudd/cudd-3.0.0/nanotrav/ |
| H A D | s382.out | 12 S0: 22 nodes 1 leaves 1 minterms
13 From[1]: 40 nodes 1 leaves 5 minterms
17 From[2]: 19 nodes 1 leaves 8 minterms
21 From[3]: 20 nodes 1 leaves 12 minterms
25 From[4]: 18 nodes 1 leaves 16 minterms
29 From[5]: 20 nodes 1 leaves 20 minterms
33 From[6]: 19 nodes 1 leaves 24 minterms
37 From[7]: 20 nodes 1 leaves 28 minterms
41 From[8]: 17 nodes 1 leaves 32 minterms
618 S0: 22 nodes 1 leaves 1 minterms
[all …]
|
| H A D | rcn25.out | 11 S0: 1 nodes 1 leaves 3.35544e+07 minterms
12 Envelope[1]: 68 nodes 1 leaves 1.95734e+07 minterms
13 Envelope[2]: 131 nodes 1 leaves 1.53791e+07 minterms
14 Envelope[3]: 240 nodes 1 leaves 1.30489e+07 minterms
440 Envelope[429]: 30 nodes 1 leaves 9 minterms
441 Envelope[430]: 29 nodes 1 leaves 8 minterms
442 Envelope[431]: 29 nodes 1 leaves 7 minterms
443 Envelope[432]: 29 nodes 1 leaves 6 minterms
444 Envelope[433]: 28 nodes 1 leaves 5 minterms
445 Envelope[434]: 27 nodes 1 leaves 4 minterms
[all …]
|
| H A D | s641.out | 21 S0: 20 nodes 1 leaves 1 minterms
22 From[1]: 20 nodes 1 leaves 1 minterms
23 Reached[1]: 25 nodes 1 leaves 2 minterms
26 From[2]: 23 nodes 1 leaves 7 minterms
27 Reached[2]: 23 nodes 1 leaves 9 minterms
30 From[3]: 45 nodes 1 leaves 56 minterms
31 Reached[3]: 48 nodes 1 leaves 65 minterms
34 From[4]: 134 nodes 1 leaves 649 minterms
38 From[5]: 163 nodes 1 leaves 560 minterms
42 From[6]: 110 nodes 1 leaves 270 minterms
[all …]
|
| H A D | mult32a.out | 44 S0: 33 nodes 1 leaves 1 minterms
133 From[23]: 24 nodes 1 leaves 512 minterms
137 From[24]: 25 nodes 1 leaves 256 minterms
141 From[25]: 26 nodes 1 leaves 128 minterms
145 From[26]: 27 nodes 1 leaves 64 minterms
149 From[27]: 28 nodes 1 leaves 32 minterms
153 From[28]: 29 nodes 1 leaves 16 minterms
157 From[29]: 30 nodes 1 leaves 8 minterms
161 From[30]: 31 nodes 1 leaves 4 minterms
165 From[31]: 32 nodes 1 leaves 2 minterms
[all …]
|
| H A D | closest.out | 12 T-F : 4 nodes 1 leaves 3 minterms
13 T-G : 4 nodes 1 leaves 3 minterms
14 T-C (0) : 3 nodes 1 leaves 2 minterms
15 T-GN : 4 nodes 1 leaves 5 minterms
16 T-N (1) : 4 nodes 1 leaves 1 minterms
18 T-F : 4 nodes 1 leaves 3 minterms
19 T-G : 4 nodes 1 leaves 1 minterms
21 T-GN : 4 nodes 1 leaves 7 minterms
24 T-F : 4 nodes 1 leaves 3 minterms
25 T-G : 4 nodes 1 leaves 1 minterms
[all …]
|
| H A D | adj49.out | 24 f: 338 nodes 1 leaves 2.11955e+08 minterms
26 v[0]: 6 nodes 1 leaves 8.79609e+13 minterms
27 v[1]: 3 nodes 1 leaves 1.40737e+14 minterms
28 v[2]: 4 nodes 1 leaves 7.03687e+13 minterms
29 v[3]: 5 nodes 1 leaves 2.46291e+14 minterms
30 v[4]: 4 nodes 1 leaves 7.03687e+13 minterms
31 v[5]: 2 nodes 1 leaves 2.81475e+14 minterms
32 v[6]: 6 nodes 1 leaves 5.27766e+13 minterms
33 v[7]: 8 nodes 1 leaves 8.35629e+13 minterms
34 v[8]: 7 nodes 1 leaves 1.14349e+14 minterms
[all …]
|
| /dports/science/PETSc/petsc-3.14.1/src/dm/impls/patch/tests/output/ |
| H A D | ex1_4.out | 46 [0] Number of roots=64, leaves=4, remote ranks=1
51 [1] Number of roots=64, leaves=2, remote ranks=1
54 [2] Number of roots=64, leaves=0, remote ranks=0
55 [3] Number of roots=64, leaves=0, remote ranks=0
56 [4] Number of roots=64, leaves=2, remote ranks=1
59 [5] Number of roots=64, leaves=1, remote ranks=1
61 [6] Number of roots=64, leaves=0, remote ranks=0
62 [7] Number of roots=64, leaves=0, remote ranks=0
63 [8] Number of roots=64, leaves=0, remote ranks=0
64 [9] Number of roots=64, leaves=0, remote ranks=0
[all …]
|
| H A D | ex1_2.out | 16 [0] Number of roots=16, leaves=9, remote ranks=4
26 [1] Number of roots=16, leaves=0, remote ranks=0
27 [2] Number of roots=16, leaves=0, remote ranks=0
28 [3] Number of roots=16, leaves=0, remote ranks=0
31 [0] Number of roots=16, leaves=4, remote ranks=1
36 [1] Number of roots=16, leaves=0, remote ranks=0
37 [2] Number of roots=16, leaves=0, remote ranks=0
38 [3] Number of roots=16, leaves=0, remote ranks=0
44 [0] Number of roots=16, leaves=0, remote ranks=0
45 [1] Number of roots=16, leaves=9, remote ranks=4
[all …]
|
| /dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tests/output/ |
| H A D | ex5_2.out | 2 [0] Number of roots=10, leaves=70, remote ranks=7
73 [1] Number of roots=10, leaves=0, remote ranks=0
74 [2] Number of roots=10, leaves=0, remote ranks=0
75 [3] Number of roots=10, leaves=0, remote ranks=0
76 [4] Number of roots=10, leaves=0, remote ranks=0
77 [5] Number of roots=10, leaves=0, remote ranks=0
78 [6] Number of roots=10, leaves=0, remote ranks=0
86 [1] Number of roots=0, leaves=5, remote ranks=1
92 [2] Number of roots=0, leaves=5, remote ranks=1
98 [3] Number of roots=0, leaves=5, remote ranks=1
[all …]
|
| /dports/math/py-mathics/Mathics3-2.2.0/mathics/builtin/ |
| H A D | quantities.py | 88 mag = leaves[0]
110 targetUnit = toUnit.leaves[0].leaves[1].get_string_value().lower()
118 abc.append(convert_unit(expr.leaves[i].leaves, targetUnit))
128 mag = leaves[0]
145 abc.append(convert_unit(expr.leaves[i].leaves))
260 if len(leaves) < 1 or len(leaves) > 2:
314 results.append(get_unit(expr.leaves[i].leaves))
372 results.append(get_magnitude(expr.leaves[i].leaves))
381 quanity = Q_(leaves[0], leaves[1].get_string_value())
401 targetUnit = unit.leaves[0].leaves[1].get_string_value().lower()
[all …]
|
| H A D | sparse.py | 54 leaves = []
58 if len(array.leaves) == 0:
62 leaf = array.leaves[0]
68 dims = leaf.leaves[1]
70 leaves = [leaf]
88 leaves.append(
101 dims = Expression("List", Integer(len(array.leaves)), *(dims.leaves))
104 for rule in leaf.leaves[3].leaves:
126 for item in data.leaves:
135 pos = rule.leaves[0]
[all …]
|
| H A D | arithmetic.py | 327 leaves = []
669 leaves = []
680 elif leaves and item == leaves[-1]:
686 and item.leaves[0].sameQ(leaves[-1].leaves[0])
690 leaves[-1].leaves[0],
691 Expression("Plus", item.leaves[1], leaves[-1].leaves[1]),
696 and item.leaves[0].sameQ(leaves[-1])
704 and leaves[-1].leaves[0].sameQ(item)
2158 leaves = expr.leaves
2164 for case in leaves[0].leaves:
[all …]
|
| /dports/archivers/zopfli/zopfli-zopfli-1.0.3/src/zopfli/ |
| H A D | katajainen.c | 185 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); in ZopfliLengthLimitedCodeLengths() local
203 free(leaves); in ZopfliLengthLimitedCodeLengths()
207 free(leaves); in ZopfliLengthLimitedCodeLengths()
212 free(leaves); in ZopfliLengthLimitedCodeLengths()
216 bitlengths[leaves[0].count]++; in ZopfliLengthLimitedCodeLengths()
218 free(leaves); in ZopfliLengthLimitedCodeLengths()
225 if (leaves[i].weight >= in ZopfliLengthLimitedCodeLengths()
227 free(leaves); in ZopfliLengthLimitedCodeLengths()
230 leaves[i].weight = (leaves[i].weight << 9) | leaves[i].count; in ZopfliLengthLimitedCodeLengths()
234 leaves[i].weight >>= 9; in ZopfliLengthLimitedCodeLengths()
[all …]
|
| /dports/archivers/pigz/pigz-2.6/zopfli/src/zopfli/ |
| H A D | katajainen.c | 185 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); in ZopfliLengthLimitedCodeLengths() local
203 free(leaves); in ZopfliLengthLimitedCodeLengths()
207 free(leaves); in ZopfliLengthLimitedCodeLengths()
212 free(leaves); in ZopfliLengthLimitedCodeLengths()
216 bitlengths[leaves[0].count]++; in ZopfliLengthLimitedCodeLengths()
218 free(leaves); in ZopfliLengthLimitedCodeLengths()
225 if (leaves[i].weight >= in ZopfliLengthLimitedCodeLengths()
227 free(leaves); in ZopfliLengthLimitedCodeLengths()
230 leaves[i].weight = (leaves[i].weight << 9) | leaves[i].count; in ZopfliLengthLimitedCodeLengths()
234 leaves[i].weight >>= 9; in ZopfliLengthLimitedCodeLengths()
[all …]
|
| /dports/archivers/maxcso/maxcso-1.10.0/zopfli/src/zopfli/ |
| H A D | katajainen.c | 185 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); in ZopfliLengthLimitedCodeLengths() local
203 free(leaves); in ZopfliLengthLimitedCodeLengths()
207 free(leaves); in ZopfliLengthLimitedCodeLengths()
212 free(leaves); in ZopfliLengthLimitedCodeLengths()
216 bitlengths[leaves[0].count]++; in ZopfliLengthLimitedCodeLengths()
218 free(leaves); in ZopfliLengthLimitedCodeLengths()
225 if (leaves[i].weight >= in ZopfliLengthLimitedCodeLengths()
227 free(leaves); in ZopfliLengthLimitedCodeLengths()
230 leaves[i].weight = (leaves[i].weight << 9) | leaves[i].count; in ZopfliLengthLimitedCodeLengths()
234 leaves[i].weight >>= 9; in ZopfliLengthLimitedCodeLengths()
[all …]
|
| /dports/archivers/py-zopfli/zopfli-0.1.9/zopfli/src/zopfli/ |
| H A D | katajainen.c | 185 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); in ZopfliLengthLimitedCodeLengths() local
203 free(leaves); in ZopfliLengthLimitedCodeLengths()
207 free(leaves); in ZopfliLengthLimitedCodeLengths()
212 free(leaves); in ZopfliLengthLimitedCodeLengths()
216 bitlengths[leaves[0].count]++; in ZopfliLengthLimitedCodeLengths()
218 free(leaves); in ZopfliLengthLimitedCodeLengths()
225 if (leaves[i].weight >= in ZopfliLengthLimitedCodeLengths()
227 free(leaves); in ZopfliLengthLimitedCodeLengths()
230 leaves[i].weight = (leaves[i].weight << 9) | leaves[i].count; in ZopfliLengthLimitedCodeLengths()
234 leaves[i].weight >>= 9; in ZopfliLengthLimitedCodeLengths()
[all …]
|
| /dports/graphics/apngasm/apngasm-2.91/zopfli/ |
| H A D | katajainen.c | 185 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); in ZopfliLengthLimitedCodeLengths() local
203 free(leaves); in ZopfliLengthLimitedCodeLengths()
207 free(leaves); in ZopfliLengthLimitedCodeLengths()
212 free(leaves); in ZopfliLengthLimitedCodeLengths()
216 bitlengths[leaves[0].count]++; in ZopfliLengthLimitedCodeLengths()
218 free(leaves); in ZopfliLengthLimitedCodeLengths()
225 if (leaves[i].weight >= in ZopfliLengthLimitedCodeLengths()
227 free(leaves); in ZopfliLengthLimitedCodeLengths()
230 leaves[i].weight = (leaves[i].weight << 9) | leaves[i].count; in ZopfliLengthLimitedCodeLengths()
234 leaves[i].weight >>= 9; in ZopfliLengthLimitedCodeLengths()
[all …]
|
| /dports/archivers/advancecomp/advancecomp-2.1-6-g7b08f7a/zopfli/ |
| H A D | katajainen.c | 185 Node* leaves = (Node*)malloc(n * sizeof(*leaves)); in ZopfliLengthLimitedCodeLengths() local
203 free(leaves); in ZopfliLengthLimitedCodeLengths()
207 free(leaves); in ZopfliLengthLimitedCodeLengths()
212 free(leaves); in ZopfliLengthLimitedCodeLengths()
216 bitlengths[leaves[0].count]++; in ZopfliLengthLimitedCodeLengths()
218 free(leaves); in ZopfliLengthLimitedCodeLengths()
225 if (leaves[i].weight >= in ZopfliLengthLimitedCodeLengths()
227 free(leaves); in ZopfliLengthLimitedCodeLengths()
230 leaves[i].weight = (leaves[i].weight << 9) | leaves[i].count; in ZopfliLengthLimitedCodeLengths()
234 leaves[i].weight >>= 9; in ZopfliLengthLimitedCodeLengths()
[all …]
|
| /dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tutorials/output/ |
| H A D | ex1_10.out | 3 [0] Number of roots=3, leaves=2, remote ranks=2
6 [1] Number of roots=2, leaves=3, remote ranks=2
10 [2] Number of roots=2, leaves=3, remote ranks=3
14 [3] Number of roots=2, leaves=3, remote ranks=2
18 [0] Roots referenced by my leaves, by rank
23 [1] Roots referenced by my leaves, by rank
29 [2] Roots referenced by my leaves, by rank
36 [3] Roots referenced by my leaves, by rank
104 ## Gathered data at multi-roots from leaves
109 ## Data at multi-roots, to scatter to leaves
[all …]
|
| H A D | ex1_10_basic.out | 4 [0] Number of roots=3, leaves=2, remote ranks=2
7 [1] Number of roots=2, leaves=3, remote ranks=2
11 [2] Number of roots=2, leaves=3, remote ranks=3
15 [3] Number of roots=2, leaves=3, remote ranks=2
19 [0] Roots referenced by my leaves, by rank
24 [1] Roots referenced by my leaves, by rank
30 [2] Roots referenced by my leaves, by rank
37 [3] Roots referenced by my leaves, by rank
113 ## Gathered data at multi-roots from leaves
118 ## Data at multi-roots, to scatter to leaves
[all …]
|
| H A D | ex1_7.out | 3 [0] Number of roots=3, leaves=2, remote ranks=2
6 [1] Number of roots=2, leaves=3, remote ranks=2
10 [2] Number of roots=2, leaves=3, remote ranks=3
14 [3] Number of roots=2, leaves=3, remote ranks=2
18 [0] Roots referenced by my leaves, by rank
23 [1] Roots referenced by my leaves, by rank
29 [2] Roots referenced by my leaves, by rank
36 [3] Roots referenced by my leaves, by rank
44 [0] Number of roots=5, leaves=2, remote ranks=2
47 [1] Number of roots=2, leaves=3, remote ranks=2
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bvgl/algo/tests/ |
| H A D | test_2d_geo_index.cxx | 31 bvgl_2d_geo_index::get_leaves(root, leaves); in test_2d_geo_index()
33 …std::cout << " size of the leaf node: " << leaves[0]->extent_.width() << 'x' << leaves[0]->extent_… in test_2d_geo_index()
35 TEST("number of leaves", leaves.size(), 64); in test_2d_geo_index()
46 leaves.clear(); in test_2d_geo_index()
60 leaves.clear(); in test_2d_geo_index()
77 leaves.clear(); in test_2d_geo_index()
89 leaves.clear(); in test_2d_geo_index()
102 leaves.clear(); in test_2d_geo_index()
118 leaves.clear(); in test_2d_geo_index()
127 leaves.clear(); in test_2d_geo_index()
[all …]
|
| /dports/x11-wm/windowmaker/WindowMaker-0.95.9/WINGs/ |
| H A D | tree.c | 11 WMArray *leaves; member
27 if (aNode->leaves) { in destroyNode()
28 WMFreeArray(aNode->leaves); in destroyNode()
47 aNode->leaves = NULL; in WMCreateTreeNodeWithDestructor()
62 if (!parent->leaves) { in WMInsertItemInTree()
80 if (aNode->leaves) { in updateNodeDepth()
94 if (!parent->leaves) { in WMInsertNodeInTree()
120 wassertr(aNode->leaves != NULL); in WMDeleteLeafForTreeNode()
174 if (aNode->leaves) { in WMSortLeavesForTreeNode()
183 if (!aNode->leaves) in sortLeavesForNode()
[all …]
|
| /dports/x11-wm/libwraster/WindowMaker-0.95.9/WINGs/ |
| H A D | tree.c | 11 WMArray *leaves; member
27 if (aNode->leaves) { in destroyNode()
28 WMFreeArray(aNode->leaves); in destroyNode()
47 aNode->leaves = NULL; in WMCreateTreeNodeWithDestructor()
62 if (!parent->leaves) { in WMInsertItemInTree()
80 if (aNode->leaves) { in updateNodeDepth()
94 if (!parent->leaves) { in WMInsertNodeInTree()
120 wassertr(aNode->leaves != NULL); in WMDeleteLeafForTreeNode()
174 if (aNode->leaves) { in WMSortLeavesForTreeNode()
183 if (!aNode->leaves) in sortLeavesForNode()
[all …]
|
| /dports/science/PETSc/petsc-3.14.1/src/dm/impls/plex/tests/output/ |
| H A D | ex1_part_simple_1.out | 61 [0] Number of roots=33, leaves=7, remote ranks=1
69 [1] Number of roots=0, leaves=7, remote ranks=1
77 [2] Number of roots=0, leaves=7, remote ranks=1
85 [3] Number of roots=0, leaves=7, remote ranks=1
93 [4] Number of roots=0, leaves=7, remote ranks=1
101 [5] Number of roots=0, leaves=7, remote ranks=1
1023 [0] Roots referenced by my leaves, by rank
1031 [1] Roots referenced by my leaves, by rank
1043 [2] Roots referenced by my leaves, by rank
1051 [3] Roots referenced by my leaves, by rank
[all …]
|