pub fn new_empty<P : AsRef<path::Path>>(filename: P, root_bits: u8) -> Result<HashStore, HashStoreError> {
        let p = filename.as_ref();
        if p.exists() {
            fs::remove_file(p).unwrap();
        }
        HashStore::new(p, root_bits)
    }
/// Creates a hashstore, and clears it if it already exists
///
/// `root_bits` is the number of bits of each key that are used for the root hash table
///
Creates a hashstore, and clears it if it already exists
`root_bits` is the number of bits of each key that are used for the root hash table
Creates a hashstore and clears it if it already exists ` root_bits ` is the number of bits of each key that are used for the root hash table
pub fn new_empty<P : AsRef<path::Path>>(filename: P, root_bits: u8) -> Result<HashStore, HashStoreError> {
        let p = filename.as_ref();
        if p.exists() {
            fs::remove_file(p).unwrap();
        }
        HashStore::new(p, root_bits)
    }
pub fn new_empty < P : AsRef < path :: Path > > ( filename : P , root_bits : u8 ) -> Result < HashStore , HashStoreError > { let p = filename . as_ref ( ) ; if p . exists ( ) { fs :: remove_file ( p ) . unwrap ( ) ; } HashStore :: new ( p , root_bits ) }
Creates a hashstore, and clears it if it already exists
`root_bits` is the number of bits of each key that are used for the root hash table
Creates a hashstore and clears it if it already exists ` root_bits ` is the number of bits of each key that are used for the root hash table
filename
P
root_bits
u8
filename
P
root_bits
u8