/dports/devel/R-cran-git2r/git2r/R/ |
H A D | diff.R | 244 new_tree = NULL, argument 272 if (!is.null(new_tree)) { 273 if (!inherits(new_tree, "git_tree")) { 276 if (x$repo$path != new_tree$repo$path) { 287 .Call(git2r_diff, NULL, x, new_tree, index, filename,
|
/dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/src/ |
H A D | array.rs | 106 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 108 tree: [$(self[$ix].new_tree(runner)?,)*], 120 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 124 self.strategy.new_tree(runner)? 264 let mut case = input.new_tree(&mut runner).unwrap(); in shrinks_fully_ltr()
|
H A D | bits.rs | 201 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 273 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 530 let value = input.new_tree(&mut runner).unwrap().current(); in generates_values_in_range() 542 accum |= input.new_tree(&mut runner).unwrap().current(); in generates_values_in_mask() 561 let v = input.new_tree(&mut runner).unwrap().current(); in mask_bounds_for_bitset_correct() 580 let v = input.new_tree(&mut runner).unwrap().current(); in mask_bounds_for_vecbool_correct() 596 let mut value = input.new_tree(&mut runner).unwrap(); in shrinks_to_zero() 619 let mut value = input.new_tree(&mut runner).unwrap(); in complicates_to_previous() 636 let value = input.new_tree(&mut runner).unwrap().current(); in sampled_selects_correct_sizes_and_bits() 666 let mut value = input.new_tree(&mut runner).unwrap(); in sampled_doesnt_shrink_below_min_size()
|
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/src/ |
H A D | array.rs | 106 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 108 tree: [$(self[$ix].new_tree(runner)?,)*], 120 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 124 self.strategy.new_tree(runner)? 264 let mut case = input.new_tree(&mut runner).unwrap(); in shrinks_fully_ltr()
|
H A D | bits.rs | 201 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 273 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 530 let value = input.new_tree(&mut runner).unwrap().current(); in generates_values_in_range() 542 accum |= input.new_tree(&mut runner).unwrap().current(); in generates_values_in_mask() 561 let v = input.new_tree(&mut runner).unwrap().current(); in mask_bounds_for_bitset_correct() 580 let v = input.new_tree(&mut runner).unwrap().current(); in mask_bounds_for_vecbool_correct() 596 let mut value = input.new_tree(&mut runner).unwrap(); in shrinks_to_zero() 619 let mut value = input.new_tree(&mut runner).unwrap(); in complicates_to_previous() 636 let value = input.new_tree(&mut runner).unwrap().current(); in sampled_selects_correct_sizes_and_bits() 666 let mut value = input.new_tree(&mut runner).unwrap(); in sampled_doesnt_shrink_below_min_size()
|
/dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/src/ |
H A D | array.rs | 106 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 108 tree: [$(self[$ix].new_tree(runner)?,)*], 120 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 124 self.strategy.new_tree(runner)? 264 let mut case = input.new_tree(&mut runner).unwrap(); in shrinks_fully_ltr()
|
H A D | bits.rs | 201 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 273 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method 530 let value = input.new_tree(&mut runner).unwrap().current(); in generates_values_in_range() 542 accum |= input.new_tree(&mut runner).unwrap().current(); in generates_values_in_mask() 561 let v = input.new_tree(&mut runner).unwrap().current(); in mask_bounds_for_bitset_correct() 580 let v = input.new_tree(&mut runner).unwrap().current(); in mask_bounds_for_vecbool_correct() 596 let mut value = input.new_tree(&mut runner).unwrap(); in shrinks_to_zero() 619 let mut value = input.new_tree(&mut runner).unwrap(); in complicates_to_previous() 636 let value = input.new_tree(&mut runner).unwrap().current(); in sampled_selects_correct_sizes_and_bits() 666 let mut value = input.new_tree(&mut runner).unwrap(); in sampled_doesnt_shrink_below_min_size()
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/tools/clang-format/ |
H A D | git-clang-format | 162 new_tree = run_clang_format_and_save_to_tree(changed_lines, 168 new_tree = run_clang_format_and_save_to_tree(changed_lines, 173 print('new tree: %s' % new_tree) 174 if old_tree == new_tree: 178 print_diff(old_tree, new_tree) 180 changed_files = apply_changes(old_tree, new_tree, force=opts.force, 497 def print_diff(old_tree, new_tree): 510 def apply_changes(old_tree, new_tree, force=False, patch_mode=False): 517 new_tree).rstrip('\0').split('\0') 534 subprocess.check_call(['git', 'checkout', '--patch', new_tree]) [all …]
|
/dports/lang/clang-mesa/clang-13.0.1.src/tools/clang-format/ |
H A D | git-clang-format | 162 new_tree = run_clang_format_and_save_to_tree(changed_lines, 168 new_tree = run_clang_format_and_save_to_tree(changed_lines, 173 print('new tree: %s' % new_tree) 174 if old_tree == new_tree: 178 print_diff(old_tree, new_tree) 180 changed_files = apply_changes(old_tree, new_tree, force=opts.force, 496 def print_diff(old_tree, new_tree): 509 def apply_changes(old_tree, new_tree, force=False, patch_mode=False): 516 new_tree).rstrip('\0').split('\0') 533 subprocess.check_call(['git', 'checkout', '--patch', new_tree]) [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/clang/tools/clang-format/ |
H A D | git-clang-format | 162 new_tree = run_clang_format_and_save_to_tree(changed_lines, 168 new_tree = run_clang_format_and_save_to_tree(changed_lines, 173 print('new tree: %s' % new_tree) 174 if old_tree == new_tree: 178 print_diff(old_tree, new_tree) 180 changed_files = apply_changes(old_tree, new_tree, force=opts.force, 496 def print_diff(old_tree, new_tree): 509 def apply_changes(old_tree, new_tree, force=False, patch_mode=False): 516 new_tree).rstrip('\0').split('\0') 533 subprocess.check_call(['git', 'checkout', '--patch', new_tree]) [all …]
|
/dports/devel/pytype/pytype-2021.9.9/pytype/pytd/ |
H A D | optimize_test.py | 41 new_tree = self.Optimize(tree) 42 return pytd_utils.Print(new_tree) 809 new_tree = tree.Visit(optimize.AbsorbMutableParameters()) 810 new_tree = new_tree.Visit(optimize.CombineContainers()) 811 self.AssertSourceEquals(new_tree, expected) 825 new_tree = tree.Visit(optimize.AbsorbMutableParameters()) 826 new_tree = new_tree.Visit(optimize.CombineContainers()) 827 self_type = new_tree.Lookup("MyClass").Lookup( 874 new_tree = tree.Visit(optimize.MergeTypeParameters()) 875 self.AssertSourceEquals(new_tree, expected)
|
/dports/devel/brz/breezy-3.2.0/breezy/ |
H A D | status.py | 326 def _filter_nonexistent(orig_paths, old_tree, new_tree): argument 343 s = new_tree.filter_unversioned_files(s) 344 nonexistent = [path for path in s if not new_tree.has_filename(path)] 399 def __init__(self, old_tree, new_tree, to_file, versioned, show_ids, argument 415 self.new_tree = new_tree 428 self.__class__.__name__, self.old_tree, self.new_tree, 442 get_shelf_manager = getattr(params.new_tree, 'get_shelf_manager', None)
|
/dports/math/py-pymc3/pymc-3.11.4/pymc3/step_methods/ |
H A D | pgbart.py | 152 new_tree = np.random.choice(particles, p=normalized_weights) 153 self.old_trees_particles_list[tree.tree_id] = new_tree 154 bart.trees[idx] = new_tree.tree 155 bart.sum_trees_output += new_tree.tree.predict_output() 159 self.sum_trees.append(new_tree.tree) 163 for index in new_tree.used_variates: 210 new_tree = Tree.init_tree( 219 ParticleTree(new_tree, prior_prob, self.init_log_weight, self.init_likelihood)
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/paint/compositing/ |
H A D | graphics_layer_tree_as_text.cc | 88 String new_tree = GraphicsLayerTreeAsTextForTesting(root, flags); in VerboseLogGraphicsLayerTree() local 90 if (it == s_previous_trees.end() || it->value != new_tree) { in VerboseLogGraphicsLayerTree() 91 VLOG(2) << "GraphicsLayer tree:\n" << new_tree.Utf8(); in VerboseLogGraphicsLayerTree() 92 s_previous_trees.Set(root, new_tree); in VerboseLogGraphicsLayerTree()
|
/dports/lang/rust/rustc-1.58.1-src/src/tools/rust-analyzer/crates/ide_assists/src/handlers/ |
H A D | split_import.rs | 22 let new_tree = use_tree.split_prefix(&path); in split_import() localVariable 23 if new_tree == use_tree { in split_import() 29 edit.replace_ast(use_tree, new_tree); in split_import()
|
/dports/devel/tla/tla-1.3.5/src/hackerlab/splay/ |
H A D | fsplay.c | 999 t_fsplay_tree new_tree) in fsplay_insert_after() argument 1003 fsplay_ref (type, new_tree); in fsplay_insert_after() 1004 return new_tree; in fsplay_insert_after() 1006 else if (!new_tree) in fsplay_insert_after() 1049 N_prime = fsplay_make_splayed_node (type, new_tree, T_prime, tree->right); in fsplay_insert_after() 1070 t_fsplay_tree new_tree) in fsplay_insert_before() argument 1074 fsplay_ref (type, new_tree); in fsplay_insert_before() 1075 return new_tree; in fsplay_insert_before() 1077 else if (!new_tree) in fsplay_insert_before() 1120 N_prime = fsplay_make_splayed_node (type, new_tree, tree->left, T_prime); in fsplay_insert_before()
|
/dports/dns/p5-DNS-Ldns/ldns-1.8.1/ |
H A D | dnssec_verify.c | 450 new_tree->rr = NULL; in ldns_dnssec_trust_tree_new() 451 new_tree->rrset = NULL; in ldns_dnssec_trust_tree_new() 452 new_tree->parent_count = 0; in ldns_dnssec_trust_tree_new() 454 return new_tree; in ldns_dnssec_trust_tree_new() 698 if(!new_tree) in ldns_dnssec_derive_trust_tree_time() 715 new_tree->rr = cur_rr; in ldns_dnssec_derive_trust_tree_time() 754 new_tree, in ldns_dnssec_derive_trust_tree_time() 762 new_tree, in ldns_dnssec_derive_trust_tree_time() 782 return new_tree; in ldns_dnssec_derive_trust_tree_time() 1001 new_tree->rr, in ldns_dnssec_derive_trust_tree_no_sig_time() [all …]
|
/dports/dns/py-ldns/ldns-1.8.1/ |
H A D | dnssec_verify.c | 450 new_tree->rr = NULL; in ldns_dnssec_trust_tree_new() 451 new_tree->rrset = NULL; in ldns_dnssec_trust_tree_new() 452 new_tree->parent_count = 0; in ldns_dnssec_trust_tree_new() 454 return new_tree; in ldns_dnssec_trust_tree_new() 698 if(!new_tree) in ldns_dnssec_derive_trust_tree_time() 715 new_tree->rr = cur_rr; in ldns_dnssec_derive_trust_tree_time() 754 new_tree, in ldns_dnssec_derive_trust_tree_time() 762 new_tree, in ldns_dnssec_derive_trust_tree_time() 782 return new_tree; in ldns_dnssec_derive_trust_tree_time() 1001 new_tree->rr, in ldns_dnssec_derive_trust_tree_no_sig_time() [all …]
|
/dports/dns/ldns/ldns-1.8.1/ |
H A D | dnssec_verify.c | 450 new_tree->rr = NULL; in ldns_dnssec_trust_tree_new() 451 new_tree->rrset = NULL; in ldns_dnssec_trust_tree_new() 452 new_tree->parent_count = 0; in ldns_dnssec_trust_tree_new() 454 return new_tree; in ldns_dnssec_trust_tree_new() 698 if(!new_tree) in ldns_dnssec_derive_trust_tree_time() 715 new_tree->rr = cur_rr; in ldns_dnssec_derive_trust_tree_time() 754 new_tree, in ldns_dnssec_derive_trust_tree_time() 762 new_tree, in ldns_dnssec_derive_trust_tree_time() 782 return new_tree; in ldns_dnssec_derive_trust_tree_time() 1001 new_tree->rr, in ldns_dnssec_derive_trust_tree_no_sig_time() [all …]
|
/dports/x11-toolkits/gtk20/gtk+-2.24.33/gtk/ |
H A D | gtkrbtree.c | 1040 *new_tree = NULL; in _gtk_rbtree_real_find_offset() 1062 *new_tree = NULL; in _gtk_rbtree_real_find_offset() 1072 *new_tree = tree; in _gtk_rbtree_real_find_offset() 1082 new_tree, in _gtk_rbtree_real_find_offset() 1085 *new_tree = tree; in _gtk_rbtree_real_find_offset() 1354 *new_tree = tree; in _gtk_rbtree_next_full() 1358 (*new_tree != NULL)) in _gtk_rbtree_next_full() 1361 *new_tree = (*new_tree)->parent_tree; in _gtk_rbtree_next_full() 1362 if (*new_tree) in _gtk_rbtree_next_full() 1378 *new_tree = tree; in _gtk_rbtree_prev_full() [all …]
|
/dports/net/mpich/mpich-3.4.3/modules/hwloc/netloc/ |
H A D | architecture.c | 338 netloc_arch_tree_t *new_tree = in netloc_arch_set_current_resources() local 341 arch->arch.global_tree = new_tree; in netloc_arch_set_current_resources() 472 netloc_arch_tree_t *new_tree = in netloc_arch_set_global_resources() local 475 arch->arch.global_tree = new_tree; in netloc_arch_set_global_resources() 490 netloc_arch_tree_t *new_tree = (netloc_arch_tree_t *) in tree_merge() local 494 new_tree->num_levels = num_levels; in tree_merge() 498 memcpy(new_tree->degrees, main->degrees, in tree_merge() 501 sub->num_levels*sizeof(*new_tree->degrees)); in tree_merge() 507 memcpy(new_tree->cost+main->num_levels, sub->cost, in tree_merge() 508 sub->num_levels*sizeof(*new_tree->cost)); in tree_merge() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/pm/hydra2/libhydra/topo/hwloc/hwloc/netloc/ |
H A D | architecture.c | 338 netloc_arch_tree_t *new_tree = in netloc_arch_set_current_resources() local 341 arch->arch.global_tree = new_tree; in netloc_arch_set_current_resources() 472 netloc_arch_tree_t *new_tree = in netloc_arch_set_global_resources() local 475 arch->arch.global_tree = new_tree; in netloc_arch_set_global_resources() 490 netloc_arch_tree_t *new_tree = (netloc_arch_tree_t *) in tree_merge() local 494 new_tree->num_levels = num_levels; in tree_merge() 498 memcpy(new_tree->degrees, main->degrees, in tree_merge() 501 sub->num_levels*sizeof(*new_tree->degrees)); in tree_merge() 507 memcpy(new_tree->cost+main->num_levels, sub->cost, in tree_merge() 508 sub->num_levels*sizeof(*new_tree->cost)); in tree_merge() [all …]
|
/dports/net/mpich/mpich-3.4.3/src/pm/hydra/tools/topo/hwloc/hwloc/netloc/ |
H A D | architecture.c | 338 netloc_arch_tree_t *new_tree = in netloc_arch_set_current_resources() local 341 arch->arch.global_tree = new_tree; in netloc_arch_set_current_resources() 472 netloc_arch_tree_t *new_tree = in netloc_arch_set_global_resources() local 475 arch->arch.global_tree = new_tree; in netloc_arch_set_global_resources() 490 netloc_arch_tree_t *new_tree = (netloc_arch_tree_t *) in tree_merge() local 494 new_tree->num_levels = num_levels; in tree_merge() 498 memcpy(new_tree->degrees, main->degrees, in tree_merge() 501 sub->num_levels*sizeof(*new_tree->degrees)); in tree_merge() 507 memcpy(new_tree->cost+main->num_levels, sub->cost, in tree_merge() 508 sub->num_levels*sizeof(*new_tree->cost)); in tree_merge() [all …]
|
/dports/devel/hwloc2/hwloc-2.5.0/netloc/ |
H A D | architecture.c | 338 netloc_arch_tree_t *new_tree = in netloc_arch_set_current_resources() local 341 arch->arch.global_tree = new_tree; in netloc_arch_set_current_resources() 472 netloc_arch_tree_t *new_tree = in netloc_arch_set_global_resources() local 475 arch->arch.global_tree = new_tree; in netloc_arch_set_global_resources() 490 netloc_arch_tree_t *new_tree = (netloc_arch_tree_t *) in tree_merge() local 494 new_tree->num_levels = num_levels; in tree_merge() 498 memcpy(new_tree->degrees, main->degrees, in tree_merge() 501 sub->num_levels*sizeof(*new_tree->degrees)); in tree_merge() 507 memcpy(new_tree->cost+main->num_levels, sub->cost, in tree_merge() 508 sub->num_levels*sizeof(*new_tree->cost)); in tree_merge() [all …]
|
/dports/math/gap/gap-4.11.0/pkg/ToolsForHomalg-2019.09.02/gap/ |
H A D | Trees.gi | 150 local succ, new_tree, new_succ, i; 154 new_tree := succ[ 1 ]; 156 new_succ := new_tree!.successor; 158 new_tree!.predecessor := fail; 164 succ[ i ]!.predecessor := new_tree; 168 return new_tree;
|