#include <stdbool.h>
#include <stdlib.h>
#include "core/ppm_visibility.h"
#include "xt/xt_core.h"
Go to the source code of this file.
◆ xt_cover_finish()
◆ xt_cover_insert_or_overlap()
- Parameters
-
cover | container of extents describing already covered portions of index list |
range | describes a contiguous interval of positions to search for and insert if not found |
search_start_pos | should be 0, if forward == true or cover->num_pos_ext, if forward == false to search all of cover, choose value to start search at if part of cover is known to be non-matching |
- Returns
- SIZE_MAX if range could be fully integrated with cover, position i of overlapping cover.pos_ext[i] otherwise
Definition at line 161 of file xt_cover.c.
◆ xt_cover_range_append()
append range to cover
- Note
- user must ensure range actually is appendable, i.e. does not overlap or precede an existing range in cover
Definition at line 141 of file xt_cover.c.
◆ xt_cover_search()
- Parameters
-
cover | container of extents describing already covered portions of index list |
query | range of positions to query if any in [query.start,query.end] is already in cover |
search_start_pos | should be 0 to search all of cover, choose value to start search at if part of cover is known to be non-matching |
- Returns
- index of first position extent in cover that overlaps or is following query or SIZE_MAX if the last range is non-adjacent and precedes the query
Definition at line 100 of file xt_cover.c.
◆ xt_cover_start()
◆ xt_idxlist_pos_ext_is_full_cover()
tests if sorted pos_ext in coverage do indeed fully cover idxlist
Definition at line 75 of file xt_cover.c.