Struct skiplist_rs::List

pub struct List<T, V> where
    T: Display,  {
    pub header: Option<NonNull<Node<T, V>>>,
    pub tailer: Option<NonNull<Node<T, V>>>,
    pub len: usize,
}

Fields

header: Option<NonNull<Node<T, V>>>

tailer: Option<NonNull<Node<T, V>>>

len: usize

记录链表中的节点数量,可以查看跳跃表每层的节点数量是否分布均匀

Implementations

impl<T, V> List<T, V> where
    T: PartialOrd + Display + Copy, 

pub fn new() -> Self

pub fn remove(&mut self, positon: InsertPosition<T, V>)

pub fn insert_with_position(
    &mut self,
    score: T,
    data: Option<V>,
    insert_position: Option<InsertPosition<T, V>>
) -> NonNull<Node<T, V>>

pub fn insert(&mut self, score: T, data: Option<V>)

pub fn find(
    &self,
    score: &T,
    find_position: Option<NonNull<Node<T, V>>>,
    is_tracing: bool
) -> Option<InsertPosition<T, V>>

寻找该层最适合插入的位置 除非链表是空的，否则不会返回空值

pub fn pop(&mut self) -> Option<T>

pub fn to_debug(&self)

pub fn to_debug_reverse(&self)