counted_map 0.4.0

a hashmap that automatically assigns keys to pushed values
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

use std::mem;

use crate::hash_index::HashIndex;

#[derive(Debug, Default, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct Counter<T: HashIndex> {
    count: T,
}
impl<T: HashIndex> Counter<T> {
    pub fn new() -> Self {
        Self::default()
    }
    pub fn starting_at(starting_at: T) -> Self {
        Self { count: starting_at }
    }
    pub fn get_count(&self) -> &T {
        &self.count
    }
}
impl<T: HashIndex> Iterator for Counter<T> {
    type Item = T;
    fn next(&mut self) -> Option<Self::Item> {
        let new = self.count.clone().increment()?;
        Some(mem::replace(&mut self.count, new))
    }
}