clap_builder/util/
flat_set.rs

1#![allow(dead_code)]
2
3use std::borrow::Borrow;
4
5/// Flat (Vec) backed set
6///
7/// This preserves insertion order
8#[derive(#[automatically_derived]
impl<T: ::core::clone::Clone> ::core::clone::Clone for FlatSet<T> {
    #[inline]
    fn clone(&self) -> FlatSet<T> {
        FlatSet { inner: ::core::clone::Clone::clone(&self.inner) }
    }
}Clone, #[automatically_derived]
impl<T: ::core::fmt::Debug> ::core::fmt::Debug for FlatSet<T> {
    #[inline]
    fn fmt(&self, f: &mut ::core::fmt::Formatter) -> ::core::fmt::Result {
        ::core::fmt::Formatter::debug_struct_field1_finish(f, "FlatSet",
            "inner", &&self.inner)
    }
}Debug, #[automatically_derived]
impl<T: ::core::cmp::PartialEq> ::core::cmp::PartialEq for FlatSet<T> {
    #[inline]
    fn eq(&self, other: &FlatSet<T>) -> bool { self.inner == other.inner }
}PartialEq, #[automatically_derived]
impl<T: ::core::cmp::Eq> ::core::cmp::Eq for FlatSet<T> {
    #[inline]
    #[doc(hidden)]
    #[coverage(off)]
    fn assert_fields_are_eq(&self) {
        let _: ::core::cmp::AssertParamIsEq<Vec<T>>;
    }
}Eq)]
9pub(crate) struct FlatSet<T> {
10    inner: Vec<T>,
11}
12
13impl<T: PartialEq + Eq> FlatSet<T> {
14    pub(crate) fn new() -> Self {
15        Default::default()
16    }
17
18    pub(crate) fn insert(&mut self, value: T) -> bool {
19        for existing in &self.inner {
20            if *existing == value {
21                return false;
22            }
23        }
24        self.inner.push(value);
25        true
26    }
27
28    pub(crate) fn contains<Q: ?Sized>(&self, value: &Q) -> bool
29    where
30        T: Borrow<Q>,
31        Q: Eq,
32    {
33        for existing in &self.inner {
34            if existing.borrow() == value {
35                return true;
36            }
37        }
38        false
39    }
40
41    pub(crate) fn retain<F>(&mut self, f: F)
42    where
43        F: FnMut(&T) -> bool,
44    {
45        self.inner.retain(f);
46    }
47
48    pub(crate) fn is_empty(&self) -> bool {
49        self.inner.is_empty()
50    }
51
52    pub(crate) fn iter(&self) -> std::slice::Iter<'_, T> {
53        self.inner.iter()
54    }
55
56    pub(crate) fn sort_by_key<K, F>(&mut self, f: F)
57    where
58        F: FnMut(&T) -> K,
59        K: Ord,
60    {
61        self.inner.sort_by_key(f);
62    }
63
64    pub(crate) fn into_vec(self) -> Vec<T> {
65        self.inner
66    }
67}
68
69impl<T: PartialEq + Eq> Default for FlatSet<T> {
70    fn default() -> Self {
71        Self {
72            inner: Default::default(),
73        }
74    }
75}
76
77impl<T: PartialEq + Eq> IntoIterator for FlatSet<T> {
78    type Item = T;
79    type IntoIter = std::vec::IntoIter<T>;
80
81    fn into_iter(self) -> Self::IntoIter {
82        self.inner.into_iter()
83    }
84}
85
86impl<'s, T: PartialEq + Eq> IntoIterator for &'s FlatSet<T> {
87    type Item = &'s T;
88    type IntoIter = std::slice::Iter<'s, T>;
89
90    fn into_iter(self) -> Self::IntoIter {
91        self.inner.iter()
92    }
93}
94
95impl<T: PartialEq + Eq> Extend<T> for FlatSet<T> {
96    fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
97        for value in iter {
98            self.insert(value);
99        }
100    }
101}
102
103impl<T: PartialEq + Eq> FromIterator<T> for FlatSet<T> {
104    fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
105        let mut set = Self::new();
106        for value in iter {
107            set.insert(value);
108        }
109        set
110    }
111}
clap_builder/util/flat_set.rs

clap_builder/util/
flat_set.rs
