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

use std::str;

use crate::core::{LinePositionIterKind, PositionStore, SearchPos};
use crate::LinePositionIter;
use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct LineStore {
    start: usize,
    end: usize,
    seq_pos: Vec<usize>,
    // TODO: performance impact of storing quality positions?
    qual_pos: Vec<usize>,
}

impl PositionStore for LineStore {
    type SeqLinesType = LinePositionIterKind;
    type QualLinesType = LinePositionIterKind;

    #[inline]
    fn init(&mut self) {
        self.seq_pos.clear();
        self.qual_pos.clear();
    }

    #[inline]
    fn move_to_start(&mut self, _: SearchPos, offset: usize) {
        self.start -= offset;
        for s in &mut self.seq_pos {
            *s -= offset;
        }
        for s in &mut self.qual_pos {
            *s -= offset;
        }
    }

    #[inline]
    fn set_record_start(&mut self, pos: usize) {
        self.start = pos;
    }

    #[inline]
    fn record_start(&self) -> usize {
        self.start
    }

    #[inline]
    fn set_seq_start(&mut self, pos: usize) {
        self.seq_pos.push(pos);
    }

    #[inline]
    fn add_seq_line_start(&mut self, pos: usize) {
        self.seq_pos.push(pos);
    }

    #[inline]
    fn seq_start(&self) -> usize {
        self.seq_pos[0]
    }

    #[inline]
    fn seq_starts(&self) -> &[usize] {
        self.seq_pos.split_last().unwrap().1
    }

    #[inline]
    fn set_sep_pos(&mut self, pos: usize, has_line: bool) {
        // in order to obtain proper slices when iterating,
        // we also need the end position of the sequence
        if has_line {
            self.seq_pos.push(pos);
        }
    }

    #[inline]
    fn sep_pos(&self) -> usize {
        *self.seq_pos.last().unwrap()
    }

    #[inline]
    fn set_qual_start(&mut self, pos: usize) {
        self.qual_pos.push(pos);
    }

    #[inline]
    fn add_qual_line_start(&mut self, pos: usize) {
        self.qual_pos.push(pos);
    }

    #[inline]
    fn qual_start(&self) -> usize {
        *self.qual_pos.first().unwrap()
    }

    #[inline]
    fn qual_starts(&self) -> &[usize] {
        self.qual_pos.split_last().unwrap().1
    }

    #[inline]
    fn has_qual(&self) -> bool {
        !self.qual_pos.is_empty()
    }

    #[inline]
    fn set_record_end(&mut self, pos: usize, has_line: bool) {
        self.end = pos;
        if self.has_qual() && has_line {
            self.qual_pos.push(pos);
        }
    }

    #[inline]
    fn record_end(&self) -> usize {
        self.end
    }

    #[inline]
    fn num_lines(&self) -> usize {
        self.seq_pos.len() + self.qual_pos.len()
    }

    #[inline]
    fn line_offset(&self, _: SearchPos, has_line: bool) -> usize {
        self.seq_pos.len() + self.qual_pos.len() - !has_line as usize
    }

    #[inline]
    fn num_seq_lines(&self) -> usize {
        debug_assert!(self.seq_pos.len() > 0);
        self.seq_pos.len() - 1
    }

    #[inline]
    fn num_qual_lines(&self) -> usize {
        self.qual_pos.len().checked_sub(1).unwrap_or(0)
    }

    #[inline]
    fn seq_lines<'a>(&'a self, buffer: &'a [u8]) -> LinePositionIter<'a> {
        debug_assert!(self.seq_pos.len() > 0);
        LinePositionIter::new(buffer, &self.seq_pos)
    }

    #[inline]
    fn qual_lines<'a>(&'a self, buffer: &'a [u8]) -> LinePositionIter<'a> {
        debug_assert!(self.qual_pos.len() > 0);
        LinePositionIter::new(buffer, &self.qual_pos)
    }
}