Home
last modified time | relevance | path

Searched refs:level_index (Results 1 – 25 of 199) sorted by relevance

12345678

/dports/archivers/laszip/LASzip-3.4.3/src/
H A Dlasquadtree.cpp288 U32 level_index = 0; in get_level_index() local
292 level_index <<= 2; in get_level_index()
304 level_index |= 1; in get_level_index()
318 return level_index; in get_level_index()
340 U32 level_index = 0; in get_level_index() local
344 level_index <<= 2; in get_level_index()
379 return level_index; in get_level_index()
414 level_index = level_index >> 2; in coarsen()
420 level_index = level_index << 2; in coarsen()
636 U32 level_index; in read() local
[all …]
H A Dlasquadtree.hpp100 void get_cell_bounding_box(U32 level_index, U32 level, F32* min, F32* max) const;
101 void get_cell_bounding_box(U32 level_index, U32 level, F64* min, F64* max) const;
102 void get_cell_bounding_box(U32 level_index, F32* min, F32* max) const;
103 void get_cell_bounding_box(U32 level_index, F64* min, F64* max) const;
111 U32 get_cell_index(U32 level_index, U32 level) const;
112 U32 get_cell_index(U32 level_index) const;
148 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
149 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
150 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
151 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
[all …]
/dports/misc/lastools/LAStools-8ff2694/LASzip/src/
H A Dlasquadtree.cpp288 U32 level_index = 0; in get_level_index() local
292 level_index <<= 2; in get_level_index()
304 level_index |= 1; in get_level_index()
318 return level_index; in get_level_index()
340 U32 level_index = 0; in get_level_index() local
344 level_index <<= 2; in get_level_index()
379 return level_index; in get_level_index()
414 level_index = level_index >> 2; in coarsen()
420 level_index = level_index << 2; in coarsen()
636 U32 level_index; in read() local
[all …]
H A Dlasquadtree.hpp100 void get_cell_bounding_box(U32 level_index, U32 level, F32* min, F32* max) const;
101 void get_cell_bounding_box(U32 level_index, U32 level, F64* min, F64* max) const;
102 void get_cell_bounding_box(U32 level_index, F32* min, F32* max) const;
103 void get_cell_bounding_box(U32 level_index, F64* min, F64* max) const;
111 U32 get_cell_index(U32 level_index, U32 level) const;
112 U32 get_cell_index(U32 level_index) const;
148 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
149 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
150 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
151 …n_x, const F32 cell_max_x, const F32 cell_min_y, const F32 cell_max_y, U32 level, U32 level_index);
[all …]
/dports/www/osrm-backend/osrm-backend-5.26.0/include/partitioner/
H A Dremove_unconnected.hpp24 for (int level_index = partitions.size() - 1; level_index >= 0; level_index--) in removeUnconnectedBoundaryNodes() local
39 const auto cell_id = partitions[level_index][node]; in removeUnconnectedBoundaryNodes()
44 const auto target_cell_id = partitions[level_index][target]; in removeUnconnectedBoundaryNodes()
62 if (level_index < static_cast<int>(partitions.size() - 1)) in removeUnconnectedBoundaryNodes()
66 return partitions[level_index + 1][node] != in removeUnconnectedBoundaryNodes()
67 partitions[level_index + 1][witness.id]; in removeUnconnectedBoundaryNodes()
82 for (auto sublevel_index = level_index; sublevel_index >= 0; in removeUnconnectedBoundaryNodes()
99 for (auto sublevel_index = level_index; sublevel_index >= 0; --sublevel_index) in removeUnconnectedBoundaryNodes()
/dports/devel/libfastcommon/libfastcommon-1.0.43/src/
H A Dskiplist_set.c153 int level_index; in skiplist_set_insert() local
158 level_index = skiplist_set_get_level_index(sl); in skiplist_set_insert()
160 for (i=sl->top_level_index; i>level_index; i--) { in skiplist_set_insert()
198 for (i=0; i<=level_index; i++) { in skiplist_set_insert()
207 void *data, int *level_index) in skiplist_set_get_equal_previous() argument
221 *level_index = i; in skiplist_set_get_equal_previous()
285 int level_index; in skiplist_set_delete() local
294 deleted = previous->links[level_index]; in skiplist_set_delete()
295 for (i=level_index; i>=0; i--) { in skiplist_set_delete()
315 int level_index; in skiplist_set_find() local
[all …]
H A Dmulti_skiplist.c156 int *level_index) in multi_skiplist_get_previous() argument
170 *level_index = i; in multi_skiplist_get_previous()
256 int level_index; in multi_skiplist_insert() local
270 node = previous->links[level_index]; in multi_skiplist_insert()
276 level_index = multi_skiplist_get_level_index(sl); in multi_skiplist_insert()
307 for (i=0; i<=level_index; i++) { in multi_skiplist_insert()
319 int level_index; in multi_skiplist_do_delete() local
331 deleted = previous->links[level_index]; in multi_skiplist_do_delete()
343 for (i=level_index; i>=0; i--) { in multi_skiplist_do_delete()
380 int level_index; in multi_skiplist_find() local
[all …]
H A Dflat_skiplist.c154 int level_index; in flat_skiplist_insert() local
158 level_index = flat_skiplist_get_level_index(sl); in flat_skiplist_insert()
190 for (i=0; i<=level_index; i++) { in flat_skiplist_insert()
199 int *level_index) in flat_skiplist_get_previous() argument
213 *level_index = i; in flat_skiplist_get_previous()
291 int level_index; in flat_skiplist_delete() local
300 deleted = previous->links[level_index]; in flat_skiplist_delete()
301 for (i=level_index; i>=0; i--) { in flat_skiplist_delete()
331 int level_index; in flat_skiplist_find() local
340 int level_index; in flat_skiplist_find_all() local
[all …]
/dports/math/yices/yices-2.6.2/src/solvers/egraph/
H A Ddiseq_stacks.c38 stack->level_index = (uint32_t *) safe_malloc(DEF_DISEQ_STACK_NLEVELS * sizeof(uint32_t)); in init_diseq_stack()
40 stack->level_index[0] = 0; in init_diseq_stack()
73 stack->level_index = (uint32_t *) safe_realloc(stack->level_index, n * sizeof(uint32_t)); in extend_diseq_stack_levels()
83 safe_free(stack->level_index); in delete_diseq_stack()
85 stack->level_index = NULL; in delete_diseq_stack()
98 stack->level_index[k] = stack->top; in diseq_stack_increase_dlevel()
H A Ddiseq_stacks.h57 uint32_t *level_index; // level_index[i] = value of top when decision level i was entered member
92 assert(stack->level_index[0] == 0); in reset_diseq_stack()
124 stack->top = stack->level_index[back_level + 1]; in diseq_stack_backtrack()
/dports/math/py-matplotlib2/matplotlib-2.2.4/src/
H A D_contour.cpp673 unsigned int level_index, in follow_boundary() argument
680 assert((level_index == 1 || level_index == 2) && in follow_boundary()
796 return level_index; in follow_boundary()
811 assert((level_index == 1 || level_index == 2) && in follow_interior()
878 if ((Z_LEVEL(point_opposite) >= level_index) ^ (level_index == 2)) in follow_interior()
984 assert((level_index == 1 || level_index == 2) && in get_corner_start_edge()
1028 if (level_index == 2) in get_corner_start_edge()
1154 assert((level_index == 1 || level_index == 2) && in get_quad_start_edge()
1165 if (level_index == 2) in get_quad_start_edge()
1180 if (!SADDLE(quad,level_index) || SADDLE_START_SW(quad,level_index)) in get_quad_start_edge()
[all …]
/dports/math/py-matplotlib/matplotlib-3.4.3/src/
H A D_contour.cpp673 unsigned int level_index, in follow_boundary() argument
680 assert((level_index == 1 || level_index == 2) && in follow_boundary()
796 return level_index; in follow_boundary()
811 assert((level_index == 1 || level_index == 2) && in follow_interior()
878 if ((Z_LEVEL(point_opposite) >= level_index) ^ (level_index == 2)) in follow_interior()
984 assert((level_index == 1 || level_index == 2) && in get_corner_start_edge()
1028 if (level_index == 2) in get_corner_start_edge()
1154 assert((level_index == 1 || level_index == 2) && in get_quad_start_edge()
1165 if (level_index == 2) in get_quad_start_edge()
1180 if (!SADDLE(quad,level_index) || SADDLE_START_SW(quad,level_index)) in get_quad_start_edge()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libwebm/source/common/
H A Dvp9_level_stats.cc137 int level_index = 0; in GetLevel() local
146 level_index = i; in GetLevel()
155 level_index = i; in GetLevel()
164 level_index = i; in GetLevel()
173 level_index = i; in GetLevel()
184 level_index = i; in GetLevel()
193 level_index = i; in GetLevel()
203 level_index = i; in GetLevel()
213 if (min_altref_distance < Vp9LevelTable[level_index].min_altref_distance) in GetLevel()
218 if (compresion_ratio < Vp9LevelTable[level_index].compresion_ratio) in GetLevel()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/libwebm/source/common/
H A Dvp9_level_stats.cc137 int level_index = 0; in GetLevel() local
146 level_index = i; in GetLevel()
155 level_index = i; in GetLevel()
164 level_index = i; in GetLevel()
173 level_index = i; in GetLevel()
184 level_index = i; in GetLevel()
193 level_index = i; in GetLevel()
203 level_index = i; in GetLevel()
213 if (min_altref_distance < Vp9LevelTable[level_index].min_altref_distance) in GetLevel()
218 if (compresion_ratio < Vp9LevelTable[level_index].compresion_ratio) in GetLevel()
/dports/biology/py-biopython/biopython-1.79/Bio/PDB/
H A DSelection.py66 level_index = entity_levels.index(level)
68 if level_index == target_index: # already right level
71 if level_index > target_index: # we're going down, e.g. S->A
72 for i in range(target_index, level_index):
75 for i in range(level_index, target_index):
/dports/mail/vpopmail/vpopmail-5.4.33/
H A Dbigdir.c74 vdir->level_index[in_level] = vdir->level_start[in_level]; in inc_dir()
81 ++vdir->level_index[in_level]; in inc_dir()
106 if ( vdir->level_index[vdir->level_cur] == in inc_dir_control()
115 if ( vdir->level_index[0]==vdir->level_end[0] && in inc_dir_control()
116 vdir->level_index[1]==vdir->level_end[1]) { in inc_dir_control()
/dports/games/krank/krank-07/levels/
H A Dmenu_scores1.py24 level_index = level-1
26 y = numLevels>20 and h*(level_index%15+5)/25 or h*(level_index+5)/30
27 x = numLevels>20 and (level_index < 15 and w*0.35 or w*0.62) or c
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/inactive/
H A DLRDHierarchInterpPolyApproximation.cpp60 const unsigned int this_dim_level = level_index[dim_idx][0]; in value()
93 const unsigned int this_dim_level = level_index[dim_idx][0]; in value()
94 const unsigned int this_dim_index = level_index[dim_idx][1]; in value()
189 const unsigned int this_dim_level = level_index[dim_idx][0]; in gradient_basis_variables()
190 const unsigned int this_dim_index = level_index[dim_idx][1]; in gradient_basis_variables()
237 const unsigned int this_dim_level = level_index[dim_idx2][0]; in gradient_basis_variables()
238 const unsigned int this_dim_index = level_index[dim_idx2][1]; in gradient_basis_variables()
424 const unsigned int this_dim_level = level_index[dim_idx2][0]; in gradient_basis_variables()
425 const unsigned int this_dim_index = level_index[dim_idx2][1]; in gradient_basis_variables()
854 const unsigned int this_dim_level = level_index[dim_idx][0]; in value()
[all …]
/dports/multimedia/libgav1/libgav1-0.17.0/src/post_filter/
H A Ddeblock.cc59 const ObuFrameHeader& frame_header, int segment_id, int level_index, in ComputeDeblockFilterLevelsHelper() argument
62 const int delta = delta_lf[frame_header.delta_lf.multi ? level_index : 0]; in ComputeDeblockFilterLevelsHelper()
66 kSegmentFeatureLoopFilterYVertical + level_index); in ComputeDeblockFilterLevelsHelper()
107 int level_index = 0; in ComputeDeblockFilterLevels() local
108 for (; level_index < 2; ++level_index) { in ComputeDeblockFilterLevels()
110 frame_header_, segment_id, level_index, delta_lf, in ComputeDeblockFilterLevels()
111 deblock_filter_levels[segment_id][level_index]); in ComputeDeblockFilterLevels()
113 for (; level_index < kFrameLfCount; ++level_index) { in ComputeDeblockFilterLevels()
114 if (frame_header_.loop_filter.level[level_index] != 0) { in ComputeDeblockFilterLevels()
116 frame_header_, segment_id, level_index, delta_lf, in ComputeDeblockFilterLevels()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libgav1/src/src/post_filter/
H A Ddeblock.cc59 const ObuFrameHeader& frame_header, int segment_id, int level_index, in ComputeDeblockFilterLevelsHelper() argument
62 const int delta = delta_lf[frame_header.delta_lf.multi ? level_index : 0]; in ComputeDeblockFilterLevelsHelper()
66 kSegmentFeatureLoopFilterYVertical + level_index); in ComputeDeblockFilterLevelsHelper()
107 int level_index = 0; in ComputeDeblockFilterLevels() local
108 for (; level_index < 2; ++level_index) { in ComputeDeblockFilterLevels()
110 frame_header_, segment_id, level_index, delta_lf, in ComputeDeblockFilterLevels()
111 deblock_filter_levels[segment_id][level_index]); in ComputeDeblockFilterLevels()
113 for (; level_index < kFrameLfCount; ++level_index) { in ComputeDeblockFilterLevels()
114 if (frame_header_.loop_filter.level[level_index] != 0) { in ComputeDeblockFilterLevels()
116 frame_header_, segment_id, level_index, delta_lf, in ComputeDeblockFilterLevels()
[all …]
/dports/mail/vpopmail/vpopmail-5.4.33/contrib/
H A Dvcdir.c126 vdir->level_index[i] = 0; in vread_cdb_dir_control()
153 &vdir->level_index[0], in vread_cdb_dir_control()
154 &vdir->level_index[1], in vread_cdb_dir_control()
155 &vdir->level_index[2]); in vread_cdb_dir_control()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/gpu/kinfu_large_scale/src/
H A Dkinfu.cpp391 for (int level_index = LEVELS-1; level_index>=0; --level_index) in performICP() local
393 int iter_num = icp_iterations_[level_index]; in performICP()
396 MapArr& vmap_curr = vmaps_curr_[level_index]; in performICP()
397 MapArr& nmap_curr = nmaps_curr_[level_index]; in performICP()
400 MapArr& vmap_g_prev = vmaps_g_prev_[level_index]; in performICP()
484 for (int level_index = LEVELS-1; level_index>=0; --level_index) in performPairWiseICP() local
486 int iter_num = icp_iterations_[level_index]; in performPairWiseICP()
489 MapArr& vmap_curr = vmaps_curr_[level_index]; in performPairWiseICP()
490 MapArr& nmap_curr = nmaps_curr_[level_index]; in performPairWiseICP()
493 MapArr& vmap_prev = vmaps_prev_[level_index]; in performPairWiseICP()
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/mpi/src/
H A Dcomputation_tree.cpp41 int computation_tree::level_index(int n) const in level_index() function in boost::mpi::detail::computation_tree
65 int child_index = level_index(level_ + 1) in child_begin()
66 + branching_factor_ * (n - level_index(level_)); in child_begin()
/dports/devel/boost-python-libs/boost_1_72_0/libs/mpi/src/
H A Dcomputation_tree.cpp41 int computation_tree::level_index(int n) const in level_index() function in boost::mpi::detail::computation_tree
65 int child_index = level_index(level_ + 1) in child_begin()
66 + branching_factor_ * (n - level_index(level_)); in child_begin()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/mpi/src/
H A Dcomputation_tree.cpp41 int computation_tree::level_index(int n) const in level_index() function in boost::mpi::detail::computation_tree
65 int child_index = level_index(level_ + 1) in child_begin()
66 + branching_factor_ * (n - level_index(level_)); in child_begin()

12345678