/dports/devel/brz/breezy-3.2.0/breezy/tests/ |
H A D | test_smart_add.py | 61 new_tree.lock_write() 68 new_tree.unlock() 75 new_tree = self.make_branch_and_tree('new') 86 new_file_id = new_tree.path2id(fn) 91 new_tree = self.make_branch_and_tree('new') 102 new_tree.path2id('a')) 104 new_tree.path2id('b')) 115 c_id = new_tree.path2id('c') 121 d_id = new_tree.path2id('subdir/d') 131 new_tree.add(['subby'], [subdir_file_id]) [all …]
|
H A D | test_upgrade.py | 85 new_tree = workingtree.WorkingTree.open('tree') 86 self.assertIs(new_tree.__class__, workingtree_4.WorkingTree4) 87 self.assertEqual(b'null:', new_tree.last_revision()) 98 new_tree = workingtree.WorkingTree.open('tree') 99 self.assertIs(new_tree.__class__, workingtree_4.WorkingTree4) 100 self.assertEqual(b'null:', new_tree.last_revision()) 109 new_tree = workingtree.WorkingTree.open('tree') 110 self.assertIs(new_tree.__class__, workingtree_4.WorkingTree4) 111 self.assertEqual(rev_id, new_tree.last_revision()) 126 new_tree = workingtree.WorkingTree.open('tree') [all …]
|
/dports/net/samba412/samba-4.12.15/source4/dsdb/samdb/ldb_modules/ |
H A D | show_deleted.c | 49 struct ldb_parse_tree *new_tree = req->op.search.tree; in show_deleted_search() local 126 new_tree = talloc(req, struct ldb_parse_tree); in show_deleted_search() 127 if (!new_tree) { in show_deleted_search() 130 new_tree->operation = LDB_OP_AND; in show_deleted_search() 131 new_tree->u.list.num_elements = 2; in show_deleted_search() 132 new_tree->u.list.elements = talloc_array(new_tree, struct ldb_parse_tree *, 2); in show_deleted_search() 133 if (!new_tree->u.list.elements) { in show_deleted_search() 137 new_tree->u.list.elements[0] = talloc(new_tree->u.list.elements, struct ldb_parse_tree); in show_deleted_search() 139 new_tree->u.list.elements[0]->u.isnot.child = in show_deleted_search() 141 if (!new_tree->u.list.elements[0]->u.isnot.child) { in show_deleted_search() [all …]
|
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/TmpFactorDir/ |
H A D | DUPZfactor_liftq.c | 163 new_tree->g = g1->g; g1->g = NULL; 164 new_tree->h = h1->g; h1->g = NULL; 165 new_tree->g_lifter = g1->g_lifter; 166 new_tree->h_lifter = h1->g_lifter; 169 DUPZmod3(new_tree->corr_factor, new_tree->g, Q); 179 DUPZmod3(new_tree->corr_factor, new_tree->h, Q); 180 DUPZmul3(new_tree->corr_factor, new_tree->corr_factor, new_tree->g); 181 DUPZmod3(new_tree->corr_factor, new_tree->h, Q); 182 DUPZneg(new_tree->corr_factor); 183 DUPZadd3(new_tree->corr_factor, new_tree->corr_factor, 1); [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/TmpFactorDir/ |
H A D | DUPZfactor_liftq.c | 163 new_tree->g = g1->g; g1->g = NULL; 164 new_tree->h = h1->g; h1->g = NULL; 165 new_tree->g_lifter = g1->g_lifter; 166 new_tree->h_lifter = h1->g_lifter; 169 DUPZmod3(new_tree->corr_factor, new_tree->g, Q); 179 DUPZmod3(new_tree->corr_factor, new_tree->h, Q); 180 DUPZmul3(new_tree->corr_factor, new_tree->corr_factor, new_tree->g); 181 DUPZmod3(new_tree->corr_factor, new_tree->h, Q); 182 DUPZneg(new_tree->corr_factor); 183 DUPZadd3(new_tree->corr_factor, new_tree->corr_factor, 1); [all …]
|
/dports/textproc/scew/scew-1.2.0/scew/ |
H A D | tree.c | 80 scew_tree *new_tree = NULL; in scew_tree_copy() local 84 new_tree = calloc (1, sizeof (scew_tree)); in scew_tree_copy() 86 if (new_tree != NULL) in scew_tree_copy() 90 new_tree->version = scew_strdup (tree->version); in scew_tree_copy() 91 new_tree->encoding = scew_strdup (tree->encoding); in scew_tree_copy() 92 new_tree->preamble = scew_strdup (tree->preamble); in scew_tree_copy() 93 new_tree->standalone = tree->standalone; in scew_tree_copy() 94 new_tree->root = scew_element_copy (tree->root); in scew_tree_copy() 104 scew_tree_free (new_tree); in scew_tree_copy() 105 new_tree = NULL; in scew_tree_copy() [all …]
|
/dports/cad/openroad/OpenROAD-2.0/src/mpl/src/ParquetFP/src/ |
H A D | btreecompact.h | 47 inline void operator=(const BTree& new_tree); 48 inline void slimAssign(const BTree& new_tree); // suffices if evaluation 91 inline void BTreeCompactor::operator=(const BTree& new_tree) 93 this->BTree::operator=(new_tree); 98 in_orth_tree[i].block_index = new_tree.tree[i].block_index; 100 OrientedPacking::ORIENT(new_tree.tree[i].orient)); 104 inline void BTreeCompactor::slimAssign(const BTree& new_tree) in slimAssign() argument 106 in_tree = new_tree.tree; in slimAssign() 107 in_blockArea = new_tree.blockArea(); in slimAssign() 112 in_orth_tree[i].block_index = new_tree.tree[i].block_index; in slimAssign() [all …]
|
/dports/devel/p5-Tree-Simple-VisitorFactory/Tree-Simple-VisitorFactory-0.16/lib/Tree/Simple/Visitor/ |
H A D | LoadClassHierarchy.pm | 57 … my $new_tree = Tree::Simple->new(defined $filter ? $filter->($class_to_load) : $class_to_load); 58 $tree->addChild($new_tree); 60 $self->_loadMethods($new_tree, $class_to_load, $filter); 62 $tree = $new_tree; 77 my $new_tree = Tree::Simple->new(defined $filter ? $filter->($superclass) : $superclass); 78 $tree->addChild($new_tree); 80 $self->_loadMethods($new_tree, $superclass, $filter); 82 $self->_loadClass($new_tree, $superclass, $filter);
|
H A D | FromNestedHash.pm | 55 my $new_tree; 58 $new_tree = $tree; 61 $new_tree = Tree::Simple->new($node); 62 $tree->addChild($new_tree); 64 $self->_buildTree($new_tree, $hash->{$key}, $node_filter)
|
H A D | FromNestedArray.pm | 71 my $new_tree; 74 $new_tree = $tree; 77 $new_tree = Tree::Simple->new($node); 78 $tree->addChild($new_tree); 88 $self->_buildTree($new_tree, $array->[$i++], $node_filter)
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/sparc/kernel/ |
H A D | cpumap.c | 187 struct cpuinfo_tree *new_tree; in build_cpuinfo_tree() local 197 new_tree = kzalloc(struct_size(new_tree, nodes, n), GFP_ATOMIC); in build_cpuinfo_tree() 198 if (!new_tree) in build_cpuinfo_tree() 201 new_tree->total_nodes = n; in build_cpuinfo_tree() 208 n = new_tree->level[level].start_index; in build_cpuinfo_tree() 211 node = &new_tree->nodes[n]; in build_cpuinfo_tree() 215 kfree(new_tree); in build_cpuinfo_tree() 246 kfree(new_tree); in build_cpuinfo_tree() 252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree() 277 node = &new_tree->nodes[n]; in build_cpuinfo_tree() [all …]
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/sparc/kernel/ |
H A D | cpumap.c | 187 struct cpuinfo_tree *new_tree; in build_cpuinfo_tree() local 197 new_tree = kzalloc(struct_size(new_tree, nodes, n), GFP_ATOMIC); in build_cpuinfo_tree() 198 if (!new_tree) in build_cpuinfo_tree() 201 new_tree->total_nodes = n; in build_cpuinfo_tree() 208 n = new_tree->level[level].start_index; in build_cpuinfo_tree() 211 node = &new_tree->nodes[n]; in build_cpuinfo_tree() 215 kfree(new_tree); in build_cpuinfo_tree() 246 kfree(new_tree); in build_cpuinfo_tree() 252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree() 277 node = &new_tree->nodes[n]; in build_cpuinfo_tree() [all …]
|
/dports/multimedia/libv4l/linux-5.13-rc2/arch/sparc/kernel/ |
H A D | cpumap.c | 187 struct cpuinfo_tree *new_tree; in build_cpuinfo_tree() local 197 new_tree = kzalloc(struct_size(new_tree, nodes, n), GFP_ATOMIC); in build_cpuinfo_tree() 198 if (!new_tree) in build_cpuinfo_tree() 201 new_tree->total_nodes = n; in build_cpuinfo_tree() 208 n = new_tree->level[level].start_index; in build_cpuinfo_tree() 211 node = &new_tree->nodes[n]; in build_cpuinfo_tree() 215 kfree(new_tree); in build_cpuinfo_tree() 246 kfree(new_tree); in build_cpuinfo_tree() 252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree() 277 node = &new_tree->nodes[n]; in build_cpuinfo_tree() [all …]
|
/dports/devel/py-lxml/lxml-4.7.1/src/lxml/tests/ |
H A D | test_sax.py | 64 root = new_tree.getroot() 73 root = new_tree.getroot() 146 root = new_tree.getroot() 153 root = new_tree.getroot() 174 new_tree = handler.etree 175 root = new_tree.getroot() 198 new_tree = handler.etree 222 new_tree = handler.etree 242 new_tree = handler.etree 257 new_tree = handler.etree [all …]
|
/dports/www/netsurf/netsurf-3.10/frontends/atari/gemtk/ |
H A D | objc.c | 179 OBJECT *new_tree; in gemtk_obj_tree_copy() local 265 new_tree[i] = tree[i]; in gemtk_obj_tree_copy() 268 new_tree[i].ob_type = tree[i].ob_type; in gemtk_obj_tree_copy() 278 new_tree[i].ob_spec.tedinfo = (TEDINFO *)area; in gemtk_obj_tree_copy() 284 new_tree[i].ob_spec.tedinfo->te_ptext = area; in gemtk_obj_tree_copy() 288 new_tree[i].ob_spec.tedinfo->te_ptmplt = area; in gemtk_obj_tree_copy() 292 new_tree[i].ob_spec.tedinfo->te_pvalid = area; in gemtk_obj_tree_copy() 301 new_tree[i].ob_spec.bitblk = (BITBLK *)area; in gemtk_obj_tree_copy() 329 new_tree[i].ob_spec.free_string = area; in gemtk_obj_tree_copy() 357 new_tree[i].ob_spec.iconblk->ib_ptext = area; in gemtk_obj_tree_copy() [all …]
|
/dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/src/strategy/ |
H A D | flatten.rs | 40 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() function 41 let meta = self.source.new_tree(runner)?; in new_tree() 111 let current = meta.current().new_tree(runner)?; 212 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 213 let inner = self.0.new_tree(runner)?; 214 inner.current().new_tree(runner) 251 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 252 let left = self.source.new_tree(runner)?; 254 let right = right_source.new_tree(runner)?; 285 let case = input.new_tree(&mut runner).unwrap(); [all …]
|
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/src/strategy/ |
H A D | flatten.rs | 40 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() function 41 let meta = self.source.new_tree(runner)?; in new_tree() 111 let current = meta.current().new_tree(runner)?; 212 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 213 let inner = self.0.new_tree(runner)?; 214 inner.current().new_tree(runner) 251 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 252 let left = self.source.new_tree(runner)?; 254 let right = right_source.new_tree(runner)?; 285 let case = input.new_tree(&mut runner).unwrap(); [all …]
|
/dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/src/strategy/ |
H A D | flatten.rs | 40 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() function 41 let meta = self.source.new_tree(runner)?; in new_tree() 111 let current = meta.current().new_tree(runner)?; 212 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 213 let inner = self.0.new_tree(runner)?; 214 inner.current().new_tree(runner) 251 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { 252 let left = self.source.new_tree(runner)?; 254 let right = right_source.new_tree(runner)?; 285 let case = input.new_tree(&mut runner).unwrap(); [all …]
|
/dports/shells/ksh2020/ast-ksh2020/src/lib/libast/path/ |
H A D | pathexists.c | 123 Tree_t *new_tree; in pathexists() local 127 new_tree = calloc(1, sizeof(Tree_t) + strlen(current_path_component)); in pathexists() 128 if (!new_tree) { in pathexists() 132 strcpy(new_tree->name, current_path_component); in pathexists() 133 new_tree->next = current_tree->tree; in pathexists() 134 current_tree->tree = new_tree; in pathexists() 136 current_tree = new_tree; in pathexists()
|
/dports/multimedia/vcdimager/vcdimager-2.0.1/lib/ |
H A D | data_structures.c | 138 VcdTree_t *new_tree; in _vcd_tree_new() local 140 new_tree = calloc(1, sizeof (VcdTree_t)); in _vcd_tree_new() 142 new_tree->root = calloc(1, sizeof (VcdTreeNode_t)); in _vcd_tree_new() 144 new_tree->root->data = root_data; in _vcd_tree_new() 145 new_tree->root->tree = new_tree; in _vcd_tree_new() 146 new_tree->root->parent = NULL; in _vcd_tree_new() 147 new_tree->root->children = NULL; in _vcd_tree_new() 148 new_tree->root->listnode = NULL; in _vcd_tree_new() 150 return new_tree; in _vcd_tree_new()
|
/dports/devel/brz/breezy-3.2.0/breezy/ |
H A D | diff.py | 477 return (old_tree, new_tree, old_branch, new_branch, 524 exit_stack.enter_context(new_tree.lock_read()) 569 self.new_tree = new_tree 578 return klass(diff_tree.old_tree, diff_tree.new_tree, 729 new_date = _patch_header_date(self.new_tree, new_path) 758 to_text = _get_text(self.new_tree, to_path) 899 new_path, self.new_tree, 'new', force_temp, 968 self.new_tree = new_tree 978 def from_trees_options(klass, old_tree, new_tree, to_file, argument 1030 iterator = self.new_tree.iter_changes(self.old_tree, [all …]
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
H A D | tree-inline.c | 272 new_tree = make_ssa_name (new_tree); in remap_ssa_name() 407 new_tree = build_type_attribute_qual_variant (new_tree, in remap_type_1() 419 new_tree = build_type_attribute_qual_variant (new_tree, in remap_type_1() 442 TYPE_MAIN_VARIANT (new_tree) = new_tree; in remap_type_1() 462 if (TYPE_MAIN_VARIANT (new_tree) != new_tree) in remap_type_1() 483 if (TYPE_MAIN_VARIANT (new_tree) != new_tree in remap_type_1() 488 if (TYPE_MAIN_VARIANT (new_tree) != new_tree in remap_type_1() 496 if (TYPE_MAIN_VARIANT (new_tree) != new_tree in remap_type_1() 500 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id); in remap_type_1() 502 if (TYPE_MAIN_VARIANT (new_tree) != new_tree) in remap_type_1() [all …]
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/ |
H A D | tree-inline.c | 272 new_tree = make_ssa_name (new_tree); in remap_ssa_name() 407 new_tree = build_type_attribute_qual_variant (new_tree, in remap_type_1() 419 new_tree = build_type_attribute_qual_variant (new_tree, in remap_type_1() 442 TYPE_MAIN_VARIANT (new_tree) = new_tree; in remap_type_1() 462 if (TYPE_MAIN_VARIANT (new_tree) != new_tree) in remap_type_1() 483 if (TYPE_MAIN_VARIANT (new_tree) != new_tree in remap_type_1() 488 if (TYPE_MAIN_VARIANT (new_tree) != new_tree in remap_type_1() 496 if (TYPE_MAIN_VARIANT (new_tree) != new_tree in remap_type_1() 500 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id); in remap_type_1() 502 if (TYPE_MAIN_VARIANT (new_tree) != new_tree) in remap_type_1() [all …]
|
/dports/devel/brz/breezy-3.2.0/breezy/tests/blackbox/ |
H A D | test_add.py | 159 new_tree = self.make_branch_and_tree('new') 169 new_tree = new_tree.controldir.open_workingtree() 170 self.assertEqual(base_tree.path2id('a'), new_tree.path2id('a')) 171 self.assertEqual(base_tree.path2id('b'), new_tree.path2id('b')) 172 self.assertEqual(base_tree.path2id('b/c'), new_tree.path2id('b/c')) 180 new_tree = self.make_branch_and_tree('new') 190 new_tree = new_tree.controldir.open_workingtree('new') 191 self.assertEqual(base_tree.path2id('b/c'), new_tree.path2id('c')) 192 self.assertEqual(base_tree.path2id('b/d'), new_tree.path2id('d'))
|
/dports/devel/p5-Tree-Parser/Tree-Parser-0.15/lib/Tree/ |
H A D | Parser.pm | 416 my $new_tree; 421 $new_tree = $node; 426 $new_tree = $tree_type->new($node); 430 $current_tree->addChild($new_tree); 431 $current_tree = $new_tree; 436 $current_tree->addSibling($new_tree); 437 $current_tree = $new_tree; 442 $current_tree->addChild($new_tree); 443 $current_tree = $new_tree; 447 $current_tree->addSibling($new_tree); [all …]
|