jay-compositor 1.15.0

The Jay compositor
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83

use hashbrown::Equivalent;
use hashbrown::HashMap;
use hashbrown::HashSet;
use hashbrown::hash_map::EntryRef;
use hashbrown::hash_map::OccupiedEntry;
use std::hash::BuildHasher;
use std::hash::Hash;

pub trait HashMapExt {
    type K;
    type V;
    type S;

    fn drain_values(&mut self) -> impl Iterator<Item = Self::V>;

    fn not_contains_key<Q>(&self, k: &Q) -> bool
    where
        Q: Hash + Equivalent<Self::K> + ?Sized;

    fn is_not_empty(&self) -> bool;

    fn occupied_entry<Q>(&mut self, k: &Q) -> Option<OccupiedEntry<'_, Self::K, Self::V, Self::S>>
    where
        Q: Hash + Equivalent<Self::K> + ?Sized;
}

impl<K, V, S> HashMapExt for HashMap<K, V, S>
where
    K: Eq + Hash,
    S: BuildHasher,
{
    type K = K;
    type V = V;
    type S = S;

    fn drain_values(&mut self) -> impl Iterator<Item = Self::V> {
        self.drain().map(|(_, v)| v)
    }

    fn not_contains_key<Q>(&self, k: &Q) -> bool
    where
        Q: Hash + Equivalent<Self::K> + ?Sized,
    {
        !self.contains_key(k)
    }

    fn is_not_empty(&self) -> bool {
        !self.is_empty()
    }

    fn occupied_entry<Q>(&mut self, k: &Q) -> Option<OccupiedEntry<'_, Self::K, Self::V, Self::S>>
    where
        Q: Hash + Equivalent<Self::K> + ?Sized,
    {
        match self.entry_ref(k) {
            EntryRef::Occupied(e) => Some(e),
            EntryRef::Vacant(_) => None,
        }
    }
}

pub trait HashSetExt {
    type T;

    fn not_contains<Q>(&self, k: &Q) -> bool
    where
        Q: Hash + Equivalent<Self::T> + ?Sized;
}

impl<T, S> HashSetExt for HashSet<T, S>
where
    T: Eq + Hash,
    S: BuildHasher,
{
    type T = T;

    fn not_contains<Q>(&self, k: &Q) -> bool
    where
        Q: Hash + Equivalent<Self::T> + ?Sized,
    {
        !self.contains(k)
    }
}