accepts-codegen 0.0.1

Rust toolkit for composing synchronous and asynchronous acceptor pipelines
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

use indexmap::IndexMap;
use std::{
    collections::hash_map::RandomState,
    hash::{BuildHasher, Hash},
};

pub struct MergeMap<K, V, MergeFn, S = RandomState>
where
    K: Eq + Hash,
    MergeFn: FnMut(&mut V, V),
    S: BuildHasher,
{
    map: IndexMap<K, V, S>,
    merge_fn: MergeFn,
}

#[allow(dead_code)]
impl<K, V, MergeFn, S> MergeMap<K, V, MergeFn, S>
where
    K: Eq + Hash,
    MergeFn: FnMut(&mut V, V),
    S: BuildHasher + Default,
{
    pub fn new(map: IndexMap<K, V, S>, merge_fn: MergeFn) -> Self {
        Self { map, merge_fn }
    }

    pub fn with_default(merge_fn: MergeFn) -> Self {
        Self {
            map: IndexMap::with_hasher(S::default()),
            merge_fn,
        }
    }

    pub fn upsert(&mut self, key: K, value: V) {
        if let Some(existing) = self.map.get_mut(&key) {
            (self.merge_fn)(existing, value);
        } else {
            self.map.insert(key, value);
        }
    }

    pub fn get(&self, key: &K) -> Option<&V> {
        self.map.get(key)
    }

    pub fn get_mut(&mut self, key: &K) -> Option<&mut V> {
        self.map.get_mut(key)
    }

    pub fn into_inner(self) -> IndexMap<K, V, S> {
        self.map
    }
}