fn next_id(&self) -> i64 {
        // First we just get all the keys (ids).
        // This vector is just a copy of the ids, so we can throw it
        // away when done.
        let mut ids: Vec<_> = self.inner.keys().collect();
        ids.sort();
        // "pop" removes the last entry from the vector, so we will have
        // the largest ID currently in use.
        // Adding 1 to the largest ID gives us the next ID, and if none
        // were found, we just start at 1.
        match ids.pop() {
            Some(id) => id + 1,
            None => 1,
        }
    }
/// Returns the next available record id.
Returns the next available record id.
Returns the next available record id .
fn next_id(&self) -> i64 {
        // First we just get all the keys (ids).
        // This vector is just a copy of the ids, so we can throw it
        // away when done.
        let mut ids: Vec<_> = self.inner.keys().collect();
        ids.sort();
        // "pop" removes the last entry from the vector, so we will have
        // the largest ID currently in use.
        // Adding 1 to the largest ID gives us the next ID, and if none
        // were found, we just start at 1.
        match ids.pop() {
            Some(id) => id + 1,
            None => 1,
        }
    }
fn next_id ( & self ) -> i64 { // First we just get all the keys (ids). // This vector is just a copy of the ids, so we can throw it // away when done. let mut ids : Vec < _ > = self . inner . keys ( ) . collect ( ) ; ids . sort ( ) ; // "pop" removes the last entry from the vector, so we will have // the largest ID currently in use. // Adding 1 to the largest ID gives us the next ID, and if none // were found, we just start at 1. match ids . pop ( ) { Some ( id ) => id + 1 , None => 1 , } }
Returns the next available record id.
Returns the next available record id .
&self