Debian Codegraph @

tags

raw
1 !_TAG_FILE_FORMAT 2 /extended format; --format=1 will not append ;" to lines/
2 !_TAG_FILE_SORTED 1 /0=unsorted, 1=sorted, 2=foldcase/
3 !_TAG_PROGRAM_AUTHOR Darren Hiebert /[email protected]/
4 !_TAG_PROGRAM_NAME Exuberant Ctags //
5 !_TAG_PROGRAM_URL http://ctags.sourceforge.net /official site/
6 !_TAG_PROGRAM_VERSION 5.8 //
7 ALN_CIGAR_MAX_LEN aln_cigar.h 26;" d
8 ALN_CIGAR_TYPE_CLIP1 aln_cigar.h 33;" d
9 ALN_CIGAR_TYPE_CLIP2 aln_cigar.h 34;" d
10 ALN_CIGAR_TYPE_DEL aln_cigar.h 31;" d
11 ALN_CIGAR_TYPE_INS aln_cigar.h 30;" d
12 ALN_CIGAR_TYPE_MAT aln_cigar.h 29;" d
13 ALN_CIGAR_TYPE_NULL aln_cigar.h 28;" d
14 ALN_CIGAR_TYPE_SKIP aln_cigar.h 32;" d
15 ASM_KMER_MASK asm_R2.h 32;" d
16 ASM_KMER_SIZE asm_R2.h 31;" d
17 ASM_R2_H asm_R2.h 20;" d
18 AlnAln stdaln.h /^} AlnAln;$/;" t typeref:struct:__anon16
19 AlnCigar aln_cigar.h /^} AlnCigar;$/;" t typeref:struct:__anon56
20 AlnParam stdaln.h /^} AlnParam;$/;" t typeref:struct:__anon14
21 BaseCnt divide.c /^} BaseCnt;$/;" t typeref:struct:__anon55 file:
22 BitVec bitvec.h /^} BitVec;$/;" t typeref:struct:__anon54
23 Block mergetag.c /^} Block;$/;" t typeref:struct:__anon13 file:
24 BloomFilter bloom_filter.h /^} BloomFilter;$/;" t typeref:struct:__anon34
25 BufferedInputFile file_reader.h /^} BufferedInputFile;$/;" t typeref:struct:__anon33
26 CC Makefile /^CC=gcc$/;" m
27 CFLAGS Makefile /^CFLAGS= -W -O2 -Wall -finline-functions -D_FILE_OFFSET_BITS=64$/;" m
28 C_N_2 divide.c /^static inline uint32_t C_N_2(uint32_t n){$/;" f file:
29 Cluster rainbow.h /^} Cluster;$/;" t typeref:struct:__anon20
30 Ctg mergecontig.h /^} Ctg;$/;" t typeref:struct:__anon45
31 CtgDB mergecontig.h /^} CtgDB;$/;" t typeref:struct:__anon46
32 D stdaln.c /^ int M, I, D;$/;" m struct:__anon10 file:
33 DELETE ezmsim.c /^enum muttype_t {NOCHANGE = 0, INSERT = 0x1000, SUBSTITUTE = 0xe000, DELETE = 0xf000};$/;" e enum:muttype_t file:
34 DEPTH ezmsim.c /^static double DEPTH = 10.0;$/;" v file:
35 Div rainbow.h /^} Div;$/;" t typeref:struct:__anon23
36 Dt stdaln.c /^ unsigned char Mt:3, It:2, Dt:2;$/;" m struct:__anon9 file:
37 EF asm_R2.h /^} EF;$/;" t typeref:struct:__anon40
38 EF_main ezmsim.c /^int EF_main(int argc, char *argv[])$/;" f
39 EF_usage ezmsim.c /^int EF_usage()$/;" f
40 ERR_RATE ezmsim.c /^static double ERR_RATE = 0.02;$/;" v file:
41 FASTA_FLAG_NORMAL file_reader.h 101;" d
42 FASTA_FLAG_NO_NAME file_reader.h 102;" d
43 FASTA_FLAG_NO_SEQ file_reader.h 103;" d
44 FASTQ_FLAG_NORMAL file_reader.h 109;" d
45 FASTQ_FLAG_NO_NAME file_reader.h 110;" d
46 FASTQ_FLAG_NO_QUAL file_reader.h 112;" d
47 FASTQ_FLAG_NO_SEQ file_reader.h 111;" d
48 FContig asm_R2.h /^} FContig;$/;" t typeref:struct:__anon38
49 FROM_D stdaln.h 39;" d
50 FROM_I stdaln.h 38;" d
51 FROM_M stdaln.h 37;" d
52 FRead asm_R2.h /^} FRead;$/;" t typeref:struct:__anon37
53 FileReader file_reader.h /^} FileReader;$/;" t typeref:struct:__anon31
54 GENERIC_SRC Makefile /^GENERIC_SRC= string.h bitvec.h file_reader.h hashset.h sort.h list.h dna.h heap.h stdaln.h vector.h$/;" m
55 GLIBS Makefile /^GLIBS=-lm$/;" m
56 Gpush_vec vector.h 112;" d
57 HASH_FLAG_MACROS hashset.h 53;" d
58 HOM_RATE ezmsim.c /^static double HOM_RATE = 0.0;$/;" v file:
59 Heap heap.h /^} Heap;$/;" t typeref:struct:__anon11
60 I stdaln.c /^ int M, I, D;$/;" m struct:__anon10 file:
61 INDEL_EXTEND ezmsim.c /^static double INDEL_EXTEND = 0.3;$/;" v file:
62 INDEL_FRAC ezmsim.c /^static double INDEL_FRAC = 0.1;$/;" v file:
63 INIT_IDX ezmsim.c 52;" d file:
64 INIT_SEQ ezmsim.c 51;" d file:
65 INSERT ezmsim.c /^enum muttype_t {NOCHANGE = 0, INSERT = 0x1000, SUBSTITUTE = 0xe000, DELETE = 0xf000};$/;" e enum:muttype_t file:
66 It stdaln.c /^ unsigned char Mt:3, It:2, Dt:2;$/;" m struct:__anon9 file:
67 KMER_NUM rainbow.h /^ uint32_t KMER_NUM;$/;" m struct:__anon20
68 KMER_SIZE rainbow.h /^ uint32_t KMER_SIZE;$/;" m struct:__anon20
69 KMER_SIZE_CTG mergecontig.h 13;" d
70 K_allele rainbow.h /^ uint32_t k_allele, K_allele;$/;" m struct:__anon23
71 LH3_STDALN_H_ stdaln.h 24;" d
72 LOCAL_OVERFLOW_REDUCE stdaln.c 233;" d file:
73 LOCAL_OVERFLOW_THRESHOLD stdaln.c 232;" d file:
74 LR_main ezmsim.c /^int LR_main(int argc, char *argv[])$/;" f
75 LR_usage ezmsim.c /^int LR_usage() {$/;" f
76 M stdaln.c /^ int M, I, D;$/;" m struct:__anon10 file:
77 MAX_RD_LEN asm_R2.h 30;" d
78 MERGECTG_H mergectg.h 2;" d
79 MINOR_INF stdaln.h 42;" d
80 MUT_RATE ezmsim.c /^static double MUT_RATE = 0.001;$/;" v file:
81 MYALLOC stdaln.h 31;" d
82 MYFREE stdaln.h 34;" d
83 Mt stdaln.c /^ unsigned char Mt:3, It:2, Dt:2;$/;" m struct:__anon9 file:
84 MurmurHash64A hashset.h /^static inline uint64_t MurmurHash64A(const void * key, int len, uint32_t seed){$/;" f
85 NOCHANGE ezmsim.c /^enum muttype_t {NOCHANGE = 0, INSERT = 0x1000, SUBSTITUTE = 0xe000, DELETE = 0xf000};$/;" e enum:muttype_t file:
86 NT_LOCAL_MASK stdaln.c 236;" d file:
87 NT_LOCAL_SCORE stdaln.c 234;" d file:
88 NT_LOCAL_SHIFT stdaln.c 235;" d file:
89 ONES_STEP_4 bitvec.h 92;" d
90 ONES_STEP_8 bitvec.h 93;" d
91 Overlap asm_R2.h /^} Overlap;$/;" t typeref:struct:__anon39
92 PACKAGE_VERSION ezmsim.c 11;" d file:
93 PWDB mergecontig.h /^} PWDB;$/;" t typeref:struct:__anon48
94 PWcontig mergecontig.h /^} PWcontig;$/;" t typeref:struct:__anon47
95 RD_KMER_SIZE mergectg.h /^ uint32_t RD_KMER_SIZE; \/\/ parameter$/;" m struct:__anon8
96 REC mergetag.c /^} REC;$/;" t typeref:struct:__anon12 file:
97 ReadInfo rainbow.h /^} ReadInfo;$/;" t typeref:struct:__anon21
98 SBT rainbow.h /^} SBT;$/;" t typeref:struct:__anon19
99 SEQ_BLOCK_SIZE ezmsim.c /^static int SEQ_BLOCK_SIZE = 512;$/;" v file:
100 SET_INF stdaln.c 238;" d file:
101 STDALN_VERSION stdaln.h 27;" d
102 SUBSTITUTE ezmsim.c /^enum muttype_t {NOCHANGE = 0, INSERT = 0x1000, SUBSTITUTE = 0xe000, DELETE = 0xf000};$/;" e enum:muttype_t file:
103 SWAP_TMP string.h 34;" d
104 SeqDB rainbow.h /^} SeqDB;$/;" t typeref:struct:__anon18
105 SeqFileAttr file_reader.h /^} SeqFileAttr;$/;" t typeref:struct:__anon32
106 Sequence file_reader.h /^} Sequence;$/;" t typeref:struct:__anon29
107 SimpAssembler simp_asm.h /^} SimpAssembler;$/;" t typeref:struct:__anon51
108 SimpContigInfo simp_asm.h /^} SimpContigInfo;$/;" t typeref:struct:__anon50
109 SimpSeqInfo simp_asm.h /^} SimpSeqInfo;$/;" t typeref:struct:__anon49
110 String string.h /^} String;$/;" t typeref:struct:__anon52
111 Vector vector.h /^typedef struct Vector {$/;" s
112 Vector vector.h /^} Vector;$/;" t typeref:struct:Vector
113 VirtualString string.h /^} VirtualString;$/;" t typeref:struct:__anon53
114 __ALN_CIGAR_RJ_H aln_cigar.h 21;" d
115 __BIT_VEC_RJ_H bitvec.h 21;" d
116 __BLOOM_FILTER_RJ_H bloom_filter.h 22;" d
117 __DNA_RJ_H dna.h 21;" d
118 __FILE_READER_RJ_H file_reader.h 21;" d
119 __HASH_SET_RJ hashset.h 21;" d
120 __HEAP_RJ_H heap.h 21;" d
121 __LIST_RJ_H list.h 21;" d
122 __MERGECONTIG_H mergecontig.h 2;" d
123 __RAINBOW_RJ_H rainbow.h 21;" d
124 __SIMPLE_ASM_RJ_H simp_asm.h 21;" d
125 __SORT_RJ_H sort.h 21;" d
126 __STRING_RJ_H string.h 21;" d
127 __VECTOR_H_RJ vector.h 21;" d
128 __lh3_Jenkins_hash_64 hashset.h /^static inline uint64_t __lh3_Jenkins_hash_64(uint64_t key){$/;" f
129 __lh3_Jenkins_hash_int hashset.h /^static inline uint32_t __lh3_Jenkins_hash_int(uint32_t key){$/;" f
130 __string_hashcode hashset.h /^static inline uint32_t __string_hashcode(const char *s){$/;" f
131 _aln_cigar_add_cigar aln_cigar.h /^static inline int _aln_cigar_add_cigar(AlnCigar *cs, int n_cigar, int len, int type){$/;" f
132 _aln_cigar_h_num_str_len aln_cigar.h /^static inline int _aln_cigar_h_num_str_len(int n){$/;" f
133 _call_key_col divide.c /^uint32_t _call_key_col(Div *div, uint32_t gid){$/;" f
134 _rj_hashset_find_prime hashset.h /^static inline uint64_t _rj_hashset_find_prime(uint64_t n){$/;" f
135 add_char_string string.h /^static inline void add_char_string(String *str, char ch){$/;" f
136 add_hashset_macro hashset.h 172;" d
137 add_read2ef asm_R2.c /^void add_read2ef(EF *ef, char *seq, uint32_t seq_id, uint32_t rd_len, uint32_t rank){ add_read2ef_core(ef, seq, seq_id, rd_len, (rank == 0)? 1 : rank); }$/;" f
138 add_read2ef_core asm_R2.c /^void add_read2ef_core(EF *ef, char *seq, uint32_t seq_id, uint32_t rd_len, uint32_t rank){$/;" f
139 add_vec_size vector.h /^static inline int add_vec_size(Vector *vec, size_t add_size){$/;" f
140 align_reads_ef asm_R2.c /^void align_reads_ef(EF *ef){$/;" f
141 aln_aa_rev_table stdaln.c /^char *aln_aa_rev_table = "ARNDCQEGHILKMFPSTWYV*X-";$/;" v
142 aln_aa_table stdaln.c /^unsigned char aln_aa_table[256] = {$/;" v
143 aln_cigar_string aln_cigar.h /^static const char aln_cigar_string[8] = "?IDM?SHN";$/;" v
144 aln_cmp mergecontig.c /^int aln_cmp(const void *p0, const void *p1, void *ref) {$/;" f
145 aln_ext_size simp_asm.h /^ int aln_ext_size;$/;" m struct:__anon51
146 aln_free_AlnAln stdaln.c /^void aln_free_AlnAln(AlnAln *aa)$/;" f
147 aln_global_core stdaln.c /^int aln_global_core(unsigned char *seq1, int len1, unsigned char *seq2, int len2, const AlnParam *ap,$/;" f
148 aln_init_AlnAln stdaln.c /^AlnAln *aln_init_AlnAln()$/;" f
149 aln_init_score_array stdaln.c /^void aln_init_score_array(unsigned char *seq, int len, int row, int *score_matrix, int **s_array)$/;" f
150 aln_local_core stdaln.c /^int aln_local_core(unsigned char *seq1, int len1, unsigned char *seq2, int len2, const AlnParam *ap,$/;" f
151 aln_nt16_rev_table stdaln.c /^char *aln_nt16_rev_table = "XAGRCMSVTWKDYHBN-";$/;" v
152 aln_nt16_table mergecontig.h /^static unsigned char aln_nt16_table[256] = {$/;" v
153 aln_nt16_table stdaln.c /^unsigned char aln_nt16_table[256] = {$/;" v
154 aln_nt4_rev_table stdaln.c /^char *aln_nt4_rev_table = "AGCTN-";$/;" v
155 aln_nt4_table stdaln.c /^unsigned char aln_nt4_table[256] = {$/;" v
156 aln_param_aa2aa stdaln.c /^AlnParam aln_param_aa2aa = { 12, 2, 2, aln_sm_blosum62, 22, 50 };$/;" v
157 aln_param_nt2nt stdaln.c /^AlnParam aln_param_nt2nt = { 10, 2, 2, aln_sm_nt, 16, 75 };$/;" v
158 aln_param_rd2rd stdaln.c /^AlnParam aln_param_rd2rd = { 20, 19, 19, aln_sm_read, 16, 75 };$/;" v
159 aln_sm_blosum45 stdaln.c /^int aln_sm_blosum45[] = {$/;" v
160 aln_sm_blosum62 stdaln.c /^int aln_sm_blosum62[] = {$/;" v
161 aln_sm_hs stdaln.c /^int aln_sm_hs[] = {$/;" v
162 aln_sm_nt stdaln.c /^int aln_sm_nt[] = {$/;" v
163 aln_sm_read stdaln.c /^int aln_sm_read[] = {$/;" v
164 aln_stdaln stdaln.c /^AlnAln *aln_stdaln(const char *seq1, const char *seq2, const AlnParam *ap, int is_global, int do_align)$/;" f
165 aln_stdaln_aux stdaln.c /^AlnAln *aln_stdaln_aux(const char *seq1, const char *seq2, const AlnParam *ap,$/;" f
166 aln_str mergecontig.h /^static inline void aln_str(char *s1, char *s2, int *mm, int *mn, int *score) {$/;" f
167 aln_trans_table_eu stdaln.c /^unsigned char aln_trans_table_eu[66] = {$/;" v
168 aln_trans_table_eu_char stdaln.c /^char *aln_trans_table_eu_char = "KKNNRRSSTTTTIMIIEEDDGGGGAAAAVVVVQQHHRRRRPPPPLLLL**YY*WCCSSSSLLFFX";$/;" v
169 alning_core cluster.c /^uint32_t alning_core(Cluster *cluster){$/;" f
170 ap simp_asm.h /^ AlnParam ap;$/;" m struct:__anon51
171 append_cigars aln_cigar.h /^static inline int append_cigars(AlnCigar *cs, int n, int type, int len){$/;" f
172 append_string string.h /^static inline void append_string(String *str, char *src, int offlen){$/;" f
173 apply_array sort.h 92;" d
174 apply_cigars aln_cigar.h /^static inline int apply_cigars(AlnCigar *dst, AlnCigar *c1, int n1, AlnCigar *c2, int n2){$/;" f
175 as_string string.h /^static inline String* as_string(char *chs){$/;" f
176 asm_ef asm_R2.c /^uint32_t asm_ef(FileReader *in, FILE *out, uint32_t min_ol, float min_sm, uint32_t min_read, uint32_t max_read){$/;" f
177 asm_ef_ctgs asm_R2.c /^void asm_ef_ctgs(EF *ef){$/;" f
178 avg_seq_len file_reader.h /^ int avg_seq_len;$/;" m struct:__anon32
179 band_width stdaln.h /^ int band_width;$/;" m struct:__anon14
180 base divide.c /^ uint32_t base;$/;" m struct:__anon55 file:
181 base rainbow.h /^ uint32_t col, cnt, base;$/;" m struct:__anon22
182 base_bit4_table dna.h /^static const uint8_t base_bit4_table[256] = {$/;" v
183 base_bit_table dna.h /^static const uint8_t base_bit_table[256] = {$/;" v
184 beg_seq2kmers dna.h 107;" d
185 beg_seq2revkmers dna.h 114;" d
186 begin_iter_bitvec bitvec.h /^static inline void begin_iter_bitvec(BitVec *bitv){ bitv->iter_idx = 0; }$/;" f
187 begin_iter_simpasm simp_asm.h /^static inline void begin_iter_simpasm(SimpAssembler *sa){ sa->iter_idx = 0; }$/;" f
188 bit2bits dna.h 144;" d
189 bit4_base_table dna.h /^static const char bit4_base_table[16] = "-ACMGRSVTWYHKDBN";$/;" v
190 bit4_bit_table dna.h /^static const uint8_t bit4_bit_table[16] = { 4, 0, 1, 4, 2, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4 };$/;" v
191 bit_base_table dna.h /^static const char bit_base_table[6] = "ACGTN-";$/;" v
192 bits bitvec.h /^ uint64_t *bits;$/;" m struct:__anon54
193 bits bloom_filter.h /^ BitVec *bits;$/;" m struct:__anon34
194 bits2bit dna.h 165;" d
195 bits2revseq dna.h /^static inline void bits2revseq(char *seq, uint64_t *bits, uint64_t off, uint32_t len){$/;" f
196 bits2seq dna.h /^static inline void bits2seq(char *seq, uint64_t *bits, uint64_t off, uint32_t len){$/;" f
197 bloom_filter_total_seeds bloom_filter.h /^static const uint32_t bloom_filter_total_seeds = 20;$/;" v
198 bsearch_vec vector.h /^static inline void* bsearch_vec(Vector *vec, void *q, cmp_vec_fun fun){$/;" f
199 bt rainbow.h /^ uint32_t bt;$/;" m struct:__anon19
200 bts rainbow.h /^ u32list *bts;$/;" m struct:__anon20
201 buf_cap file_reader.h /^ int buf_off, buf_size, buf_cap;$/;" m struct:__anon33
202 buf_off file_reader.h /^ int buf_off, buf_size, buf_cap;$/;" m struct:__anon33
203 buf_size file_reader.h /^ int buf_off, buf_size, buf_cap;$/;" m struct:__anon33
204 buffer file_reader.h /^ char *buffer;$/;" m struct:__anon31
205 buffer file_reader.h /^ void *buffer;$/;" m struct:__anon33
206 buffer vector.h /^ void *buffer;$/;" m struct:Vector
207 build_tree mergectg.c /^void build_tree(merge_t *merger) {$/;" f
208 cache mergectg.h /^ contigsv *cache;$/;" m struct:__anon8
209 cache rainbow.h /^ u32slist *grps, *cache;$/;" m struct:__anon23
210 cal_2seq_mm_core cluster.c /^uint8_t cal_2seq_mm_core(uint64_t *seq1, uint64_t *seq2, uint8_t len1, uint8_t len2){$/;" f
211 cal_mm mergetag.c /^uint32_t cal_mm(String *seqs, Block *b1, Block *b2){$/;" f
212 call_key_col divide.c /^uint32_t call_key_col(Div *div, uint32_t gid){$/;" f
213 cap vector.h /^ size_t cap;$/;" m struct:Vector
214 capacity file_reader.h /^ int capacity;$/;" m struct:__anon31
215 capacity string.h /^ int capacity;$/;" m struct:__anon52
216 cat_cigars aln_cigar.h /^static inline int cat_cigars(AlnCigar *cigars1, int n_cigar1, AlnCigar *cigars2, int n_cigar2){$/;" f
217 cat_vec vector.h /^static inline int cat_vec(Vector *dst, Vector *src){$/;" f
218 catstr string.h /^static inline char* catstr(int n_str, ...){$/;" f
219 cbs rainbow.h /^ cbv *cbs;$/;" m struct:__anon23
220 change_seeds_bloomfilter bloom_filter.h /^static inline void change_seeds_bloomfilter(BloomFilter *bf){ bf->seed_off = (bf->seed_off + bf->n_seed) % bloom_filter_total_seeds; }$/;" f
221 chash_code hashset.h 499;" d
222 chash_equals hashset.h 500;" d
223 chomp_string string.h /^static inline void chomp_string(String *str){$/;" f
224 cid mergectg.h /^ uint32_t cid; \/\/$/;" m struct:__anon8
225 cid mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
226 cigars2string aln_cigar.h /^static inline char* cigars2string(AlnCigar *cigars, int n_cigar, char *str){$/;" f
227 cigars_lengths aln_cigar.h /^static inline void cigars_lengths(AlnCigar *cigars, int n_cigar, int *aln_size, int *seq1_size, int *seq2_size){$/;" f
228 cigars_seq2aln aln_cigar.h /^static inline int cigars_seq2aln(char *dst, AlnCigar *c, int n, int seq_idx, char *seq){$/;" f
229 clear_bitvec bitvec.h /^static inline void clear_bitvec(BitVec *bitv){ bitv->n_bit = 0; }$/;" f
230 clear_bloomfilter bloom_filter.h /^static inline void clear_bloomfilter(BloomFilter *bf){ zeros_bitvec(bf->bits); }$/;" f
231 clear_ctg mergectg.c /^void clear_ctg(contig_t *ctg) {$/;" f
232 clear_entity_del hashset.h 60;" d
233 clear_entity_null hashset.h 59;" d
234 clear_hashset_macro hashset.h 265;" d
235 clear_heap heap.h /^static inline void clear_heap(Heap *heap){ clear_rjheapv(heap->ptrs); }$/;" f
236 clear_string string.h /^static inline void clear_string(String *str){ str->size = 0; }$/;" f
237 clear_vec vector.h 217;" d
238 clone_string string.h /^static inline String* clone_string(String *str){ $/;" f
239 close_bif file_reader.h /^static inline void close_bif(BufferedInputFile *bif){$/;" f
240 closed asm_R2.h /^ uint32_t len:31, closed:1;$/;" m struct:__anon38
241 closed mergectg.h /^ int closed;$/;" m struct:__anon3
242 closed simp_asm.h /^ uint32_t len:31, closed:1;$/;" m struct:__anon50
243 cls_id mergecontig.h /^ uint32_t cls_id;$/;" m struct:__anon45
244 cluster_invoker main.c /^int cluster_invoker(int argc, char **argv){$/;" f
245 clustering cluster.c /^void clustering(Cluster *cluster, FileReader *fr2, int is_fq2, int fix_rd_len, FILE *out){$/;" f
246 clustering_ctg mergecontig.c /^PWDB* clustering_ctg(PWDB *db, uint32_t min_overlap, float het) {$/;" f
247 cmp heap.h /^ heap_comp_func cmp;$/;" m struct:__anon11
248 cmp_2nums_proc sort.h 26;" d
249 cmp_ctg_clsid mergecontig.c /^int cmp_ctg_clsid(const void *p0, const void *p1) {$/;" f
250 cmp_ids mergecontig.h /^static inline int cmp_ids(const void *e1, const void *e2) {$/;" f
251 cmp_kmer_pos mergecontig.h /^static inline int cmp_kmer_pos (const void *e1, const void *e2) {$/;" f
252 cmp_ol_func asm_R2.c /^int cmp_ol_func(const void *e1, const void *e2){$/;" f
253 cmp_sbt cluster.c /^inline int cmp_sbt(const void *e1, const void *e2){$/;" f
254 cmp_sr_alnhit simp_asm.h /^static inline int cmp_sr_alnhit(const void *e1, const void *e2){$/;" f
255 cmp_vec_fun vector.h /^typedef int (*cmp_vec_fun)(const void *k1, const void *k2);$/;" t
256 cns_len mergetag.c /^ uint32_t cns_off, cns_len;$/;" m struct:__anon13 file:
257 cns_off mergetag.c /^ uint32_t cns_off, cns_len;$/;" m struct:__anon13 file:
258 cnt divide.c /^ uint32_t cnt;$/;" m struct:__anon55 file:
259 cnt rainbow.h /^ uint32_t col, cnt, base;$/;" m struct:__anon22
260 col rainbow.h /^ uint32_t col, cnt, base;$/;" m struct:__anon22
261 col_base_t rainbow.h /^} col_base_t;$/;" t typeref:struct:__anon22
262 comment file_reader.h /^ String comment;$/;" m struct:__anon29
263 compile_cigars aln_cigar.h /^static inline int compile_cigars(AlnCigar *dst, AlnCigar *c1, int n1, AlnCigar *c2, int n2, int seq_idx){$/;" f
264 consensus mergetag.c /^void consensus(recv *divs, String *seqs, uint32_t beg, uint32_t end, uint32_t *cns_off, uint32_t *cns_len){$/;" f
265 contig_code mergectg.h 46;" d
266 contig_eq mergectg.h 47;" d
267 contig_seq_t mergectg.h /^} contig_seq_t;$/;" t typeref:struct:__anon4
268 contig_t mergectg.h /^} contig_t; $/;" t typeref:struct:__anon3
269 count_hashset_macro hashset.h 263;" d
270 count_heap heap.h /^static inline size_t count_heap(Heap *heap){ return count_rjheapv(heap->ptrs); }$/;" f
271 count_ones_bit32 bitvec.h /^static inline uint32_t count_ones_bit32(uint32_t v){$/;" f
272 count_ones_bit64 bitvec.h /^static inline int count_ones_bit64(const uint64_t x){$/;" f
273 ctg_dir simp_asm.h /^ uint32_t ctg_id, ctg_dir:1, ctg_off:20, used:1, rank:10;$/;" m struct:__anon49
274 ctg_id asm_R2.h /^ uint32_t ctg_id:24, ctg_off:19, used:1;$/;" m struct:__anon37
275 ctg_id simp_asm.h /^ uint32_t ctg_id, ctg_dir:1, ctg_off:20, used:1, rank:10;$/;" m struct:__anon49
276 ctg_kmer_t mergectg.h /^} ctg_kmer_t;$/;" t typeref:struct:__anon5
277 ctg_off asm_R2.h /^ uint32_t ctg_id:24, ctg_off:19, used:1;$/;" m struct:__anon37
278 ctg_off simp_asm.h /^ uint32_t ctg_id, ctg_dir:1, ctg_off:20, used:1, rank:10;$/;" m struct:__anon49
279 ctgnum mergecontig.h /^ uint32_t ctgnum;$/;" m struct:__anon46
280 ctgs asm_R2.h /^ Vector *ctgs;$/;" m struct:__anon40
281 ctgs mergecontig.h /^ ctglist *ctgs;$/;" m struct:__anon46
282 ctgs mergectg.h /^ contigv *ctgs;$/;" m struct:__anon8
283 ctgs simp_asm.h /^ ctgv *ctgs;$/;" m struct:__anon51
284 ctgv mergecontig.h /^ ctglist *ctgv;$/;" m struct:__anon48
285 ctype stdaln.h /^ unsigned char ctype;$/;" m struct:__anon15
286 cuhash_code hashset.h 509;" d
287 cuhash_equals hashset.h 510;" d
288 cuhash_t hashset.h /^typedef struct { char *key; uint32_t val; } cuhash_t;$/;" t typeref:struct:__anon28
289 define_apply_array sort.h 230;" d
290 define_bubble_sort sort.h 29;" d
291 define_hashset hashset.h 371;" d
292 define_list list.h 214;" d
293 define_list_core list.h 39;" d
294 define_list_ext list.h 166;" d
295 define_merge sort.h 153;" d
296 define_native_list list.h 218;" d
297 define_quick_sort sort.h 114;" d
298 define_reverse_array sort.h 217;" d
299 define_revsere_vec vector.h 177;" d
300 define_search_array sort.h 241;" d
301 define_unique_merge sort.h 202;" d
302 delimiter file_reader.h /^ char delimiter;$/;" m struct:__anon31
303 deps rainbow.h /^ u32list *deps;$/;" m struct:__anon23
304 destroy_tree mergectg.c /^void destroy_tree(pathtree_t *t) {$/;" f
305 div_invoker main.c /^int div_invoker(int argc, char **argv){$/;" f
306 div_reads divide.c /^uint32_t div_reads(Div *div, FileReader *fr, FILE *out){$/;" f
307 dividing divide.c /^void dividing(Div *div, uint32_t old_gid, FILE *out){$/;" f
308 dividing_core divide.c /^void dividing_core(Div *div, uint32_t gid, int dep){$/;" f
309 dna_rev_seq dna.h /^static inline uint64_t dna_rev_seq(uint64_t seq, uint8_t seq_size){$/;" f
310 dna_xor2ones dna.h /^static inline uint64_t dna_xor2ones(uint64_t seq){$/;" f
311 dpcell_t stdaln.c /^} dpcell_t;$/;" t typeref:struct:__anon9 file:
312 dpscore_t stdaln.c /^} dpscore_t;$/;" t typeref:struct:__anon10 file:
313 dump_hashset_macro hashset.h 277;" d
314 dump_vec vector.h /^static inline size_t dump_vec(Vector *vec, FILE *out){$/;" f
315 e_size vector.h /^ unsigned int e_size;$/;" m struct:Vector
316 ef mergectg.h /^ EF *ef;$/;" m struct:__anon8
317 ef_id asm_R2.h /^ uint32_t ef_id;$/;" m struct:__anon40
318 ef_usage asm_R2.c /^int ef_usage(){$/;" f
319 encap_bitvec bitvec.h /^static inline void encap_bitvec(BitVec *bitv, uint64_t num){$/;" f
320 encap_hashset_macro hashset.h 317;" d
321 encap_vec vector.h /^static inline int encap_vec(Vector *vec, unsigned int add_size){$/;" f
322 end1 stdaln.h /^ int start1, end1; \/* start and end of the first sequence, coordinations are 1-based *\/$/;" m struct:__anon16
323 end2 stdaln.h /^ int start2, end2; \/* start and end of the second sequence, coordinations are 1-based *\/$/;" m struct:__anon16
324 end_seq2kmers dna.h 112;" d
325 end_seq2kmers dna.h 119;" d
326 err_xopen_core ezmsim.c /^FILE *err_xopen_core(const char *func, const char *fn, const char *mode)$/;" f
327 eseq asm_R2.h /^ char eseq[MAX_RD_LEN];$/;" m struct:__anon40
328 exact_limit rainbow.h /^ uint32_t exact_limit;$/;" m struct:__anon20
329 execute_pwaln mergecontig.c /^void execute_pwaln(CtgDB *db, uint32_t min_overlap, float het, uint32_t max_nctg) {$/;" f
330 exists_entity hashset.h 56;" d
331 exists_hashset_macro hashset.h 153;" d
332 ezmsim_EF_core ezmsim.c /^void ezmsim_EF_core(FILE *fpout1, FILE *fpout2, FILE *fp_fa, unsigned int size_l, unsigned int size_r, unsigned char *cut, int pos, int distance, int ovlp, int stp, int reverse, int is_hap)$/;" f
333 ezmsim_LR_core ezmsim.c /^void ezmsim_LR_core(FILE *fpout1, FILE *fpout2, FILE *fp_fa, int size_l, int size_r, unsigned char *cut, int pos)$/;" f
334 fclose_filereader file_reader.c /^void fclose_filereader(FileReader *fr){$/;" f
335 ffread hashset.h 275;" d
336 ffwrite hashset.h 274;" d
337 fidx file_reader.h /^ uint32_t fidx;$/;" m struct:__anon31
338 file file_reader.h /^ FILE *file;$/;" m struct:__anon30
339 file file_reader.h /^ FILE *file;$/;" m struct:__anon33
340 filename file_reader.h /^ char *filename;$/;" m struct:__anon30
341 files file_reader.h /^ Vector *files;$/;" m struct:__anon31
342 find_overlap asm_R2.c /^void find_overlap(char *seq1, uint32_t len1, uint32_t off1, char *seq2, uint32_t len2, uint32_t off2, uint32_t *l_ol, uint32_t *r_ol, uint32_t *n_mm){$/;" f
343 flag mergectg.h /^ int flag; \/\/ if == 0 first use, init; else reset$/;" m struct:__anon8
344 flags rainbow.h /^ BitVec *flags;$/;" m struct:__anon20
345 flip_bitvec bitvec.h /^static inline void flip_bitvec(BitVec *bitv, uint64_t idx){ bitv->bits[idx>>6] ^= 1LLU << (idx&0x3FU); }$/;" f
346 flip_cigars aln_cigar.h /^static inline void flip_cigars(AlnCigar *cigars, int n_cigar){$/;" f
347 fopen_filereader file_reader.c /^FileReader* fopen_filereader(char *filename){$/;" f
348 fopen_filereader2 file_reader.c /^FileReader* fopen_filereader2(char *prefix, char *postfix){$/;" f
349 fopen_m_filereader file_reader.c /^FileReader* fopen_m_filereader(int n_file, char **filenames){$/;" f
350 fr_file_t file_reader.h /^} fr_file_t;$/;" t typeref:struct:__anon30
351 fr_fread file_reader.c /^static inline int fr_fread(void *buf, size_t e_size, size_t size, FILE *in){$/;" f file:
352 fread_all file_reader.c /^char *fread_all(FileReader *fr){$/;" f
353 fread_fasta file_reader.h 107;" d
354 fread_fasta_adv file_reader.c /^int fread_fasta_adv(Sequence **seq_ptr, FileReader *fr, int fasta_flag){$/;" f
355 fread_fastq file_reader.h 116;" d
356 fread_fastq_adv file_reader.c /^int fread_fastq_adv(Sequence **seq_ptr, FileReader *fr, int fastq_flag){$/;" f
357 fread_line file_reader.c /^int fread_line(String *line, FileReader *fr){$/;" f
358 fread_line2 file_reader.c /^int fread_line2(String *line, FileReader *fr){$/;" f
359 fread_table file_reader.c /^int fread_table(FileReader *fr){$/;" f
360 free_bitvec bitvec.h /^static inline void free_bitvec(BitVec *bitv){$/;" f
361 free_bloomfilter bloom_filter.h /^static inline void free_bloomfilter(BloomFilter *bf){$/;" f
362 free_cluster cluster.c /^void free_cluster(Cluster *cluster){$/;" f
363 free_ctg mergectg.c /^void free_ctg(contig_t *ctg) {$/;" f
364 free_ctgdb mergecontig.c /^void free_ctgdb(CtgDB *db) {$/;" f
365 free_ctgs mergectg.c /^void free_ctgs(merge_t *merger) {$/;" f
366 free_div divide.c /^void free_div(Div *div){$/;" f
367 free_ef asm_R2.c /^void free_ef(EF *ef){$/;" f
368 free_hashset_macro hashset.h 310;" d
369 free_heap heap.h /^static inline void free_heap(Heap *heap){ free_rjheapv(heap->ptrs); free(heap); }$/;" f
370 free_load_ctgdb mergecontig.c /^void free_load_ctgdb(CtgDB *db) {$/;" f
371 free_merger mergectg.c /^void free_merger(merge_t *merger) {$/;" f
372 free_pwdb mergecontig.c /^void free_pwdb(PWDB *db) {$/;" f
373 free_sequence file_reader.h 59;" d
374 free_simpasm simp_asm.h /^static inline void free_simpasm(SimpAssembler *sa){$/;" f
375 free_string string.h /^static inline void free_string(String *str){ free(str->string); free(str); }$/;" f
376 free_tree mergectg.c /^void free_tree(merge_t *merger) {$/;" f
377 free_vec vector.h /^static inline void free_vec(Vector *vec){$/;" f
378 froll_back file_reader.c /^int froll_back(FileReader *fr){$/;" f
379 gap_end stdaln.h /^ int gap_end;$/;" m struct:__anon14
380 gap_ext stdaln.h /^ int gap_ext;$/;" m struct:__anon14
381 gap_open stdaln.h /^ int gap_open;$/;" m struct:__anon14
382 get_2bit16 bitvec.h 33;" d
383 get_2bit32 bitvec.h 34;" d
384 get_2bit64 bitvec.h 35;" d
385 get_2bit8 bitvec.h 32;" d
386 get_bit16 bitvec.h 28;" d
387 get_bit32 bitvec.h 29;" d
388 get_bit64 bitvec.h 30;" d
389 get_bit8 bitvec.h 27;" d
390 get_bitvec bitvec.h /^static inline uint64_t get_bitvec(BitVec *bitv, uint64_t idx){ return (bitv->bits[idx>>6] >> (idx&0x3FU)) & 0x01LLU; }$/;" f
391 get_bloomfilter bloom_filter.h /^static inline int get_bloomfilter(BloomFilter *bf, const void *key, uint32_t len){$/;" f
392 get_col_len file_reader.h 89;" d
393 get_col_str file_reader.h 88;" d
394 get_col_vstr file_reader.h 87;" d
395 get_hashset_macro hashset.h 94;" d
396 get_last_vec_ref vector.h /^static inline void* get_last_vec_ref(Vector *vec){$/;" f
397 get_next_vec_ref vector.h /^static inline void* get_next_vec_ref(Vector *vec){$/;" f
398 get_pool_ctg asm_R2.c /^FContig* get_pool_ctg(EF *ef){$/;" f
399 get_pool_vec asm_R2.c /^Vector* get_pool_vec(EF *ef){$/;" f
400 get_vec vector.h /^static inline int get_vec(Vector *vec, size_t idx, void *e){$/;" f
401 get_vec_ref vector.h /^static inline void* get_vec_ref(Vector *vec, size_t idx){$/;" f
402 gget_vec vector.h 133;" d
403 gid mergetag.c /^ uint32_t gid, off, len;$/;" m struct:__anon13 file:
404 gid mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
405 gid_map rainbow.h /^ u32list *gid_map;$/;" m struct:__anon20
406 gidoff rainbow.h /^ uint32_t gidoff;$/;" m struct:__anon20
407 gidoff rainbow.h /^ uint32_t gidoff;$/;" m struct:__anon23
408 gids rainbow.h /^ u32list *gids;$/;" m struct:__anon20
409 gids rainbow.h /^ u32list *gids;$/;" m struct:__anon23
410 gpeer_vec vector.h 139;" d
411 gpop_vec vector.h 120;" d
412 gpush_vec vector.h 111;" d
413 grps rainbow.h /^ u32slist *grps, *cache;$/;" m struct:__anon23
414 gset_vec vector.h 126;" d
415 guess_seq_file file_reader.c /^void guess_seq_file(FileReader *fr, SeqFileAttr *attr){$/;" f
416 guess_seq_file_type file_reader.c /^int guess_seq_file_type(FileReader *fr){$/;" f
417 hash64shift hashset.h /^static inline uint64_t hash64shift(uint64_t key){$/;" f
418 heap_comp_func heap.h /^typedef int (*heap_comp_func)(const void *e1, const void *e2, void *ref);$/;" t
419 het mergecontig.h /^ float het;$/;" m struct:__anon47
420 het mergectg.h /^ float het; \/\/ parameter$/;" m struct:__anon8
421 hp mergecontig.h /^ Heap *hp;$/;" m struct:__anon48
422 i stdaln.h /^ int i, j;$/;" m struct:__anon15
423 i32hash_code hashset.h 495;" d
424 i32hash_equals hashset.h 496;" d
425 id mergecontig.h /^ uint32_t id;$/;" m struct:__anon43
426 id mergecontig.h /^ uint32_t id;$/;" m struct:__anon45
427 id mergectg.h /^ uint32_t id; \/\/ which contig$/;" m struct:__anon5
428 id mergectg.h /^ uint32_t id;$/;" m struct:__anon3
429 id mergectg.h /^ uint32_t id;$/;" m struct:__anon4
430 id0 mergecontig.h /^ uint32_t id0;$/;" m struct:__anon47
431 id1 mergecontig.h /^ uint32_t id1;$/;" m struct:__anon47
432 id_tt mergecontig.h /^} id_tt;$/;" t typeref:struct:__anon43
433 idx ezmsim.c /^ uint64_t *idx;$/;" m struct:__anon26 file:
434 idx_t ezmsim.c /^} idx_t;$/;" t typeref:struct:__anon26 file:
435 idxs rainbow.h /^ uint32_t idxs[2];$/;" m struct:__anon20
436 inc_tag asm_R2.h /^ uint32_t inc_tag;$/;" m struct:__anon40
437 index asm_R2.h /^ rhash *index;$/;" m struct:__anon40
438 index mergectg.h /^ rdkhash *index;$/;" m struct:__anon3
439 index rainbow.h /^ khash *index;$/;" m struct:__anon20
440 index_bitvec bitvec.h /^static inline void index_bitvec(BitVec *bitv){$/;" f
441 index_rds mergectg.c /^void index_rds(merge_t *merger, contig_t *ctg) {$/;" f
442 indexing_cluster cluster.c /^void indexing_cluster(Cluster *cluster, FileReader *fr, int is_fq, int fix_rd_len){$/;" f
443 init_bif file_reader.h /^static inline BufferedInputFile* init_bif(FILE *file, int buf_size){$/;" f
444 init_bitvec bitvec.h /^static inline BitVec* init_bitvec(uint64_t n_bit){$/;" f
445 init_bloomfilter bloom_filter.h /^static inline BloomFilter* init_bloomfilter(size_t size, uint32_t n_seed){$/;" f
446 init_cluster cluster.c /^Cluster* init_cluster(uint32_t max_mm, uint32_t exact_limit, uint32_t KMER_SIZE, uint32_t KMER_NUM){$/;" f
447 init_ctgdb mergecontig.c /^CtgDB* init_ctgdb(void ) {$/;" f
448 init_delimiters file_reader.c /^int* init_delimiters(char *expr){$/;" f
449 init_div divide.c /^Div* init_div(uint32_t k_allele, uint32_t K_allele, float min_freq){$/;" f
450 init_ef asm_R2.c /^EF* init_ef(uint32_t ef_id, char *eseq, uint32_t rd_len, uint32_t min_ol, float min_sm){$/;" f
451 init_hashset_macro hashset.h 63;" d
452 init_heap heap.h /^static inline Heap* init_heap(heap_comp_func cmp, void *ref){$/;" f
453 init_memvec vector.h /^static inline void init_memvec(Vector *vec, unsigned int e_size, unsigned int init_size){$/;" f
454 init_merger mergectg.c /^merge_t* init_merger(uint32_t min_kmer, uint32_t min_overlap, float het, uint32_t kmersize, uint32_t max_cluster, uint32_t need_asm) {$/;" f
455 init_simpasm simp_asm.h /^static inline SimpAssembler* init_simpasm(uint32_t n_cpu, uint32_t kmer_size, uint32_t rd_len, uint32_t strand, uint32_t min_ol, float min_sm, uint32_t max_mm, int allow_gap){$/;" f
456 init_string string.h /^static inline String* init_string(int cap){$/;" f
457 init_vec vector.h /^static inline Vector* init_vec(unsigned int e_size, unsigned int init_size){$/;" f
458 is_entity_del hashset.h 55;" d
459 is_entity_null hashset.h 54;" d
460 is_fq file_reader.h /^ int is_fq;$/;" m struct:__anon32
461 is_similar_enough mergectg.c /^int is_similar_enough(merge_t *merger, contig_t *c1, contig_t *c2) {$/;" f
462 iter_bitvec bitvec.h /^static inline uint64_t iter_bitvec(BitVec *bitv){$/;" f
463 iter_hashset_macro hashset.h 237;" d
464 iter_idx bitvec.h /^ uint64_t iter_idx;$/;" m struct:__anon54
465 iter_idx simp_asm.h /^ uint32_t iter_idx;$/;" m struct:__anon51
466 iter_simpasm simp_asm.h /^static inline SimpContigInfo* iter_simpasm(SimpAssembler *sa){$/;" f
467 j stdaln.h /^ int i, j;$/;" m struct:__anon15
468 jenkins_one_at_a_time_hash hashset.h /^static inline uint32_t jenkins_one_at_a_time_hash(char *key, size_t len){$/;" f
469 k_allele rainbow.h /^ uint32_t k_allele, K_allele;$/;" m struct:__anon23
470 key hashset.h /^typedef struct { char *key; uint32_t val; } cuhash_t;$/;" m struct:__anon28
471 key hashset.h /^typedef struct { uint32_t key, val; } uuhash_t;$/;" m struct:__anon27
472 key mergectg.h /^typedef struct {uint32_t key; uint32_t oldid; char *path;} uuchash_t;$/;" m struct:__anon6
473 kmer asm_R2.h /^ uint32_t kmer:10, rps_idx:22;$/;" m struct:__anon36
474 kmer mergecontig.h /^ uint64_t kmer;$/;" m struct:__anon41
475 kmer mergectg.h /^ uint64_t kmer, kpos;$/;" m struct:__anon5
476 kmer mergectg.h /^ uint64_t kmer:62, kpos:2;$/;" m struct:__anon2
477 kmer1 rainbow.h /^ uint32_t kmer1, kmer2, seqid;$/;" m struct:__anon17
478 kmer2 rainbow.h /^ uint32_t kmer1, kmer2, seqid;$/;" m struct:__anon17
479 kmer_code mergecontig.h 41;" d
480 kmer_code mergectg.h 72;" d
481 kmer_eq mergecontig.h 42;" d
482 kmer_eq mergectg.h 73;" d
483 kmer_equals rainbow.h 46;" d
484 kmer_hashcode rainbow.h 45;" d
485 kmer_mask dna.h 105;" d
486 kmer_pos_t mergecontig.h /^} kmer_pos_t;$/;" t typeref:struct:__anon42
487 kmer_t rainbow.h /^} kmer_t;$/;" t typeref:struct:__anon17
488 kmer_tt mergecontig.h /^} kmer_tt;$/;" t typeref:struct:__anon41
489 kpos mergecontig.h /^ uint64_t kpos;$/;" m struct:__anon41
490 kpos mergectg.h /^ uint64_t kmer, kpos;$/;" m struct:__anon5
491 kpos mergectg.h /^ uint64_t kmer:62, kpos:2;$/;" m struct:__anon2
492 l ezmsim.c /^ int l, m; \/* length and maximum buffer size *\/$/;" m struct:__anon24 file:
493 l ezmsim.c /^ int l, m; \/* length and maximum buffer size *\/$/;" m struct:__anon25 file:
494 l ezmsim.c /^ uint64_t l, m;$/;" m struct:__anon26 file:
495 l_ol asm_R2.h /^ uint32_t l_rid:20, r_rid:20, l_ol:8, r_ol:8, n_mm:7, used:1;$/;" m struct:__anon39
496 l_rid asm_R2.h /^ uint32_t l_rid:20, r_rid:20, l_ol:8, r_ol:8, n_mm:7, used:1;$/;" m struct:__anon39
497 last mergecontig.h /^ uint64_t last; \/\/last kmer position$/;" m struct:__anon44
498 last mergectg.h /^ uint64_t last; \/\/last kmer position$/;" m struct:__anon7
499 last_brk file_reader.h /^ int last_brk;$/;" m struct:__anon31
500 lastoffset mergecontig.h /^ uint32_t lastoffset;$/;" m struct:__anon42
501 lastoffset mergecontig.h /^ uint32_t lastoffset;$/;" m struct:__anon43
502 left mergectg.h /^ pathtree_t *left;$/;" m struct:pathtree_t
503 len aln_cigar.h /^ uint16_t len:13, type:3;$/;" m struct:__anon56
504 len asm_R2.h /^ uint32_t len:31, closed:1;$/;" m struct:__anon38
505 len mergetag.c /^ uint32_t gid, off, len;$/;" m struct:__anon13 file:
506 len rainbow.h /^ uint32_t len;$/;" m struct:__anon19
507 len simp_asm.h /^ uint32_t len:31, closed:1;$/;" m struct:__anon50
508 len simp_asm.h /^ uint32_t seqid, len;$/;" m struct:__anon49
509 len1 mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
510 len2 mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
511 lend_ctgv_merger mergectg.c /^contig_t* lend_ctgv_merger(merge_t *merger) {$/;" f
512 lend_ulist_div divide.c /^u32list* lend_ulist_div(Div *div){$/;" f
513 line file_reader.h /^ String *line;$/;" m struct:__anon31
514 line_breaker file_reader.h /^ char line_breaker;$/;" m struct:__anon31
515 link_t mergecontig.h /^} link_t;$/;" t typeref:struct:__anon44
516 link_t mergectg.h /^} link_t;$/;" t typeref:struct:__anon7
517 linking_core cluster.c /^uint32_t linking_core(Cluster *cluster, uint32_t seqid, uint64_t *seq, uint32_t seqlen){$/;" f
518 links rainbow.h /^ u32list *links;$/;" m struct:__anon20
519 load_ctgdb mergecontig.c /^CtgDB* load_ctgdb(FileReader *fr1, FileReader *fr2) {$/;" f
520 load_hashset_macro hashset.h 293;" d
521 load_seqdb cluster.c /^SeqDB* load_seqdb(FileReader *fr, int is_fq, int fix_rd_len){$/;" f
522 m ezmsim.c /^ int l, m; \/* length and maximum buffer size *\/$/;" m struct:__anon24 file:
523 m ezmsim.c /^ int l, m; \/* length and maximum buffer size *\/$/;" m struct:__anon25 file:
524 m ezmsim.c /^ uint64_t l, m;$/;" m struct:__anon26 file:
525 m_idx mergectg.h /^ idxv *m_idx; \/\/ merged multiple index$/;" m struct:__anon3
526 m_rds mergectg.h /^ u32list *m_rds; \/\/ merged reads index$/;" m struct:__anon3
527 main ezmsim.c /^int main (int argc, char *argv[])$/;" f
528 main main.c /^int main(int argc, char **argv){$/;" f
529 main mergetag.c /^int main(int argc, char **argv){$/;" f
530 main rbasm_main.c /^int main(int argc, char **argv){$/;" f
531 maq_mut_diref ezmsim.c /^void maq_mut_diref(const seq_t *seq, int is_hap, mutseq_t *hap1, mutseq_t *hap2)$/;" f
532 maq_print_mutref ezmsim.c /^void maq_print_mutref(const char *name, const seq_t *seq, mutseq_t *hap1, mutseq_t *hap2)$/;" f
533 markers rainbow.h /^ u64list *markers[4];$/;" m struct:__anon23
534 matrix stdaln.h /^ int *matrix;$/;" m struct:__anon14
535 max_cluster mergectg.h /^ uint32_t max_cluster; \/\/parameter$/;" m struct:__anon8
536 max_mm rainbow.h /^ uint32_t max_mm;$/;" m struct:__anon20
537 max_pair_len rainbow.h /^ uint32_t max_pair_len;$/;" m struct:__anon20
538 max_rd_len rainbow.h /^ uint8_t rd_len, max_rd_len;$/;" m struct:__anon18
539 max_read mergectg.h /^ uint32_t max_read; \/\/ parameter for asm$/;" m struct:__anon8
540 max_seq_len file_reader.h /^ int max_seq_len;$/;" m struct:__anon32
541 max_seqid rainbow.h /^ uint32_t max_seqid;$/;" m struct:__anon20
542 merge_along_tree mergectg.c /^void merge_along_tree(merge_t *merger, pathtree_t *tree) {$/;" f
543 merge_core mergectg.c /^void merge_core(merge_t *merger) {$/;" f
544 merge_core mergetag.c /^void merge_core(recv *divs, String *seqs, uint32_t max_mm, int task, blockv *blocks, FILE *out){$/;" f
545 merge_ctgs mergectg.c /^void merge_ctgs(merge_t *merger, FileReader *in, FILE *out) {$/;" f
546 merge_invoker main.c /^int merge_invoker(int argc, char **argv) {$/;" f
547 merge_leaves mergectg.c /^void merge_leaves(merge_t *merger, uint32_t id1, uint32_t id2) {$/;" f
548 merge_t mergectg.h /^} merge_t;$/;" t typeref:struct:__anon8
549 min_freq rainbow.h /^ float min_freq;$/;" m struct:__anon23
550 min_kmer mergectg.h /^ uint32_t min_kmer; \/\/ parameter: # kmers to define two similar contigs$/;" m struct:__anon8
551 min_ol asm_R2.h /^ uint32_t min_ol;$/;" m struct:__anon40
552 min_ol mergectg.h /^ uint32_t min_ol; \/\/parameter for asm$/;" m struct:__anon8
553 min_overlap mergectg.h /^ uint32_t min_overlap; \/\/ parameter$/;" m struct:__anon8
554 min_read mergectg.h /^ uint32_t min_read; \/\/ parameter for asm$/;" m struct:__anon8
555 min_seq_len file_reader.h /^ int min_seq_len;$/;" m struct:__anon32
556 min_sm asm_R2.h /^ float min_sm;$/;" m struct:__anon40
557 min_sm mergectg.h /^ float min_sm; \/\/ parameter for asm$/;" m struct:__anon8
558 mut_t ezmsim.c /^typedef unsigned short mut_t;$/;" t file:
559 mutmsk ezmsim.c /^static mut_t mutmsk = (mut_t)0xf000;$/;" v file:
560 mutseq_t ezmsim.c /^} mutseq_t;$/;" t typeref:struct:__anon25 file:
561 muttype_t ezmsim.c /^enum muttype_t {NOCHANGE = 0, INSERT = 0x1000, SUBSTITUTE = 0xe000, DELETE = 0xf000};$/;" g file:
562 n_bit bitvec.h /^ uint64_t n_bit;$/;" m struct:__anon54
563 n_cap bitvec.h /^ uint64_t n_cap;$/;" m struct:__anon54
564 n_col rainbow.h /^ uint32_t n_col;$/;" m struct:__anon23
565 n_mm asm_R2.h /^ uint32_t l_rid:20, r_rid:20, l_ol:8, r_ol:8, n_mm:7, used:1;$/;" m struct:__anon39
566 n_rd rainbow.h /^ uint32_t n_rd;$/;" m struct:__anon18
567 n_seed bloom_filter.h /^ uint32_t n_seed, seed_off;$/;" m struct:__anon34
568 name file_reader.h /^ String name;$/;" m struct:__anon29
569 native_number_cmp list.h 216;" d
570 need_asm mergectg.h /^ uint32_t need_asm; \/\/ parameter$/;" m struct:__anon8
571 nst_nt4_table ezmsim.c /^uint8_t nst_nt4_table[256] = {$/;" v
572 num_cmp_script sort.h 27;" d
573 num_max list.h 34;" d
574 num_min list.h 33;" d
575 off mergetag.c /^ uint32_t gid, off, len;$/;" m struct:__anon13 file:
576 off1 mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
577 off2 mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
578 offset mergecontig.h /^ uint32_t offset;$/;" m struct:__anon42
579 offset mergecontig.h /^ uint32_t offset;$/;" m struct:__anon43
580 offset mergecontig.h /^ uint32_t offset;$/;" m struct:__anon44
581 offset mergectg.h /^ int offset; \/\/ offset w.r.t. the current contig$/;" m struct:__anon5
582 offset mergectg.h /^ int offset; \/\/ current kmer offset$/;" m struct:__anon7
583 offset2 mergectg.h /^ int offset2; \/\/ offset of query contig$/;" m struct:__anon5
584 olbisearch mergecontig.c /^static inline int olbisearch(uint64_t a[], uint64_t q, int i, int j) {$/;" f file:
585 old_clsid mergecontig.h /^ uint32_t old_clsid;$/;" m struct:__anon45
586 oldid mergectg.h /^typedef struct {uint32_t key; uint32_t oldid; char *path;} uuchash_t;$/;" m struct:__anon6
587 ols asm_R2.h /^ Vector *ols;$/;" m struct:__anon40
588 ols simp_asm.h /^ sr_hitv *ols;$/;" m struct:__anon51
589 one2bitvec bitvec.h /^static inline void one2bitvec(BitVec *bitv){ encap_bitvec(bitv, 1); one_bitvec(bitv, bitv->n_bit); bitv->n_bit ++; }$/;" f
590 one_bitvec bitvec.h /^static inline void one_bitvec(BitVec *bitv, uint64_t idx){ bitv->bits[idx>>6] |= 1LLU << (idx&0x3FU); }$/;" f
591 ones_bitvec bitvec.h /^static inline void ones_bitvec(BitVec *bitv){ memset(bitv->bits, 0xFFU, bitv->n_cap \/ 8); }$/;" f
592 open_bif file_reader.h /^static inline BufferedInputFile* open_bif(char *filename){$/;" f
593 open_bif2 file_reader.h /^static inline BufferedInputFile* open_bif2(char *filename, char *suffix){$/;" f
594 open_file_for_append file_reader.h /^static inline FILE* open_file_for_append(char *name, char *suffix){$/;" f
595 open_file_for_read file_reader.h /^static inline FILE* open_file_for_read(char *name, char *suffix){$/;" f
596 open_file_for_write file_reader.h /^static inline FILE* open_file_for_write(char *name, char *suffix){$/;" f
597 out1 stdaln.h /^ char *out1, *out2; \/* print them, and then you will know *\/$/;" m struct:__anon16
598 out2 stdaln.h /^ char *out1, *out2; \/* print them, and then you will know *\/$/;" m struct:__anon16
599 outm stdaln.h /^ char *outm;$/;" m struct:__anon16
600 output_ef_ctgs asm_R2.c /^void output_ef_ctgs(EF *ef, FILE *out){$/;" f
601 overlap mergecontig.h /^ uint32_t overlap;$/;" m struct:__anon47
602 path mergectg.h /^ String *path;$/;" m struct:__anon3
603 path mergectg.h /^typedef struct {uint32_t key; uint32_t oldid; char *path;} uuchash_t;$/;" m struct:__anon6
604 path stdaln.h /^ path_t *path; \/* for advanced users... :-) *\/$/;" m struct:__anon16
605 path_len stdaln.h /^ int path_len; \/* for advanced users... :-) *\/$/;" m struct:__anon16
606 path_t stdaln.h /^} path_t;$/;" t typeref:struct:__anon15
607 pathtree_t mergectg.h /^struct pathtree_t {$/;" s
608 pathtree_t mergectg.h /^typedef struct pathtree_t pathtree_t;$/;" t typeref:struct:pathtree_t
609 peer_heap heap.h /^static inline void* peer_heap(Heap *heap){ return (count_rjheapv(heap->ptrs)? get_rjheapv(heap->ptrs, 0) : NULL );}$/;" f
610 poisson_num_gen ezmsim.c /^int poisson_num_gen(double lamda)$/;" f
611 pool_ctg asm_R2.h /^ Vector *pool_ctg;$/;" m struct:__anon40
612 pool_vec asm_R2.h /^ Vector *pool_vec;$/;" m struct:__anon40
613 pop_heap heap.h /^static inline void* pop_heap(Heap *heap){$/;" f
614 pop_vec vector.h /^static inline int pop_vec(Vector *vec, void *e){$/;" f
615 pos mergecontig.h /^ uint64_t pos;$/;" m struct:__anon42
616 prefix_path mergectg.c /^void prefix_path(char *s1, char *s2, int n, char *pre) {$/;" f
617 prepare_hashset_macro hashset.h 117;" d
618 prepare_reads mergectg.c /^void prepare_reads(merge_t *merger, FileReader *in, uint32_t lastcid) {$/;" f
619 prepare_seq_seqdb cluster.c /^uint8_t prepare_seq_seqdb(SeqDB *sdb, uint32_t rid, uint64_t *seqs){$/;" f
620 print_alignments asm_R2.c /^void print_alignments(EF *ef){$/;" f
621 print_asm mergectg.c /^void print_asm(merge_t *merger, FILE *out) {$/;" f
622 print_asm2 mergectg.c /^void print_asm2(merge_t *merger, FILE *out) {$/;" f
623 print_clusters mergecontig.c /^void print_clusters(PWDB *db) {$/;" f
624 print_ctgdb mergecontig.c /^void print_ctgdb(CtgDB *db) {$/;" f
625 print_pretty_seq file_reader.h /^static inline void print_pretty_seq(FILE *out, String *seq, int line_width){$/;" f
626 ps1 rainbow.h /^ u32list *ps1;$/;" m struct:__anon23
627 ps2 rainbow.h /^ u32list *ps2;$/;" m struct:__anon23
628 ptr file_reader.h /^ int ptr;$/;" m struct:__anon31
629 ptrs heap.h /^ rjheapv *ptrs;$/;" m struct:__anon11
630 push_heap heap.h /^static inline void push_heap(Heap *heap, void *p){$/;" f
631 push_simpasm simp_asm.h /^static inline void push_simpasm(SimpAssembler *sa, uint32_t seqid, char *seq, uint32_t seqlen, uint8_t rank){$/;" f
632 push_vec vector.h /^static inline void push_vec(Vector *vec, void *e){$/;" f
633 put_bloomfilter bloom_filter.h /^static inline void put_bloomfilter(BloomFilter *bf, const void *key, uint32_t len){$/;" f
634 put_cache_ctgs mergectg.c /^void put_cache_ctgs(merge_t *merger, contig_t *ctg) {$/;" f
635 put_hashset_macro hashset.h 205;" d
636 put_pool_ctg asm_R2.c /^void put_pool_ctg(EF *ef, FContig *ctg){$/;" f
637 put_pool_vec asm_R2.c /^void put_pool_vec(EF *ef, Vector *vec){$/;" f
638 pw_aln_contigs mergecontig.c /^PWDB* pw_aln_contigs(CtgDB *db, uint32_t min_overlap, float het) {$/;" f
639 pw_aln_contigs_brute mergecontig.c /^PWDB* pw_aln_contigs_brute(CtgDB *db) {$/;" f
640 pwctgs mergecontig.h /^ pwctglist *pwctgs;$/;" m struct:__anon48
641 qsort_vec vector.h /^static inline void qsort_vec(Vector *vec, cmp_vec_fun fun){$/;" f
642 qual file_reader.h /^ String qual;$/;" m struct:__anon29
643 r2r simp_asm.h /^ u64hash *r2r;$/;" m struct:__anon51
644 r_ol asm_R2.h /^ uint32_t l_rid:20, r_rid:20, l_ol:8, r_ol:8, n_mm:7, used:1;$/;" m struct:__anon39
645 r_rid asm_R2.h /^ uint32_t l_rid:20, r_rid:20, l_ol:8, r_ol:8, n_mm:7, used:1;$/;" m struct:__anon39
646 ran_normal ezmsim.c /^double ran_normal()$/;" f
647 rank asm_R2.h /^ uint32_t rd_len:10, rank:10;$/;" m struct:__anon37
648 rank mergectg.h /^ uint32_t rank;$/;" m struct:__anon1
649 rank mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
650 rank rainbow.h /^ uint32_t seqid, seqoff, seqlen1:10, seqlen2:10, rank:6, revsed:6;$/;" m struct:__anon21
651 rank simp_asm.h /^ uint32_t ctg_id, ctg_dir:1, ctg_off:20, used:1, rank:10;$/;" m struct:__anon49
652 rank_bitvec bitvec.h /^static inline uint64_t rank_bitvec(BitVec *bitv, uint64_t idx){$/;" f
653 rank_cigars_seqlen aln_cigar.h /^static inline int rank_cigars_seqlen(AlnCigar *cigars, int n_cigar, int len, int seq_idx){$/;" f
654 rd_kmer_code mergectg.h 26;" d
655 rd_kmer_eq mergectg.h 27;" d
656 rd_kmer_t mergectg.h /^} rd_kmer_t;$/;" t typeref:struct:__anon2
657 rd_len asm_R2.h /^ uint32_t rd_len:10, rank:10;$/;" m struct:__anon37
658 rd_len mergectg.h /^ uint32_t rd_len;$/;" m struct:__anon1
659 rd_len rainbow.h /^ uint8_t rd_len, max_rd_len;$/;" m struct:__anon18
660 rds asm_R2.h /^ Vector *rds;$/;" m struct:__anon40
661 rds mergectg.h /^ readv *rds;$/;" m struct:__anon3
662 rds rainbow.h /^ rilist *rds;$/;" m struct:__anon23
663 rds simp_asm.h /^ seqv *rds;$/;" m struct:__anon51
664 read_bif file_reader.h /^static inline int64_t read_bif(BufferedInputFile *bif, void *data, int64_t size){$/;" f
665 read_t mergectg.h /^} read_t;$/;" t typeref:struct:__anon1
666 reduce_vec_size vector.h /^static inline int reduce_vec_size(Vector *vec, size_t size){$/;" f
667 ref heap.h /^ void *ref;$/;" m struct:__anon11
668 ref_apply_array sort.h 103;" d
669 ref_iter_hashset_macro hashset.h 251;" d
670 refine_cigars aln_cigar.h /^static inline int refine_cigars(AlnCigar *c, int n){$/;" f
671 remove_hashset_macro hashset.h 211;" d
672 remove_heap heap.h /^static inline void remove_heap(Heap *heap, size_t idx){$/;" f
673 reset_div divide.c /^void reset_div(Div *div){$/;" f
674 reset_ef asm_R2.c /^void reset_ef(EF *ef, uint32_t ef_id, char *eseq, uint32_t rd_len, uint32_t min_ol, float min_sm){$/;" f
675 reset_filereader file_reader.c /^int reset_filereader(FileReader *fr){$/;" f
676 reset_iter_hashset_macro hashset.h 235;" d
677 reset_merger mergectg.c /^void reset_merger(merge_t *merger) {$/;" f
678 reset_simpasm simp_asm.h /^static inline void reset_simpasm(SimpAssembler *sa){$/;" f
679 reset_vec vector.h /^static inline void reset_vec(Vector *vec){$/;" f
680 return_ctgv_merger mergectg.c /^void return_ctgv_merger(merge_t *merger, contig_t *ctg) {$/;" f
681 return_ulist_div divide.c /^void return_ulist_div(Div *div, u32list *list){ if(list){ clear_u32list(list); push_u32slist(div->cache, list); } }$/;" f
682 rev_rank_cigars_seqlen aln_cigar.h /^static inline int rev_rank_cigars_seqlen(AlnCigar *cigars, int n_cigar, int len, int seq_idx){$/;" f
683 rev_select_cigars_seqlen aln_cigar.h /^static inline int rev_select_cigars_seqlen(AlnCigar *cigars, int n_cigar, int len, int seq_idx){$/;" f
684 reverse_cigars aln_cigar.h /^static inline void reverse_cigars(AlnCigar *cs, int n){$/;" f
685 reverse_dna dna.h /^static inline void reverse_dna(char *seq, int len){$/;" f
686 reverse_string string.h /^static inline void reverse_string(String *str){$/;" f
687 reverse_vec vector.h /^static inline void reverse_vec(Vector *vec){$/;" f
688 revsed rainbow.h /^ uint32_t seqid, seqoff, seqlen1:10, seqlen2:10, rank:6, revsed:6;$/;" m struct:__anon21
689 revseq2bits dna.h /^static inline void revseq2bits(uint64_t *bits, uint64_t bitoff, char *seq, uint32_t seqlen){$/;" f
690 rhash_code asm_R2.h 40;" d
691 rhash_eq asm_R2.h 41;" d
692 rhash_t asm_R2.h /^} rhash_t;$/;" t typeref:struct:__anon36
693 rid asm_R2.h /^typedef struct { uint32_t rid:16, roff:16; } rp_t;$/;" m struct:__anon35
694 rid mergetag.c /^ uint32_t rid, cid, gid, rank, off1, len1, off2, len2;$/;" m struct:__anon12 file:
695 rids asm_R2.h /^ Vector *rids;$/;" m struct:__anon38
696 rids simp_asm.h /^ u32list *rids;$/;" m struct:__anon51
697 right mergectg.h /^ pathtree_t *right;$/;" m struct:pathtree_t
698 roff asm_R2.h /^typedef struct { uint32_t rid:16, roff:16; } rp_t;$/;" m struct:__anon35
699 row stdaln.h /^ int row;$/;" m struct:__anon14
700 rp_t asm_R2.h /^typedef struct { uint32_t rid:16, roff:16; } rp_t;$/;" t typeref:struct:__anon35
701 rps asm_R2.h /^ Vector *rps;$/;" m struct:__anon40
702 rps_idx asm_R2.h /^ uint32_t kmer:10, rps_idx:22;$/;" m struct:__anon36
703 s ezmsim.c /^ mut_t *s; \/* sequence *\/$/;" m struct:__anon25 file:
704 s ezmsim.c /^ unsigned char *s; \/* sequence *\/$/;" m struct:__anon24 file:
705 sbts rainbow.h /^ sbtv *sbts;$/;" m struct:__anon20
706 score mergecontig.h /^ int score; $/;" m struct:__anon47
707 score stdaln.h /^ int score; \/* score *\/$/;" m struct:__anon16
708 sdb rainbow.h /^ SeqDB *sdb, *sdb2;$/;" m struct:__anon20
709 sdb2 rainbow.h /^ SeqDB *sdb, *sdb2;$/;" m struct:__anon20
710 search_array vector.h 159;" d
711 search_array_dsc vector.h 168;" d
712 seed_off bloom_filter.h /^ uint32_t n_seed, seed_off;$/;" m struct:__anon34
713 seeds bloom_filter.h /^static const uint32_t seeds[20] = $/;" v
714 select_cigars_seqlen aln_cigar.h /^static inline int select_cigars_seqlen(AlnCigar *cigars, int n_cigar, int len, int seq_idx){$/;" f
715 seq asm_R2.h /^ String *seq;$/;" m struct:__anon38
716 seq asm_R2.h /^ char seq[MAX_RD_LEN+1];$/;" m struct:__anon37
717 seq file_reader.h /^ String seq;$/;" m struct:__anon29
718 seq mergecontig.h /^ char *seq;$/;" m struct:__anon45
719 seq mergectg.h /^ char *seq;$/;" m struct:__anon4
720 seq mergectg.h /^ char seq[MAX_RD_LEN+1];$/;" m struct:__anon1
721 seq rainbow.h /^ uint64_t seq[8];$/;" m struct:__anon19
722 seq simp_asm.h /^ String *seq;$/;" m struct:__anon50
723 seq1 rainbow.h /^ uint64_t seq1[10], seq2[10];$/;" m struct:__anon20
724 seq2 rainbow.h /^ uint64_t seq1[10], seq2[10];$/;" m struct:__anon20
725 seq2bits dna.h /^static inline void seq2bits(uint64_t *bits, uint64_t bitoff, char *seq, uint32_t seqlen){$/;" f
726 seq2kmer dna.h /^static inline uint64_t seq2kmer(char *seq, uint32_t ksize){$/;" f
727 seq2revkmer dna.h /^static inline uint64_t seq2revkmer(char *seq, uint32_t ksize){$/;" f
728 seq_id asm_R2.h /^ uint32_t seq_id;$/;" m struct:__anon37
729 seq_id mergectg.h /^ uint32_t seq_id;$/;" m struct:__anon1
730 seq_read_fasta ezmsim.c /^int seq_read_fasta(FILE *fp, seq_t *seq, char *locus, char *comment)$/;" f
731 seq_set_block_size ezmsim.c /^void seq_set_block_size(int size)$/;" f
732 seq_t ezmsim.c /^} seq_t;$/;" t typeref:struct:__anon24 file:
733 seqid rainbow.h /^ uint32_t kmer1, kmer2, seqid;$/;" m struct:__anon17
734 seqid rainbow.h /^ uint32_t seqid, seqoff, seqlen1:10, seqlen2:10, rank:6, revsed:6;$/;" m struct:__anon21
735 seqid simp_asm.h /^ uint32_t seqid, len;$/;" m struct:__anon49
736 seqlen1 rainbow.h /^ uint32_t seqid, seqoff, seqlen1:10, seqlen2:10, rank:6, revsed:6;$/;" m struct:__anon21
737 seqlen2 rainbow.h /^ uint32_t seqid, seqoff, seqlen1:10, seqlen2:10, rank:6, revsed:6;$/;" m struct:__anon21
738 seqlens rainbow.h /^ u8list *seqlens;$/;" m struct:__anon18
739 seqoff rainbow.h /^ uint32_t seqid, seqoff, seqlen1:10, seqlen2:10, rank:6, revsed:6;$/;" m struct:__anon21
740 seqoffs rainbow.h /^ u64list *seqoffs;$/;" m struct:__anon18
741 seqs rainbow.h /^ u8list *seqs;$/;" m struct:__anon23
742 seqs rainbow.h /^ uint64_t *seqs;$/;" m struct:__anon18
743 set_D stdaln.c 278;" d file:
744 set_I stdaln.c 256;" d file:
745 set_M stdaln.c 240;" d file:
746 set_end_D stdaln.c 288;" d file:
747 set_end_I stdaln.c 266;" d file:
748 set_entity_del hashset.h 58;" d
749 set_entity_null hashset.h 57;" d
750 set_inc_tag_ef asm_R2.c /^void set_inc_tag_ef(EF *ef, uint32_t inc){$/;" f
751 set_vec vector.h /^static inline void set_vec(Vector *vec, size_t idx, void *e){$/;" f
752 set_vec_size vector.h /^static inline int set_vec_size(Vector *vec, size_t size){$/;" f
753 sids simp_asm.h /^ u32list *sids;$/;" m struct:__anon50
754 sim_pairs mergectg.h /^ uint32_t sim_pairs;$/;" m struct:__anon8
755 simple_assemble simp_asm.h /^static inline void simple_assemble(SimpAssembler *sa){$/;" f
756 simple_join_contigs simp_asm.h /^static inline int simple_join_contigs(SimpAssembler *sa, SR_AlnHit *hit){$/;" f
757 simple_move_rids simp_asm.h /^static inline void simple_move_rids(SimpAssembler *sa, uint32_t dst, uint32_t src, int off){$/;" f
758 simple_reverse_contig simp_asm.h /^static inline void simple_reverse_contig(SimpAssembler *sa, uint32_t ctg_id){$/;" f
759 size bloom_filter.h /^ size_t size;$/;" m struct:__anon34
760 size file_reader.h /^ int size;$/;" m struct:__anon31
761 size string.h /^ int size;$/;" m struct:__anon53
762 size string.h /^ int size;$/;" m struct:__anon52
763 size vector.h /^ size_t size;$/;" m struct:Vector
764 sort_array sort.h 48;" d
765 sorting_core cluster.c /^uint32_t sorting_core(Cluster *cluster){$/;" f
766 split_string string.h /^static inline int split_string(String *str, char separator, Vector *virtual_strings){$/;" f
767 split_vstring string.h /^static inline int split_vstring(VirtualString *str, char separator, Vector *virtual_strings, int cut){$/;" f
768 sra simp_asm.h /^ SR_SeqDB *sra;$/;" m struct:__anon51
769 start1 stdaln.h /^ int start1, end1; \/* start and end of the first sequence, coordinations are 1-based *\/$/;" m struct:__anon16
770 start2 stdaln.h /^ int start2, end2; \/* start and end of the second sequence, coordinations are 1-based *\/$/;" m struct:__anon16
771 stdin_filereader file_reader.c /^FileReader* stdin_filereader(){$/;" f
772 strindex ezmsim.c /^int strindex(idx_t *index, unsigned char *s, unsigned char *t)$/;" f
773 string string.h /^ char *string;$/;" m struct:__anon52
774 string string.h /^ char *string;$/;" m struct:__anon53
775 string2cigars aln_cigar.h /^static inline int string2cigars(AlnCigar *cigars, char *str, int len){$/;" f
776 string_filereader file_reader.c /^FileReader* string_filereader(char *string){$/;" f
777 sub32seqbits dna.h /^static inline uint64_t sub32seqbits(uint64_t *src, uint64_t off){$/;" f
778 sub_cigars aln_cigar.h /^static inline int sub_cigars(AlnCigar *dst, AlnCigar *cigars, int n_cigar, int off, int len){$/;" f
779 sub_seq_cigars aln_cigar.h /^static inline int sub_seq_cigars(AlnCigar *dst, AlnCigar *c, int n, int seq_idx, int off, int len){$/;" f
780 substr string.h /^static inline char* substr(char *string, int start, int end, char *dst){$/;" f
781 sums bitvec.h /^ uint64_t *sums;$/;" m struct:__anon54
782 swap_tmp string.h 35;" d
783 sys_prime_list hashset.h /^static const uint64_t sys_prime_list[61] = {$/;" v
784 sz mergecontig.h /^ uint32_t sz; \/\/union tree depth$/;" m struct:__anon45
785 tabs file_reader.h /^ Vector *tabs;$/;" m struct:__anon31
786 tid mergectg.h /^ uint32_t tid; \/\/ leaf records contig ID$/;" m struct:pathtree_t
787 tracing_core cluster.c /^void tracing_core(Cluster *cluster, uint32_t bt){$/;" f
788 tree mergectg.h /^ pathtree_t *tree;$/;" m struct:__anon8
789 trim_string string.h /^static inline void trim_string(String *str){$/;" f
790 trunc_string string.h /^static inline void trunc_string(String *str, int size){$/;" f
791 type aln_cigar.h /^ uint16_t len:13, type:3;$/;" m struct:__anon56
792 u32hash_code hashset.h 489;" d
793 u32hashcode hashset.h 480;" d
794 u64hash_code hashset.h 490;" d
795 u64hashcode hashset.h 481;" d
796 uc ezmsim.c /^void uc(unsigned char *s)$/;" f
797 uniq asm_R2.h /^ u64hash *uniq;$/;" m struct:__anon40
798 update_ctg2merge mergectg.c /^void update_ctg2merge(merge_t *merger) {$/;" f
799 usage ezmsim.c /^int usage()$/;" f
800 usage main.c /^int usage(){$/;" f
801 usage mergetag.c /^int usage(){$/;" f
802 used asm_R2.h /^ uint32_t ctg_id:24, ctg_off:19, used:1;$/;" m struct:__anon37
803 used asm_R2.h /^ uint32_t l_rid:20, r_rid:20, l_ol:8, r_ol:8, n_mm:7, used:1;$/;" m struct:__anon39
804 used simp_asm.h /^ uint32_t ctg_id, ctg_dir:1, ctg_off:20, used:1, rank:10;$/;" m struct:__anon49
805 uuchash_code mergectg.h 77;" d
806 uuchash_equals mergectg.h 78;" d
807 uuchash_t mergectg.h /^typedef struct {uint32_t key; uint32_t oldid; char *path;} uuchash_t;$/;" t typeref:struct:__anon6
808 uuhash_code hashset.h 504;" d
809 uuhash_equals hashset.h 505;" d
810 uuhash_t hashset.h /^typedef struct { uint32_t key, val; } uuhash_t;$/;" t typeref:struct:__anon27
811 uxxhash_equals hashset.h 491;" d
812 val hashset.h /^typedef struct { char *key; uint32_t val; } cuhash_t;$/;" m struct:__anon28
813 val hashset.h /^typedef struct { uint32_t key, val; } uuhash_t;$/;" m struct:__anon27
814 vec_memcpy vector.h /^static inline void vec_memcpy(void *dst, void *src, size_t size){$/;" f
815 vec_size vector.h 65;" d
816 version main.c /^const char *version = "2.0.1";$/;" v
817 vline file_reader.h /^ String *vline;$/;" m struct:__anon31
818 xopen ezmsim.c 103;" d file:
819 zero2bitvec bitvec.h /^static inline void zero2bitvec(BitVec *bitv){ encap_bitvec(bitv, 1); zero_bitvec(bitv, bitv->n_bit); bitv->n_bit ++; }$/;" f
820 zero_bitvec bitvec.h /^static inline void zero_bitvec(BitVec *bitv, uint64_t idx){ bitv->bits[idx>>6] &= ~(1LLU << (idx&0x3FU)); }$/;" f
821 zeros_bitvec bitvec.h /^static inline void zeros_bitvec(BitVec *bitv){ memset(bitv->bits, 0, bitv->n_cap \/ 8); }$/;" f