Lines Matching defs:top
13425 let mut top = heap.peek_mut().unwrap();
13426 *top -= 2;
13437 let mut top = heap.peek_mut().unwrap();
13438 *top -= 2;
13439 assert_eq!(PeekMut::pop(top), 8);
18981 /// // Mutates the data from slice into owned vec and pushes a new value on top
23096 // The gist of the story is: we must enforce the invariants on the top four runs on the stack.
23097 // Enforcing them on just top three is not sufficient to ensure that the invariants will still
23100 // This function correctly checks invariants for the top four runs. Additionally, if the top
29246 // We are at the top, create a new root node and push there.
35611 // Check the back pointers top-down, before we attempt to rely on
37572 // make sure fix_top eliminates both top levels.
37587 // make sure fix_top eliminates both top levels.
38203 /// root on top, the number says at which elevation the node appears.
38204 /// If you picture trees with leaves on top, the number says how high
38232 /// The method name assumes you picture trees with the root node on top.
38496 let top = self.node;
38508 Global.deallocate(top.cast(), Layout::new::<InternalNode<K, V>>());
38904 /// The method name assumes you picture trees with the root node on top.
39797 /// Removes empty levels on the top, but keeps an empty leaf if the entire tree is empty.
46997 /// while let Some(top) = stack.pop() {
46999 /// println!("{}", top);
47097 /// visualized as below. The top part is the `Vec` struct, it contains a
50115 //! items of the `alloc` crate by adding a glob import to the top of modules: