Struct HighSpeedCache 

pub struct HighSpeedCache<T, const LEN: usize> { /* private fields */ }

Implementations

impl<T, const LEN: usize> HighSpeedCache<T, LEN>

where T: CacheData,

pub fn with_capacity(_capacity: usize) -> Self

创建一个新的高速缓存，与 Vec 的 with_capacity 方法类似 注意：因为内部已经使用固定大小的数组，参数 capacity 仅用于保持 API 风格一致性

pub fn new() -> Self

pub fn push(&self, item_new: T)

添加1项 请控制此方法不可并发访问

pub fn current(&self) -> &T

当前项

pub fn clear(&self)

请控制此方法不可并发访问

pub fn find_找之前的项( &self, 毫秒数: i64, is_找不到即取最新数据: bool, ) -> Option<&T>

传参：毫秒 如果找不到精确定位的数据, 则返回最新的那条数据

pub fn find_limit<F: Fn(&T, &T) -> bool>( &self, n: i64, is_return_last: bool, compare: F, ) -> T

如果十档或者前封单数据如果出现断档的情况，那么把前一个数据的时间戳改成现在数据并且减10毫秒 下次找数据时可以直接找到这一条 找到范围内最大的值 n: 毫秒数 is_return_last: true; 两秒内最大值找不到, 即找一个最新的数据 compare: 比较两个值, 返回true则使用新的值

TODO: 不要使用补数据的逻辑, 找不到数据即取一个最新的数据

pub fn list_items_len(&self, count: usize) -> Vec<&T>

传参：找多少个

pub fn list_items(&self, 毫秒数: i64) -> Vec<&T>

传参：毫秒

impl<T, const LEN: usize> HighSpeedCache<T, LEN>

where T: CacheData,

pub fn len(&self) -> usize

返回缓存中的元素数量

pub fn is_empty(&self) -> bool

检查缓存是否为空

pub fn capacity(&self) -> usize

返回缓存的容量（最大可存储元素数）

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

根据索引获取元素的引用

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

获取元素的可变引用

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

返回一个引用迭代器，按从最新到最旧的顺序

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

返回一个可变引用迭代器，按从最新到最旧的顺序

pub fn to_vec(&self) -> Vec<T>

where T: Clone,

转换为 Vec

Trait Implementations

impl<T: CacheData, const LEN: usize> Default for HighSpeedCache<T, LEN>

fn default() -> Self

Returns the “default value” for a type.

impl<T, const LEN: usize> Deref for HighSpeedCache<T, LEN>

type Target = UnsafeData<T, LEN>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T, const LEN: usize> Index<usize> for HighSpeedCache<T, LEN>

where T: CacheData,

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T, const LEN: usize> IndexMut<usize> for HighSpeedCache<T, LEN>

where T: CacheData,

fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, T, const LEN: usize> IntoIterator for &'a HighSpeedCache<T, LEN>

where T: CacheData,

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = HighSpeedCacheIter<'a, T, LEN>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T, const LEN: usize> IntoIterator for &'a mut HighSpeedCache<T, LEN>

where T: CacheData,

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = HighSpeedCacheIterMut<'a, T, LEN>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, const LEN: usize> IntoIterator for HighSpeedCache<T, LEN>

where T: CacheData + Clone,

type Item = T

The type of the elements being iterated over.

type IntoIter = HighSpeedCacheIntoIter<T, LEN>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.