| /dports/games/freecell-solver/freecell-solver-6.2.0/ |
| H A D | depth_multi_queue.h | 25 long min_depth, max_depth, max_depth_margin; member
63 &(queue->queues_by_depth[queue->max_depth - queue->min_depth])); in fcs_depth_multi_queue__insert()
66 assert(depth >= queue->min_depth); in fcs_depth_multi_queue__insert()
68 &(queue->queues_by_depth[depth - queue->min_depth]), item); in fcs_depth_multi_queue__insert()
80 queue->min_depth = first_depth; in fcs_depth_multi_queue__init()
84 (size_t)(queue->max_depth_margin - queue->min_depth + 1)); in fcs_depth_multi_queue__init()
94 const long limit = queue->max_depth - queue->min_depth; in fcs_depth_multi_queue__destroy()
122 *return_depth = depth + (int)queue->min_depth; in fcs_depth_multi_queue__extract()
|
| /dports/sysutils/diskonaut/diskonaut-0.11.0/cargo-crates/jwalk-0.5.1/src/ |
| H A D | lib.rs | 189 min_depth: usize, field
207 min_depth: 0, in new()
257 pub fn min_depth(mut self, depth: usize) -> Self { in min_depth() method
258 self.options.min_depth = depth; in min_depth()
259 if self.options.min_depth > self.options.max_depth { in min_depth()
260 self.options.min_depth = self.options.max_depth; in min_depth()
281 if self.options.max_depth < self.options.min_depth { in max_depth()
282 self.options.max_depth = self.options.min_depth; in max_depth()
351 let min_depth = self.options.min_depth; in into_iter() localVariable
374 min_depth, in into_iter()
[all …]
|
| /dports/biology/bamutil/bamUtil-1.0.15/libStatGen/glf/ |
| H A D | GlfRecord.cpp | 42 myRec1Base.min_depth = 0; in reset()
50 myRec2Base.min_depth = 0; in reset()
224 myRec1Base.min_depth = minDepth; in setMinDepth()
225 myRec2Base.min_depth = minDepth; in setMinDepth()
238 setMinDepth((myRec1Base.min_depth & MIN_LK_MASK) | in setReadDepth()
282 return(myRec1Base.min_depth); in getMinDepth()
286 return(myRec2Base.min_depth); in getMinDepth()
297 return(myRec1Base.min_depth >> MIN_LK_SHIFT); in getMinLk()
301 return(myRec2Base.min_depth >> MIN_LK_SHIFT); in getMinLk()
312 return(myRec1Base.min_depth & READ_DEPTH_MASK); in getReadDepth()
[all …]
|
| /dports/lang/ruby26/ruby-2.6.9/benchmark/ |
| H A D | so_binary_trees.rb | 31 min_depth = 4
33 max_depth = min_depth + 2 if min_depth + 2 > max_depth
43 min_depth.step(max_depth + 1, 2) do |depth|
44 iterations = 2**(max_depth - depth + min_depth)
|
| /dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-718.0.0/src/graph/scc/ |
| H A D | mod.rs | 199 Cycle { min_depth: usize },
236 WalkReturn::Cycle { min_depth } => panic!( in construct()
238 node, min_depth in construct()
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
413 min_depth: usize, in walk_unvisited_node() field
427 min_depth: 0, in walk_unvisited_node()
442 min_depth, in walk_unvisited_node()
493 if successor_min_depth < *min_depth { in walk_unvisited_node()
498 *min_depth = successor_min_depth; in walk_unvisited_node()
524 min_depth: depth, in walk_unvisited_node()
[all …]
|
| /dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-722.0.0/src/graph/scc/ |
| H A D | mod.rs | 199 Cycle { min_depth: usize },
236 WalkReturn::Cycle { min_depth } => panic!( in construct()
238 node, min_depth in construct()
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
413 min_depth: usize, in walk_unvisited_node() field
427 min_depth: 0, in walk_unvisited_node()
442 min_depth, in walk_unvisited_node()
493 if successor_min_depth < *min_depth { in walk_unvisited_node()
498 *min_depth = successor_min_depth; in walk_unvisited_node()
524 min_depth: depth, in walk_unvisited_node()
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/compiler/rustc_data_structures/src/graph/scc/ |
| H A D | mod.rs | 199 Cycle { min_depth: usize },
236 WalkReturn::Cycle { min_depth } => panic!( in construct()
238 node, min_depth in construct()
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
414 min_depth: usize, in walk_unvisited_node() field
428 min_depth: 0, in walk_unvisited_node()
443 min_depth, in walk_unvisited_node()
491 if successor_min_depth < *min_depth { in walk_unvisited_node()
493 *min_depth = successor_min_depth; in walk_unvisited_node()
516 min_depth: depth, in walk_unvisited_node()
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/rustc-ap-rustc_data_structures/src/graph/scc/ |
| H A D | mod.rs | 199 Cycle { min_depth: usize },
236 WalkReturn::Cycle { min_depth } => panic!( in construct()
238 node, min_depth in construct()
270 NodeState::BeingVisited { depth: min_depth } => WalkReturn::Cycle { min_depth }, in inspect_node()
413 min_depth: usize, in walk_unvisited_node() field
427 min_depth: 0, in walk_unvisited_node()
442 min_depth, in walk_unvisited_node()
493 if successor_min_depth < *min_depth { in walk_unvisited_node()
498 *min_depth = successor_min_depth; in walk_unvisited_node()
524 min_depth: depth, in walk_unvisited_node()
[all …]
|
| /dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/jwalk-0.6.0/src/ |
| H A D | lib.rs | 189 min_depth: usize,
208 min_depth: 0,
259 pub fn min_depth(mut self, depth: usize) -> Self {
260 self.options.min_depth = depth;
261 if self.options.min_depth > self.options.max_depth {
262 self.options.min_depth = self.options.max_depth;
283 if self.options.max_depth < self.options.min_depth {
284 self.options.max_depth = self.options.min_depth;
364 let min_depth = self.options.min_depth;
394 min_depth,
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/volm/desc/ |
| H A D | volm_desc_ex_2d_matcher.cxx | 54 if (obj->min_depth() > largest_rad || !obj->active()) { in create_query_desc()
76 if (obj->min_depth() > largest_rad) in create_query_desc()
96 if (!g_idx->active() || g_idx->min_depth() > largest_rad) in create_query_desc()
98 double min_depth = g_idx->min_depth(); in create_query_desc() local
101 double dist = min_depth; in create_query_desc()
109 if (dist < min_depth) in create_query_desc()
129 if ( !obj->active() || obj->min_depth() > largest_rad) in create_query_desc()
132 double min_d = obj->min_depth(); in create_query_desc()
|
| /dports/biology/py-pysam/pysam-0.18.0/samtools/ |
| H A D | bedcov.c | 80 int tflags = 0, min_depth = -1; in main_bedcov() local
109 case 'd': min_depth = atoi(optarg); break; in main_bedcov()
169 if (min_depth >= 0) pcov = calloc(n, sizeof(*pcov)); in main_bedcov()
170 if (!cnt || (min_depth >= 0 && !pcov)) return 2; in main_bedcov()
206 if (min_depth > DEFAULT_DEPTH) in main_bedcov()
207 bam_mplp_set_maxcnt(mplp, min_depth); in main_bedcov()
212 if (min_depth >= 0) memset(pcov, 0, sizeof(*pcov) * n); in main_bedcov()
218 if (skip_DN || min_depth >= 0) { in main_bedcov()
226 if (min_depth >= 0 && pd >= min_depth) pcov[i]++; in main_bedcov()
241 if (min_depth >= 0) { in main_bedcov()
|
| H A D | bedcov.c.pysam.c | 82 int tflags = 0, min_depth = -1; in main_bedcov() local
111 case 'd': min_depth = atoi(optarg); break; in main_bedcov()
171 if (min_depth >= 0) pcov = calloc(n, sizeof(*pcov)); in main_bedcov()
172 if (!cnt || (min_depth >= 0 && !pcov)) return 2; in main_bedcov()
208 if (min_depth > DEFAULT_DEPTH) in main_bedcov()
209 bam_mplp_set_maxcnt(mplp, min_depth); in main_bedcov()
214 if (min_depth >= 0) memset(pcov, 0, sizeof(*pcov) * n); in main_bedcov()
220 if (skip_DN || min_depth >= 0) { in main_bedcov()
228 if (min_depth >= 0 && pd >= min_depth) pcov[i]++; in main_bedcov()
243 if (min_depth >= 0) { in main_bedcov()
|
| /dports/biology/samtools/samtools-1.14/ |
| H A D | bedcov.c | 80 int tflags = 0, min_depth = -1; in main_bedcov() local
109 case 'd': min_depth = atoi(optarg); break; in main_bedcov()
169 if (min_depth >= 0) pcov = calloc(n, sizeof(*pcov)); in main_bedcov()
170 if (!cnt || (min_depth >= 0 && !pcov)) return 2; in main_bedcov()
206 if (min_depth > DEFAULT_DEPTH) in main_bedcov()
207 bam_mplp_set_maxcnt(mplp, min_depth); in main_bedcov()
212 if (min_depth >= 0) memset(pcov, 0, sizeof(*pcov) * n); in main_bedcov()
218 if (skip_DN || min_depth >= 0) { in main_bedcov()
226 if (min_depth >= 0 && pd >= min_depth) pcov[i]++; in main_bedcov()
241 if (min_depth >= 0) { in main_bedcov()
|
| /dports/math/heyoka/heyoka-0.16.0/src/ |
| H A D | gp.cpp | 97 expression expression_generator::operator()(unsigned min_depth, unsigned max_depth, unsigned depth)… in operator ()() argument
104 if (depth < min_depth) { in operator ()()
174 return u_f(this->operator()(min_depth, max_depth, depth + 1)); in operator ()()
180 return b_f(this->operator()(min_depth, max_depth, depth + 1), in operator ()()
181 this->operator()(min_depth, max_depth, depth + 1)); in operator ()()
274 const unsigned min_depth, const unsigned max_depth, unsigned depth) in mutate() argument
278 e = generator(min_depth, max_depth, depth); in mutate()
281 [&generator, &mut_p, &min_depth, &max_depth, &depth, &engine](auto &node) { in mutate()
284 mutate(*b, generator, mut_p, engine, min_depth, max_depth, depth + 1); in mutate()
292 …xpression &e, std::size_t node_id, const expression_generator &generator, const unsigned min_depth, in mutate() argument
[all …]
|
| /dports/graphics/xfig/xfig-3.2.8a/src/ |
| H A D | w_layers.c | 451 for (i = min_depth; i < but; i++) { in draw_layer_button()
580 if (min_depth < 0) return; in sweep_layer()
584 if (but < min_depth) but = min_depth; in sweep_layer()
623 if (min_depth < 0) return; in all_active()
625 for (i=min_depth; i<=max_depth; i++) { in all_active()
644 if (min_depth < 0) return; in all_inactive()
664 if (min_depth < 0) return; in toggle_all()
942 saved_min_depth = min_depth; in save_depths()
977 min_depth = saved_min_depth; in restore_depths()
1001 temp = min_depth; in swap_depths()
[all …]
|
| /dports/games/gnuchess/gnuchess-6.2.9/src/engine/ |
| H A D | trans.cpp | 60 sint8 min_depth; member
200 clear_entry->min_depth = DepthNone; in trans_clear()
305 if (min_value > -ValueInf && depth >= entry->min_depth) { in trans_store()
306 entry->min_depth = depth; in trans_store()
355 entry->min_depth = (min_value > -ValueInf) ? depth : DepthNone; in trans_store()
365 bool trans_retrieve(trans_t * trans, uint64 key, int * move, int * min_depth, int * max_depth, int … in trans_retrieve() argument
372 ASSERT(min_depth!=NULL); in trans_retrieve()
396 *min_depth = entry->min_depth; in trans_retrieve()
456 if (entry->min_value == -ValueInf && entry->min_depth != DepthNone) return false; in entry_is_ok()
457 if (entry->min_value > -ValueInf && entry->min_depth == DepthNone) return false; in entry_is_ok()
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/sources/iros2011/include/solution/ |
| H A D | filters.h | 11 thresholdDepth (const PointCloudPtr & input, float min_depth, float max_depth) in thresholdDepth() argument
16 pass_through.setFilterLimits (min_depth, max_depth); in thresholdDepth()
52 applyFilters (const PointCloudPtr & input, float min_depth, float max_depth, float leaf_size, float… in applyFilters() argument
56 filtered = thresholdDepth (input, min_depth, max_depth); in applyFilters()
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/doc/tutorials/content/sources/iccv2011/include/ |
| H A D | filters.h | 11 thresholdDepth (const PointCloudPtr & input, float min_depth, float max_depth) in thresholdDepth() argument
16 pass_through.setFilterLimits (min_depth, max_depth); in thresholdDepth()
52 applyFilters (const PointCloudPtr & input, float min_depth, float max_depth, float leaf_size, float… in applyFilters() argument
56 filtered = thresholdDepth (input, min_depth, max_depth); in applyFilters()
|
| /dports/emulators/dolphin-emu/dolphin-3152428/Source/Core/VideoCommon/ |
| H A D | BPFunctions.cpp | 74 float min_depth = (xfmem.viewport.farZ - xfmem.viewport.zRange) / 16777216.0f; in SetViewport() local
96 min_depth = std::clamp(min_depth, 0.0f, GX_MAX_DEPTH); in SetViewport()
106 min_depth = GX_MAX_DEPTH; in SetViewport()
111 min_depth = 0.0f; in SetViewport()
121 far_depth = min_depth; in SetViewport()
129 far_depth = 1.0f - min_depth; in SetViewport()
|
| /dports/games/scid/scid/engines/togaII1.2.1a/src/ |
| H A D | trans.cpp | 38 sint8 min_depth; member
178 clear_entry->min_depth = DepthNone; in trans_clear()
286 if (min_value > -ValueInf && (trans_endgame || depth >= entry->min_depth)) { in trans_store()
287 entry->min_depth = depth; in trans_store()
337 entry->min_depth = (min_value > -ValueInf) ? depth : DepthNone; in trans_store()
347 bool trans_retrieve(trans_t * trans, uint64 key, int * move, int * min_depth, int * max_depth, int … in trans_retrieve() argument
354 ASSERT(min_depth!=NULL); in trans_retrieve()
378 *min_depth = entry->min_depth; in trans_retrieve()
|
| /dports/sysutils/diskonaut/diskonaut-0.11.0/cargo-crates/jwalk-0.5.1/src/core/ |
| H A D | dir_entry_iter.rs | 10 min_depth: usize, field
21 min_depth: usize, in new()
41 min_depth, in new()
89 if dir_entry.depth >= self.min_depth { in next()
|
| /dports/graphics/py-svg.path/svg.path-4.0.2/src/svg/path/ |
| H A D | path.py | 22 if (length2 - length > error) or (depth < min_depth):
28 curve, mid, end, mid_point, end_point, error, min_depth, depth
53 def length(self, error=None, min_depth=None): argument
116 def length(self, error=ERROR, min_depth=MIN_DEPTH): argument
166 def length(self, error=None, min_depth=None): argument
347 def length(self, error=ERROR, min_depth=MIN_DEPTH): argument
395 def length(self, error=ERROR, min_depth=MIN_DEPTH): argument
463 def _calc_lengths(self, error=ERROR, min_depth=MIN_DEPTH): argument
468 each.length(error=error, min_depth=min_depth) for each in self._segments
497 def length(self, error=ERROR, min_depth=MIN_DEPTH): argument
[all …]
|
| /dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/jwalk-0.6.0/src/core/ |
| H A D | dir_entry_iter.rs | 10 min_depth: usize, field
21 min_depth: usize, in new()
42 min_depth, in new()
90 if dir_entry.depth >= self.min_depth { in next()
|
| /dports/math/py-numpy/numpy-1.20.3/numpy/core/include/numpy/ |
| H A D | ndarrayobject.h | 107 #define PyArray_ContiguousFromAny(op, type, min_depth, max_depth) \ argument
108 PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
182 #define PyArray_FromObject(op, type, min_depth, max_depth) \ argument
183 PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
187 #define PyArray_ContiguousFromObject(op, type, min_depth, max_depth) \ argument
188 PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
192 #define PyArray_CopyFromObject(op, type, min_depth, max_depth) \ argument
193 PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
|
| /dports/textproc/py-gensim/gensim-4.0.1/gensim/corpora/ |
| H A D | textcorpus.py | 479 def __init__(self, input, dictionary=None, metadata=False, min_depth=0, max_depth=None, argument
508 self._min_depth = min_depth
543 def min_depth(self): member in TextDirectoryCorpus
546 @min_depth.setter
547 def min_depth(self, min_depth): argument
548 self._min_depth = min_depth
571 if self.min_depth <= depth <= self.max_depth:
|