Home
last modified time | relevance | path

Searched refs:the_tree (Results 1 – 25 of 26) sorted by relevance

12

/dports/math/ann/ann_1.1.2/test/
H A Dann_test.cpp577 the_tree = NULL; in initGlobals()
863 delete the_tree; // get rid of it in main()
867 the_tree = new ANNbd_tree( // build it in main()
900 the_tree->Print(ANNfalse, cout); in main()
911 if (the_tree == NULL) { // no tree in main()
936 delete the_tree; // get rid of it in main()
961 the_tree->Print(ANNfalse, cout); in main()
1006 if (the_tree == NULL) { in main()
1045 the_tree->annkSearch( in main()
1053 the_tree->annkPriSearch( in main()
[all …]
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/ann_1.1.1/test/
H A Dann_test.cpp573 the_tree = NULL; in initGlobals()
859 delete the_tree; // get rid of it in main()
863 the_tree = new ANNbd_tree( // build it in main()
896 the_tree->Print(ANNfalse, cout); in main()
907 if (the_tree == NULL) { // no tree in main()
932 delete the_tree; // get rid of it in main()
957 the_tree->Print(ANNfalse, cout); in main()
1002 if (the_tree == NULL) { in main()
1041 the_tree->annkSearch( in main()
1049 the_tree->annkPriSearch( in main()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/queso/src/contrib/ANN/test/
H A Dann_test.cpp577 the_tree = NULL; in initGlobals()
863 delete the_tree; // get rid of it in main()
867 the_tree = new ANNbd_tree( // build it in main()
900 the_tree->Print(ANNfalse, cout); in main()
911 if (the_tree == NULL) { // no tree in main()
936 delete the_tree; // get rid of it in main()
961 the_tree->Print(ANNfalse, cout); in main()
1006 if (the_tree == NULL) { in main()
1045 the_tree->annkSearch( in main()
1053 the_tree->annkPriSearch( in main()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/approxnn/test/
H A Dann_test.cpp577 the_tree = NULL; in initGlobals()
863 delete the_tree; // get rid of it in main()
867 the_tree = new ANNbd_tree( // build it in main()
900 the_tree->Print(ANNfalse, cout); in main()
911 if (the_tree == NULL) { // no tree in main()
936 delete the_tree; // get rid of it in main()
961 the_tree->Print(ANNfalse, cout); in main()
1006 if (the_tree == NULL) { in main()
1045 the_tree->annkSearch( in main()
1053 the_tree->annkPriSearch( in main()
[all …]
/dports/www/sitecopy/sitecopy-0.16.6/gnome/
H A Dmisc.c31 extern GtkWidget *main_area_box, *area_data, *the_tree;
385 gtk_clist_clear(GTK_CLIST(the_tree)); in open_newrc()
386 fill_tree_from_all_sites(the_tree); in open_newrc()
555 gtk_ctree_node_set_text(GTK_CTREE(the_tree), in rescan_selected()
620 the_tree = gtk_ctree_new(1, 0); in ctree_create_sites()
621 gtk_ctree_set_indent(GTK_CTREE(the_tree), 14); in ctree_create_sites()
622 gtk_ctree_set_spacing(GTK_CTREE(the_tree), 4); in ctree_create_sites()
627 fill_tree_from_all_sites(the_tree); in ctree_create_sites()
628 gtk_widget_set_usize(the_tree, 150, -1); in ctree_create_sites()
629 gtk_widget_show(the_tree); in ctree_create_sites()
[all …]
H A Dtree.c24 GtkCTree *the_tree; variable
173 file_im_adding = gtk_ctree_insert_node(GTK_CTREE(the_tree), in add_file()
181 gtk_ctree_node_set_row_data(GTK_CTREE(the_tree), file_im_adding, in add_file()
240 site_item = gtk_ctree_insert_node(GTK_CTREE(the_tree), NULL, NULL, node_label, in add_a_site_to_the_tree()
247 gtk_ctree_node_set_row_data(GTK_CTREE(the_tree), site_item, in add_a_site_to_the_tree()
273 gtk_clist_freeze(GTK_CLIST(the_tree)); in add_a_site_to_the_tree()
275 gtk_clist_thaw(GTK_CLIST(the_tree)); in add_a_site_to_the_tree()
579 gtk_ctree_remove_node(GTK_CTREE(the_tree), in rebuild_node_files()
583 gtk_clist_freeze(GTK_CLIST(the_tree)); in rebuild_node_files()
585 gtk_clist_thaw(GTK_CLIST(the_tree)); in rebuild_node_files()
H A Doperations.c590 extern GtkCTree *the_tree; in delete_selected()
606 gtk_ctree_remove_node(GTK_CTREE(the_tree), in delete_selected()
H A Dsite_widgets.c27 extern GtkWidget *the_tree;
H A Dnew_site.c32 extern GtkWidget *the_tree;
/dports/games/scummvm/scummvm-2.5.1/engines/glk/archetype/
H A Dinterpreter.cpp403 void display_expr(ExprTree the_tree) { in display_expr() argument
404 if (the_tree->_kind != OPER) { in display_expr()
405 display_result(*the_tree); in display_expr()
407 if (Binary[the_tree->_data._oper.op_name]) { in display_expr()
409 display_expr(the_tree->_data._oper.left); in display_expr()
413 debugN("%s", Operators[the_tree->_data._oper.op_name]); in display_expr()
415 display_expr(the_tree->_data._oper.right); in display_expr()
H A Dinterpreter.h125 extern void display_expr(ExprTree the_tree);
/dports/misc/mc-nox11/mc-4.8.27/src/filemanager/
H A Dtree.h20 extern WTree *the_tree;
H A Dtree.c75 WTree *the_tree = NULL; variable
1336 tree_chdir (the_tree, vpath); in sync_tree()
H A Dcmd.c1099 tree_chdir (the_tree, vpath); in hotlist_cmd()
H A Dlayout.c1249 the_tree = (WTree *) new_widget; in create_panel()
/dports/misc/mc/mc-4.8.27/src/filemanager/
H A Dtree.h20 extern WTree *the_tree;
H A Dtree.c75 WTree *the_tree = NULL; variable
1336 tree_chdir (the_tree, vpath); in sync_tree()
H A Dcmd.c1099 tree_chdir (the_tree, vpath); in hotlist_cmd()
H A Dlayout.c1249 the_tree = (WTree *) new_widget; in create_panel()
/dports/biology/babel/babel-1.6/
H A Drings.c125 void tree_to_sets(ums_type *mol,spanning_tree *the_tree,set_type *the_set[]) in tree_to_sets() argument
134 if (the_tree[i].level >= 0) in tree_to_sets()
135 biton(the_set[the_tree[i].level],i); in tree_to_sets()
524 int build_common_array(set_type *common_set, spanning_tree *the_tree,spanning_tree *common_array) in build_common_array() argument
536 common_array[k].level = the_tree[next].level; in build_common_array()
H A Dbabel.h381 extern void tree_to_sets(ums_type *mol, spanning_tree *the_tree, set_type *the_set[]);
400 extern int build_common_array(set_type *common_set, spanning_tree *the_tree, spanning_tree *common_…
/dports/lang/racket/racket-8.3/src/bc/src/
H A Dcodetab.inc83 static void *do_find_symbol(void **the_tree, uintptr_t v)
86 void **t = the_tree, *val;
147 void **the_tree, **t1, **t2, **split_t, *val1, *val2;
168 the_tree = shared_codetab_tree;
176 the_tree = codetab_tree;
181 t1 = t2 = the_tree;
/dports/lang/racket-minimal/racket-8.3/src/bc/src/
H A Dcodetab.inc83 static void *do_find_symbol(void **the_tree, uintptr_t v)
86 void **t = the_tree, *val;
147 void **the_tree, **t1, **t2, **split_t, *val1, *val2;
168 the_tree = shared_codetab_tree;
176 the_tree = codetab_tree;
181 t1 = t2 = the_tree;
/dports/biology/ugene/ugene-40.1/src/plugins/ngs_reads_classification/src/
H A DTaxonomySupport.cpp78 TaxonomyTree *TaxonomyTree::the_tree = nullptr; member in U2::LocalWorkflow::TaxonomyTree
102 if (the_tree == nullptr) { in getInstance()
104 the_tree = load(new TaxonomyTree); in getInstance()
106 return the_tree; in getInstance()
H A DTaxonomySupport.h83 static TaxonomyTree *the_tree; variable

12