pub fn insert(&mut self, datoms: &[Datom]) -> io::Result<PageId>
    where Store: store::StoreMut {
        let old_root_page = self.root_page;
        let new_root_node = self.insert_into(old_root_page, datoms)?;
        let new_root_page = self.write_root(new_root_node)?;
        // TODO: Maybe not return the new page id? The function is &mut self
        // anyway, so one might reasonably expect it to mutate the root pointer.
        self.root_page = new_root_page;
        Ok(new_root_page)
    }
/// Insert datoms into the tree, return the new root page.
Insert datoms into the tree, return the new root page.
Insert datoms into the tree return the new root page .
pub fn insert(&mut self, datoms: &[Datom]) -> io::Result<PageId>
    where Store: store::StoreMut {
        let old_root_page = self.root_page;
        let new_root_node = self.insert_into(old_root_page, datoms)?;
        let new_root_page = self.write_root(new_root_node)?;
        // TODO: Maybe not return the new page id? The function is &mut self
        // anyway, so one might reasonably expect it to mutate the root pointer.
        self.root_page = new_root_page;
        Ok(new_root_page)
    }
pub fn insert ( & mut self , datoms : & [ Datom ] ) -> io :: Result < PageId > where Store : store :: StoreMut { let old_root_page = self . root_page ; let new_root_node = self . insert_into ( old_root_page , datoms ) ? ; let new_root_page = self . write_root ( new_root_node ) ? ; // TODO: Maybe not return the new page id? The function is &mut self // anyway, so one might reasonably expect it to mutate the root pointer. self . root_page = new_root_page ; Ok ( new_root_page ) }
Insert datoms into the tree, return the new root page.
Insert datoms into the tree return the new root page .
&mut self
datoms
&[Datom]
&mut self
datoms
&[Datom]