18     pub(crate) fn get(&self, n: usize, data: &[T], index: usize) -> Option<bool> {  in get()
19         if unlikely(index >= n) {  in get()
23         let element_index = index / T::bit_size();  in get()
24         let bit_index = index % T::bit_size();  in get()
33     pub(crate) fn set(&self, n: usize, data: &mut [T], index: usize, value: bool) -> Option<bool> {  in set()
34         if unlikely(index >= n) {  in set()
37         let element_index = index / T::bit_size();  in set()
38         let bit_index = index % T::bit_size();  in set()
126     pub(crate) fn next_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {  in next_index()
127         if unlikely(index >= n) {  in next_index()
131         let element_index = index / T::bit_size();  in next_index()
132         let bit_index = index % T::bit_size();  in next_index()
149     pub(crate) fn next_false_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {  in next_false_index()
150         if unlikely(index >= n) {  in next_false_index()
154         let element_index = index / T::bit_size();  in next_false_index()
155         let bit_index = index % T::bit_size();  in next_false_index()
172     pub(crate) fn prev_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {  in prev_index()
173         if unlikely(index >= n) {  in prev_index()
176         let element_index = index / T::bit_size();  in prev_index()
177         let bit_index = index % T::bit_size();  in prev_index()
193     pub(crate) fn prev_false_index(&self, n: usize, data: &[T], index: usize) -> Option<usize> {  in prev_false_index()
194         let element_index = index / T::bit_size();  in prev_false_index()
195         let bit_index = index % T::bit_size();  in prev_false_index()
258     fn make_index(&self, n: usize, index: usize) -> Option<usize> {  in make_index()
259         if unlikely(index >= n) {  in make_index()
263         Some(index)  in make_index()