Lines Matching refs:entries
118 entries: Vec<Entry<T>>, field
164 entries: std::slice::Iter<'a, Entry<T>>, field
170 entries: std::slice::IterMut<'a, Entry<T>>, field
228 entries: Vec::with_capacity(capacity), in with_capacity()
244 self.entries.capacity() in capacity()
277 let need_add = self.len + additional - self.entries.len(); in reserve()
278 self.entries.reserve(need_add); in reserve()
311 let need_add = self.len + additional - self.entries.len(); in reserve_exact()
312 self.entries.reserve_exact(need_add); in reserve_exact()
356 self.entries.shrink_to_fit(); in shrink_to_fit()
375 self.entries.clear(); in clear()
440 entries: self.entries.iter(), in iter()
472 entries: self.entries.iter_mut(), in iter_mut()
493 match self.entries.get(key) { in get()
517 match self.entries.get_mut(key) { in get_mut()
540 match *self.entries.get_unchecked(key) { in get_unchecked()
566 match *self.entries.get_unchecked_mut(key) { in get_unchecked_mut()
631 if key == self.entries.len() { in insert_at()
632 self.entries.push(Entry::Occupied(val)); in insert_at()
635 let prev = mem::replace(&mut self.entries[key], Entry::Occupied(val)); in insert_at()
668 let prev = mem::replace(&mut self.entries[key], Entry::Vacant(self.next)); in remove()
678 self.entries[key] = prev; in remove()
700 self.entries in contains()
737 for i in 0..self.entries.len() { in retain()
738 let keep = match self.entries[i] { in retain()
779 Drain(self.entries.drain(..)) in drain()
787 match self.entries[key] { in index()
796 match self.entries[key] { in index_mut()
842 .field("remaining", &self.entries.len()) in fmt()
854 .field("remaining", &self.entries.len()) in fmt()
893 match self.slab.entries[self.key] { in insert()
931 while let Some(entry) = self.entries.next() { in next()
950 while let Some(entry) = self.entries.next() { in next()