Struct FixedVec

pub struct FixedVec<T> { /* private fields */ }

指定位置的序列, 每个位置上指向上向的位置, 相当于模拟指针 可以根据坐标位置获取相应数据, 亦可以操作上级及下级位置

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_head(1);
    val.insert_head(2);
    assert_eq!(val.len(), 2);
    assert_eq!(val.head(), Some(&2));
    assert_eq!(val.tail(), Some(&1));
    assert_eq!(val.insert_head(3), None);
}

Implementations

impl<T> FixedVec<T>

pub fn new(capacity: usize) -> Self

pub fn with_memory(capacity: usize, reserve: usize) -> Self

pub fn capacity(&self) -> usize

获取容量

pub fn len(&self) -> usize

返回长度

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

pub fn clear(&mut self)

清除数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_head(1);
    assert_eq!(val.len(), 1);
    val.clear();
    assert_eq!(val.len(), 0);
}

pub fn get(&self, idx: usize) -> Option<&T>

pub fn get_mut(&mut self, idx: usize) -> Option<&mut T>

pub fn head_idx(&self) -> usize

获取头部的坐标位置

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_tail(1);
    assert_eq!(val.head_idx(), 0);
}

pub fn head(&self) -> Option<&T>

获取头部首位数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_tail(1);
    assert_eq!(val.head(), Some(&1));
}

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

获取头部首位可变数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_tail(1);
    assert_eq!(val.head_mut(), Some(&mut 1));
}

pub fn tail_idx(&self) -> usize

获取尾部的坐标位置

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_tail(1);
    assert_eq!(val.tail_idx(), 0);
}

pub fn tail(&self) -> Option<&T>

获取尾部首位数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_head(1);
    assert_eq!(val.tail(), Some(&1));
}

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

获取尾部首位可变数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_head(1);
    assert_eq!(val.tail_mut(), Some(&mut 1));
}

pub fn insert_head(&mut self, data: T) -> Option<(usize, &mut T)>

从头部插入新的数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    assert_eq!(val.insert_head(1), Some((0, &mut 1)));
    assert_eq!(val.insert_head(2), Some((1, &mut 2)));
    assert_eq!(val.insert_head(3), None);
}

pub fn insert_tail(&mut self, data: T) -> Option<(usize, &mut T)>

从头部插入新的数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    assert_eq!(val.insert_tail(1), Some((0, &mut 1)));
    assert_eq!(val.insert_tail(2), Some((1, &mut 2)));
    assert_eq!(val.insert_tail(3), None);
}

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

从头部弹出数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_tail(1);
    val.insert_tail(2);
    assert_eq!(val.pop_head(), Some(1));
}

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

从尾部弹出数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_head(1);
    val.insert_head(2);
    assert_eq!(val.pop_tail(), Some(1));
}

pub fn remove(&mut self, idx: usize) -> Option<T>

删除指定位置数据

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(2);
    val.insert_head(1);
    val.insert_head(2);
    assert_eq!(val.remove(1), Some(2));
    assert_eq!(val.len(), 1);
    assert_eq!(val.tail_idx(), 0);
}

pub fn iter(&self) -> FixedVecIter<'_, T>

迭代器

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(5);
    val.insert_head(1);
    val.insert_head(2);
    val.insert_head(3);
    assert_eq!(val.iter().map(|(_, v)| *v).collect::<Vec<_>>(), vec![3, 2, 1]);
}

pub fn iter_mut(&mut self) -> FixedVecIterMut<'_, T>

迭代器

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(5);
    val.insert_head(1);
    val.insert_head(2);
    val.insert_head(3);
    let _ = val.iter_mut().map(|(_, v)| *v = *v * 2).collect::<Vec<_>>();
    assert_eq!(val.iter().map(|(_, v)| *v).collect::<Vec<_>>(), vec![6, 4, 2]);
}

pub fn resize(&mut self, capacity: usize)

重置设置大小

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(5);
    val.insert_head(1);
    val.insert_head(2);
    val.resize(3);
    assert_eq!(val.len(), 2);
    assert_eq!(val.head_idx(), 0);
    assert_eq!(val.tail_idx(), 1);
    assert_eq!(val.tail(), Some(&1));
}

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&T) -> bool,

pub fn retain_mut<F>(&mut self, f: F)

where F: FnMut(&mut T) -> bool,

pub fn move_head(&mut self, idx: usize) -> Option<&mut T>

将指定位置挪到最前面

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(5);
    val.insert_head(1);
    val.insert_head(2);
    val.insert_head(3);
    assert_eq!(val.get(1), Some(&2));
    assert_eq!(val.head(), Some(&3));
    val.move_head(1);
    assert_eq!(val.head(), Some(&2));
    assert_eq!(val.get(1), Some(&2));
    assert_eq!(val.tail(), Some(&1));
}

pub fn move_tail(&mut self, idx: usize) -> Option<&mut T>

将指定位置挪到最后面

Examples

use algorithm::FixedVec;
fn main() {
    let mut val = FixedVec::new(5);
    val.insert_tail(1);
    val.insert_tail(2);
    val.insert_tail(3);
    assert_eq!(val.get(1), Some(&2));
    assert_eq!(val.tail(), Some(&3));
    val.move_tail(1);
    assert_eq!(val.tail(), Some(&2));
    assert_eq!(val.get(1), Some(&2));
    assert_eq!(val.head(), Some(&1));
}

Trait Implementations

impl<T: Debug> Debug for FixedVec<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.