2 #![forbid(missing_docs)]
4 //! A library for defining enums that can be used in compact bit sets. It supports enums up to 128
5 //! variants, and has a macro to use these sets in constants.
7 //! For serde support, enable the `serde` feature.
9 //! # Defining enums for use with EnumSet
11 //! Enums to be used with [`EnumSet`] should be defined using `#[derive(EnumSetType)]`:
15 //! #[derive(EnumSetType, Debug)]
17 //! A, B, C, D, E, F, G,
21 //! For more information on more advanced use cases, see the documentation for
22 //! [`#[derive(EnumSetType)]`](./derive.EnumSetType.html).
24 //! # Working with EnumSets
26 //! EnumSets can be constructed via [`EnumSet::new()`] like a normal set. In addition,
27 //! `#[derive(EnumSetType)]` creates operator overloads that allow you to create EnumSets like so:
31 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
32 //! let new_set = Enum::A | Enum::C | Enum::G;
33 //! assert_eq!(new_set.len(), 3);
36 //! All bitwise operations you would expect to work on bitsets also work on both EnumSets and
37 //! enums with `#[derive(EnumSetType)]`:
40 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
41 //! // Intersection of sets
42 //! assert_eq!((Enum::A | Enum::B) & Enum::C, EnumSet::empty());
43 //! assert_eq!((Enum::A | Enum::B) & Enum::A, Enum::A);
44 //! assert_eq!(Enum::A & Enum::B, EnumSet::empty());
46 //! // Symmetric difference of sets
47 //! assert_eq!((Enum::A | Enum::B) ^ (Enum::B | Enum::C), Enum::A | Enum::C);
48 //! assert_eq!(Enum::A ^ Enum::C, Enum::A | Enum::C);
50 //! // Difference of sets
51 //! assert_eq!((Enum::A | Enum::B | Enum::C) - Enum::B, Enum::A | Enum::C);
53 //! // Complement of sets
54 //! assert_eq!(!(Enum::E | Enum::G), Enum::A | Enum::B | Enum::C | Enum::D | Enum::F);
57 //! The [`enum_set!`] macro allows you to create EnumSets in constant contexts:
61 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
62 //! const CONST_SET: EnumSet<Enum> = enum_set!(Enum::A | Enum::B);
63 //! assert_eq!(CONST_SET, Enum::A | Enum::B);
66 //! Mutable operations on the [`EnumSet`] otherwise similarly to Rust's builtin sets:
70 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
71 //! let mut set = EnumSet::new();
72 //! set.insert(Enum::A);
73 //! set.insert_all(Enum::E | Enum::G);
74 //! assert!(set.contains(Enum::A));
75 //! assert!(!set.contains(Enum::B));
76 //! assert_eq!(set, Enum::A | Enum::E | Enum::G);
79 use core::cmp::Ordering;
81 use core::fmt::{Debug, Formatter};
82 use core::hash::{Hash, Hasher};
83 use core::iter::{FromIterator, Sum};
87 /// Everything in this module is internal API and may change at any time.
91 /// A reexport of core to allow our macros to be generic to std vs core.
92 pub use ::core as core_export;
94 /// A reexport of serde so there is no requirement to depend on serde.
95 #[cfg(feature = "serde")] pub use serde2 as serde;
97 /// The actual members of EnumSetType. Put here to avoid polluting global namespaces.
98 pub unsafe trait EnumSetTypePrivate {
99 /// The underlying type used to store the bitset.
100 type Repr: EnumSetTypeRepr;
101 /// A mask of bits that are valid in the bitset.
102 const ALL_BITS: Self::Repr;
104 /// Converts an enum of this type into its bit position.
105 fn enum_into_u32(self) -> u32;
106 /// Converts a bit position into an enum value.
107 unsafe fn enum_from_u32(val: u32) -> Self;
109 /// Serializes the `EnumSet`.
111 /// This and `deserialize` are part of the `EnumSetType` trait so the procedural derive
112 /// can control how `EnumSet` is serialized.
113 #[cfg(feature = "serde")]
114 fn serialize<S: serde::Serializer>(set: EnumSet<Self>, ser: S) -> Result<S::Ok, S::Error>
115 where Self: EnumSetType;
116 /// Deserializes the `EnumSet`.
117 #[cfg(feature = "serde")]
118 fn deserialize<'de, D: serde::Deserializer<'de>>(de: D) -> Result<EnumSet<Self>, D::Error>
119 where Self: EnumSetType;
122 use crate::__internal::EnumSetTypePrivate;
123 #[cfg(feature = "serde")] use crate::__internal::serde;
124 #[cfg(feature = "serde")] use crate::serde::{Serialize, Deserialize};
127 use crate::repr::EnumSetTypeRepr;
129 /// The procedural macro used to derive [`EnumSetType`], and allow enums to be used with
132 /// It may be used with any enum with no data fields, at most 127 variants, and no variant
133 /// discriminators larger than 127.
135 /// # Additional Impls
137 /// In addition to the implementation of `EnumSetType`, this procedural macro creates multiple
138 /// other impls that are either required for the macro to work, or make the procedural macro more
139 /// ergonomic to use.
141 /// A full list of traits implemented as is follows:
143 /// * [`Copy`], [`Clone`], [`Eq`], [`PartialEq`] implementations are created to allow `EnumSet`
144 /// to function properly. These automatic implementations may be suppressed using
145 /// `#[enumset(no_super_impls)]`, but these traits must still be implemented in another way.
146 /// * [`PartialEq`], [`Sub`], [`BitAnd`], [`BitOr`], [`BitXor`], and [`Not`] implementations are
147 /// created to allow the crate to be used more ergonomically in expressions. These automatic
148 /// implementations may be suppressed using `#[enumset(no_ops)]`.
152 /// Options are given with `#[enumset(foo)]` annotations attached to the same enum as the derive.
153 /// Multiple options may be given in the same annotation using the `#[enumset(foo, bar)]` syntax.
155 /// A full list of options is as follows:
157 /// * `#[enumset(no_super_impls)]` prevents the derive from creating implementations required for
158 /// [`EnumSet`] to function. When this attribute is specified, implementations of [`Copy`],
159 /// [`Clone`], [`Eq`], and [`PartialEq`]. This can be useful if you are using a code generator
160 /// that already derives these traits. These impls should function identically to the
161 /// automatically derived versions, or unintentional behavior may be a result.
162 /// * `#[enumset(no_ops)` prevents the derive from implementing any operator traits.
163 /// * `#[enumset(crate_name = "enumset2")]` may be used to change the name of the `enumset` crate
164 /// used in the generated code, if you have renamed the crate via cargo options.
166 /// When the `serde` feature is used, the following features may also be specified. These options
167 /// may be used (with no effect) when building without the feature enabled:
169 /// * `#[enumset(serialize_repr = "u8")]` may be used to specify the integer type used to serialize
170 /// the underlying bitset.
171 /// * `#[enumset(serialize_as_list)]` may be used to serialize the bitset as a list of enum
172 /// variants instead of an integer. This requires [`Deserialize`] and [`Serialize`] be
173 /// implemented on the enum.
174 /// * `#[enumset(serialize_deny_unknown)]` causes the generated deserializer to return an error
175 /// for unknown bits instead of silently ignoring them.
179 /// Deriving a plain EnumSetType:
182 /// # use enumset::*;
183 /// #[derive(EnumSetType)]
185 /// A, B, C, D, E, F, G,
189 /// Deriving a sparse EnumSetType:
192 /// # use enumset::*;
193 /// #[derive(EnumSetType)]
194 /// pub enum SparseEnum {
195 /// A = 10, B = 20, C = 30, D = 127,
199 /// Deriving an EnumSetType without adding ops:
202 /// # use enumset::*;
203 /// #[derive(EnumSetType)]
204 /// #[enumset(no_ops)]
205 /// pub enum NoOpsEnum {
206 /// A, B, C, D, E, F, G,
209 pub use enumset_derive::EnumSetType;
211 /// The trait used to define enum types that may be used with [`EnumSet`].
213 /// This trait must be impelmented using `#[derive(EnumSetType)]`, is not public API, and its
214 /// internal structure may change at any time with no warning.
216 /// For full documentation on the procedural derive and its options, see
217 /// [`#[derive(EnumSetType)]`](./derive.EnumSetType.html).
218 pub unsafe trait EnumSetType: Copy + Eq + EnumSetTypePrivate { }
220 /// An efficient set type for enums.
222 /// It is implemented using a bitset stored using the smallest integer that can fit all bits
223 /// in the underlying enum. In general, an enum variant with a numeric value of `n` is stored in
224 /// the nth least significant bit (corresponding with a mask of, e.g. `1 << enum as u32`).
228 /// When the `serde` feature is enabled, `EnumSet`s can be serialized and deserialized using
229 /// the `serde` crate. The exact serialization format can be controlled with additional attributes
230 /// on the enum type. These attributes are valid regardless of whether the `serde` feature
233 /// By default, `EnumSet`s serialize by directly writing out the underlying bitset as an integer
234 /// of the smallest type that can fit in the underlying enum. You can add a
235 /// `#[enumset(serialize_repr = "u8")]` attribute to your enum to control the integer type used
236 /// for serialization. This can be important for avoiding unintentional breaking changes when
237 /// `EnumSet`s are serialized with formats like `bincode`.
239 /// By default, unknown bits are ignored and silently removed from the bitset. To override this
240 /// behavior, you can add a `#[enumset(serialize_deny_unknown)]` attribute. This will cause
241 /// deserialization to fail if an invalid bit is set.
243 /// In addition, the `#[enumset(serialize_as_list)]` attribute causes the `EnumSet` to be
244 /// instead serialized as a list of enum variants. This requires your enum type implement
245 /// [`Serialize`] and [`Deserialize`]. Note that this is a breaking change
246 #[derive(Copy, Clone, PartialEq, Eq)]
248 pub struct EnumSet<T: EnumSetType> {
250 /// This is public due to the [`enum_set!`] macro.
251 /// This is **NOT** public API and may change at any time.
252 pub __priv_repr: T::Repr
254 impl <T: EnumSetType> EnumSet<T> {
255 // Returns all bits valid for the enum
257 fn all_bits() -> T::Repr {
261 /// Creates an empty `EnumSet`.
263 pub fn new() -> Self {
264 EnumSet { __priv_repr: T::Repr::empty() }
267 /// Returns an `EnumSet` containing a single element.
269 pub fn only(t: T) -> Self {
270 let mut set = Self::new();
275 /// Creates an empty `EnumSet`.
277 /// This is an alias for [`EnumSet::new`].
279 pub fn empty() -> Self {
283 /// Returns an `EnumSet` containing all valid variants of the enum.
285 pub fn all() -> Self {
286 EnumSet { __priv_repr: Self::all_bits() }
289 /// Total number of bits used by this type. Note that the actual amount of space used is
290 /// rounded up to the next highest integer type (`u8`, `u16`, `u32`, `u64`, or `u128`).
292 /// This is the same as [`EnumSet::variant_count`] except in enums with "sparse" variants.
293 /// (e.g. `enum Foo { A = 10, B = 20 }`)
295 pub fn bit_width() -> u32 {
296 T::Repr::WIDTH - T::ALL_BITS.leading_zeros()
299 /// The number of valid variants that this type can contain.
301 /// This is the same as [`EnumSet::bit_width`] except in enums with "sparse" variants.
302 /// (e.g. `enum Foo { A = 10, B = 20 }`)
304 pub fn variant_count() -> u32 {
305 T::ALL_BITS.count_ones()
308 /// Returns the number of elements in this set.
310 pub fn len(&self) -> usize {
311 self.__priv_repr.count_ones() as usize
313 /// Returns `true` if the set contains no elements.
315 pub fn is_empty(&self) -> bool {
316 self.__priv_repr.is_empty()
318 /// Removes all elements from the set.
320 pub fn clear(&mut self) {
321 self.__priv_repr = T::Repr::empty()
324 /// Returns `true` if `self` has no elements in common with `other`. This is equivalent to
325 /// checking for an empty intersection.
327 pub fn is_disjoint(&self, other: Self) -> bool {
328 (*self & other).is_empty()
330 /// Returns `true` if the set is a superset of another, i.e., `self` contains at least all the
331 /// values in `other`.
333 pub fn is_superset(&self, other: Self) -> bool {
334 (*self & other).__priv_repr == other.__priv_repr
336 /// Returns `true` if the set is a subset of another, i.e., `other` contains at least all
337 /// the values in `self`.
339 pub fn is_subset(&self, other: Self) -> bool {
340 other.is_superset(*self)
343 /// Returns a set containing any elements present in either set.
345 pub fn union(&self, other: Self) -> Self {
346 EnumSet { __priv_repr: self.__priv_repr | other.__priv_repr }
348 /// Returns a set containing every element present in both sets.
350 pub fn intersection(&self, other: Self) -> Self {
351 EnumSet { __priv_repr: self.__priv_repr & other.__priv_repr }
353 /// Returns a set containing element present in `self` but not in `other`.
355 pub fn difference(&self, other: Self) -> Self {
356 EnumSet { __priv_repr: self.__priv_repr.and_not(other.__priv_repr) }
358 /// Returns a set containing every element present in either `self` or `other`, but is not
361 pub fn symmetrical_difference(&self, other: Self) -> Self {
362 EnumSet { __priv_repr: self.__priv_repr ^ other.__priv_repr }
364 /// Returns a set containing all enum variants not in this set.
366 pub fn complement(&self) -> Self {
367 EnumSet { __priv_repr: !self.__priv_repr & Self::all_bits() }
370 /// Checks whether this set contains a value.
372 pub fn contains(&self, value: T) -> bool {
373 self.__priv_repr.has_bit(value.enum_into_u32())
376 /// Adds a value to this set.
378 /// If the set did not have this value present, `true` is returned.
380 /// If the set did have this value present, `false` is returned.
382 pub fn insert(&mut self, value: T) -> bool {
383 let contains = !self.contains(value);
384 self.__priv_repr.add_bit(value.enum_into_u32());
387 /// Removes a value from this set. Returns whether the value was present in the set.
389 pub fn remove(&mut self, value: T) -> bool {
390 let contains = self.contains(value);
391 self.__priv_repr.remove_bit(value.enum_into_u32());
395 /// Adds all elements in another set to this one.
397 pub fn insert_all(&mut self, other: Self) {
398 self.__priv_repr = self.__priv_repr | other.__priv_repr
400 /// Removes all values in another set from this one.
402 pub fn remove_all(&mut self, other: Self) {
403 self.__priv_repr = self.__priv_repr.and_not(other.__priv_repr);
406 /// Creates an iterator over the values in this set.
408 /// Note that iterator invalidation is impossible as the iterator contains a copy of this type,
409 /// rather than holding a reference to it.
410 pub fn iter(&self) -> EnumSetIter<T> {
411 EnumSetIter::new(*self)
415 /// Helper macro for generating conversion functions.
416 macro_rules! conversion_impls {
419 $underlying:ty, $underlying_str:expr,
420 $from_fn:ident $to_fn:ident $from_fn_opt:ident $to_fn_opt:ident,
421 $from:ident $try_from:ident $from_truncated:ident
422 $to:ident $try_to:ident $to_truncated:ident
425 impl <T : EnumSetType> EnumSet<T> {$(
426 #[doc = "Returns a `"]
427 #[doc = $underlying_str]
428 #[doc = "` representing the elements of this set.\n\nIf the underlying bitset will \
430 #[doc = $underlying_str]
431 #[doc = "`, this method will panic."]
433 pub fn $to(&self) -> $underlying {
434 self.$try_to().expect("Bitset will not fit into this type.")
437 #[doc = "Tries to return a `"]
438 #[doc = $underlying_str]
439 #[doc = "` representing the elements of this set.\n\nIf the underlying bitset will \
441 #[doc = $underlying_str]
442 #[doc = "`, this method will instead return `None`."]
444 pub fn $try_to(&self) -> Option<$underlying> {
445 EnumSetTypeRepr::$to_fn_opt(&self.__priv_repr)
448 #[doc = "Returns a truncated `"]
449 #[doc = $underlying_str]
450 #[doc = "` representing the elements of this set.\n\nIf the underlying bitset will \
452 #[doc = $underlying_str]
453 #[doc = "`, this method will truncate any bits that don't fit."]
455 pub fn $to_truncated(&self) -> $underlying {
456 EnumSetTypeRepr::$to_fn(&self.__priv_repr)
459 #[doc = "Constructs a bitset from a `"]
460 #[doc = $underlying_str]
461 #[doc = "`.\n\nIf a bit that doesn't correspond to an enum variant is set, this \
464 pub fn $from(bits: $underlying) -> Self {
465 Self::$try_from(bits).expect("Bitset contains invalid variants.")
468 #[doc = "Attempts to constructs a bitset from a `"]
469 #[doc = $underlying_str]
470 #[doc = "`.\n\nIf a bit that doesn't correspond to an enum variant is set, this \
471 method will return `None`."]
473 pub fn $try_from(bits: $underlying) -> Option<Self> {
474 let bits = T::Repr::$from_fn_opt(bits);
475 let mask = Self::all().__priv_repr;
476 bits.and_then(|bits| if bits.and_not(mask).is_empty() {
477 Some(EnumSet { __priv_repr: bits })
483 #[doc = "Constructs a bitset from a `"]
484 #[doc = $underlying_str]
485 #[doc = "`, ignoring invalid variants."]
487 pub fn $from_truncated(bits: $underlying) -> Self {
488 let mask = Self::all().$to_truncated();
489 let bits = <T::Repr as EnumSetTypeRepr>::$from_fn(bits & mask);
490 EnumSet { __priv_repr: bits }
496 for_num!(u8, "u8", from_u8 to_u8 from_u8_opt to_u8_opt,
497 from_u8 try_from_u8 from_u8_truncated as_u8 try_as_u8 as_u8_truncated);
498 for_num!(u16, "u16", from_u16 to_u16 from_u16_opt to_u16_opt,
499 from_u16 try_from_u16 from_u16_truncated as_u16 try_as_u16 as_u16_truncated);
500 for_num!(u32, "u32", from_u32 to_u32 from_u32_opt to_u32_opt,
501 from_u32 try_from_u32 from_u32_truncated as_u32 try_as_u32 as_u32_truncated);
502 for_num!(u64, "u64", from_u64 to_u64 from_u64_opt to_u64_opt,
503 from_u64 try_from_u64 from_u64_truncated as_u64 try_as_u64 as_u64_truncated);
504 for_num!(u128, "u128", from_u128 to_u128 from_u128_opt to_u128_opt,
505 from_u128 try_from_u128 from_u128_truncated as_u128 try_as_u128 as_u128_truncated);
506 for_num!(usize, "usize", from_usize to_usize from_usize_opt to_usize_opt,
507 from_usize try_from_usize from_usize_truncated
508 as_usize try_as_usize as_usize_truncated);
511 impl <T: EnumSetType> Default for EnumSet<T> {
512 /// Returns an empty set.
513 fn default() -> Self {
518 impl <T: EnumSetType> IntoIterator for EnumSet<T> {
520 type IntoIter = EnumSetIter<T>;
522 fn into_iter(self) -> Self::IntoIter {
526 impl <T: EnumSetType> Sum for EnumSet<T> {
527 fn sum<I: Iterator<Item=Self>>(iter: I) -> Self {
528 iter.fold(EnumSet::empty(), |a, v| a | v)
531 impl <'a, T: EnumSetType> Sum<&'a EnumSet<T>> for EnumSet<T> {
532 fn sum<I: Iterator<Item=&'a Self>>(iter: I) -> Self {
533 iter.fold(EnumSet::empty(), |a, v| a | *v)
536 impl <T: EnumSetType> Sum<T> for EnumSet<T> {
537 fn sum<I: Iterator<Item=T>>(iter: I) -> Self {
538 iter.fold(EnumSet::empty(), |a, v| a | v)
541 impl <'a, T: EnumSetType> Sum<&'a T> for EnumSet<T> {
542 fn sum<I: Iterator<Item=&'a T>>(iter: I) -> Self {
543 iter.fold(EnumSet::empty(), |a, v| a | *v)
547 impl <T: EnumSetType, O: Into<EnumSet<T>>> Sub<O> for EnumSet<T> {
550 fn sub(self, other: O) -> Self::Output {
551 self.difference(other.into())
554 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitAnd<O> for EnumSet<T> {
557 fn bitand(self, other: O) -> Self::Output {
558 self.intersection(other.into())
561 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitOr<O> for EnumSet<T> {
564 fn bitor(self, other: O) -> Self::Output {
565 self.union(other.into())
568 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitXor<O> for EnumSet<T> {
571 fn bitxor(self, other: O) -> Self::Output {
572 self.symmetrical_difference(other.into())
576 impl <T: EnumSetType, O: Into<EnumSet<T>>> SubAssign<O> for EnumSet<T> {
578 fn sub_assign(&mut self, rhs: O) {
582 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitAndAssign<O> for EnumSet<T> {
584 fn bitand_assign(&mut self, rhs: O) {
588 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitOrAssign<O> for EnumSet<T> {
590 fn bitor_assign(&mut self, rhs: O) {
594 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitXorAssign<O> for EnumSet<T> {
596 fn bitxor_assign(&mut self, rhs: O) {
601 impl <T: EnumSetType> Not for EnumSet<T> {
604 fn not(self) -> Self::Output {
609 impl <T: EnumSetType> From<T> for EnumSet<T> {
610 fn from(t: T) -> Self {
615 impl <T: EnumSetType> PartialEq<T> for EnumSet<T> {
616 fn eq(&self, other: &T) -> bool {
617 self.__priv_repr == EnumSet::only(*other).__priv_repr
620 impl <T: EnumSetType + Debug> Debug for EnumSet<T> {
621 fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
622 let mut is_first = true;
623 f.write_str("EnumSet(")?;
624 for v in self.iter() {
625 if !is_first { f.write_str(" | ")?; }
634 #[allow(clippy::derive_hash_xor_eq)] // This impl exists to change trait bounds only.
635 impl <T: EnumSetType> Hash for EnumSet<T> {
636 fn hash<H: Hasher>(&self, state: &mut H) {
637 self.__priv_repr.hash(state)
640 impl <T: EnumSetType> PartialOrd for EnumSet<T> {
641 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
642 self.__priv_repr.partial_cmp(&other.__priv_repr)
645 impl <T: EnumSetType> Ord for EnumSet<T> {
646 fn cmp(&self, other: &Self) -> Ordering {
647 self.__priv_repr.cmp(&other.__priv_repr)
651 #[cfg(feature = "serde")]
652 impl <T: EnumSetType> Serialize for EnumSet<T> {
653 fn serialize<S: serde::Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
654 T::serialize(*self, serializer)
658 #[cfg(feature = "serde")]
659 impl <'de, T: EnumSetType> Deserialize<'de> for EnumSet<T> {
660 fn deserialize<D: serde::Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error> {
661 T::deserialize(deserializer)
665 /// The iterator used by [`EnumSet`]s.
666 #[derive(Clone, Debug)]
667 pub struct EnumSetIter<T: EnumSetType> {
670 impl <T: EnumSetType> EnumSetIter<T> {
671 fn new(set: EnumSet<T>) -> EnumSetIter<T> {
675 impl <T: EnumSetType> Iterator for EnumSetIter<T> {
678 fn next(&mut self) -> Option<Self::Item> {
679 if self.set.is_empty() {
682 let bit = self.set.__priv_repr.trailing_zeros();
683 self.set.__priv_repr.remove_bit(bit);
684 unsafe { Some(T::enum_from_u32(bit)) }
687 fn size_hint(&self) -> (usize, Option<usize>) {
688 let left = self.set.len();
693 impl<T: EnumSetType> ExactSizeIterator for EnumSetIter<T> {}
695 impl<T: EnumSetType> Extend<T> for EnumSet<T> {
696 fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
697 iter.into_iter().for_each(|v| { self.insert(v); });
701 impl<T: EnumSetType> FromIterator<T> for EnumSet<T> {
702 fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
703 let mut set = EnumSet::default();
709 impl<T: EnumSetType> Extend<EnumSet<T>> for EnumSet<T> {
710 fn extend<I: IntoIterator<Item = EnumSet<T>>>(&mut self, iter: I) {
711 iter.into_iter().for_each(|v| { self.insert_all(v); });
715 impl<T: EnumSetType> FromIterator<EnumSet<T>> for EnumSet<T> {
716 fn from_iter<I: IntoIterator<Item = EnumSet<T>>>(iter: I) -> Self {
717 let mut set = EnumSet::default();
723 /// Creates a EnumSet literal, which can be used in const contexts.
725 /// The syntax used is `enum_set!(Type::A | Type::B | Type::C)`. Each variant must be of the same
726 /// type, or a error will occur at compile-time.
728 /// This macro accepts trailing `|`s to allow easier use in other macros.
733 /// # use enumset::*;
734 /// # #[derive(EnumSetType, Debug)] enum Enum { A, B, C }
735 /// const CONST_SET: EnumSet<Enum> = enum_set!(Enum::A | Enum::B);
736 /// assert_eq!(CONST_SET, Enum::A | Enum::B);
739 /// This macro is strongly typed. For example, the following will not compile:
742 /// # use enumset::*;
743 /// # #[derive(EnumSetType, Debug)] enum Enum { A, B, C }
744 /// # #[derive(EnumSetType, Debug)] enum Enum2 { A, B, C }
745 /// let type_error = enum_set!(Enum::A | Enum2::B);
748 macro_rules! enum_set {
750 $crate::EnumSet { __priv_repr: 0 }
752 ($value:path $(|)*) => {
754 #[allow(deprecated)] let value = $value.__impl_enumset_internal__const_only();
758 ($value:path | $($rest:path)|* $(|)*) => {
760 #[allow(deprecated)] let value = $value.__impl_enumset_internal__const_only();
761 $(#[allow(deprecated)] let value = $rest.__impl_enumset_internal__const_merge(value);)*