pub struct WriteMode {
pub insert: InsertMode,
pub overwrite: OverwriteMode,
pub allow_extend_support: bool,
pub append_strategy: AppendStrategy,
}
Expand description
Defines how/where data may be inserted, which day may and may not be overwritten, and whether data may extend the domain
§Example
Default WriteMode
only allows appending supported values to new rows or
columns
use lace::{WriteMode, InsertMode, OverwriteMode, AppendStrategy};
let mode_new = WriteMode::new();
let mode_def = WriteMode::default();
assert_eq!(
mode_new,
WriteMode {
insert: InsertMode::Unrestricted,
overwrite: OverwriteMode::Deny,
allow_extend_support: false,
append_strategy: AppendStrategy::None,
}
);
assert_eq!(mode_def, mode_new);
Fields§
§insert: InsertMode
Determines whether new rows or columns can be appended or if data may be entered into existing cells.
overwrite: OverwriteMode
Determines if existing cells may or may not be overwritten or whether only missing cells may be overwritten.
allow_extend_support: bool
If true
, allow column support to be extended to accommodate new data
that fall outside the range. For example, a binary column extends to
ternary after the user inserts Datum::Categorical(2)
.
append_strategy: AppendStrategy
The behavior of the table when new rows are appended
Implementations§
Trait Implementations§
source§impl<'de> Deserialize<'de> for WriteMode
impl<'de> Deserialize<'de> for WriteMode
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq for WriteMode
impl PartialEq for WriteMode
impl Copy for WriteMode
impl Eq for WriteMode
impl StructuralPartialEq for WriteMode
Auto Trait Implementations§
impl RefUnwindSafe for WriteMode
impl Send for WriteMode
impl Sync for WriteMode
impl Unpin for WriteMode
impl UnwindSafe for WriteMode
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.