| /third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/ |
| D | printable.js | 8 constructor (tree, path) { argument
9 this.name = tree.name
10 if (tree.packageName && tree.packageName !== this.name) {
11 this.packageName = tree.packageName
13 if (tree.version) {
14 this.version = tree.version
16 this.location = tree.location
17 this.path = tree.path
18 if (tree.realpath !== this.path) {
19 this.realpath = tree.realpath
[all …]
|
| D | tree-check.js | 3 const checkTree = (tree, checkUnreachable = true) => { argument
4 const log = [['START TREE CHECK', tree.path]]
8 if (!tree.root || !tree.root.inventory) {
9 return tree
12 const { inventory } = tree.root
14 const check = (node, via = tree, viaType = 'self') => {
31 if (node.isRoot && node !== tree.root) {
35 tree: tree.path, property
36 root: tree.root.path,
43 if (node.root !== tree.root) {
[all …]
|
| /third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/tools/conversion/eot/ |
| D | HuffmanEncoder.java | 28 private TreeNode[] tree; field in HuffmanEncoder
53 tree = new TreeNode[limit]; in HuffmanEncoder()
55 tree[i] = new TreeNode(); in HuffmanEncoder()
58 tree[i].up = (short)(i / 2); in HuffmanEncoder()
59 tree[i].weight = 1; in HuffmanEncoder()
62 tree[i].left = (short)(2 * i); in HuffmanEncoder()
63 tree[i].right = (short)(2 * i + 1); in HuffmanEncoder()
66 tree[i].code = -1; in HuffmanEncoder()
67 tree[range + i].code = (short)i; in HuffmanEncoder()
68 tree[range + i].left = -1; in HuffmanEncoder()
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | moduleExportAssignment2.types | 2 var npm = module.exports = function (tree) {
3 >npm : { (tree: any): void; asReadInstalled: (tree: any) => void; }
4 >module.exports = function (tree) {} : { (tree: any): void; asReadInstalled: (tree: any) => void; }
5 >module.exports : { (tree: any): void; asReadInstalled: (tree: any) => void; }
6 >module : { exports: { (tree: any): void; asReadInstalled: (tree: any) => void; }; }
7 >exports : { (tree: any): void; asReadInstalled: (tree: any) => void; }
8 >function (tree) {} : (tree: any) => void
9 >tree : any
11 module.exports.asReadInstalled = function (tree) {
12 …ts.asReadInstalled = function (tree) { npm(tree) // both references should be callable modul…
[all …]
|
| /third_party/python/Lib/test/ |
| D | test_type_comments.py | 248 for tree in self.parse_all(funcdef):
249 self.assertEqual(tree.body[0].type_comment, "() -> int")
250 self.assertEqual(tree.body[1].type_comment, "() -> None")
251 tree = self.classic_parse(funcdef)
252 self.assertEqual(tree.body[0].type_comment, None)
253 self.assertEqual(tree.body[1].type_comment, None)
256 for tree in self.parse_all(asyncdef, minver=5):
257 self.assertEqual(tree.body[0].type_comment, "() -> int")
258 self.assertEqual(tree.body[1].type_comment, "() -> int")
259 tree = self.classic_parse(asyncdef)
[all …]
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/katex/contrib/ |
| D | render-a11y-string.js | 293 var handleObject = function handleObject(tree, a11yStrings, atomType) {
295 switch (tree.type) {
299 buildA11yStrings(tree.base, a11yStrings, atomType);
301 buildString(tree.label, "normal", a11yStrings);
310 buildA11yStrings(tree.base, a11yStrings, atomType);
312 buildString(accentUnderMap[tree.label], "normal", a11yStrings);
326 var text = tree.text;
328 switch (tree.family) {
344 buildString(tree.text, "inner", a11yStrings);
368 tree.family;
[all …]
|
| D | render-a11y-string.mjs | 181 const handleObject = (tree, a11yStrings, atomType) => { argument
183 switch (tree.type) {
187 buildA11yStrings(tree.base, a11yStrings, atomType);
189 buildString(tree.label, "normal", a11yStrings);
198 buildA11yStrings(tree.base, a11yStrings, atomType);
200 buildString(accentUnderMap[tree.label], "normal", a11yStrings);
214 const text = tree.text;
216 switch (tree.family) {
232 buildString(tree.text, "inner", a11yStrings);
256 tree.family;
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/tests/regres/cov/ |
| D | coverage_test.go | 49 tree := &cov.Tree{}
52 tree.Add(cov.Path{"a", "b"}, coverage(fileA, span0, span1))
59 checkSpans(t, tree.Spans(), span0, span1)
60 checkTests(t, tree, `{a:{b}}`)
61 checkCoverage(t, tree, fileA, `a:{[0,1]}`)
64 tree.Add(cov.Path{"a", "b", "d", "i"}, coverage(fileA, span0, span1))
74 checkSpans(t, tree.Spans(), span0, span1)
75 checkTests(t, tree, `{a:{b:{d:{i}}}}`)
76 checkCoverage(t, tree, fileA, `a:{[0,1]}`)
79 tree.Add(cov.Path{"a", "b", "e"}, coverage(fileA, span0, span1, span2))
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 165 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges() argument
166 if (tree->height() == 0) { in GetLeafEdges()
167 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
171 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
178 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges() argument
180 GetLeafEdges(tree, edges); in GetLeafEdges()
200 CordRepBtree* tree = CordRepBtree::Create(MakeHexFlat(0)); in MakeTree() local
202 tree = append ? CordRepBtree::Append(tree, MakeHexFlat(i)) in MakeTree()
203 : CordRepBtree::Prepend(tree, MakeHexFlat(i)); in MakeTree()
205 return tree; in MakeTree()
[all …]
|
| D | cord_rep_btree.h | 134 CordRepBtree* tree; member
165 static void Destroy(CordRepBtree* tree);
176 static CordRepBtree* Append(CordRepBtree* tree, CordRep* rep);
177 static CordRepBtree* Prepend(CordRepBtree* tree, CordRep* rep);
190 static CordRepBtree* Append(CordRepBtree* tree, string_view data,
192 static CordRepBtree* Prepend(CordRepBtree* tree, string_view data,
277 static bool IsValid(const CordRepBtree* tree, bool shallow = false);
285 static CordRepBtree* AssertValid(CordRepBtree* tree, bool shallow = true);
286 static const CordRepBtree* AssertValid(const CordRepBtree* tree,
385 static void DestroyLeaf(CordRepBtree* tree, size_t begin, size_t end);
[all …]
|
| D | cord_rep_btree.cc | 207 inline CordRepBtree* BuildStack(CordRepBtree* tree, int depth) { in BuildStack()
208 assert(depth <= tree->height()); in BuildStack()
210 while (current_depth < depth && tree->refcount.IsOne()) { in BuildStack()
211 stack[current_depth++] = tree; in BuildStack()
212 tree = tree->Edge(edge_type)->btree(); in BuildStack()
214 share_depth = current_depth + (tree->refcount.IsOne() ? 1 : 0); in BuildStack()
216 stack[current_depth++] = tree; in BuildStack()
217 tree = tree->Edge(edge_type)->btree(); in BuildStack()
219 return tree; in BuildStack()
225 inline void BuildOwnedStack(CordRepBtree* tree, int height) { in BuildOwnedStack()
[all …]
|
| D | cord_rep_btree_reader_test.cc | 116 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST() local
117 tree = CordRepBtree::Append(tree, MakeFlat("def")); in TEST()
119 reader.Init(tree); in TEST()
122 CordRep::Unref(tree); in TEST()
149 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST() local
150 tree = CordRepBtree::Append(tree, MakeFlat("def")); in TEST()
152 reader.Init(tree); in TEST()
157 CordRep::Unref(tree); in TEST()
165 CordRep* tree; in TEST() local
171 chunk = reader.Read(0, chunk.length(), tree); in TEST()
[all …]
|
| /third_party/node/deps/openssl/openssl/crypto/x509/ |
| D | pcy_tree.c | 54 char *str, X509_POLICY_TREE *tree, in tree_print() argument
60 curr = tree->levels + tree->nlevel; in tree_print()
66 (long)(curr - tree->levels)); in tree_print()
67 for (plev = tree->levels; plev != curr; plev++) { in tree_print()
71 (long)(plev - tree->levels), plev->flags); in tree_print()
85 #define TREE_PRINT(str, tree, curr) \ argument
87 tree_print(trc_out, "before tree_prune()", tree, curr); \
100 X509_POLICY_TREE *tree; in tree_init() local
174 if ((tree = OPENSSL_zalloc(sizeof(*tree))) == NULL) { in tree_init()
180 tree->node_maximum = OPENSSL_POLICY_TREE_NODES_MAX; in tree_init()
[all …]
|
| D | pcy_lib.c | 20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count() argument
22 if (!tree) in X509_policy_tree_level_count()
24 return tree->nlevel; in X509_policy_tree_level_count()
27 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, in X509_policy_tree_get0_level() argument
30 if (!tree || (i < 0) || (i >= tree->nlevel)) in X509_policy_tree_get0_level()
32 return tree->levels + i; in X509_policy_tree_get0_level()
37 *tree) in STACK_OF()
39 if (!tree) in STACK_OF()
41 return tree->auth_policies; in STACK_OF()
46 *tree) in STACK_OF()
[all …]
|
| /third_party/openssl/crypto/x509/ |
| D | pcy_tree.c | 54 char *str, X509_POLICY_TREE *tree, in tree_print() argument
60 curr = tree->levels + tree->nlevel; in tree_print()
66 (long)(curr - tree->levels)); in tree_print()
67 for (plev = tree->levels; plev != curr; plev++) { in tree_print()
71 (long)(plev - tree->levels), plev->flags); in tree_print()
85 #define TREE_PRINT(str, tree, curr) \ argument
87 tree_print(trc_out, "before tree_prune()", tree, curr); \
100 X509_POLICY_TREE *tree; in tree_init() local
174 if ((tree = OPENSSL_zalloc(sizeof(*tree))) == NULL) { in tree_init()
180 tree->node_maximum = OPENSSL_POLICY_TREE_NODES_MAX; in tree_init()
[all …]
|
| D | pcy_lib.c | 20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count() argument
22 if (!tree) in X509_policy_tree_level_count()
24 return tree->nlevel; in X509_policy_tree_level_count()
27 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, in X509_policy_tree_get0_level() argument
30 if (!tree || (i < 0) || (i >= tree->nlevel)) in X509_policy_tree_get0_level()
32 return tree->levels + i; in X509_policy_tree_get0_level()
37 *tree) in STACK_OF()
39 if (!tree) in STACK_OF()
41 return tree->auth_policies; in STACK_OF()
46 *tree) in STACK_OF()
[all …]
|
| /third_party/skia/third_party/externals/tint/test/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/ |
| D | 0.wgsl.expected.hlsl | 3 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:46:11 warning: code is…
7 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:60:11 warning: code is…
11 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:62:9 warning: code is …
15 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:105:11 warning: code i…
19 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:119:11 warning: code i…
23 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:121:9 warning: code is…
27 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:164:11 warning: code i…
31 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:178:11 warning: code i…
35 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:180:9 warning: code is…
39 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:223:11 warning: code i…
[all …]
|
| D | 0.spvasm.expected.hlsl | 39 BST tree[10] = (BST[10])0;
47 tree[0] = tint_symbol_1;
62 const int x_65 = tree[x_58].data;
65 const int x_79 = tree[x_78_save].leftIndex;
67 tree[x_78_save].leftIndex = 1;
69 tree[1] = tint_symbol_2;
73 x_84 = tree[x_78_save].leftIndex;
84 const int x_71 = tree[x_70_save].rightIndex;
86 tree[x_70_save].rightIndex = 1;
88 tree[1] = tint_symbol_3;
[all …]
|
| D | 1.wgsl.expected.hlsl | 3 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:61:15 warning: code is…
7 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:99:11 warning: code is…
11 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:171:17 warning: code i…
15 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:209:13 warning: code i…
19 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:268:15 warning: code i…
23 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:306:11 warning: code i…
27 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:359:15 warning: code i…
31 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:397:11 warning: code i…
35 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:450:15 warning: code i…
39 vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/1.wgsl:488:11 warning: code i…
[all …]
|
| /third_party/cJSON/tests/ |
| D | parse_examples.c | 50 cJSON *tree = NULL; in do_test() local
76 tree = parse_file(test_path); in do_test()
77 TEST_ASSERT_NOT_NULL_MESSAGE(tree, "Failed to read of parse test."); in do_test()
80 actual = cJSON_Print(tree); in do_test()
91 if (tree != NULL) in do_test()
93 cJSON_Delete(tree); in do_test()
137 cJSON *tree = NULL; in file_test6_should_not_be_parsed() local
142 tree = cJSON_Parse(test6); in file_test6_should_not_be_parsed()
143 TEST_ASSERT_NULL_MESSAGE(tree, "Should fail to parse what is not JSON."); in file_test6_should_not_be_parsed()
151 if (tree != NULL) in file_test6_should_not_be_parsed()
[all …]
|
| /third_party/protobuf/java/util/src/test/java/com/google/protobuf/util/ |
| D | FieldMaskTreeTest.java | 47 FieldMaskTree tree = new FieldMaskTree(); in testAddFieldPath() local
48 assertThat(tree.toString()).isEmpty(); in testAddFieldPath()
49 tree.addFieldPath(""); in testAddFieldPath()
50 assertThat(tree.toString()).isEmpty(); in testAddFieldPath()
52 tree.addFieldPath("foo"); in testAddFieldPath()
53 assertEquals("foo", tree.toString()); in testAddFieldPath()
55 tree.addFieldPath("foo"); in testAddFieldPath()
56 assertEquals("foo", tree.toString()); in testAddFieldPath()
58 tree.addFieldPath("bar.baz"); in testAddFieldPath()
59 assertEquals("bar.baz,foo", tree.toString()); in testAddFieldPath()
[all …]
|
| /third_party/skia/third_party/externals/tint/test/vk-gl-cts/graphicsfuzz/spv-load-from-frag-color/ |
| D | 1.spvasm.expected.hlsl | 39 BST tree[10] = (BST[10])0;
47 tree[0] = tint_symbol_1;
62 const int x_69 = tree[x_62].data;
65 const int x_83 = tree[x_82_save].leftIndex;
67 tree[x_82_save].leftIndex = 1;
69 tree[1] = tint_symbol_2;
73 x_88 = tree[x_82_save].leftIndex;
84 const int x_75 = tree[x_74_save].rightIndex;
86 tree[x_74_save].rightIndex = 1;
88 tree[1] = tint_symbol_3;
[all …]
|
| D | 1.wgsl.expected.hlsl | 120 BST tree[10] = (BST[10])0;
128 tree[0] = tint_symbol_1;
143 const int x_69 = tree[x_62].data;
146 const int x_83 = tree[x_82_save].leftIndex;
148 tree[x_82_save].leftIndex = 1;
150 tree[1] = tint_symbol_2;
154 x_88 = tree[x_82_save].leftIndex;
165 const int x_75 = tree[x_74_save].rightIndex;
167 tree[x_74_save].rightIndex = 1;
169 tree[1] = tint_symbol_3;
[all …]
|
| /third_party/skia/third_party/externals/libwebp/src/utils/ |
| D | huffman_encode_utils.c | 135 static void SetBitDepths(const HuffmanTree* const tree, in SetBitDepths() argument
138 if (tree->pool_index_left_ >= 0) { in SetBitDepths()
139 SetBitDepths(&pool[tree->pool_index_left_], pool, bit_depths, level + 1); in SetBitDepths()
140 SetBitDepths(&pool[tree->pool_index_right_], pool, bit_depths, level + 1); in SetBitDepths()
142 bit_depths[tree->value_] = level; in SetBitDepths()
167 HuffmanTree* tree, int tree_depth_limit, in GenerateOptimalTree() argument
184 tree_pool = tree + tree_size_orig; in GenerateOptimalTree()
201 tree[idx].total_count_ = count; in GenerateOptimalTree()
202 tree[idx].value_ = j; in GenerateOptimalTree()
203 tree[idx].pool_index_left_ = -1; in GenerateOptimalTree()
[all …]
|
| /third_party/node/tools/icu/ |
| D | icutrim.py | 210 def queueForRemoval(tree): argument
212 if tree not in config.get("trees", {}):
214 mytree = trees[tree]
216 print("* %s: %d items" % (tree, len(mytree["locs"])))
218 if isinstance(config["trees"][tree], basestring):
219 treeStr = config["trees"][tree]
221 print(" Substituting $%s for tree %s" % (treeStr, tree))
223 print(" ERROR: no variable: variables.%s for tree %s" % (treeStr, tree))
225 config["trees"][tree] = config["variables"][treeStr]
226 myconfig = config["trees"][tree]
[all …]
|