Lines Matching defs:stack
9269 // Test on-stack from_fn.
9294 // Test on-stack from_elem.
9441 // Test on stack.
9529 // Test on-stack push().
22992 /// natural runs. There is a stack of pending runs yet to be merged. Each newly found run is pushed
22993 /// onto the stack, and then some pairs of adjacent runs are merged until these two invariants are
23065 // Push this run onto the stack.
23086 // Finally, exactly one run must remain in the stack.
23089 // Examines the stack of runs and identifies the next pair of runs to merge. More specifically,
23096 // The gist of the story is: we must enforce the invariants on the top four runs on the stack.
23098 // hold for *all* runs in the stack.
23101 // run starts at index 0, it will always demand a merge operation until the stack is fully
26159 //! that an error has occurred back up the stack.
26280 //! references information on the stack. Under the hood, all of
35032 let mut stack = vec![];
35038 stack.push((factor, dormant_r));
35040 while let Some((factor, dormant_r)) = stack.pop() {
46988 /// Use a `Vec<T>` as an efficient stack:
46991 /// let mut stack = Vec::new();
46993 /// stack.push(1);
46994 /// stack.push(2);
46995 /// stack.push(3);
46997 /// while let Some(top) = stack.pop() {
47118 /// stored on the stack for two reasons:
48177 // the stack and in the vector at the same time.
50180 //! Move a value from the stack to the heap by creating a [`Box`]:
50187 //! Move a value from a [`Box`] back to the stack by [dereferencing]:
51360 /// from the stack into it.