| /dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/src/strategy/ |
| H A D | just.rs | 43 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
93 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
134 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
|
| H A D | recursive.rs | 82 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
136 strat.new_tree(runner) in new_tree()
183 let tree = strat.new_tree(&mut runner).unwrap().current(); in test_recursive()
203 let mut value = strat.new_tree(&mut runner).unwrap(); in simplifies_to_non_recursive()
|
| H A D | shuffle.rs | 97 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() function
100 self.0.new_tree(runner).map(|inner| ShuffleValueTree { in new_tree()
231 let mut value = input.new_tree(&mut runner).unwrap().current(); in generates_different_permutations()
250 let mut value = input.new_tree(&mut runner).unwrap(); in simplify_reduces_shuffle_amount()
|
| H A D | filter.rs | 59 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
61 let val = self.source.new_tree(runner)?; in new_tree()
124 let mut case = input.new_tree(&mut runner).unwrap(); in test_filter()
|
| /dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/src/strategy/ |
| H A D | just.rs | 43 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
93 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
134 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
|
| H A D | recursive.rs | 82 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
136 strat.new_tree(runner) in new_tree()
183 let tree = strat.new_tree(&mut runner).unwrap().current(); in test_recursive()
203 let mut value = strat.new_tree(&mut runner).unwrap(); in simplifies_to_non_recursive()
|
| H A D | shuffle.rs | 97 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() function
100 self.0.new_tree(runner).map(|inner| ShuffleValueTree { in new_tree()
231 let mut value = input.new_tree(&mut runner).unwrap().current(); in generates_different_permutations()
250 let mut value = input.new_tree(&mut runner).unwrap(); in simplify_reduces_shuffle_amount()
|
| H A D | filter.rs | 59 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
61 let val = self.source.new_tree(runner)?; in new_tree()
124 let mut case = input.new_tree(&mut runner).unwrap(); in test_filter()
|
| /dports/devel/p5-Tree-Simple-VisitorFactory/Tree-Simple-VisitorFactory-0.16/lib/Tree/Simple/Visitor/ |
| H A D | LoadDirectoryTree.pm | 98 my $new_tree = $t->new($item);
99 $t->addChild($new_tree);
100 $self->_recursiveLoad($new_tree, $full_path);
|
| /dports/devel/ncnf/ncnf-3.0.1/src/ |
| H A D | ncnf_find.c | 108 char *new_tree; in _na_find_objects() local
116 p = new_tree = alloca(combined_len + 1); in _na_find_objects()
126 ll_result = _na_find_objects(obj, new_tree, in _na_find_objects()
|
| /dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/src/strategy/ |
| H A D | just.rs | 43 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
93 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
134 fn new_tree(&self, _: &mut TestRunner) -> NewTree<Self> { in new_tree() method
|
| H A D | recursive.rs | 82 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
136 strat.new_tree(runner) in new_tree()
183 let tree = strat.new_tree(&mut runner).unwrap().current(); in test_recursive()
203 let mut value = strat.new_tree(&mut runner).unwrap(); in simplifies_to_non_recursive()
|
| H A D | shuffle.rs | 97 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() function
100 self.0.new_tree(runner).map(|inner| ShuffleValueTree { in new_tree()
231 let mut value = input.new_tree(&mut runner).unwrap().current(); in generates_different_permutations()
250 let mut value = input.new_tree(&mut runner).unwrap(); in simplify_reduces_shuffle_amount()
|
| H A D | filter.rs | 59 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
61 let val = self.source.new_tree(runner)?; in new_tree()
124 let mut case = input.new_tree(&mut runner).unwrap(); in test_filter()
|
| /dports/devel/brz/breezy-3.2.0/breezy/ |
| H A D | shelf_ui.py | 240 new_tree = self.target_tree
243 new_tree = self.work_tree
245 new_path = new_tree.id2path(file_id)
247 text_differ = diff.DiffText(old_tree, new_tree, diff_file,
364 self.change_editor.new_tree.id2path(file_id)))
486 new_tree = tt.get_preview_tree()
491 diff.show_diff_trees(merger.this_tree, new_tree, self.write_diff_to,
|
| /dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/src/ |
| H A D | tuple.rs | 46 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> {
47 let values = ($(self.$fld.new_tree(runner)?,)*);
121 let mut case = input.new_tree(&mut runner).unwrap(); in shrinks_fully_ltr()
|
| /dports/net-mgmt/tcpreplay/tcpreplay-4.3.4/src/ |
| H A D | tree.c | 45 static tcpr_tree_t *new_tree();
239 finder = new_tree(); in check_ip_tree()
306 finder = new_tree(); in check_ip6_tree()
390 newnode = new_tree(); in add_tree_first_ipv4()
412 newnode = new_tree(); in add_tree_first_ipv4()
444 newnode = new_tree(); in add_tree_first_ipv6()
466 newnode = new_tree(); in add_tree_first_ipv6()
679 new_tree() in new_tree() function
723 node = new_tree(); in packet2tree()
|
| /dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/src/ |
| H A D | tuple.rs | 46 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> {
47 let values = ($(self.$fld.new_tree(runner)?,)*);
148 let mut case = input.new_tree(&mut runner).unwrap(); in shrinks_fully_ltr()
|
| /dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/src/ |
| H A D | tuple.rs | 46 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> {
47 let values = ($(self.$fld.new_tree(runner)?,)*);
148 let mut case = input.new_tree(&mut runner).unwrap(); in shrinks_fully_ltr()
|
| /dports/lang/rust/rustc-1.58.1-src/library/portable-simd/crates/test_helpers/src/ |
| H A D | wasm.rs | 40 … fn new_tree(&self, runner: &mut proptest::test_runner::TestRunner) -> NewTree<Self> {
41 Ok(BinarySearch { inner: self.strategy.new_tree(runner)? })
|
| /dports/math/py-pymc3/pymc-3.11.4/pymc3/distributions/ |
| H A D | tree.py | 168 new_tree = Tree(tree_id, len(idx_data_points))
169 new_tree[0] = LeafNode(index=0, value=leaf_node_value, idx_data_points=idx_data_points)
170 return new_tree
|
| /dports/textproc/p5-HTML-FormatText-WithLinks-AndTables/HTML-FormatText-WithLinks-AndTables-0.07/lib/HTML/FormatText/WithLinks/ |
| H A D | AndTables.pm | 143 my $new_tree = HTML::TreeBuilder->new;
144 $new_tree->{_content} = [ $td ];
147 my $text = __PACKAGE__->new->_parse($new_tree);
|
| /dports/net/ipsumdump/ipsumdump-1.86/src/ |
| H A D | ipaggmanip.cc | 604 AggregateWTree new_tree(AggregateWTree::COUNT_ADDRS_LEAF); in process_tree_actions() local
607 new_tree.fake_by_discriminating_prefix(i, dp, randomness); in process_tree_actions()
609 tree = new_tree; in process_tree_actions()
614 AggregateWTree new_tree(AggregateWTree::COUNT_ADDRS_LEAF); in process_tree_actions() local
619 new_tree.fake_by_branching_counts(p, delta, v); in process_tree_actions()
621 tree = new_tree; in process_tree_actions()
627 new_tree.fake_by_dirichlet(tree.nnz()); in process_tree_actions()
628 tree = new_tree; in process_tree_actions()
686 AggregateTree new_tree; in process_tree_actions() local
687 tree.make_mapped(max_p, map, new_tree); in process_tree_actions()
[all …]
|
| /dports/graphics/py-cairosvg/CairoSVG-2.5.2/cairosvg/ |
| H A D | parser.py | 333 new_tree = Node(
336 new_tree.xml_tree = cached_tree.xml_tree
337 new_tree.url = url
338 new_tree.tag = cached_tree.tag
339 new_tree.root = True
340 return new_tree
|
| /dports/x11-toolkits/gtk20/gtk+-2.24.33/gtk/ |
| H A D | gtkrbtree.h | 151 GtkRBTree **new_tree,
164 GtkRBTree **new_tree,
168 GtkRBTree **new_tree,
|