28         !(self.chunk_map.contains_key(&p.tsn) || sna32lte(p.tsn, cumulative_tsn))  in can_push()
32         let tsn = p.tsn;  in push_no_check()  localVariable
34         self.chunk_map.insert(tsn, p);  in push_no_check()
37         if self.sorted.is_empty() || sna32gt(tsn, *self.sorted.back().unwrap()) {  in push_no_check()
38             self.sorted.push_back(tsn);  in push_no_check()
39         } else if sna32lt(tsn, *self.sorted.front().unwrap()) {  in push_no_check()
40             self.sorted.push_front(tsn);  in push_no_check()
51                 .binary_search_by(|element| compare_tsn(*element, tsn))  in push_no_check()
56             self.sorted.insert(pos, tsn);  in push_no_check()
64         let ok = self.chunk_map.contains_key(&p.tsn);  in push()
65         if ok || sna32lte(p.tsn, cumulative_tsn) {  in push()
67             self.dup_tsn.push(p.tsn);  in push()
76     pub(crate) fn pop(&mut self, tsn: u32) -> Option<ChunkPayloadData> {  in pop()
77         if Some(&tsn) == self.sorted.front() {  in pop()
79             if let Some(c) = self.chunk_map.remove(&tsn) {  in pop()
90     pub(crate) fn get(&self, tsn: u32) -> Option<&ChunkPayloadData> {  in get()
91         self.chunk_map.get(&tsn)  in get()
93     pub(crate) fn get_mut(&mut self, tsn: u32) -> Option<&mut ChunkPayloadData> {  in get_mut()
94         self.chunk_map.get_mut(&tsn)  in get_mut()
109         for (i, tsn) in self.sorted.iter().enumerate() {  in get_gap_ack_blocks()
110             let diff = if *tsn >= cumulative_tsn {  in get_gap_ack_blocks()
111                 (*tsn - cumulative_tsn) as u16  in get_gap_ack_blocks()
142     pub(crate) fn mark_as_acked(&mut self, tsn: u32) -> usize {  in mark_as_acked()
143         let n_bytes_acked = if let Some(c) = self.chunk_map.get_mut(&tsn) {  in mark_as_acked()