Lines Matching refs:peek
13414 assert_eq!(heap.peek().unwrap(), sorted.last().unwrap());
13423 assert_eq!(heap.peek(), Some(&10));
13428 assert_eq!(heap.peek(), Some(&9));
13435 assert_eq!(heap.peek(), Some(&10));
13441 assert_eq!(heap.peek(), Some(&9));
13448 assert!(*heap.peek().unwrap() == 9);
13451 assert!(*heap.peek().unwrap() == 11);
13454 assert!(*heap.peek().unwrap() == 11);
13457 assert!(*heap.peek().unwrap() == 27);
13460 assert!(*heap.peek().unwrap() == 27);
13463 assert!(*heap.peek().unwrap() == 103);
13470 assert!(**heap.peek().unwrap() == 9);
13473 assert!(**heap.peek().unwrap() == 11);
13476 assert!(**heap.peek().unwrap() == 11);
13479 assert!(**heap.peek().unwrap() == 27);
13482 assert!(**heap.peek().unwrap() == 27);
13485 assert!(**heap.peek().unwrap() == 103);
13536 assert!(empty.peek().is_none());
31446 f.debug_tuple("DrainFilter").field(&self.inner.peek()).finish()
31468 pub(super) fn peek(&self) -> Option<(&K, &V)> {
33285 f.debug_tuple("DrainFilter").field(&self.inner.peek().map(|(k, _)| k)).finish()
33582 match other_iter.peek().map_or(Less, |other_next| self_next.cmp(other_next)) {
44445 /// // We can use peek to look at the next item in the heap. In this case,
44447 /// assert_eq!(heap.peek(), None);
44454 /// // Now peek shows the most important item in the heap.
44455 /// assert_eq!(heap.peek(), Some(&5));
44505 /// | [push] | [pop] | [peek]/[peek\_mut] |
44514 /// [peek]: BinaryHeap::peek
44515 /// [peek\_mut]: BinaryHeap::peek_mut
44667 /// assert_eq!(heap.peek(), Some(&2));
44724 /// assert_eq!(heap.peek(), Some(&5));
45120 /// assert_eq!(heap.peek(), None);
45125 /// assert_eq!(heap.peek(), Some(&5));
45133 pub fn peek(&self) -> Option<&T> {