Home
last modified time | relevance | path

Searched defs:tree (Results 1 – 25 of 226) sorted by relevance

12345678910

/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h134 CordRepBtree* tree; member
388 static void Delete(CordRepBtree* tree) { delete tree; } in Delete()
584 CordRepBtree* tree = new CordRepBtree; in New() local
591 CordRepBtree* tree = new CordRepBtree; in New() local
602 CordRepBtree* tree = new CordRepBtree; in New() local
610 inline void CordRepBtree::DestroyTree(CordRepBtree* tree, size_t begin, in DestroyTree()
619 inline void CordRepBtree::Destroy(CordRepBtree* tree) { in Destroy()
624 auto* tree = static_cast<CordRepBtree*>(::operator new(sizeof(CordRepBtree))); in CopyRaw() local
631 CordRepBtree* tree = CopyRaw(); in Copy() local
640 CordRepBtree* tree = CopyRaw(); in CopyToEndFrom() local
[all …]
Dcord_rep_btree_test.cc165 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
178 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges()
200 CordRepBtree* tree = CordRepBtree::Create(MakeHexFlat(0)); in MakeTree() local
211 CordRepBtree* tree = CordRepBtree::Create(*it); in CreateTree() local
219 CordRepBtree* tree = CordRepBtree::Create(*rit); in CreateTreeReverse() local
276 auto* tree = CordRepBtree::New(); in TEST() local
284 auto* tree = CordRepBtree::New(3); in TEST() local
360 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST() local
463 CordRepBtree* tree = CordRepBtree::Create(flats.back()); in TEST_P() local
493 CordRepBtree* tree = CordRepBtree::Create(flats.back()); in TEST_P() local
[all …]
Dcord_rep_btree_navigator.h62 CordRep* tree; member
164 inline CordRep* CordRepBtreeNavigator::InitFirst(CordRepBtree* tree) { in InitFirst()
168 inline CordRep* CordRepBtreeNavigator::InitLast(CordRepBtree* tree) { in InitLast()
173 inline CordRep* CordRepBtreeNavigator::Init(CordRepBtree* tree) { in Init()
207 CordRepBtree* tree, size_t offset) { in InitOffset()
Dcord_rep_consume_test.cc89 CordRep* tree = CreateTestTree(); in TEST() local
106 CordRep* tree = CreateTestTree(); in TEST() local
124 CordRep* tree = CreateTestTree(); in TEST() local
141 CordRep* tree = CreateTestTree(); in TEST() local
162 CordRepSubstring* tree = CreateSubstring(concat, 15, 10); in TEST() local
/third_party/node/deps/openssl/openssl/crypto/x509/
Dpcy_tree.c54 char *str, X509_POLICY_TREE *tree, in tree_print()
85 #define TREE_PRINT(str, tree, curr) \ argument
100 X509_POLICY_TREE *tree; in tree_init() local
259 X509_POLICY_TREE *tree) in tree_link_matching_nodes()
289 X509_POLICY_TREE *tree) in tree_link_nodes()
312 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_add_unmatched()
340 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_link_unmatched()
376 X509_POLICY_TREE *tree) in tree_link_any()
406 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_prune()
481 static int tree_calculate_authority_set(X509_POLICY_TREE *tree, in tree_calculate_authority_set()
[all …]
/third_party/openssl/crypto/x509/
Dpcy_tree.c54 char *str, X509_POLICY_TREE *tree, in tree_print()
85 #define TREE_PRINT(str, tree, curr) \ argument
100 X509_POLICY_TREE *tree; in tree_init() local
259 X509_POLICY_TREE *tree) in tree_link_matching_nodes()
289 X509_POLICY_TREE *tree) in tree_link_nodes()
312 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_add_unmatched()
340 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_link_unmatched()
376 X509_POLICY_TREE *tree) in tree_link_any()
406 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_prune()
481 static int tree_calculate_authority_set(X509_POLICY_TREE *tree, in tree_calculate_authority_set()
[all …]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
Dtree-check.js3 const checkTree = (tree, checkUnreachable = true) => { argument
35 tree: tree.path, property
47 tree: tree.path, property
59 tree: tree.path, property
72 tree: tree.path, property
84 tree: tree.path, property
96 tree: tree.path, property
107 tree: tree.path, property
144 tree: tree.path, property
Dcalc-dep-flags.js3 const calcDepFlags = (tree, resetRoot = true) => { argument
11 tree, property
97 tree: node, property
Dprintable.js8 constructor (tree, path) { argument
108 constructor (tree, path) { argument
115 constructor (tree, path) { argument
182 const printableTree = (tree, path = []) => { argument
/third_party/protobuf/java/util/src/test/java/com/google/protobuf/util/
DFieldMaskTreeTest.java47 FieldMaskTree tree = new FieldMaskTree(); in testAddFieldPath() local
72 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testMergeFromFieldMask() local
80 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString(initialTreeString)); in testRemoveFieldPath() local
102 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testRemoveFromFieldMask() local
109 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testIntersectFieldPath() local
139 FieldMaskTree tree, in merge()
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/testing/
DRangeTreeSubject.java35 public static RangeTreeSubject assertThat(@Nullable RangeTree tree) { in assertThat()
39 public static RangeTreeSubject assertThat(@Nullable PrefixTree tree) { in assertThat()
43 public static RangeTreeSubject assertWithMessageThat( in assertWithMessageThat()
92 RangeTree tree = RangeTree.from(spec); in containsExactly() local
99 RangeTree tree = RangeTree.from(specs); in containsExactly() local
/third_party/node/tools/icu/
Dicutrim.py210 def queueForRemoval(tree): argument
254 def addTreeByType(tree, mytree): argument
277 tree = None variable
279 tree = "ROOT" variable
281 tree = treeprefix[0:-1] variable
/third_party/skia/third_party/externals/spirv-tools/test/opt/dominator_tree/
Dgenerated.cpp128 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
193 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
295 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
337 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
416 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
492 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
613 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
743 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
778 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
848 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
[all …]
/third_party/spirv-tools/test/opt/dominator_tree/
Dgenerated.cpp127 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
192 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
294 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
336 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
415 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
491 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
612 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
742 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
777 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
847 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/dominator_tree/
Dgenerated.cpp128 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
193 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
295 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
337 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
416 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
492 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
613 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
743 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
778 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
848 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
[all …]
/third_party/skia/infra/bots/gen_tasks_logic/
Dcompile_cas.go185 type tree struct { struct
186 root *node
198 func (t *tree) add(p string) {
205 func (t *tree) entries() []string {
/third_party/cJSON/tests/
Dparse_examples.c50 cJSON *tree = NULL; in do_test() local
137 cJSON *tree = NULL; in file_test6_should_not_be_parsed() local
185 cJSON *tree = NULL; in test12_should_not_be_parsed() local
200 cJSON *tree = NULL; in test13_should_be_parsed_without_null_termination() local
229 cJSON *tree = NULL; in test14_should_not_be_parsed() local
/third_party/skia/tests/graphite/
DIntersectionTreeTest.cpp36 IntersectionTree tree; in DEF_GRAPHITE_TEST() local
50 IntersectionTree tree; in DEF_GRAPHITE_TEST() local
64 IntersectionTree tree; in DEF_GRAPHITE_TEST() local
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/bloat/
Dwebtreemap.js26 function focus(tree) { argument
53 function makeDom(tree, level) { argument
137 function layout(tree, level, width, height) { argument
/third_party/toybox/toys/other/
Dacpi.c44 static int acpi_callback(struct dirtree *tree) in acpi_callback()
85 static int temp_callback(struct dirtree *tree) in temp_callback()
108 static int cool_callback(struct dirtree *tree) in cool_callback()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
Dindex.js108 workspaceNodes (tree, workspaces) { argument
140 workspaceDependencySet (tree, workspaces, includeWorkspaceRoot) { argument
176 excludeWorkspacesDependencySet (tree) { argument
179 tree, property
/third_party/selinux/libsepol/cil/test/unit/
Dtest_cil_fqn.c49 struct cil_tree *tree; in test_cil_qualify_name() local
65 struct cil_tree *tree; in test_cil_qualify_name_cil_flavor() local
/third_party/node/deps/v8/third_party/zlib/
Dtrees.c161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
165 # define send_code(s, c, tree) \ argument
430 #define pqremove(s, tree, top) \ argument
441 #define smaller(tree, n, m, depth) \ argument
451 local void pqdownheap(s, tree, k) in pqdownheap() argument
490 ct_data *tree = desc->dyn_tree; local
572 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
619 ct_data *tree = desc->dyn_tree; local
703 local void scan_tree (s, tree, max_code) in scan_tree() argument
748 local void send_tree (s, tree, max_code) in send_tree() argument
/third_party/skia/third_party/externals/zlib/
Dtrees.c161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
165 # define send_code(s, c, tree) \ argument
430 #define pqremove(s, tree, top) \ argument
441 #define smaller(tree, n, m, depth) \ argument
451 local void pqdownheap(s, tree, k) in pqdownheap() argument
490 ct_data *tree = desc->dyn_tree; local
572 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
619 ct_data *tree = desc->dyn_tree; local
703 local void scan_tree (s, tree, max_code) in scan_tree() argument
748 local void send_tree (s, tree, max_code) in send_tree() argument
/third_party/libwebsockets/win32port/zlib/
Dtrees.c168 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
172 # define send_code(s, c, tree) \ argument
438 #define pqremove(s, tree, top) \ argument
449 #define smaller(tree, n, m, depth) \ argument
459 local void pqdownheap(s, tree, k) in pqdownheap() argument
498 ct_data *tree = desc->dyn_tree; local
581 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
627 ct_data *tree = desc->dyn_tree; local
711 local void scan_tree (s, tree, max_code) in scan_tree() argument
756 local void send_tree (s, tree, max_code) in send_tree() argument

12345678910