Lines Matching refs:entries
28700 f.debug_list().entries(self).finish()
30065 /// An iterator over the entries of a `BTreeMap`.
30080 f.debug_list().entries(self.clone()).finish()
30084 /// A mutable iterator over the entries of a `BTreeMap`.
30097 /// An owning iterator over the entries of a `BTreeMap`.
30121 f.debug_list().entries(self.iter()).finish()
30147 f.debug_list().entries(self.clone()).finish()
30165 f.debug_list().entries(self.clone()).finish()
30183 f.debug_list().entries(self.inner.iter().map(|(_, val)| val)).finish()
30201 f.debug_list().entries(self.inner.iter().map(|(key, _)| key)).finish()
30219 f.debug_list().entries(self.inner.iter().map(|(_, val)| val)).finish()
30223 /// An iterator over a sub-range of entries in a `BTreeMap`.
30237 f.debug_list().entries(self.clone()).finish()
30241 /// A mutable iterator over a sub-range of entries in a `BTreeMap`.
30259 f.debug_list().entries(range).finish()
30277 /// // entries can now be inserted into the empty map
31801 f.debug_map().entries(self.iter()).finish()
31825 /// Gets an iterator over the entries of the map, sorted by key.
31857 /// Gets a mutable iterator over the entries of the map, sorted by key.
33440 f.debug_set().entries(self.iter()).finish()
37944 // this module doesn't care whether the entries are sorted, which nodes can be underfull, or
43195 f.debug_list().entries(self).finish()
44605 f.debug_list().entries(self.iter()).finish()