/dports/devel/brz/breezy-3.2.0/breezy/tests/per_workingtree/ |
H A D | test_workingtree.py | 1467 new_tree = tree.controldir.sprout( 1503 new_tree = tree.controldir.sprout( 1506 new_tree.add('foo') 1519 new_tree = tree.controldir.sprout( 1522 new_tree.add('foo') 1524 new_tree.commit('set reference') 1525 tree.pull(new_tree.branch) 1532 new_tree = tree.controldir.sprout( 1535 new_tree.add(['foo']) 1537 new_tree.commit('add reference') [all …]
|
/dports/www/drupal8/drupal-8.9.20/core/lib/Drupal/Core/Menu/ |
H A D | DefaultMenuLinkTreeManipulators.php | 228 $new_tree = []; 238 …$new_tree[(50000 + $instance->getWeight()) . ' ' . $instance->getTitle() . ' ' . $instance->getPlu… 240 ksort($new_tree); 241 return $new_tree;
|
/dports/www/drupal9/drupal-9.2.10/core/lib/Drupal/Core/Menu/ |
H A D | DefaultMenuLinkTreeManipulators.php | 226 $new_tree = []; 236 …$new_tree[(50000 + $instance->getWeight()) . ' ' . $instance->getTitle() . ' ' . $instance->getPlu… 238 ksort($new_tree); 239 return $new_tree;
|
/dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/src/strategy/ |
H A D | statics.rs | 79 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 81 let val = self.source.new_tree(runner)?; in new_tree() 175 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 176 self.source.new_tree(runner).map(|v| Map { in new_tree() 235 let mut case = input.new_tree(&mut runner).unwrap(); in test_static_filter()
|
H A D | unions.rs | 124 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 146 self.options[pick].1.new_tree(runner)?, in new_tree() 366 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 375 ((self.0).0).1.new_tree(runner)?) 383 ((self.0).$ix).1.new_tree(runner)?)) 490 let case = input.new_tree(&mut runner).unwrap(); in test_union() 528 counts[input.new_tree(&mut runner).unwrap().current()] += 1; in test_union_weighted() 567 let case = input.new_tree(&mut runner).unwrap(); in test_tuple_union() 605 counts[input.new_tree(&mut runner).unwrap().current()] += 1; in test_tuple_union_weighting() 629 if 0 == input.new_tree(&mut runner).unwrap().current() { in test_tuple_union_all_sizes()
|
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/src/strategy/ |
H A D | statics.rs | 79 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 81 let val = self.source.new_tree(runner)?; in new_tree() 175 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 176 self.source.new_tree(runner).map(|v| Map { in new_tree() 235 let mut case = input.new_tree(&mut runner).unwrap(); in test_static_filter()
|
H A D | unions.rs | 124 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 146 self.options[pick].1.new_tree(runner)?, in new_tree() 366 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 375 ((self.0).0).1.new_tree(runner)?) 383 ((self.0).$ix).1.new_tree(runner)?)) 490 let case = input.new_tree(&mut runner).unwrap(); in test_union() 528 counts[input.new_tree(&mut runner).unwrap().current()] += 1; in test_union_weighted() 567 let case = input.new_tree(&mut runner).unwrap(); in test_tuple_union() 605 counts[input.new_tree(&mut runner).unwrap().current()] += 1; in test_tuple_union_weighting() 629 if 0 == input.new_tree(&mut runner).unwrap().current() { in test_tuple_union_all_sizes()
|
/dports/net/kamailio/kamailio-5.4.5/src/modules/prefix_route/ |
H A D | tree.c | 355 struct tree *new_tree, *old_tree; in tree_swap() local 357 new_tree = tree_alloc(); in tree_swap() 358 if (NULL == new_tree) in tree_swap() 361 new_tree->root = root; in tree_swap() 368 *shared_tree = new_tree; in tree_swap()
|
/dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/src/strategy/ |
H A D | statics.rs | 79 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 81 let val = self.source.new_tree(runner)?; in new_tree() 175 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 176 self.source.new_tree(runner).map(|v| Map { in new_tree() 235 let mut case = input.new_tree(&mut runner).unwrap(); in test_static_filter()
|
H A D | unions.rs | 124 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 146 self.options[pick].1.new_tree(runner)?, in new_tree() 366 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 375 ((self.0).0).1.new_tree(runner)?) 383 ((self.0).$ix).1.new_tree(runner)?)) 490 let case = input.new_tree(&mut runner).unwrap(); in test_union() 528 counts[input.new_tree(&mut runner).unwrap().current()] += 1; in test_union_weighted() 567 let case = input.new_tree(&mut runner).unwrap(); in test_tuple_union() 605 counts[input.new_tree(&mut runner).unwrap().current()] += 1; in test_tuple_union_weighting() 629 if 0 == input.new_tree(&mut runner).unwrap().current() { in test_tuple_union_all_sizes()
|
/dports/net/freediameter/freeDiameter-1.5.0/extensions/acl_wl/ |
H A D | acl_wl.c | 137 struct fd_list new_tree; in sig_hdlr() local 138 new_tree = tree_root; in sig_hdlr() 141 tree_root = new_tree; in sig_hdlr()
|
/dports/graphics/evince/evince-41.3/cut-n-paste/unarr/rar/ |
H A D | huffman-rar.c | 17 void *new_tree = calloc(new_capacity, sizeof(*code->tree)); in rar_new_node() local 18 if (!new_tree) { in rar_new_node() 22 memcpy(new_tree, code->tree, code->capacity * sizeof(*code->tree)); in rar_new_node() 24 code->tree = new_tree; in rar_new_node()
|
/dports/archivers/unarr/unarr-1.0.1/rar/ |
H A D | huffman-rar.c | 17 void *new_tree = calloc(new_capacity, sizeof(*code->tree)); in rar_new_node() local 18 if (!new_tree) { in rar_new_node() 22 memcpy(new_tree, code->tree, code->capacity * sizeof(*code->tree)); in rar_new_node() 24 code->tree = new_tree; in rar_new_node()
|
/dports/astro/opencpn/OpenCPN-5.2.4/plugins/chartdldr_pi/src/unarr/rar/ |
H A D | huffman-rar.c | 17 void *new_tree = calloc(new_capacity, sizeof(*code->tree)); in rar_new_node() local 18 if (!new_tree) { in rar_new_node() 22 memcpy(new_tree, code->tree, code->capacity * sizeof(*code->tree)); in rar_new_node() 24 code->tree = new_tree; in rar_new_node()
|
/dports/graphics/peruse/peruse-8d1de5f4a7c4a6ca7444b0c55cb9aaa44a982a78/src/qtquick/karchive-rar/unarr/rar/ |
H A D | huffman-rar.c | 17 void *new_tree = calloc(new_capacity, sizeof(*code->tree)); in rar_new_node() local 18 if (!new_tree) { in rar_new_node() 22 memcpy(new_tree, code->tree, code->capacity * sizeof(*code->tree)); in rar_new_node() 24 code->tree = new_tree; in rar_new_node()
|
/dports/archivers/py-bup/bup-0.31/lib/cmd/ |
H A D | split-cmd.py | 178 new_tree = pack_writer.new_tree variable 182 new_tree = lambda shalist: git.calc_hash(b'tree', git.tree_encode(shalist)) function 197 hashsplit.split_to_blob_or_tree(new_blob, new_tree, files, 204 new_blob, new_tree, files, 206 tree = new_tree(shalist)
|
/dports/x11-toolkits/gtk30/gtk+-3.24.31/gtk/ |
H A D | gtkrbtree.h | 141 GtkRBTree **new_tree, 145 GtkRBTree **new_tree, 159 GtkRBTree **new_tree, 163 GtkRBTree **new_tree,
|
/dports/x11-toolkits/gtk40/gtk-4.4.1/gtk/ |
H A D | gtktreerbtreeprivate.h | 141 GtkTreeRBTree **new_tree, 145 GtkTreeRBTree **new_tree, 159 GtkTreeRBTree **new_tree, 163 GtkTreeRBTree **new_tree,
|
/dports/devel/libgit2/libgit2-1.3.0/tests/stress/ |
H A D | diff.c | 21 git_tree *tree, *new_tree; in test_with_many() local 59 (git_object **)&new_tree, g_repo, "HEAD^{tree}")); in test_with_many() 62 &diff, g_repo, tree, new_tree, &diffopts)); in test_with_many() 83 git_tree_free(new_tree); in test_with_many()
|
/dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/examples/ |
H A D | tutorial-strategy-play.rs | 20 let int_val = (0..100i32).new_tree(&mut runner).unwrap(); in main() 22 .new_tree(&mut runner) in main()
|
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/examples/ |
H A D | tutorial-strategy-play.rs | 20 let int_val = (0..100i32).new_tree(&mut runner).unwrap(); in main() 22 .new_tree(&mut runner) in main()
|
/dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/examples/ |
H A D | tutorial-strategy-play.rs | 20 let int_val = (0..100i32).new_tree(&mut runner).unwrap(); in main() 22 .new_tree(&mut runner) in main()
|
/dports/biology/infernal/infernal-1.1.3/easel/ |
H A D | esl_red_black.c | 654 ESL_RED_BLACK_DOUBLEKEY *tree, *new_tree, *node, **head, **tail; in main() local 668 new_tree = NULL; in main() 670 while(new_tree == NULL){ // handle the case where we generate the in main() 676 new_tree = esl_red_black_doublekey_insert(tree, node); in main() 678 tree = new_tree; in main() 714 new_tree = NULL; in main() 715 while(new_tree == NULL){ // handle the case where we generate the in main() 722 new_tree = esl_red_black_doublekey_insert(tree, node); in main() 724 tree = new_tree; in main()
|
/dports/biology/hmmer/hmmer-3.3/easel/ |
H A D | esl_red_black.c | 654 ESL_RED_BLACK_DOUBLEKEY *tree, *new_tree, *node, **head, **tail; in main() local 668 new_tree = NULL; in main() 670 while(new_tree == NULL){ // handle the case where we generate the in main() 676 new_tree = esl_red_black_doublekey_insert(tree, node); in main() 678 tree = new_tree; in main() 714 new_tree = NULL; in main() 715 while(new_tree == NULL){ // handle the case where we generate the in main() 722 new_tree = esl_red_black_doublekey_insert(tree, node); in main() 724 tree = new_tree; in main()
|
/dports/devel/pytype/pytype-2021.9.9/pytype/pytd/ |
H A D | visitors_test.py | 48 new_tree = visitors.LookupClasses(tree) 49 self.AssertSourceEquals(new_tree, src) 50 new_tree.Visit(visitors.VerifyLookup()) 88 new_tree.Visit(visitors.VerifyVisitor()) 89 self.AssertSourceEquals(new_tree, expected) 116 new_tree.Visit(visitors.VerifyVisitor()) 117 self.AssertSourceEquals(new_tree, expected) 136 self.AssertSourceEquals(new_tree, expected) 176 new_tree = tree.Visit(visitors.StripSelf()) 177 self.AssertSourceEquals(new_tree, expected) [all …]
|