pub fn insert(&mut self, row: R) {
        debug_assert_eq!(row.columns(), self.cols);
        let rowid = self.rowid;
        for (column, idx) in self.indices.iter_mut() {
            use EqualityIndex;
            idx.index(row.index(*column).clone(), rowid);
        }
        self.rows.insert(self.rowid, row);
        self.rowid += 1;
    }
/// Insert a new data row into the `Store`. The row **must** have the same number of columns as
/// specified when the `Store` was created. If it does not, the code will panic with an
/// assertion failure.
///
/// Inserting a row has similar complexity to `BTreeMap::insert`, and *may* need to re-allocate
/// the backing memory for the `Store`. The insertion also updates all maintained indices,
/// which may also re-allocate.
Insert a new data row into the `Store`. The row **must** have the same number of columns as
specified when the `Store` was created. If it does not, the code will panic with an
assertion failure.

Inserting a row has similar complexity to `BTreeMap::insert`, and *may* need to re-allocate
the backing memory for the `Store`. The insertion also updates all maintained indices,
which may also re-allocate.
Insert a new data row into the ` Store ` . The row ** must ** have the same number of columns as specified when the ` Store ` was created . If it does not the code will panic with an assertion failure . Inserting a row has similar complexity to ` BTreeMap :: insert ` and * may * need to re - allocate the backing memory for the ` Store ` . The insertion also updates all maintained indices which may also re - allocate .
pub fn insert(&mut self, row: R) {
        debug_assert_eq!(row.columns(), self.cols);
        let rowid = self.rowid;
        for (column, idx) in self.indices.iter_mut() {
            use EqualityIndex;
            idx.index(row.index(*column).clone(), rowid);
        }
        self.rows.insert(self.rowid, row);
        self.rowid += 1;
    }
pub fn insert ( & mut self , row : R ) { debug_assert_eq ! ( row columns ( ) self cols ) ; let rowid = self . rowid ; for ( column , idx ) in self . indices . iter_mut ( ) { use EqualityIndex ; idx . index ( row . index ( * column ) . clone ( ) , rowid ) ; } self . rows . insert ( self . rowid , row ) ; self . rowid += 1 ; }
Insert a new data row into the `Store`.
Insert a new data row into the ` Store ` .
&mut self
row
R
&mut self
row
R