| /dports/math/libpgmath/flang-d07daf3/test/openmp_examples/sources/ |
| H A D | Example_cancellation.2f.f | 14 recursive subroutine search_tree(tree, value, level, found) subroutine
25 call search_tree(tree%left, value, level+1, found_left) argument
36 call search_tree(tree%right, value, level+1, found_right)
60 call search_tree(tree, value, 0, found)
|
| /dports/devel/p5-Config-Model/Config-Model-2.147/lib/Config/Model/ |
| H A D | SearchElement.pm | 128 unless ( defined $self->{search_tree} ) {
144 $self->{search_tree} = $self->{data}{$searched};
164 my $next_step = $self->{search_tree}{next_step};
226 my $next = $self->{search_tree}{next_step};
255 $self->{search_tree} = $data;
258 $self->{search_tree} = { next_step => undef };
|
| /dports/audio/moc/moc-2.5.2/ |
| H A D | playlist.c | 203 rb_delete (&plist->search_tree, file_name); in plist_add()
319 rb_clear (&plist->search_tree); in plist_clear()
348 x = rb_min (&plist->search_tree); in plist_sort_fname()
379 x = rb_search (&plist->search_tree, file); in plist_find_fname()
674 rb_delete (&plist->search_tree, file); in plist_set_file()
780 rb_clear (&plist->search_tree); in plist_shuffle()
783 rb_insert (&plist->search_tree, (void *)(intptr_t)i); in plist_shuffle()
797 rb_delete (&plist->search_tree, fname); in plist_swap_first_fname()
800 rb_insert (&plist->search_tree, NULL); in plist_swap_first_fname()
916 x1 = rb_search (&plist->search_tree, file1); in plist_swap_files()
[all …]
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/apps/src/ |
| H A D | surfel_smoothing_test.cpp | 27 search::KdTree<PointXYZ>::Ptr search_tree(new search::KdTree<PointXYZ>); in main() local
28 normal_estimation.setSearchMethod(search_tree); in main()
35 surfel_smoothing.setSearchMethod(search_tree); in main()
|
| H A D | multiscale_feature_persistence_example.cpp | 66 pcl::search::KdTree<PointXYZ>::Ptr search_tree(new pcl::search::KdTree<PointXYZ>); in subsampleAndCalculateNormals() local
67 normal_estimation_filter.setSearchMethod(search_tree); in subsampleAndCalculateNormals()
|
| /dports/sysutils/syslinux/syslinux-6.03/core/fs/btrfs/ |
| H A D | btrfs.c | 236 static int search_tree(struct fs_info *fs, u64 loffset, in search_tree() function
261 ret = search_tree(fs, tree_buf->node.ptrs[slot].blockptr, in search_tree()
303 search_tree(fs, path->offsets[level], key, path); in next_leaf()
323 search_tree(fs, path->offsets[0], key, path); in next_slot()
371 search_tree(fs, bfs->sb.chunk_root, &search_key, &path); in btrfs_read_chunk_tree()
411 ret = search_tree(fs, bfs->fs_tree, &search_key, &path); in btrfs_iget_by_inr()
463 ret = search_tree(fs, bfs->fs_tree, &search_key, &path); in btrfs_iget()
499 ret = search_tree(fs, bfs->fs_tree, &search_key, &path); in btrfs_readdir()
535 ret = search_tree(fs, bfs->fs_tree, &search_key, &path); in btrfs_next_extent()
605 if (search_tree(fs, bfs->sb.root, &search_key, &path)) in btrfs_get_fs_tree()
[all …]
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/src/slurmd/common/ |
| H A D | reverse_tree_math.c | 113 static int search_tree(int id, int node, int max_children, int width, in search_tree() function
137 return search_tree(id, current, next_children, width, in search_tree()
175 search_tree(rank, 0, max_children, width, &p, &c, depth); in reverse_tree_info()
|
| /dports/textproc/pdfoutline/fntsample-release-5.4/scripts/ |
| H A D | pdf-extract-outline.pl | 51 sub search_tree { subroutine
68 my $result = search_tree($kid->val, $key);
112 $dest = search_tree($tree, $name);
|
| /dports/textproc/pdfoutline/fntsample-release-5.4/ |
| H A D | pdf-extract-outline | 51 sub search_tree {
68 my $result = search_tree($kid->val, $key);
112 $dest = search_tree($tree, $name);
|
| /dports/x11-fonts/fntsample/fntsample-release-5.4/scripts/ |
| H A D | pdf-extract-outline.pl | 51 sub search_tree { subroutine
68 my $result = search_tree($kid->val, $key);
112 $dest = search_tree($tree, $name);
|
| /dports/devel/liborcus/liborcus-0.16.1/src/ |
| H A D | orcus_test_ods.cpp | 198 bool good = bold_runs.search_tree(0, is_bold, &start_pos, &end_pos).second; in test_ods_import_formatted_text()
205 good = bold_runs.search_tree(4, is_bold, &start_pos, &end_pos).second; in test_ods_import_formatted_text()
226 bool good = italic_runs.search_tree(0, it_italic, &start_pos, &end_pos).second; in test_ods_import_formatted_text()
233 good = italic_runs.search_tree(9, it_italic, &start_pos, &end_pos).second; in test_ods_import_formatted_text()
240 good = italic_runs.search_tree(15, it_italic, &start_pos, &end_pos).second; in test_ods_import_formatted_text()
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/newlib/libc/sys/linux/iconv/ |
| H A D | gconv_trans.c | 60 static void *search_tree; variable
140 found = tfind (trans, &search_tree, trans_compare); in __gconv_translit_find()
216 if (tsearch (newp, &search_tree, trans_compare) == NULL) in __gconv_translit_find()
|
| /dports/devel/arm-none-eabi-newlib/newlib-2.4.0/newlib/libc/sys/linux/iconv/ |
| H A D | gconv_trans.c | 60 static void *search_tree; variable
140 found = tfind (trans, &search_tree, trans_compare); in __gconv_translit_find()
216 if (tsearch (newp, &search_tree, trans_compare) == NULL) in __gconv_translit_find()
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/newlib/libc/sys/linux/iconv/ |
| H A D | gconv_trans.c | 60 static void *search_tree; variable
140 found = tfind (trans, &search_tree, trans_compare); in __gconv_translit_find()
216 if (tsearch (newp, &search_tree, trans_compare) == NULL) in __gconv_translit_find()
|
| /dports/science/py-pyaixi/pyaixi-1.0.4.post1/pyaixi/agents/ |
| H A D | mc_aixi_ctw.py | 499 search_tree = monte_carlo_search_tree.MonteCarloSearchNode(decision_node)
504 search_tree.sample(self, self.horizon)
517 if action not in search_tree.children:
523 mean = search_tree.children[action].mean + (random.random() * 0.0001)
|
| /dports/mail/exim-mysql/exim-4.95/src/ |
| H A D | search.c | 30 static tree_node *search_tree = NULL; variable
316 if (search_tree) in search_tidyup()
318 tidyup_subtree(search_tree); in search_tidyup()
319 search_tree = NULL; in search_tidyup()
414 if ((t = tree_search(search_tree, keybuffer))) in search_open()
481 tree_insertnode(&search_tree, t); in search_open()
|
| /dports/mail/exim-monitor/exim-4.95/src/ |
| H A D | search.c | 30 static tree_node *search_tree = NULL; variable
316 if (search_tree) in search_tidyup()
318 tidyup_subtree(search_tree); in search_tidyup()
319 search_tree = NULL; in search_tidyup()
414 if ((t = tree_search(search_tree, keybuffer))) in search_open()
481 tree_insertnode(&search_tree, t); in search_open()
|
| /dports/mail/exim-postgresql/exim-4.95/src/ |
| H A D | search.c | 30 static tree_node *search_tree = NULL; variable
316 if (search_tree) in search_tidyup()
318 tidyup_subtree(search_tree); in search_tidyup()
319 search_tree = NULL; in search_tidyup()
414 if ((t = tree_search(search_tree, keybuffer))) in search_open()
481 tree_insertnode(&search_tree, t); in search_open()
|
| /dports/mail/exim-sa-exim/exim-4.95/src/ |
| H A D | search.c | 30 static tree_node *search_tree = NULL; variable
316 if (search_tree) in search_tidyup()
318 tidyup_subtree(search_tree); in search_tidyup()
319 search_tree = NULL; in search_tidyup()
414 if ((t = tree_search(search_tree, keybuffer))) in search_open()
481 tree_insertnode(&search_tree, t); in search_open()
|
| /dports/mail/exim-ldap2/exim-4.95/src/ |
| H A D | search.c | 30 static tree_node *search_tree = NULL; variable
316 if (search_tree) in search_tidyup()
318 tidyup_subtree(search_tree); in search_tidyup()
319 search_tree = NULL; in search_tidyup()
414 if ((t = tree_search(search_tree, keybuffer))) in search_open()
481 tree_insertnode(&search_tree, t); in search_open()
|
| /dports/mail/exim/exim-4.95/src/ |
| H A D | search.c | 30 static tree_node *search_tree = NULL; variable
316 if (search_tree) in search_tidyup()
318 tidyup_subtree(search_tree); in search_tidyup()
319 search_tree = NULL; in search_tidyup()
414 if ((t = tree_search(search_tree, keybuffer))) in search_open()
481 tree_insertnode(&search_tree, t); in search_open()
|
| /dports/mail/exim-sqlite/exim-4.95/src/ |
| H A D | search.c | 30 static tree_node *search_tree = NULL; variable
316 if (search_tree) in search_tidyup()
318 tidyup_subtree(search_tree); in search_tidyup()
319 search_tree = NULL; in search_tidyup()
414 if ((t = tree_search(search_tree, keybuffer))) in search_open()
481 tree_insertnode(&search_tree, t); in search_open()
|
| /dports/math/z3/z3-z3-4.8.13/src/qe/ |
| H A D | qe.cpp | 897 class search_tree { class
939 search_tree(search_tree* parent, ast_manager& m, app* assignment): in search_tree() function in qe::search_tree
950 ~search_tree() { in ~search_tree()
975 ptr_vector<search_tree> todo; in get_leaves()
1067 search_tree const* node = this; in is_pure()
1087 search_tree* child() const { in child()
1101 search_tree* add_child(expr* fml) { in add_child()
1105 search_tree* st = alloc(search_tree, this, m, m.mk_true()); in add_child()
1119 search_tree* st = alloc(search_tree, this, m, assignment); in add_child()
1336 search_tree m_root;
[all …]
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/qe/ |
| H A D | qe.cpp | 898 class search_tree { class
940 search_tree(search_tree* parent, ast_manager& m, app* assignment): in search_tree() function in qe::search_tree
951 ~search_tree() { in ~search_tree()
976 ptr_vector<search_tree> todo; in get_leaves()
1068 search_tree const* node = this; in is_pure()
1088 search_tree* child() const { in child()
1102 search_tree* add_child(expr* fml) { in add_child()
1106 search_tree* st = alloc(search_tree, this, m, m.mk_true()); in add_child()
1120 search_tree* st = alloc(search_tree, this, m, assignment); in add_child()
1339 search_tree m_root;
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | boost_web_graph.cpp | 194 Graph search_tree(num_vertices(g)); in main() local
198 add_edge(parent[*vi], *vi, search_tree); in main()
210 depth_first_visit(search_tree, src, tree_printer, get(vertex_color, g)); in main()
|