/dports/devel/efl/efl-1.25.1/src/lib/elementary/ |
H A D | efl_ui_position_manager_common.h | 22 unsigned int start_id, end_id; member 36 conf.range.start_id = start_id; in _batch_request_size() 37 conf.range.end_id = MIN(start_id + len, end_id); in _batch_request_size() 44 #define BATCH_ACCESS_SIZE(cb, start_id, end_id, len, cache, data) \ argument 67 range.start_id = start_id; in _batch_request_objects() 68 range.end_id = MIN(start_id + len, end_id); in _batch_request_objects() 75 #define BATCH_ACCESS_OBJECT(cb, start_id, end_id, len, data) \ argument 81 #define BATCH_ACCESS_OBJECT_VAL(cb, start_id, end_id, len, data, v) \ argument 121 if (new.end_id <= old.start_id || new.start_id >= old.end_id) in vis_segment_swap() 125 vis_change_segment(cb, new.start_id, new.end_id, EINA_TRUE); in vis_segment_swap() [all …]
|
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/lib/gitlab/background_migration/ |
H A D | fix_pages_access_level.rb | 70 def perform(start_id, stop_id) argument 71 fix_public_access_level(start_id, stop_id) 73 make_internal_projects_public(start_id, stop_id) 75 fix_private_access_level(start_id, stop_id) 86 def fix_public_access_level(start_id, stop_id) argument 87 …project_features(start_id, stop_id, ProjectFeature::PUBLIC, Project::PUBLIC).each_batch do |featur… 95 def make_internal_projects_public(start_id, stop_id) argument 110 def fix_private_access_level(start_id, stop_id) argument 111 …project_features(start_id, stop_id, ProjectFeature::ENABLED, Project::PRIVATE).find_each do |proje… 121 def project_features(start_id, stop_id, pages_access_level, project_visibility_level) argument [all …]
|
H A D | cleanup_orphaned_lfs_objects_projects.rb | 31 def perform(start_id, end_id) argument 32 cleanup_lfs_objects_projects_without_lfs_object(start_id, end_id) 33 cleanup_lfs_objects_projects_without_project(start_id, end_id) 38 def cleanup_lfs_objects_projects_without_lfs_object(start_id, end_id) argument 39 …each_record_without_association(start_id, end_id, :lfs_object, :lfs_objects) do |lfs_objects_proje… 55 def cleanup_lfs_objects_projects_without_project(start_id, end_id) argument 56 …each_record_without_association(start_id, end_id, :project, :projects) do |lfs_objects_projects_wi… 61 def each_record_without_association(start_id, end_id, association, table_name) argument 62 batch = LfsObjectsProject.where(id: start_id..end_id)
|
H A D | migrate_legacy_artifacts.rb | 14 def perform(start_id, stop_id) argument 16 insert_archives(start_id, stop_id) 17 insert_metadatas(start_id, stop_id) 18 delete_legacy_artifacts(start_id, stop_id) 24 def insert_archives(start_id, stop_id) argument 66 def insert_metadatas(start_id, stop_id) argument 109 def delete_legacy_artifacts(start_id, stop_id) argument
|
H A D | wrongfully_confirmed_email_unconfirmer.rb | 26 def self.wrongfully_confirmed_emails(start_id, stop_id) argument 29 .where(id: (start_id..stop_id)) 37 def perform(start_id, stop_id) argument 39 .wrongfully_confirmed_emails(start_id, stop_id) 45 update_email_records(start_id, stop_id) 58 def update_email_records(start_id, stop_id) argument 78 def email_query_for_update(start_id, stop_id) argument 80 .wrongfully_confirmed_emails(start_id, stop_id)
|
/dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/kdb/ |
H A D | colidx1.c | 60 if ( a < b -> loc . start_id ) in KColumnIdx1NodeFind() 76 if ( ( a -> loc . start_id + a -> loc . id_range ) <= b -> loc . start_id ) in KColumnIdx1NodeSort() 78 return a -> loc . start_id >= ( b -> loc . start_id + b -> loc . id_range ); in KColumnIdx1NodeSort() 138 buffer [ i ] . start_id = bswap_64 ( buffer [ i ] . start_id ); in KColumnIdx1Swap() 502 *first = self->data[0].start_id ; in KColumnIdx1IdRange() 528 if ( a < b -> loc . start_id ) in KColumnIdx1NodeFindFirstRowId() 532 else if ( b -> loc . start_id < pb -> next -> loc . start_id ) in KColumnIdx1NodeFindFirstRowId() 636 assert ( data [ high ] . start_id - data [ low ] . start_id != 0 ); in KColumnIdx1LocateFirstRowIdBlob() 638 / ( data [ high ] . start_id - data [ low ] . start_id ); in KColumnIdx1LocateFirstRowIdBlob() 749 assert ( data[high].start_id - data[low].start_id != 0 ); in KColumnIdx1LocateBlock() [all …]
|
H A D | wcolidx0.c | 61 if ( a -> start_id < b -> loc . start_id ) in KColumnIdx0NodeMatch() 63 else if ( a -> start_id > b -> loc . start_id ) in KColumnIdx0NodeMatch() 147 assert ( n -> loc . start_id == exist -> loc . start_id ); in KColumnIdx0Inflate() 175 buffer [ i ] . start_id = bswap_64 ( buffer [ i ] . start_id ); in KColumnIdx0Swap() 416 else if ( b -> loc . start_id < pb -> next -> loc . start_id ) in KColumnIdx0NodeFindFirstRowId() 506 assert ( ( loc -> start_id + loc -> id_range ) > loc -> start_id ); in KColumnIdx0Commit() 517 assert ( n -> loc . start_id == loc -> start_id ); in KColumnIdx0Commit() 533 n -> loc . start_id = loc -> start_id; in KColumnIdx0Commit() 547 loc_copy . start_id = bswap_64 ( loc -> start_id ); in KColumnIdx0Commit() 656 n -> loc . start_id = prior -> start_id; in KColumnIdx0Revert() [all …]
|
H A D | colidx0.c | 59 if ( a < b -> loc . start_id ) in KColumnIdx0NodeFind() 75 if ( ( a -> loc . start_id + a -> loc . id_range ) <= b -> loc . start_id ) in KColumnIdx0NodeSort() 77 return a -> loc . start_id >= ( b -> loc . start_id + b -> loc . id_range ); in KColumnIdx0NodeSort() 126 assert ( n -> loc . start_id == exist -> loc . start_id ); in KColumnIdx0Inflate() 154 buffer [ i ] . start_id = bswap_64 ( buffer [ i ] . start_id ); in KColumnIdx0Swap() 334 * first = a -> loc . start_id; in KColumnIdx0IdRange() 359 if ( a < b -> loc . start_id ) in KColumnIdx0NodeFindFirstRowId() 363 else if ( b -> loc . start_id < pb -> next -> loc . start_id ) in KColumnIdx0NodeFindFirstRowId() 391 … assert ( start >= n -> loc . start_id && start < n -> loc . start_id + n -> loc . id_range ); in KColumnIdx0FindFirstRowId() 399 * found = pb . next -> loc . start_id; in KColumnIdx0FindFirstRowId() [all …]
|
H A D | idxblk.c | 103 if ( start_id == id ) in KColIdxBlockFind0() 105 * first = start_id; in KColIdxBlockFind0() 109 if ( start_id > id ) in KColIdxBlockFind0() 141 if ( start_id == id ) in KColIdxBlockFind1() 143 * first = start_id; in KColIdxBlockFind1() 147 if ( start_id > id ) in KColIdxBlockFind1() 181 if ( start_id <= id ) in KColIdxBlockFind2() 183 if ( start_id == id || in KColIdxBlockFind2() 187 * first = start_id; in KColIdxBlockFind2() 200 if ( start_id == id ) in KColIdxBlockFind2() [all …]
|
/dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/kdb/ |
H A D | colidx1.c | 60 if ( a < b -> loc . start_id ) in KColumnIdx1NodeFind() 76 if ( ( a -> loc . start_id + a -> loc . id_range ) <= b -> loc . start_id ) in KColumnIdx1NodeSort() 78 return a -> loc . start_id >= ( b -> loc . start_id + b -> loc . id_range ); in KColumnIdx1NodeSort() 138 buffer [ i ] . start_id = bswap_64 ( buffer [ i ] . start_id ); in KColumnIdx1Swap() 502 *first = self->data[0].start_id ; in KColumnIdx1IdRange() 528 if ( a < b -> loc . start_id ) in KColumnIdx1NodeFindFirstRowId() 532 else if ( b -> loc . start_id < pb -> next -> loc . start_id ) in KColumnIdx1NodeFindFirstRowId() 636 assert ( data [ high ] . start_id - data [ low ] . start_id != 0 ); in KColumnIdx1LocateFirstRowIdBlob() 638 / ( data [ high ] . start_id - data [ low ] . start_id ); in KColumnIdx1LocateFirstRowIdBlob() 749 assert ( data[high].start_id - data[low].start_id != 0 ); in KColumnIdx1LocateBlock() [all …]
|
H A D | wcolidx0.c | 61 if ( a -> start_id < b -> loc . start_id ) in KColumnIdx0NodeMatch() 63 else if ( a -> start_id > b -> loc . start_id ) in KColumnIdx0NodeMatch() 147 assert ( n -> loc . start_id == exist -> loc . start_id ); in KColumnIdx0Inflate() 175 buffer [ i ] . start_id = bswap_64 ( buffer [ i ] . start_id ); in KColumnIdx0Swap() 416 else if ( b -> loc . start_id < pb -> next -> loc . start_id ) in KColumnIdx0NodeFindFirstRowId() 506 assert ( ( loc -> start_id + loc -> id_range ) > loc -> start_id ); in KColumnIdx0Commit() 517 assert ( n -> loc . start_id == loc -> start_id ); in KColumnIdx0Commit() 533 n -> loc . start_id = loc -> start_id; in KColumnIdx0Commit() 547 loc_copy . start_id = bswap_64 ( loc -> start_id ); in KColumnIdx0Commit() 656 n -> loc . start_id = prior -> start_id; in KColumnIdx0Revert() [all …]
|
H A D | colidx0.c | 59 if ( a < b -> loc . start_id ) in KColumnIdx0NodeFind() 75 if ( ( a -> loc . start_id + a -> loc . id_range ) <= b -> loc . start_id ) in KColumnIdx0NodeSort() 77 return a -> loc . start_id >= ( b -> loc . start_id + b -> loc . id_range ); in KColumnIdx0NodeSort() 126 assert ( n -> loc . start_id == exist -> loc . start_id ); in KColumnIdx0Inflate() 154 buffer [ i ] . start_id = bswap_64 ( buffer [ i ] . start_id ); in KColumnIdx0Swap() 334 * first = a -> loc . start_id; in KColumnIdx0IdRange() 359 if ( a < b -> loc . start_id ) in KColumnIdx0NodeFindFirstRowId() 363 else if ( b -> loc . start_id < pb -> next -> loc . start_id ) in KColumnIdx0NodeFindFirstRowId() 391 … assert ( start >= n -> loc . start_id && start < n -> loc . start_id + n -> loc . id_range ); in KColumnIdx0FindFirstRowId() 399 * found = pb . next -> loc . start_id; in KColumnIdx0FindFirstRowId() [all …]
|
H A D | idxblk.c | 103 if ( start_id == id ) in KColIdxBlockFind0() 105 * first = start_id; in KColIdxBlockFind0() 109 if ( start_id > id ) in KColIdxBlockFind0() 141 if ( start_id == id ) in KColIdxBlockFind1() 143 * first = start_id; in KColIdxBlockFind1() 147 if ( start_id > id ) in KColIdxBlockFind1() 181 if ( start_id <= id ) in KColIdxBlockFind2() 183 if ( start_id == id || in KColIdxBlockFind2() 187 * first = start_id; in KColIdxBlockFind2() 200 if ( start_id == id ) in KColIdxBlockFind2() [all …]
|
/dports/sysutils/slurm-wlm/slurm-20.02.7/src/plugins/mpi/pmi2/ |
H A D | setup.c | 461 start_id = 0; in _get_proc_mapping() 465 ( rounds[start_id] >= tasks[start_id] || in _get_proc_mapping() 467 tids[start_id][rounds[start_id]]) )) { in _get_proc_mapping() 506 start_id = 0; in _get_proc_mapping() 510 ( rounds[start_id] >= tasks[start_id] || in _get_proc_mapping() 512 tids[start_id][rounds[start_id]]) )) { in _get_proc_mapping() 520 while (rounds[start_id] < tasks[start_id] && in _get_proc_mapping() 522 tids[start_id][rounds[start_id]])) { in _get_proc_mapping() 557 start_id = 0; in _get_proc_mapping() 564 start_id = i; in _get_proc_mapping() [all …]
|
/dports/science/code_saturne/code_saturne-7.1.0/src/alge/ |
H A D | cs_matrix_assembler_priv.h | 225 cs_lnum_t start_id = 0; in _l_id_binary_search() local 228 while (start_id < end_id) { in _l_id_binary_search() 230 start_id = mid_id + 1; in _l_id_binary_search() 235 mid_id = start_id + (end_id - start_id)/2; in _l_id_binary_search() 263 cs_lnum_t start_id = 0; in _g_id_binary_find() local 265 cs_lnum_t mid_id = (end_id -start_id) / 2; in _g_id_binary_find() 266 while (start_id < end_id) { in _g_id_binary_find() 268 start_id = mid_id + 1; in _g_id_binary_find() 273 mid_id = start_id + ((end_id -start_id) / 2); in _g_id_binary_find()
|
/dports/graphics/R-cran-s2/s2/src/s2/ |
H A D | s2cell_index.cc | 31 if (range.start_id() < prev_start_id_) { in StartUnion() 34 prev_start_id_ = range.start_id(); in StartUnion() 76 S2CellId start_id, cell_id; in Build() member 80 : start_id(_start_id), cell_id(_cell_id), label(_label) {} in Build() 87 if (start_id < y.start_id) return true; in Build() 88 if (y.start_id < start_id) return false; in Build() 119 S2CellId start_id = deltas[i].start_id; in Build() local 121 for (; i < deltas.size() && deltas[i].start_id == start_id; ++i) { in Build() 129 range_nodes_.push_back({start_id, contents}); in Build()
|
/dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
H A D | s2cell_index.cc | 31 if (range.start_id() < prev_start_id_) { in StartUnion() 34 prev_start_id_ = range.start_id(); in StartUnion() 76 S2CellId start_id, cell_id; in Build() member 80 : start_id(_start_id), cell_id(_cell_id), label(_label) {} in Build() 87 if (start_id < y.start_id) return true; in Build() 88 if (y.start_id < start_id) return false; in Build() 119 S2CellId start_id = deltas[i].start_id; in Build() local 121 for (; i < deltas.size() && deltas[i].start_id == start_id; ++i) { in Build() 129 range_nodes_.push_back({start_id, contents}); in Build()
|
/dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
H A D | s2cell_index.cc | 31 if (range.start_id() < prev_start_id_) { in StartUnion() 34 prev_start_id_ = range.start_id(); in StartUnion() 76 S2CellId start_id, cell_id; in Build() member 80 : start_id(_start_id), cell_id(_cell_id), label(_label) {} in Build() 87 if (start_id < y.start_id) return true; in Build() 88 if (y.start_id < start_id) return false; in Build() 119 S2CellId start_id = deltas[i].start_id; in Build() local 121 for (; i < deltas.size() && deltas[i].start_id == start_id; ++i) { in Build() 129 range_nodes_.push_back({start_id, contents}); in Build()
|
/dports/science/code_saturne/code_saturne-7.1.0/src/base/ |
H A D | cs_map.c | 259 int start_id, end_id, mid_id; in cs_map_name_to_id() local 264 start_id = 0; in cs_map_name_to_id() 266 mid_id = start_id + ((end_id -start_id) / 2); in cs_map_name_to_id() 268 while (start_id <= end_id) { in cs_map_name_to_id() 271 start_id = mid_id + 1; in cs_map_name_to_id() 276 mid_id = start_id + ((end_id -start_id) / 2); in cs_map_name_to_id() 303 int start_id, end_id, mid_id; in cs_map_name_to_id_try() local 312 start_id = 0; in cs_map_name_to_id_try() 314 mid_id = start_id + ((end_id -start_id) / 2); in cs_map_name_to_id_try() 319 start_id = mid_id + 1; in cs_map_name_to_id_try() [all …]
|
/dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/vdb/ |
H A D | index_project.c | 78 int64_t start_id; in index_project_impl() local 101 empty_row_id_start = (*rslt)->start_id; in index_project_impl() 102 empty_row_id_count = (*rslt)->stop_id - (*rslt)->start_id + 1; in index_project_impl() 116 …rc = KIndexProjectText(self->ndx, row_id, &start_id, &id_count, temp_buff.base, temp_buff.elem_cou… in index_project_impl() 126 start_id = row_id; in index_project_impl() 144 if ( start_id < empty_row_id_start ) in index_project_impl() 146 id_count -= empty_row_id_start - start_id; in index_project_impl() 147 start_id = empty_row_id_start; in index_project_impl() 150 if ( start_id + id_count > empty_row_id_start + empty_row_id_count ) in index_project_impl() 152 id_count = empty_row_id_start + empty_row_id_count - start_id; in index_project_impl() [all …]
|
H A D | wcolumn.c | 583 rm -> start_id = self -> end_id; in WColumnCommitRowData() 751 uint64_t num_rows = rm [ rm_idx ] . start_id + rm [ rm_idx ] . cnt - self -> start_id; in WColumnSplitBuffer() 752 assert ( rm [ 0 ] . start_id == self -> start_id ); in WColumnSplitBuffer() 759 id = self -> start_id + num_rows; in WColumnSplitBuffer() 762 num_rows = id - self -> start_id; in WColumnSplitBuffer() 925 split -> start_id = id; in WColumnSplitBuffer() 941 if ( self -> start_id >= id ) in WColumnRowMapCompare() 975 assert ( self -> start_id == rm [ 0 ] . start_id ); in WColumnBufferPage() 976 if ( end_id < self -> start_id ) in WColumnBufferPage() 995 ( rm [ right - 1 ] . start_id + rm [ right - 1 ] . cnt - rm [ left ] . start_id ); in WColumnBufferPage() [all …]
|
/dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/vdb/ |
H A D | index_project.c | 78 int64_t start_id; in index_project_impl() local 101 empty_row_id_start = (*rslt)->start_id; in index_project_impl() 102 empty_row_id_count = (*rslt)->stop_id - (*rslt)->start_id + 1; in index_project_impl() 116 …rc = KIndexProjectText(self->ndx, row_id, &start_id, &id_count, temp_buff.base, temp_buff.elem_cou… in index_project_impl() 126 start_id = row_id; in index_project_impl() 144 if ( start_id < empty_row_id_start ) in index_project_impl() 146 id_count -= empty_row_id_start - start_id; in index_project_impl() 147 start_id = empty_row_id_start; in index_project_impl() 150 if ( start_id + id_count > empty_row_id_start + empty_row_id_count ) in index_project_impl() 152 id_count = empty_row_id_start + empty_row_id_count - start_id; in index_project_impl() [all …]
|
H A D | wcolumn.c | 583 rm -> start_id = self -> end_id; in WColumnCommitRowData() 751 uint64_t num_rows = rm [ rm_idx ] . start_id + rm [ rm_idx ] . cnt - self -> start_id; in WColumnSplitBuffer() 752 assert ( rm [ 0 ] . start_id == self -> start_id ); in WColumnSplitBuffer() 759 id = self -> start_id + num_rows; in WColumnSplitBuffer() 762 num_rows = id - self -> start_id; in WColumnSplitBuffer() 925 split -> start_id = id; in WColumnSplitBuffer() 941 if ( self -> start_id >= id ) in WColumnRowMapCompare() 975 assert ( self -> start_id == rm [ 0 ] . start_id ); in WColumnBufferPage() 976 if ( end_id < self -> start_id ) in WColumnBufferPage() 995 ( rm [ right - 1 ] . start_id + rm [ right - 1 ] . cnt - rm [ left ] . start_id ); in WColumnBufferPage() [all …]
|
/dports/net-mgmt/netdot/Netdot-netdot-1.0.7/htdocs/cable_plant/ |
H A D | cable_plant_backbone.mhtml | 4 $start_id => undef; 45 elsif ($start_id && $end_id) { 46 my $s1 = Site->retrieve($start_id); 55 elsif ($start_id) { 56 my $start_site = Site->retrieve($start_id); 124 …push( @headers, '<a href="cable_plant.html?start_id=' . $start_id . '&end_id=' . $end_id . '&site_… 126 …push( @headers, '<a href="cable_plant.html?start_id=' . $start_id . '&end_id=' . $end_id . '&site_… 132 …push( @headers, '<a href="cable_plant.html?start_id=' . $start_id . '&end_id=' . $end_id . '&site_… 138 …push( @headers, '<a href="cable_plant.html?start_id=' . $start_id . '&end_id=' . $end_id . '&site_… 140 …push( @headers, '<a href="cable_plant.html?start_id=' . $start_id . '&end_id=' . $end_id . '&site_… [all …]
|
/dports/science/code_saturne/code_saturne-7.1.0/src/fvm/ |
H A D | fvm_writer_helper.c | 269 cs_lnum_t start_id = 0; in _extra_vertex_get_gnum() local 400 cs_lnum_t start_id = 0; in _field_helper_output_eg() local 435 cs_lnum_t start_id = 0; in _field_helper_output_eg() local 539 cs_lnum_t start_id = 0; in _field_helper_output_eg() local 735 cs_lnum_t start_id = 0; in _field_helper_output_el() local 911 cs_lnum_t start_id = 0; in _field_helper_output_ng() local 1632 h->start_id = 0; in fvm_writer_field_helper_create() 2062 h->start_id = end_id; in fvm_writer_field_helper_step_el() 2071 h->start_id = 0; in fvm_writer_field_helper_step_el() 2168 h->start_id = end_id; in fvm_writer_field_helper_step_nl() [all …]
|