pub struct MechTable {
pub rows: usize,
pub cols: usize,
pub data: IndexMap<u64, (ValueKind, Matrix<Value>)>,
pub col_names: HashMap<u64, String>,
}
Fields§
§rows: usize
§cols: usize
§data: IndexMap<u64, (ValueKind, Matrix<Value>)>
§col_names: HashMap<u64, String>
Implementations§
Source§impl MechTable
impl MechTable
pub fn from_records(records: Vec<MechRecord>) -> MResult<MechTable>
pub fn from_kind(kind: ValueKind) -> MResult<MechTable>
pub fn empty_table(&self, rows: usize) -> MechTable
pub fn check_record_schema(&self, record: &MechRecord) -> MResult<bool>
pub fn check_table_schema(&self, record: &MechTable) -> MResult<bool>
pub fn append_table(&mut self, other: &MechTable) -> MResult<()>
pub fn append_record(&mut self, record: MechRecord) -> MResult<()>
pub fn get_record(&self, ix: usize) -> Option<MechRecord>
pub fn to_html(&self) -> String
pub fn new( rows: usize, cols: usize, data: IndexMap<u64, (ValueKind, Matrix<Value>)>, col_names: HashMap<u64, String>, ) -> MechTable
pub fn kind(&self) -> ValueKind
pub fn size_of(&self) -> usize
pub fn rows(&self) -> usize
pub fn cols(&self) -> usize
pub fn get(&self, key: &u64) -> Option<&(ValueKind, Matrix<Value>)>
pub fn shape(&self) -> Vec<usize>
Trait Implementations§
Source§impl PrettyPrint for MechTable
impl PrettyPrint for MechTable
fn pretty_print(&self) -> String
impl Eq for MechTable
impl StructuralPartialEq for MechTable
Auto Trait Implementations§
impl Freeze for MechTable
impl !RefUnwindSafe for MechTable
impl !Send for MechTable
impl !Sync for MechTable
impl Unpin for MechTable
impl !UnwindSafe for MechTable
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.