/dports/databases/mariadb104-server/mariadb-10.4.24/storage/mroonga/vendor/groonga/lib/dat/ |
H A D | header.hpp | 80 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Header 128 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_phantoms() 132 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_zombies()
|
H A D | trie.hpp | 169 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Trie 170 return header_->max_num_nodes(); in max_num_nodes()
|
H A D | trie.cpp | 206 const double max_num_nodes = num_nodes_per_key * max_num_keys; in create_file() local 207 GRN_DAT_THROW_IF(PARAM_ERROR, (max_num_nodes - 1.0) >= MAX_NUM_NODES); in create_file() 208 max_num_blocks = ((UInt32)max_num_nodes + BLOCK_SIZE - 1) / BLOCK_SIZE; in create_file() 284 nodes_.assign(header_ + 1, max_num_nodes()); in map_address()
|
/dports/databases/mariadb104-client/mariadb-10.4.24/storage/mroonga/vendor/groonga/lib/dat/ |
H A D | header.hpp | 80 UInt32 max_num_nodes() const { in pgkill() 128 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in pgkill() 132 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in pgkill()
|
H A D | trie.hpp | 169 UInt32 max_num_nodes() const { 170 return header_->max_num_nodes();
|
H A D | trie.cpp | 206 const double max_num_nodes = num_nodes_per_key * max_num_keys; in create_file() local 207 GRN_DAT_THROW_IF(PARAM_ERROR, (max_num_nodes - 1.0) >= MAX_NUM_NODES); in create_file() 208 max_num_blocks = ((UInt32)max_num_nodes + BLOCK_SIZE - 1) / BLOCK_SIZE; in create_file() 284 nodes_.assign(header_ + 1, max_num_nodes()); in map_address()
|
/dports/databases/mariadb103-client/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/dat/ |
H A D | header.hpp | 80 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Header 128 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_phantoms() 132 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_zombies()
|
H A D | trie.hpp | 169 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Trie 170 return header_->max_num_nodes(); in max_num_nodes()
|
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/mroonga/vendor/groonga/lib/dat/ |
H A D | header.hpp | 80 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Header 128 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_phantoms() 132 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_zombies()
|
H A D | trie.hpp | 169 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Trie 170 return header_->max_num_nodes(); in max_num_nodes()
|
/dports/databases/mariadb103-server/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/dat/ |
H A D | header.hpp | 80 UInt32 max_num_nodes() const { in File() 128 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in File() 132 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in File()
|
H A D | trie.hpp | 169 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Trie 170 return header_->max_num_nodes(); in max_num_nodes()
|
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/mroonga/vendor/groonga/lib/dat/ |
H A D | header.hpp | 80 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Header 128 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_phantoms() 132 GRN_DAT_DEBUG_THROW_IF(x > max_num_nodes()); in set_num_zombies()
|
H A D | trie.hpp | 169 UInt32 max_num_nodes() const { in max_num_nodes() function in grn::dat::Trie 170 return header_->max_num_nodes(); in max_num_nodes()
|
/dports/math/dbcsr/dbcsr-2.1.0/src/acc/libsmm_acc/tune/ |
H A D | tune_setup.py | 34 max_num_nodes, argument 89 gen_jobfile(outdir, compiler, m, n, k, cpus_per_node, max_num_nodes) 259 def gen_jobfile(outdir, compiler, m, n, k, cpus_per_node=12, max_num_nodes=0): argument 268 if max_num_nodes > 0: 269 num_nodes = min(len(all_exe), max_num_nodes)
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/exts/dbcsr/src/acc/libsmm_acc/tune/ |
H A D | tune_setup.py | 34 max_num_nodes, argument 89 gen_jobfile(outdir, compiler, m, n, k, cpus_per_node, max_num_nodes) 257 def gen_jobfile(outdir, compiler, m, n, k, cpus_per_node=12, max_num_nodes=0): argument 266 if max_num_nodes > 0: 267 num_nodes = min(len(all_exe), max_num_nodes)
|
/dports/science/py-dlib/dlib-19.22/dlib/random_forest/ |
H A D | random_forest_regression.h | 388 const uint32_t max_num_nodes = y.size(); in do_train() local 480 tree[range.tree_idx].left = leaves.size() + max_num_nodes; in do_train() 504 tree[range.tree_idx].right = leaves.size() + max_num_nodes; in do_train() 511 DLIB_CASSERT(max_num_nodes >= tree.size()); in do_train() 512 const auto offset = max_num_nodes - tree.size(); in do_train() 515 if (n.left >= max_num_nodes) in do_train() 517 if (n.right >= max_num_nodes) in do_train()
|
/dports/science/dlib-cpp/dlib-19.22/dlib/random_forest/ |
H A D | random_forest_regression.h | 388 const uint32_t max_num_nodes = y.size(); in do_train() local 480 tree[range.tree_idx].left = leaves.size() + max_num_nodes; in do_train() 504 tree[range.tree_idx].right = leaves.size() + max_num_nodes; in do_train() 511 DLIB_CASSERT(max_num_nodes >= tree.size()); in do_train() 512 const auto offset = max_num_nodes - tree.size(); in do_train() 515 if (n.left >= max_num_nodes) in do_train() 517 if (n.right >= max_num_nodes) in do_train()
|
/dports/math/py-or-tools/or-tools-9.2/ortools/graph/ |
H A D | ebert_graph.h | 256 NodeIndexType max_num_nodes() const { return max_num_nodes_; } in max_num_nodes() function 1114 if (!Reserve(max_num_nodes, max_num_arcs)) { in Initialize() 1120 ThisAsDerived()->InitializeInternal(max_num_nodes, max_num_arcs); in Initialize() 1168 void InitializeInternal(NodeIndexType max_num_nodes, in InitializeInternal() argument 1229 EbertGraph(NodeIndexType max_num_nodes, ArcIndexType max_num_arcs) { in EbertGraph() argument 1230 Initialize(max_num_nodes, max_num_arcs); in EbertGraph() 1605 Initialize(max_num_nodes, max_num_arcs); in ForwardEbertGraph() 1966 GraphBuilderFromArcs(typename GraphType::NodeIndex max_num_nodes, 1970 Reserve(max_num_nodes, max_num_arcs); 2026 GraphBuilderFromArcs(typename GraphType::NodeIndex max_num_nodes, [all …]
|
H A D | max_flow.cc | 159 const NodeIndex max_num_nodes = Graphs<Graph>::NodeReservation(*graph_); in GenericMaxFlow() local 160 if (max_num_nodes > 0) { in GenericMaxFlow() 161 node_excess_.Reserve(0, max_num_nodes - 1); in GenericMaxFlow() 163 node_potential_.Reserve(0, max_num_nodes - 1); in GenericMaxFlow() 165 first_admissible_arc_.Reserve(0, max_num_nodes - 1); in GenericMaxFlow() 167 bfs_queue_.reserve(max_num_nodes); in GenericMaxFlow() 168 active_nodes_.reserve(max_num_nodes); in GenericMaxFlow()
|
H A D | min_cost_flow.cc | 68 const NodeIndex max_num_nodes = Graphs<Graph>::NodeReservation(*graph_); in GenericMinCostFlow() local 69 if (max_num_nodes > 0) { in GenericMinCostFlow() 70 node_excess_.Reserve(0, max_num_nodes - 1); in GenericMinCostFlow() 72 node_potential_.Reserve(0, max_num_nodes - 1); in GenericMinCostFlow() 74 first_admissible_arc_.Reserve(0, max_num_nodes - 1); in GenericMinCostFlow() 76 initial_node_excess_.Reserve(0, max_num_nodes - 1); in GenericMinCostFlow() 78 feasible_node_excess_.Reserve(0, max_num_nodes - 1); in GenericMinCostFlow()
|
H A D | graphs.h | 65 return graph.max_num_nodes(); in precise()
|
/dports/math/py-yt/yt-4.0.1/yt/utilities/lib/ |
H A D | cyoctree.pyx | 52 np.int64_t max_num_nodes 90 if tree.num_nodes > tree.max_num_nodes - 16: 91 if octree_reallocate(tree, tree.max_num_nodes * 2): 269 octree.max_num_nodes = num_nodes 548 self.c_octree.max_num_nodes = max(self.input_positions.shape[0] / self.n_ref, 1) 556 if octree_allocate(self.c_octree, self.c_octree.max_num_nodes): return 1
|
/dports/math/z3/z3-z3-4.8.13/src/sat/ |
H A D | sat_anf_simplifier.cpp | 381 unsigned max_num_nodes = 1 << 18; in configure_solver() local 382 ps.get_manager().set_max_num_nodes(max_num_nodes); in configure_solver()
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/ |
H A D | sat_anf_simplifier.cpp | 381 unsigned max_num_nodes = 1 << 18; in configure_solver() local 382 ps.get_manager().set_max_num_nodes(max_num_nodes); in configure_solver()
|