Function merklebtree::iterator::next

pub fn next<T>(btree_iterator: &mut btree_iterator<T>) -> bool where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's key and value can be retrieved by Key() and Value(). If Next() was called for the first time, then it will point the iterator to the first element if it exists. Modifies the state of the iterator.