Home
last modified time | relevance | path

Searched refs:new_tree (Results 201 – 225 of 1300) sorted by relevance

12345678910>>...52

/dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/src/
H A Dcollection.rs552 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
557 elements.push(self.element.new_tree(runner)?); in new_tree()
574 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
578 .map(|t| t.new_tree(runner)) in new_tree()
691 let case = input.new_tree(&mut runner).unwrap(); in test_vec()
739 let mut case = input.new_tree(&mut runner).unwrap(); in test_parallel_vec()
762 let v = input.new_tree(&mut runner).unwrap().current(); in test_map()
775 let v = input.new_tree(&mut runner).unwrap().current(); in test_set()
H A Dchar.rs252 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
343 let mut value = input.new_tree(&mut runner).unwrap();
363 let ch = any().new_tree(&mut runner).unwrap().current(); in applies_desired_bias()
381 let mut value = any().new_tree(&mut runner).unwrap(); in doesnt_shrink_to_ascii_control()
H A Dmacros.rs71 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> {
72 self.0.new_tree(runner).map($vtname)
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/src/
H A Dcollection.rs552 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
557 elements.push(self.element.new_tree(runner)?); in new_tree()
574 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
578 .map(|t| t.new_tree(runner)) in new_tree()
691 let case = input.new_tree(&mut runner).unwrap(); in test_vec()
739 let mut case = input.new_tree(&mut runner).unwrap(); in test_parallel_vec()
762 let v = input.new_tree(&mut runner).unwrap().current(); in test_map()
775 let v = input.new_tree(&mut runner).unwrap().current(); in test_set()
H A Dchar.rs252 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
343 let mut value = input.new_tree(&mut runner).unwrap();
363 let ch = any().new_tree(&mut runner).unwrap().current(); in applies_desired_bias()
381 let mut value = any().new_tree(&mut runner).unwrap(); in doesnt_shrink_to_ascii_control()
H A Dmacros.rs71 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> {
72 self.0.new_tree(runner).map($vtname)
/dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/src/
H A Dcollection.rs552 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
557 elements.push(self.element.new_tree(runner)?); in new_tree()
574 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
578 .map(|t| t.new_tree(runner)) in new_tree()
691 let case = input.new_tree(&mut runner).unwrap(); in test_vec()
739 let mut case = input.new_tree(&mut runner).unwrap(); in test_parallel_vec()
762 let v = input.new_tree(&mut runner).unwrap().current(); in test_map()
775 let v = input.new_tree(&mut runner).unwrap().current(); in test_set()
H A Dchar.rs252 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
343 let mut value = input.new_tree(&mut runner).unwrap();
363 let ch = any().new_tree(&mut runner).unwrap().current(); in applies_desired_bias()
381 let mut value = any().new_tree(&mut runner).unwrap(); in doesnt_shrink_to_ascii_control()
H A Dmacros.rs71 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> {
72 self.0.new_tree(runner).map($vtname)
/dports/devel/tla/tla-1.3.5/src/hackerlab/splay/
H A Dfsplay.h169 t_fsplay_tree new_tree);
172 t_fsplay_tree new_tree);
/dports/devel/ncnf/ncnf-3.0.1/src/
H A Dncnf_diff.c72 _ncnf_diff(struct ncnf_obj_s *old_tree, struct ncnf_obj_s *new_tree) { in _ncnf_diff() argument
76 || new_tree->obj_class != NOBJ_ROOT) { in _ncnf_diff()
85 _ncnf_walk_tree(new_tree, in _ncnf_diff()
89 ret = _ncnf_diff_level(old_tree, new_tree); in _ncnf_diff()
/dports/biology/artemis/artemis-17.0.1-11-g3e43d27e/uk/ac/sanger/artemis/io/
H A DLocationParseNode.java503 final LocationParseNode new_tree = getCanonicalComplement(); in getCanonical()
505 if(new_tree.getType() != JOIN && new_tree.getType() != ORDER) in getCanonical()
506 return new_tree; in getCanonical()
510 (LocationParseNodeVector)new_tree.child; in getCanonical()
597 return new_tree; in getCanonical()
/dports/devel/grex/grex-1.3.0/cargo-crates/proptest-1.0.0/src/strategy/
H A Dfilter_map.rs61 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
63 let val = self.source.new_tree(runner)?; in new_tree()
180 let mut case = input.new_tree(&mut runner).unwrap(); in test_filter_map()
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/proptest/src/strategy/
H A Dfilter_map.rs61 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
63 let val = self.source.new_tree(runner)?; in new_tree()
180 let mut case = input.new_tree(&mut runner).unwrap(); in test_filter_map()
/dports/www/newsboat/newsboat-2.22.1/cargo-crates/proptest-0.10.1/src/strategy/
H A Dfilter_map.rs61 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() method
63 let val = self.source.new_tree(runner)?; in new_tree()
180 let mut case = input.new_tree(&mut runner).unwrap(); in test_filter_map()
/dports/games/ags/ags_linux_v.3.4.4.1/Engine/test/
H A Dtest_inifile.cpp277 StringOrderMap &new_tree = tree3["other1"]; in Test_IniFile() local
278 new_tree["item1_1"] = "value1_1"; in Test_IniFile()
279 new_tree["item1_2"] = "value1_2"; in Test_IniFile()
280 new_tree["item1_3"] = "value1_3"; in Test_IniFile()
/dports/audio/festival/festival/src/modules/UniSyn_phonology/
H A DUniSyn_phonology.cc92 const EST_String &new_tree);
246 EST_String new_tree = get_c_string(car(largs)); in FT_extend_tree() local
251 u->create_relation(new_tree); in FT_extend_tree()
255 p = u->relation(new_tree)->append(m); in FT_extend_tree()
491 LISP FT_binaryize_tree(LISP l_utt, LISP old_tree, LISP new_tree) in FT_binaryize_tree() argument
494 get_c_string(new_tree)); in FT_binaryize_tree()
/dports/games/scummvm/scummvm-2.5.1/engines/ags/tests/
H A Dtest_inifile.cpp318 StringOrderMap &new_tree = tree3["other1"]; in Test_IniFile() local
319 new_tree["item1_1"] = "value1_1"; in Test_IniFile()
320 new_tree["item1_2"] = "value1_2"; in Test_IniFile()
321 new_tree["item1_3"] = "value1_3"; in Test_IniFile()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/boct/tests/
H A Dtest_create_tree.cxx30 boct_tree<short,vgl_point_3d<double> > new_tree(root, init_tree->number_levels()); in test_create_tree() local
31 std::vector<boct_tree_cell<short,vgl_point_3d<double> >*> new_leaves=new_tree.leaf_cells(); in test_create_tree()
/dports/devel/cgit/cgit-1.2.3/git/t/
H A Dt7003-filter-branch.sh498 git replace $tree $new_tree &&
499 git tag -a -m "tag to a tree" treetag $new_tree &&
/dports/lang/rust/rustc-1.58.1-src/library/portable-simd/crates/test_helpers/src/
H A Darray.rs42 fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self> { in new_tree() function
46 *t = MaybeUninit::new(self.strategy.new_tree(runner)?) in new_tree()
/dports/devel/avr-gdb/gdb-7.3.1/sim/ppc/
H A Dgen-icache.c378 icache_tree *new_tree; in icache_tree_insert() local
396 new_tree = ZALLOC(icache_tree); in icache_tree_insert()
397 new_tree->name = name; in icache_tree_insert()
398 new_tree->next = cur_tree; in icache_tree_insert()
399 *ptr_to_cur_tree = new_tree; in icache_tree_insert()
400 return new_tree; in icache_tree_insert()
/dports/devel/gdb761/gdb-7.6.1/sim/ppc/
H A Dgen-icache.c377 icache_tree *new_tree; in icache_tree_insert() local
395 new_tree = ZALLOC(icache_tree); in icache_tree_insert()
396 new_tree->name = name; in icache_tree_insert()
397 new_tree->next = cur_tree; in icache_tree_insert()
398 *ptr_to_cur_tree = new_tree; in icache_tree_insert()
399 return new_tree; in icache_tree_insert()
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gdb/sim/ppc/
H A Dgen-icache.c378 icache_tree *new_tree; in icache_tree_insert() local
396 new_tree = ZALLOC(icache_tree); in icache_tree_insert()
397 new_tree->name = name; in icache_tree_insert()
398 new_tree->next = cur_tree; in icache_tree_insert()
399 *ptr_to_cur_tree = new_tree; in icache_tree_insert()
400 return new_tree; in icache_tree_insert()
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gdb/sim/ppc/
H A Dgen-icache.c378 icache_tree *new_tree; in icache_tree_insert() local
396 new_tree = ZALLOC(icache_tree); in icache_tree_insert()
397 new_tree->name = name; in icache_tree_insert()
398 new_tree->next = cur_tree; in icache_tree_insert()
399 *ptr_to_cur_tree = new_tree; in icache_tree_insert()
400 return new_tree; in icache_tree_insert()

12345678910>>...52