Struct Storage

pub struct Storage { /* private fields */ }

Implementations

impl Storage

pub fn create(file: File, schema: &str) -> Result<Storage>

pub fn persist(&mut self) -> Result<()>

pub fn open(file: File) -> Result<Storage>

pub fn insert(&mut self, tuple: &mut Tuple) -> Result<(), SchemaError>

Insert does not allow duplicate key and inserts the Tuple in the set in a sorted way

pub fn append(&mut self, tuple: &mut Tuple) -> Result<(), SchemaError>

Append allows duplicate key

pub fn update(&mut self, tuple: &mut Tuple) -> Result<usize, SchemaError>

Update all tuples matching the key

returns how many tuples were updated

pub fn remove_all(&mut self, filter: &Filter) -> usize

Remove all tuples matching the key. Working from the end to the front of the Storage.

pub fn remove(&mut self, filter: &Filter) -> usize

Delete all tuples matching the key sorted

pub fn iter(&self) -> StorageIterator<'_>

pub fn get(&self, offset: u64) -> Option<Tuple>

pub fn create_filter(&self, filter: &str) -> Result<Filter, SchemaParseError>

pub fn schema_to_string(&self) -> String

Trait Implementations

impl Debug for Storage

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

Formats the value using the given formatter.

impl Drop for Storage

fn drop(&mut self)

Executes the destructor for this type.

impl PartialEq for Storage

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.