Home
last modified time | relevance | path

Searched refs:num_trees (Results 1 – 25 of 148) sorted by relevance

123456

/dports/biology/iqtree/IQ-TREE-2.0.6/booster/
H A Dbooster.c312 if(num_trees >= init_boot_trees){ in main_booster()
316 alt_tree_strings[num_trees] = strdup(big_string); in main_booster()
317 num_trees++; in main_booster()
339 for(i_tree=0; i_tree < num_trees;i_tree++){ in main_booster()
368 for(i_tree=0; i_tree< num_trees; i_tree++){ in fbp()
397 if(num_trees != 0) { in fbp()
440 for(i_tree=0; i_tree< num_trees; i_tree++){ in tbe()
446 for(i_tree=0; i_tree< num_trees; i_tree++){ in tbe()
515 for(i_tree=0; i_tree < num_trees; i_tree++){ in tbe()
523 if(num_trees != 0) { in tbe()
[all …]
/dports/misc/py-xgboost/xgboost-1.5.1/src/gbm/
H A Dgbtree_model.cc14 CHECK_EQ(param.num_trees, static_cast<int32_t>(trees.size())); in Save()
46 for (int32_t i = 0; i < param.num_trees; ++i) { in Load()
51 tree_info.resize(param.num_trees); in Load()
52 if (param.num_trees != 0) { in Load()
55 fi->Read(dmlc::BeginPtr(tree_info), sizeof(int32_t) * param.num_trees), in Load()
56 sizeof(int32_t) * param.num_trees); in Load()
68 CHECK_EQ(param.num_trees, static_cast<int>(trees.size())); in SaveModel()
104 tree_info.resize(param.num_trees); in LoadModel()
106 for (int32_t i = 0; i < param.num_trees; ++i) { in LoadModel()
H A Dgbtree_model.h32 int32_t num_trees;
58 DMLC_DECLARE_FIELD(num_trees) in DMLC_DECLARE_PARAMETER()
72 dmlc::ByteSwap(&x.num_trees, sizeof(x.num_trees), 1); in ByteSwap()
101 param.num_trees = 0; in InitTreesToUpdate()
126 param.num_trees += static_cast<int>(new_trees.size()); in CommitModel()
/dports/misc/xgboost/xgboost-1.5.1/src/gbm/
H A Dgbtree_model.cc14 CHECK_EQ(param.num_trees, static_cast<int32_t>(trees.size())); in Save()
46 for (int32_t i = 0; i < param.num_trees; ++i) { in Load()
51 tree_info.resize(param.num_trees); in Load()
52 if (param.num_trees != 0) { in Load()
55 fi->Read(dmlc::BeginPtr(tree_info), sizeof(int32_t) * param.num_trees), in Load()
56 sizeof(int32_t) * param.num_trees); in Load()
68 CHECK_EQ(param.num_trees, static_cast<int>(trees.size())); in SaveModel()
104 tree_info.resize(param.num_trees); in LoadModel()
106 for (int32_t i = 0; i < param.num_trees; ++i) { in LoadModel()
H A Dgbtree_model.h32 int32_t num_trees;
58 DMLC_DECLARE_FIELD(num_trees) in DMLC_DECLARE_PARAMETER()
72 dmlc::ByteSwap(&x.num_trees, sizeof(x.num_trees), 1); in ByteSwap()
101 param.num_trees = 0; in InitTreesToUpdate()
126 param.num_trees += static_cast<int>(new_trees.size()); in CommitModel()
/dports/textproc/py-gensim/gensim-4.0.1/gensim/similarities/
H A Dannoy.py46 def __init__(self, model=None, num_trees=None): argument
73 self.num_trees = num_trees
75 if model and num_trees:
105 d = {'f': self.model.vector_size, 'num_trees': self.num_trees, 'labels': self.labels}
149 self.num_trees = d['num_trees']
165 index.build(self.num_trees)
/dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/lib/
H A Dmultitree_impl.hpp92 n->num_trees = 1; in make_single_leaf()
100 n->num_trees = 1; in make_two_leaves()
110 n->num_trees = count_unrooted_trees<index>(n->num_leaves); in make_unconstrained()
119 n->num_trees = left->num_trees * right->num_trees; in make_inner_node()
128 n->num_trees = 0; in make_alternative_array()
138 n->num_trees = 0; in make_unexplored()
/dports/biology/python-nexus/python-nexus-1.63/nexus/bin/
H A Dnexus_treemanip.py181 def run_random(num_trees, nexus_obj, do_print=False): argument
201 num_trees = int(num_trees)
205 if num_trees > nexus_obj.trees.ntrees:
209 elif num_trees == nexus_obj.trees.ntrees: # pragma: no cover
215 (nexus_obj.trees.ntrees, num_trees)
217 nexus_obj.trees.trees = sample(nexus_obj.trees.trees, num_trees)
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/xphoto/samples/
H A Dlearn_color_balance.py23 def learn_regression_tree_ensemble(img_features, gt_illuminants, num_trees, max_tree_depth): argument
29 stride = int(np.ceil(len(inst) / float(num_trees+1)))
32 for tree_idx in range(num_trees):
35 X = num_trees * [inst[i][0] for i in local_group_range]
36 y_r = num_trees * [inst[i][1] for i in local_group_range]
37 y_g = num_trees * [inst[i][2] for i in local_group_range]
239 num_trees = int(args.num_trees) variable
285 model = learn_regression_tree_ensemble(features, gt_illuminants, num_trees, max_tree_depth)
287 …te_code(model,{"-r":args.range, "--hist_bin_num": args.hist_bin_num, "--num_trees": args.num_trees,
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bstm_multi/cpp/algo/
H A Dbstm_multi_bstm_block_to_bstm_multi_block_function.cxx323 std::size_t num_trees = buffer.size() / t_size; in coalesce_trees() local
326 for (int tree_idx = 0; tree_idx < num_trees; ++tree_idx) { in coalesce_trees()
375 std::size_t num_trees = space_buffer.size() / space_tree_size; in coalesce_trees() local
380 for (std::size_t tree_idx = 0; tree_idx < num_trees; ++tree_idx) { in coalesce_trees()
410 std::size_t num_trees = bottom_buffer.size() / time_tree_size; in coalesce_trees() local
463 std::size_t num_trees = volume(num_regions); in compute_trees_structure() local
464 blk->new_buffer(num_trees * space_tree_size, current_level); in compute_trees_structure()
467 std::memset(current_buffer, 0, num_trees * space_tree_size); in compute_trees_structure()
491 std::size_t num_trees = volume(num_regions); in compute_trees_structure() local
492 blk->new_buffer(num_trees * time_tree_size, current_level); in compute_trees_structure()
[all …]
/dports/misc/py-xgboost/xgboost-1.5.1/python-package/xgboost/
H A Dplotting.py123 def to_graphviz(booster, fmap='', num_trees=0, rankdir=None, argument
210 dump_format=parameters)[num_trees]
215 def plot_tree(booster, fmap='', num_trees=0, rankdir=None, ax=None, **kwargs): argument
247 g = to_graphviz(booster, fmap=fmap, num_trees=num_trees, rankdir=rankdir,
/dports/misc/xgboost/xgboost-1.5.1/python-package/xgboost/
H A Dplotting.py123 def to_graphviz(booster, fmap='', num_trees=0, rankdir=None, argument
210 dump_format=parameters)[num_trees]
215 def plot_tree(booster, fmap='', num_trees=0, rankdir=None, ax=None, **kwargs): argument
247 g = to_graphviz(booster, fmap=fmap, num_trees=num_trees, rankdir=rankdir,
/dports/games/tuxracer/tuxracer-0.61/src/
H A Dcourse_load.c71 static int num_trees; variable
177 num_trees = 0; in reset_course()
231 tree_types[i].num_trees = 0; in reset_course()
621 type->num_trees = 0; in tree_defaults()
870 tree_types[i].num_trees = 0; in trees_cb()
879 num_trees = 0; in trees_cb()
895 num_trees += 1; in trees_cb()
896 which_tree->num_trees += 1; in trees_cb()
926 num_trees = 0; in trees_cb()
945 tree_locs[num_trees].diam = (tree_locs[num_trees].height / in trees_cb()
[all …]
H A Dmirror_course.c42 int num_trees; in mirror_course() local
80 num_trees = get_num_trees(); in mirror_course()
81 for ( i=0; i<num_trees; i++) { in mirror_course()
/dports/x11/xlockmore/xlockmore-5.67/modes/glx/
H A Dfire.c165 static int num_trees; variable
592 if (fs->num_trees) in inittextures()
603 fs->num_trees = 0; in inittextures()
645 for(i=0;i<fs->num_trees;i++) in inittree()
759 if (fs->num_trees) in DrawFire()
764 for(j=0;j<fs->num_trees;j++) in DrawFire()
864 fs->num_trees, in Init()
892 if (fs->num_trees) in Init()
991 fs->num_trees = (num_trees<MAX_TREES)?num_trees:MAX_TREES; in init_fire()
993 fs->num_trees = 0; in init_fire()
[all …]
/dports/x11/xscreensaver/xscreensaver-5.44/hacks/glx/
H A Dglforestfire.c157 static int num_trees; variable
559 if (fs->num_trees) in inittextures()
573 fs->num_trees = 0; in inittextures()
617 for(i=0;i<fs->num_trees;i++) { in inittree()
736 if (fs->num_trees) in DrawFire()
743 for(j=0;j<fs->num_trees;j++) in DrawFire()
845 fs->num_trees, in Init()
856 if (fs->num_trees) in Init()
956 fs->num_trees = (num_trees<MAX_TREES)?num_trees:MAX_TREES; in init_fire()
958 fs->num_trees = 0; in init_fire()
[all …]
/dports/sysutils/wimlib/wimlib-1.13.0/src/
H A Dextract.c627 for (i = 0; i < num_trees; i++) { in remove_duplicate_trees()
648 for (i = 0; i < num_trees; i++) in remove_contained_trees()
650 for (i = 0; i < num_trees; i++) { in remove_contained_trees()
701 size_t num_trees, bool add_ancestors) in build_dentry_list() argument
706 for (size_t i = 0; i < num_trees; i++) in build_dentry_list()
711 for (size_t i = 0; i < num_trees; i++) { in build_dentry_list()
1453 num_trees = remove_duplicate_trees(trees, num_trees); in extract_trees()
1454 num_trees = remove_contained_trees(trees, num_trees); in extract_trees()
1740 size_t num_trees; in do_wimlib_extract_paths() local
1810 num_trees = num_paths; in do_wimlib_extract_paths()
[all …]
/dports/misc/py-xgboost/xgboost-1.5.1/tests/python-gpu/
H A Dtest_gpu_ranking.py99 num_trees = 2500
106 cls.params, cls.dtrain, num_boost_round=num_trees,
115 cls.cpu_params, cls.dtrain, num_boost_round=num_trees,
128 cls.params, cls.dtrain_w, num_boost_round=num_trees,
H A Dtest_gpu_plotting.py37 graph = xgb.to_graphviz(reg, num_trees=len(j_tree) - 1)
39 ax = xgb.plot_tree(reg, num_trees=len(j_tree) - 1)
/dports/misc/xgboost/xgboost-1.5.1/tests/python-gpu/
H A Dtest_gpu_ranking.py99 num_trees = 2500
106 cls.params, cls.dtrain, num_boost_round=num_trees,
115 cls.cpu_params, cls.dtrain, num_boost_round=num_trees,
128 cls.params, cls.dtrain_w, num_boost_round=num_trees,
H A Dtest_gpu_plotting.py37 graph = xgb.to_graphviz(reg, num_trees=len(j_tree) - 1)
39 ax = xgb.plot_tree(reg, num_trees=len(j_tree) - 1)
/dports/math/cgal/CGAL-5.3/include/CGAL/Classification/ETHZ/
H A DRandom_forest_classifier.h125 std::size_t num_trees = 25,
128 train<CGAL::Parallel_if_available_tag>(ground_truth, reset_trees, num_trees, max_depth);
171 std::size_t num_trees = 25,
177 params.n_trees = num_trees;
/dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/test/
H A Dmultitree_iterator.cpp19 void check_unique_trees(multitree_node* root, index num_trees) { in check_unique_trees() argument
30 CHECK(bipartitions.size() == num_trees); in check_unique_trees()
/dports/devel/tla/tla-1.3.5/src/tla/tests/changeset-tests/
H A Drun-test.sh84 num_trees=50
87 while [ $tree_num -le $num_trees ]; do
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/sources/gpu/people_detect/src/
H A Dpeople_detect.cpp342 int num_trees = (int)tree_files.size(); in main() local
343 pc::parse_argument (argc, argv, "-numTrees", num_trees); in main()
345 tree_files.resize(num_trees); in main()
346 if (num_trees == 0 || num_trees > 4) in main()

123456