@@ -70,16 +70,16 @@ bam_get_aux(const bam1_t *b) {
7070 ((b->core .l_qseq + 1 ) >> 1 ) + b->core .l_qseq ;
7171}
7272
73- static inline int
74- bam_get_l_aux (const bam1_t *b) {
75- return b->l_data - (b->core .l_qname + (b->core .n_cigar << 2 ) +
76- ((b->core .l_qseq + 1 ) >> 1 ) + b->core .l_qseq );
77- }
73+ // static inline int
74+ // bam_get_l_aux(const bam1_t *b) {
75+ // return b->l_data - (b->core.l_qname + (b->core.n_cigar << 2) +
76+ // ((b->core.l_qseq + 1) >> 1) + b->core.l_qseq);
77+ // }
7878
79- static inline bool
80- bam_same_orientation (const bam1_t *a, const bam1_t *b) {
81- return ((a->core .flag ^ b->core .flag ) & BAM_FREVERSE) != 0 ;
82- }
79+ // static inline bool
80+ // bam_same_orientation(const bam1_t *a, const bam1_t *b) {
81+ // return ((a->core.flag ^ b->core.flag) & BAM_FREVERSE) != 0;
82+ // }
8383
8484static void
8585roundup_to_power_of_2 (uint32_t &x) {
@@ -255,10 +255,10 @@ bam_set1_wrapper(bam1_t *bam, const size_t l_qname, const char *qname,
255255 return static_cast <int >(data_len);
256256}
257257
258- static inline size_t
259- bam_get_n_cigar (const bam1_t *b) {
260- return b->core .n_cigar ;
261- }
258+ // static inline size_t
259+ // bam_get_n_cigar(const bam1_t *b) {
260+ // return b->core.n_cigar;
261+ // }
262262
263263static inline uint32_t
264264to_insertion (const uint32_t x) {
@@ -373,24 +373,24 @@ get_l_qseq(const bam1_t *b) {
373373 return b->core .l_qseq ;
374374}
375375
376- static inline void
377- complement_seq (char *first, char *last) {
378- for (; first != last; ++first) {
379- assert (valid_base (*first));
380- *first = complement (*first);
381- }
382- }
376+ // static inline void
377+ // complement_seq(char *first, char *last) {
378+ // for (; first != last; ++first) {
379+ // assert(valid_base(*first));
380+ // *first = complement(*first);
381+ // }
382+ // }
383383
384- static inline void
385- reverse (char *a, char *b) {
386- char *p1, *p2;
387- for (p1 = a, p2 = b - 1 ; p2 > p1; ++p1, --p2) {
388- *p1 ^= *p2;
389- *p2 ^= *p1;
390- *p1 ^= *p2;
391- assert (valid_base (*p1) && valid_base (*p2));
392- }
393- }
384+ // static inline void
385+ // reverse(char *a, char *b) {
386+ // char *p1, *p2;
387+ // for (p1 = a, p2 = b - 1; p2 > p1; ++p1, --p2) {
388+ // *p1 ^= *p2;
389+ // *p2 ^= *p1;
390+ // *p1 ^= *p2;
391+ // assert(valid_base(*p1) && valid_base(*p2));
392+ // }
393+ // }
394394
395395// return value is the number of cigar ops that are fully consumed in
396396// order to read n_ref, while "partial_oplen" is the number of bases
@@ -542,15 +542,15 @@ flip_conversion(bam_rec &aln) {
542542 flip_conversion (aln.b );
543543}
544544
545- static inline bool
546- are_mates (const bam1_t *one, const bam1_t *two) {
547- return one->core .mtid == two->core .tid && one->core .mpos == two->core .pos &&
548- (one->core .flag & BAM_FREVERSE) != (one->core .flag & BAM_FREVERSE);
549- // below is a consistency check and should not be necessary
550- /* &&
551- two->core.mtid == one->core.tid &&
552- two->core.mpos == one->core.pos; */
553- }
545+ // static inline bool
546+ // are_mates(const bam1_t *one, const bam1_t *two) {
547+ // return one->core.mtid == two->core.tid && one->core.mpos == two->core.pos &&
548+ // (one->core.flag & BAM_FREVERSE) != (one->core.flag & BAM_FREVERSE);
549+ // // below is a consistency check and should not be necessary
550+ // /* &&
551+ // two->core.mtid == one->core.tid &&
552+ // two->core.mpos == one->core.pos; */
553+ // }
554554
555555static inline int
556556truncate_overlap (const bam1_t *a, const uint32_t overlap, bam1_t *c) {
0 commit comments