pub struct GHeap<K, T, U> {
pub n: usize,
pub free: usize,
pub v: Vec<HeapNode<K, T, U>>,
}
Expand description
Heap for tracking least used page.
Fields§
§n: usize
Number of heap nodes, not including free nodes.
free: usize
1 + Index of start of free list.
v: Vec<HeapNode<K, T, U>>
Vector of heap nodes.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<K, T, U> RefUnwindSafe for GHeap<K, T, U>
impl<K, T, U> Send for GHeap<K, T, U>
impl<K, T, U> Sync for GHeap<K, T, U>
impl<K, T, U> Unpin for GHeap<K, T, U>
impl<K, T, U> UnwindSafe for GHeap<K, T, U>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more