wiwi_chain/set.rs
1use crate::prelude_internal::*;
2
3impl_chain_conversions! { [T, S] std::collections::HashSet<T, S> }
4impl_chain_conversions! { [T] std::collections::BTreeSet<T> }
5impl_chain_conversions! {
6 #[cfg(feature = "hashbrown")]
7 [T, S] hashbrown::HashSet<T, S>
8}
9
10chain_fns! {
11 impl and_mut [T, S] { doc "HashSet" "std::collections::HashSet" } std::collections::HashSet<T, S>;
12 impl and_mut [T] { doc "BTreeSet" "std::collections::BTreeSet" } std::collections::BTreeSet<T>;
13 #[cfg(feature = "hashbrown")]
14 impl and_mut [T, S] { doc "HashSet" "hashbrown::HashSet" } hashbrown::HashSet<T, S>;
15
16 doc [Self]
17 fn clear(inner) {
18 inner.clear()
19 }
20
21 doc [Self]
22 fn len(inner, out: impl Output<usize>) {
23 out.write(inner.len())
24 }
25}
26
27/*
28std
29Methods
30capacity
31clear
32contains
33difference
34drain
35entry
36extract_if
37get
38get_or_insert
39get_or_insert_with
40hasher
41insert
42intersection
43is_disjoint
44is_empty
45is_subset
46is_superset
47iter
48len
49new
50remove
51replace
52reserve
53retain
54shrink_to
55shrink_to_fit
56symmetric_difference
57take
58try_reserve
59union
60with_capacity
61with_capacity_and_hasher
62with_hasher
63Trait Implementations
64BitAnd<&HashSet<T, S>>
65BitOr<&HashSet<T, S>>
66BitXor<&HashSet<T, S>>
67Clone
68Debug
69Default
70Eq
71Extend<&'a T>
72Extend<T>
73From<[T; N]>
74FromIterator<T>
75IntoIterator
76IntoIterator
77PartialEq
78Sub<&HashSet<T, S>>
79
80
81btree
82Methods
83append
84clear
85contains
86difference
87entry
88extract_if
89first
90get
91get_or_insert
92get_or_insert_with
93insert
94intersection
95is_disjoint
96is_empty
97is_subset
98is_superset
99iter
100last
101len
102lower_bound
103lower_bound_mut
104new
105new_in
106pop_first
107pop_last
108range
109remove
110replace
111retain
112split_off
113symmetric_difference
114take
115union
116upper_bound
117upper_bound_mut
118Trait Implementations
119BitAnd<&BTreeSet<T, A>>
120BitOr<&BTreeSet<T, A>>
121BitXor<&BTreeSet<T, A>>
122Clone
123Debug
124Default
125Eq
126Extend<&'a T>
127Extend<T>
128From<[T; N]>
129FromIterator<T>
130Hash
131IntoIterator
132IntoIterator
133Ord
134PartialEq
135PartialOrd
136Sub<&BTreeSet<T, A>>
137
138
139hashbrown
140Methods
141allocation_size
142allocator
143capacity
144clear
145contains
146difference
147drain
148entry
149extract_if
150get
151get_or_insert
152get_or_insert_with
153hasher
154insert
155insert_unique_unchecked
156intersection
157is_disjoint
158is_empty
159is_subset
160is_superset
161iter
162len
163new
164new_in
165par_difference
166par_drain
167par_eq
168par_intersection
169par_is_disjoint
170par_is_subset
171par_is_superset
172par_symmetric_difference
173par_union
174remove
175replace
176reserve
177retain
178shrink_to
179shrink_to_fit
180symmetric_difference
181take
182try_reserve
183union
184with_capacity
185with_capacity_and_hasher
186with_capacity_and_hasher_in
187with_capacity_in
188with_hasher
189with_hasher_in
190Trait Implementations
191BitAnd<&HashSet<T, S, A>>
192BitAndAssign<&HashSet<T, S, A>>
193BitOr<&HashSet<T, S, A>>
194BitOrAssign<&HashSet<T, S, A>>
195BitXor<&HashSet<T, S, A>>
196BitXorAssign<&HashSet<T, S, A>>
197Clone
198Debug
199Default
200Deserialize<'de>
201Eq
202Extend<&'a T>
203Extend<T>
204From<HashMap<T, (), S, A>>
205From<[T; N]>
206FromIterator<T>
207FromParallelIterator<T>
208IntoIterator
209IntoIterator
210IntoParallelIterator
211IntoParallelIterator
212ParallelExtend<&'a T>
213ParallelExtend<T>
214PartialEq
215Serialize
216Sub<&HashSet<T, S, A>>
217SubAssign<&HashSet<T, S, A>>
218*/