pub struct HeapNode<K, T, U> {
pub x: U,
pub pos: U,
pub id: T,
pub key: K,
}
Expand description
Heap Node.
Fields§
§x: U
Index of node from heap position.
pos: U
Heap position of this node.
id: T
Node id.
key: K
Node key.
Trait Implementations§
Auto Trait Implementations§
impl<K, T, U> RefUnwindSafe for HeapNode<K, T, U>
impl<K, T, U> Send for HeapNode<K, T, U>
impl<K, T, U> Sync for HeapNode<K, T, U>
impl<K, T, U> Unpin for HeapNode<K, T, U>
impl<K, T, U> UnwindSafe for HeapNode<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