Repository navigation
Expand file tree
/
Copy pathregidx.h
More file actions
209 lines (171 loc) · 7.64 KB
/
Copy pathregidx.h
File metadata and controls
209 lines (171 loc) · 7.64 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
/*
Copyright (C) 2014-2025 Genome Research Ltd.
Author: Petr Danecek <pd3@sanger.ac.uk>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
/*
Region indexing with an optional payload.
Example of usage:
// Init the parser and print regions. In this example the payload is a
// pointer to a string. For the description of parse_custom and
// free_custom functions, see regidx_parse_f and regidx_free_f below,
// and for working example see test/test-regidx.c.
regidx_t *idx = regidx_init(in_fname,parse_custom,free_custom,sizeof(char*),NULL);
// Query overlap with chr:beg-end (beg,end are 1-based coordinates)
regitr_t *itr = regitr_init(idx);
if ( regidx_overlap(idx, chr,beg-1,end-1, itr) ) printf("There is an overlap!\n");
while ( regitr_overlap(itr) )
{
printf("[%d,%d] overlaps with [%d,%d], payload=%s\n", beg,end,
itr->beg+1, itr->end+1, regitr_payload(itr,char*));
}
regidx_destroy(idx);
regitr_destroy(itr);
Another example, loop over all regions:
regidx_t *idx = regidx_init(in_fname,NULL,NULL,0,NULL);
regitr_t *itr = regitr_init(idx);
while ( regitr_loop(itr) )
printf("chr=%s beg=%d end=%d\n", itr->seq, itr->beg+1, itr->end+1);
regidx_destroy(idx);
regitr_destroy(itr);
*/
#ifndef __REGIDX_H__
#define __REGIDX_H__
#include <stdio.h>
#include <inttypes.h>
#ifdef __cplusplus
extern "C" {
#endif
#define REGIDX_MAX 2147483646 // maximum regidx coordinate (0-based)
typedef struct _regidx_t regidx_t;
typedef struct
{
uint32_t beg,end;
void *payload;
char *seq;
void *itr;
}
regitr_t;
#define regitr_payload(itr,type_t) (*((type_t*)(itr)->payload))
typedef enum
{
merge_overlaps, // merge overlapping regions
}
regidx_opt_t;
int regidx_set(regidx_t *idx, regidx_opt_t key, ...); // returns 0 on success
/*
* regidx_parse_f - Function to parse one input line, such as regidx_parse_bed
* or regidx_parse_tab below. The function is expected to set `chr_from` and
* `chr_to` to point to first and last character of chromosome name and set
* coordinates `beg` and `end` (0-based, inclusive). If regidx_init() was
* called with non-zero payload_size, the `payload` points to a memory
* location of the payload_size and `usr` is the data passed to regidx_init().
* Any memory allocated by the function will be freed by regidx_free_f called
* by regidx_destroy().
*
* Return value: 0 on success, -1 to skip a record, -2 on fatal error.
*/
typedef int (*regidx_parse_f)(const char *line, char **chr_beg, char **chr_end, uint32_t *beg, uint32_t *end, void *payload, void *usr);
typedef void (*regidx_free_f)(void *payload);
/*
* A note about the parsers:
* - leading spaces are ignored
* - lines starting with "#" are ignored
*/
int regidx_parse_bed(const char*,char**,char**,uint32_t*,uint32_t*,void*,void*); // CHROM or whitespace-sepatated CHROM,FROM,TO (0-based,right-open)
int regidx_parse_tab(const char*,char**,char**,uint32_t*,uint32_t*,void*,void*); // CHROM or whitespace-separated CHROM,POS (1-based, inclusive)
int regidx_parse_reg(const char*,char**,char**,uint32_t*,uint32_t*,void*,void*); // CHROM, CHROM:POS, CHROM:FROM-TO, CHROM:FROM- (1-based, inclusive)
int regidx_parse_vcf(const char*,char**,char**,uint32_t*,uint32_t*,void*,void*);
/*
* regidx_init() - creates new index
* regidx_init_string() - creates new index, from a string rather than from a file
*
* @param fname: input file name or NULL if regions will be added one-by-one via regidx_insert()
* @param parsef: regidx_parse_bed, regidx_parse_tab or see description of regidx_parse_f. If NULL,
* the format will be autodetected, currently either regidx_parse_tab (the default) or
* regidx_parse_bed (file must be named 'bed' or 'bed.gz') will be used. Note that
* the exact autodetection algorithm will change.
* @param freef: NULL or see description of regidx_parse_f
* @param payload_size: 0 with regidx_parse_bed, regidx_parse_tab or see regidx_parse_f
* @param usr: optional user data passed to regidx_parse_f
*
* Returns index on success or NULL on error.
*/
regidx_t *regidx_init(const char *fname, regidx_parse_f parsef, regidx_free_f freef, size_t payload_size, void *usr);
regidx_t *regidx_init_string(const char *string, regidx_parse_f parsef, regidx_free_f freef, size_t payload_size, void *usr);
/*
* regidx_destroy() - free memory allocated by regidx_init
*/
void regidx_destroy(regidx_t *idx);
/*
* regidx_overlap() - check overlap of the location chr:from-to with regions
* @param beg,end: 0-based start, end coordinate (inclusive)
* @param itr: pointer to iterator, can be NULL if regidx_loop not needed
*
* Returns 0 if there is no overlap or 1 if overlap is found. The overlapping
* regions can be iterated as shown in the example above.
*/
int regidx_overlap(regidx_t *idx, const char *chr, uint32_t beg, uint32_t end, regitr_t *itr);
/*
* regidx_insert() - add a new region.
* regidx_insert_list() - add new regions from a list
* regidx_push() - low level insertion of a new region
*
* Returns 0 on success or -1 on error.
*/
int regidx_insert(regidx_t *idx, char *line);
int regidx_insert_list(regidx_t *idx, char *line, char delim);
int regidx_push(regidx_t *idx, char *chr_beg, char *chr_end, uint32_t beg, uint32_t end, void *payload);
/*
* regidx_seq_names() - return list of all sequence names
*/
char **regidx_seq_names(regidx_t *idx, int *n);
/*
* regidx_seq_nregs() - number of regions
* regidx_nregs() - total number of regions
*/
int regidx_seq_nregs(regidx_t *idx, const char *seq);
int regidx_nregs(regidx_t *idx);
/*
* regitr_init() - initialize an iterator. The idx parameter is required only
* with regitr_loop. If only regitr_overlap is called, NULL
* can be given.
*
* regitr_reset() - initialize an iterator for a repeated regitr_loop cycle.
* Not required with regitr_overlap.
*/
regitr_t *regitr_init(regidx_t *idx);
void regitr_destroy(regitr_t *itr);
void regitr_reset(regidx_t *idx, regitr_t *itr);
/*
* regitr_overlap() - next overlapping region
* Returns 0 when done or 1 when itr is set to next region
*/
int regitr_overlap(regitr_t *itr);
/*
* regitr_loop() - loop over all regions
* Returns 0 when done or 1 when itr is set to next region
*/
int regitr_loop(regitr_t *itr);
/*
* regitr_copy() - create a copy of an iterator for a repeated iteration with regitr_loop
*/
void regitr_copy(regitr_t *dst, regitr_t *src);
#ifdef __cplusplus
}
#endif
#endif