176     entries: Vec<(K, V)>,  field
200         self.entries.iter()  in iter()
223         self.entries.iter_mut()  in iter_mut()
239         StreamMap { entries: vec![] }  in new()
256             entries: Vec::with_capacity(capacity),  in with_capacity()
343         self.entries.capacity()  in capacity()
359         self.entries.len()  in len()
375         self.entries.is_empty()  in is_empty()
392         self.entries.clear();  in clear()
420         self.entries.push((k, stream));  in insert()
445         for i in 0..self.entries.len() {  in remove()
446             if self.entries[i].0.borrow() == k {  in remove()
447                 return Some(self.entries.swap_remove(i).1);  in remove()
474         for i in 0..self.entries.len() {  in contains_key()
475             if self.entries[i].0.borrow() == k {  in contains_key()
493         let start = self::rand::thread_rng_n(self.entries.len() as u32) as usize;  in poll_next_entry()
496         for _ in 0..self.entries.len() {  in poll_next_entry()
497             let (_, stream) = &mut self.entries[idx];  in poll_next_entry()
503                     self.entries.swap_remove(idx);  in poll_next_entry()
507                     if idx == self.entries.len() {  in poll_next_entry()
509                     } else if idx < start && start <= self.entries.len() {  in poll_next_entry()
512                         idx = idx.wrapping_add(1) % self.entries.len();  in poll_next_entry()
516                     idx = idx.wrapping_add(1) % self.entries.len();  in poll_next_entry()
522         if self.entries.is_empty() {  in poll_next_entry()
545             let key = self.entries[idx].0.clone();  in poll_next()
555         for (_, stream) in &self.entries {  in size_hint()