50     async fn pack(&mut self, nalus: &mut BytesMut, timestamp: u32) -> Result<(), PackerError>;  in pack()
76 pub fn find_start_code(nalus: &[u8]) -> Option<usize> {  in find_start_code()
78     nalus.windows(pattern.len()).position(|w| w == pattern)  in find_start_code()
82     nalus: &mut BytesMut,  in split_annexb_and_process()
85     while !nalus.is_empty() {  in split_annexb_and_process()
90         if let Some(first_pos) = find_start_code(&nalus[..]) {  in split_annexb_and_process()
92                 if let Some(distance_to_first_pos) = find_start_code(&nalus[first_pos + 3..]) {  in split_annexb_and_process()
94                     while second_pos > 0 && nalus[second_pos - 1] == 0 {  in split_annexb_and_process()
97                     nalus.split_to(second_pos)  in split_annexb_and_process()
99                     nalus.split_to(nalus.len())  in split_annexb_and_process()
125     fn find_start_code(nalus: &[u8]) -> Option<usize> {  in find_start_code()
127         nalus.windows(pattern.len()).position(|w| w == pattern)  in find_start_code()
132         let mut nalus = BytesMut::new();  in test_annexb_split()  localVariable
133         nalus.extend_from_slice(&[  in test_annexb_split()
138         while !nalus.is_empty() {  in test_annexb_split()
143             if let Some(first_pos) = find_start_code(&nalus[..]) {  in test_annexb_split()
145                     if let Some(distance_to_first_pos) = find_start_code(&nalus[first_pos + 3..]) {  in test_annexb_split()
148                         while second_pos > 0 && nalus[second_pos - 1] == 0 {  in test_annexb_split()
152                         nalus.split_to(second_pos)  in test_annexb_split()
154                         nalus.split_to(nalus.len())  in test_annexb_split()