Struct Dict 

pub struct Dict {
    pub nodes: Vec<DictNode>,
}

A sorted doubly-linked list dictionary. The comparison function takes (frame_data, key1, key2) and returns key1 <= key2.

Fields

nodes: Vec<DictNode>

Implementations

impl Dict

pub fn new() -> Self

pub fn insert<F>(&mut self, key: u32, leq: &F) -> NodeIdx

where F: Fn(u32, u32) -> bool,

dictInsert: insert a key at the back (before the head sentinel).

pub fn insert_before<F>(&mut self, node: NodeIdx, key: u32, leq: &F) -> NodeIdx

where F: Fn(u32, u32) -> bool,

dictInsertBefore: insert key before node, walking backward to find the correct sorted position.

pub fn delete(&mut self, node: NodeIdx)

dictDelete: remove a node from the dictionary.

pub fn search<F>(&self, key: u32, leq: &F) -> NodeIdx

where F: Fn(u32, u32) -> bool,

dictSearch: find the first node with key >= given key.

pub fn key(&self, node: NodeIdx) -> u32

dictKey: get the key of a node.

pub fn min(&self) -> NodeIdx

dictMin: first real node (after sentinel).

pub fn max(&self) -> NodeIdx

dictMax: last real node (before sentinel, via prev).

pub fn succ(&self, node: NodeIdx) -> NodeIdx

dictSucc: successor of a node.

pub fn pred(&self, node: NodeIdx) -> NodeIdx

dictPred: predecessor of a node.

Trait Implementations

impl Default for Dict

fn default() -> Self

Returns the “default value” for a type.