2 #![forbid(missing_docs)]
4 // The safety requirement is "use the procedural derive".
5 #![allow(clippy::missing_safety_doc)]
7 //! A library for defining enums that can be used in compact bit sets. It supports enums up to 128
8 //! variants, and has a macro to use these sets in constants.
10 //! For serde support, enable the `serde` feature.
12 //! # Defining enums for use with EnumSet
14 //! Enums to be used with [`EnumSet`] should be defined using `#[derive(EnumSetType)]`:
18 //! #[derive(EnumSetType, Debug)]
20 //! A, B, C, D, E, F, G,
24 //! For more information on more advanced use cases, see the documentation for
25 //! [`#[derive(EnumSetType)]`](./derive.EnumSetType.html).
27 //! # Working with EnumSets
29 //! EnumSets can be constructed via [`EnumSet::new()`] like a normal set. In addition,
30 //! `#[derive(EnumSetType)]` creates operator overloads that allow you to create EnumSets like so:
34 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
35 //! let new_set = Enum::A | Enum::C | Enum::G;
36 //! assert_eq!(new_set.len(), 3);
39 //! All bitwise operations you would expect to work on bitsets also work on both EnumSets and
40 //! enums with `#[derive(EnumSetType)]`:
43 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
44 //! // Intersection of sets
45 //! assert_eq!((Enum::A | Enum::B) & Enum::C, EnumSet::empty());
46 //! assert_eq!((Enum::A | Enum::B) & Enum::A, Enum::A);
47 //! assert_eq!(Enum::A & Enum::B, EnumSet::empty());
49 //! // Symmetric difference of sets
50 //! assert_eq!((Enum::A | Enum::B) ^ (Enum::B | Enum::C), Enum::A | Enum::C);
51 //! assert_eq!(Enum::A ^ Enum::C, Enum::A | Enum::C);
53 //! // Difference of sets
54 //! assert_eq!((Enum::A | Enum::B | Enum::C) - Enum::B, Enum::A | Enum::C);
56 //! // Complement of sets
57 //! assert_eq!(!(Enum::E | Enum::G), Enum::A | Enum::B | Enum::C | Enum::D | Enum::F);
60 //! The [`enum_set!`] macro allows you to create EnumSets in constant contexts:
64 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
65 //! const CONST_SET: EnumSet<Enum> = enum_set!(Enum::A | Enum::B);
66 //! assert_eq!(CONST_SET, Enum::A | Enum::B);
69 //! Mutable operations on the [`EnumSet`] otherwise similarly to Rust's builtin sets:
73 //! # #[derive(EnumSetType, Debug)] pub enum Enum { A, B, C, D, E, F, G }
74 //! let mut set = EnumSet::new();
75 //! set.insert(Enum::A);
76 //! set.insert_all(Enum::E | Enum::G);
77 //! assert!(set.contains(Enum::A));
78 //! assert!(!set.contains(Enum::B));
79 //! assert_eq!(set, Enum::A | Enum::E | Enum::G);
82 use core::cmp::Ordering;
84 use core::fmt::{Debug, Formatter};
85 use core::hash::{Hash, Hasher};
86 use core::iter::{FromIterator, Sum};
90 /// Everything in this module is internal API and may change at any time.
94 /// A reexport of core to allow our macros to be generic to std vs core.
95 pub use ::core as core_export;
97 /// A reexport of serde so there is no requirement to depend on serde.
98 #[cfg(feature = "serde")] pub use serde2 as serde;
100 /// The actual members of EnumSetType. Put here to avoid polluting global namespaces.
101 pub unsafe trait EnumSetTypePrivate {
102 /// The underlying type used to store the bitset.
103 type Repr: EnumSetTypeRepr;
104 /// A mask of bits that are valid in the bitset.
105 const ALL_BITS: Self::Repr;
107 /// Converts an enum of this type into its bit position.
108 fn enum_into_u32(self) -> u32;
109 /// Converts a bit position into an enum value.
110 unsafe fn enum_from_u32(val: u32) -> Self;
112 /// Serializes the `EnumSet`.
114 /// This and `deserialize` are part of the `EnumSetType` trait so the procedural derive
115 /// can control how `EnumSet` is serialized.
116 #[cfg(feature = "serde")]
117 fn serialize<S: serde::Serializer>(set: EnumSet<Self>, ser: S) -> Result<S::Ok, S::Error>
118 where Self: EnumSetType;
119 /// Deserializes the `EnumSet`.
120 #[cfg(feature = "serde")]
121 fn deserialize<'de, D: serde::Deserializer<'de>>(de: D) -> Result<EnumSet<Self>, D::Error>
122 where Self: EnumSetType;
125 use crate::__internal::EnumSetTypePrivate;
126 #[cfg(feature = "serde")] use crate::__internal::serde;
127 #[cfg(feature = "serde")] use crate::serde::{Serialize, Deserialize};
130 use crate::repr::EnumSetTypeRepr;
132 /// The procedural macro used to derive [`EnumSetType`], and allow enums to be used with
135 /// It may be used with any enum with no data fields, at most 127 variants, and no variant
136 /// discriminators larger than 127.
138 /// # Additional Impls
140 /// In addition to the implementation of `EnumSetType`, this procedural macro creates multiple
141 /// other impls that are either required for the macro to work, or make the procedural macro more
142 /// ergonomic to use.
144 /// A full list of traits implemented as is follows:
146 /// * [`Copy`], [`Clone`], [`Eq`], [`PartialEq`] implementations are created to allow `EnumSet`
147 /// to function properly. These automatic implementations may be suppressed using
148 /// `#[enumset(no_super_impls)]`, but these traits must still be implemented in another way.
149 /// * [`PartialEq`], [`Sub`], [`BitAnd`], [`BitOr`], [`BitXor`], and [`Not`] implementations are
150 /// created to allow the crate to be used more ergonomically in expressions. These automatic
151 /// implementations may be suppressed using `#[enumset(no_ops)]`.
155 /// Options are given with `#[enumset(foo)]` annotations attached to the same enum as the derive.
156 /// Multiple options may be given in the same annotation using the `#[enumset(foo, bar)]` syntax.
158 /// A full list of options is as follows:
160 /// * `#[enumset(no_super_impls)]` prevents the derive from creating implementations required for
161 /// [`EnumSet`] to function. When this attribute is specified, implementations of [`Copy`],
162 /// [`Clone`], [`Eq`], and [`PartialEq`]. This can be useful if you are using a code generator
163 /// that already derives these traits. These impls should function identically to the
164 /// automatically derived versions, or unintentional behavior may be a result.
165 /// * `#[enumset(no_ops)` prevents the derive from implementing any operator traits.
166 /// * `#[enumset(crate_name = "enumset2")]` may be used to change the name of the `enumset` crate
167 /// used in the generated code. When the `std` feature is enabled, enumset parses `Cargo.toml`
168 /// to determine the name of the crate, and this flag is unnecessary.
169 /// * `#[enumset(repr = "u8")]` may be used to specify the in-memory representation of `EnumSet`s
170 /// of this enum type. The effects of this are described in [the `EnumSet` documentation under
171 /// “FFI, Safety and `repr`”][EnumSet#ffi-safety-and-repr]. Allowed types are `u8`, `u16`, `u32`,
172 /// `u64` and `u128`. If this is not used, then the derive macro will choose a type to best fit
173 /// the enum, but there are no guarantees about which type will be chosen.
175 /// When the `serde` feature is used, the following features may also be specified. These options
176 /// may be used (with no effect) when building without the feature enabled:
178 /// * `#[enumset(serialize_repr = "u8")]` may be used to specify the integer type used to serialize
179 /// the underlying bitset.
180 /// * `#[enumset(serialize_as_list)]` may be used to serialize the bitset as a list of enum
181 /// variants instead of an integer. This requires [`Deserialize`] and [`Serialize`] be
182 /// implemented on the enum.
183 /// * `#[enumset(serialize_deny_unknown)]` causes the generated deserializer to return an error
184 /// for unknown bits instead of silently ignoring them.
188 /// Deriving a plain EnumSetType:
191 /// # use enumset::*;
192 /// #[derive(EnumSetType)]
194 /// A, B, C, D, E, F, G,
198 /// Deriving a sparse EnumSetType:
201 /// # use enumset::*;
202 /// #[derive(EnumSetType)]
203 /// pub enum SparseEnum {
204 /// A = 10, B = 20, C = 30, D = 127,
208 /// Deriving an EnumSetType without adding ops:
211 /// # use enumset::*;
212 /// #[derive(EnumSetType)]
213 /// #[enumset(no_ops)]
214 /// pub enum NoOpsEnum {
215 /// A, B, C, D, E, F, G,
218 pub use enumset_derive::EnumSetType;
220 /// The trait used to define enum types that may be used with [`EnumSet`].
222 /// This trait must be impelmented using `#[derive(EnumSetType)]`, is not public API, and its
223 /// internal structure may change at any time with no warning.
225 /// For full documentation on the procedural derive and its options, see
226 /// [`#[derive(EnumSetType)]`](./derive.EnumSetType.html).
227 pub unsafe trait EnumSetType: Copy + Eq + EnumSetTypePrivate { }
229 /// An [`EnumSetType`] for which [`EnumSet`]s have a guaranteed in-memory representation.
231 /// An implementation of this trait is generated by using
232 /// [`#[derive(EnumSetType)]`](./derive.EnumSetType.html) with the annotation
233 /// `#[enumset(repr = "…")]`, where `…` is `u8`, `u16`, `u32`, `u64` or `u128`.
235 /// For any type `T` that implements this trait, the in-memory representation of `EnumSet<T>`
236 /// is guaranteed to be `Repr`. This guarantee is useful for FFI. See [the `EnumSet` documentation
237 /// under “FFI, Safety and `repr`”][EnumSet#ffi-safety-and-repr] for an example.
238 pub unsafe trait EnumSetTypeWithRepr: EnumSetType + EnumSetTypePrivate<Repr = <Self as EnumSetTypeWithRepr>::Repr> {
239 /// The guaranteed representation.
240 type Repr: EnumSetTypeRepr;
243 /// An efficient set type for enums.
245 /// It is implemented using a bitset stored using the smallest integer that can fit all bits
246 /// in the underlying enum. In general, an enum variant with a discriminator of `n` is stored in
247 /// the nth least significant bit (corresponding with a mask of, e.g. `1 << enum as u32`).
249 /// # Numeric representation
251 /// `EnumSet` is internally implemented using integer types, and as such can be easily converted
252 /// from and to numbers.
254 /// Each bit of the underlying integer corresponds to at most one particular enum variant. If the
255 /// corresponding bit for a variant is set, it present in the set. Bits that do not correspond to
256 /// any variant are always unset.
258 /// By default, each enum variant is stored in a bit corresponding to its discriminator. An enum
259 /// variant with a discriminator of `n` is stored in the `n + 1`th least significant bit
260 /// (corresponding to a mask of e.g. `1 << enum as u32`).
264 /// When the `serde` feature is enabled, `EnumSet`s can be serialized and deserialized using
265 /// the `serde` crate. The exact serialization format can be controlled with additional attributes
266 /// on the enum type. These attributes are valid regardless of whether the `serde` feature
269 /// By default, `EnumSet`s serialize by directly writing out the underlying bitset as an integer
270 /// of the smallest type that can fit in the underlying enum. You can add a
271 /// `#[enumset(serialize_repr = "u8")]` attribute to your enum to control the integer type used
272 /// for serialization. This can be important for avoiding unintentional breaking changes when
273 /// `EnumSet`s are serialized with formats like `bincode`.
275 /// By default, unknown bits are ignored and silently removed from the bitset. To override thris
276 /// behavior, you can add a `#[enumset(serialize_deny_unknown)]` attribute. This will cause
277 /// deserialization to fail if an invalid bit is set.
279 /// In addition, the `#[enumset(serialize_as_list)]` attribute causes the `EnumSet` to be
280 /// instead serialized as a list of enum variants. This requires your enum type implement
281 /// [`Serialize`] and [`Deserialize`]. Note that this is a breaking change.
283 /// # FFI, Safety and `repr`
285 /// If an enum type `T` is annotated with [`#[enumset(repr = "R")]`][derive@EnumSetType#options], then
286 /// several things happen:
288 /// * `T` will implement <code>[EnumSetTypeWithRepr]<Repr = R></code> in addition to
290 /// * The `EnumSet` methods with `repr` in their name, such as [`as_repr`][EnumSet::as_repr] and
291 /// [`from_repr`][EnumSet::from_repr], will be available for `EnumSet<T>`.
292 /// * The in-memory representation of `EnumSet<T>` is guaranteed to be `R`.
294 /// That last guarantee makes it sound to send `EnumSet<T>` across an FFI boundary. For example:
297 /// # use enumset::*;
300 /// # // This example “foreign” function is actually written in Rust, but for the sake
301 /// # // of example, we'll pretend it's written in C.
303 /// # extern "C" fn some_foreign_function(set: u32) -> u32 {
309 /// // This function is written in C like:
310 /// // uint32_t some_foreign_function(uint32_t set) { … }
311 /// fn some_foreign_function(set: EnumSet<MyEnum>) -> EnumSet<MyEnum>;
314 /// #[derive(Debug, EnumSetType)]
315 /// #[enumset(repr = "u32")]
316 /// enum MyEnum { A, B, C }
318 /// let set: EnumSet<MyEnum> = enum_set!(MyEnum::A | MyEnum::C);
320 /// let new_set: EnumSet<MyEnum> = unsafe { some_foreign_function(set) };
321 /// assert_eq!(new_set, enum_set!(MyEnum::C));
324 /// When an `EnumSet<T>` is received via FFI, all bits that don't correspond to an enum variant
325 /// of `T` must be set to 0. Behavior is **undefined** if any of these bits are set to 1.
326 #[derive(Copy, Clone, PartialEq, Eq)]
328 pub struct EnumSet<T: EnumSetType> {
330 /// This is public due to the [`enum_set!`] macro.
331 /// This is **NOT** public API and may change at any time.
332 pub __priv_repr: T::Repr
334 impl <T: EnumSetType> EnumSet<T> {
335 // Returns all bits valid for the enum
337 fn all_bits() -> T::Repr {
341 /// Creates an empty `EnumSet`.
343 pub fn new() -> Self {
344 EnumSet { __priv_repr: T::Repr::empty() }
347 /// Returns an `EnumSet` containing a single element.
349 pub fn only(t: T) -> Self {
350 let mut set = Self::new();
355 /// Creates an empty `EnumSet`.
357 /// This is an alias for [`EnumSet::new`].
359 pub fn empty() -> Self {
363 /// Returns an `EnumSet` containing all valid variants of the enum.
365 pub fn all() -> Self {
366 EnumSet { __priv_repr: Self::all_bits() }
369 /// Total number of bits used by this type. Note that the actual amount of space used is
370 /// rounded up to the next highest integer type (`u8`, `u16`, `u32`, `u64`, or `u128`).
372 /// This is the same as [`EnumSet::variant_count`] except in enums with "sparse" variants.
373 /// (e.g. `enum Foo { A = 10, B = 20 }`)
375 pub fn bit_width() -> u32 {
376 T::Repr::WIDTH - T::ALL_BITS.leading_zeros()
379 /// The number of valid variants that this type can contain.
381 /// This is the same as [`EnumSet::bit_width`] except in enums with "sparse" variants.
382 /// (e.g. `enum Foo { A = 10, B = 20 }`)
384 pub fn variant_count() -> u32 {
385 T::ALL_BITS.count_ones()
388 /// Returns the number of elements in this set.
390 pub fn len(&self) -> usize {
391 self.__priv_repr.count_ones() as usize
393 /// Returns `true` if the set contains no elements.
395 pub fn is_empty(&self) -> bool {
396 self.__priv_repr.is_empty()
398 /// Removes all elements from the set.
400 pub fn clear(&mut self) {
401 self.__priv_repr = T::Repr::empty()
404 /// Returns `true` if `self` has no elements in common with `other`. This is equivalent to
405 /// checking for an empty intersection.
407 pub fn is_disjoint(&self, other: Self) -> bool {
408 (*self & other).is_empty()
410 /// Returns `true` if the set is a superset of another, i.e., `self` contains at least all the
411 /// values in `other`.
413 pub fn is_superset(&self, other: Self) -> bool {
414 (*self & other).__priv_repr == other.__priv_repr
416 /// Returns `true` if the set is a subset of another, i.e., `other` contains at least all
417 /// the values in `self`.
419 pub fn is_subset(&self, other: Self) -> bool {
420 other.is_superset(*self)
423 /// Returns a set containing any elements present in either set.
425 pub fn union(&self, other: Self) -> Self {
426 EnumSet { __priv_repr: self.__priv_repr | other.__priv_repr }
428 /// Returns a set containing every element present in both sets.
430 pub fn intersection(&self, other: Self) -> Self {
431 EnumSet { __priv_repr: self.__priv_repr & other.__priv_repr }
433 /// Returns a set containing element present in `self` but not in `other`.
435 pub fn difference(&self, other: Self) -> Self {
436 EnumSet { __priv_repr: self.__priv_repr.and_not(other.__priv_repr) }
438 /// Returns a set containing every element present in either `self` or `other`, but is not
441 pub fn symmetrical_difference(&self, other: Self) -> Self {
442 EnumSet { __priv_repr: self.__priv_repr ^ other.__priv_repr }
444 /// Returns a set containing all enum variants not in this set.
446 pub fn complement(&self) -> Self {
447 EnumSet { __priv_repr: !self.__priv_repr & Self::all_bits() }
450 /// Checks whether this set contains a value.
452 pub fn contains(&self, value: T) -> bool {
453 self.__priv_repr.has_bit(value.enum_into_u32())
456 /// Adds a value to this set.
458 /// If the set did not have this value present, `true` is returned.
460 /// If the set did have this value present, `false` is returned.
462 pub fn insert(&mut self, value: T) -> bool {
463 let contains = !self.contains(value);
464 self.__priv_repr.add_bit(value.enum_into_u32());
467 /// Removes a value from this set. Returns whether the value was present in the set.
469 pub fn remove(&mut self, value: T) -> bool {
470 let contains = self.contains(value);
471 self.__priv_repr.remove_bit(value.enum_into_u32());
475 /// Adds all elements in another set to this one.
477 pub fn insert_all(&mut self, other: Self) {
478 self.__priv_repr = self.__priv_repr | other.__priv_repr
480 /// Removes all values in another set from this one.
482 pub fn remove_all(&mut self, other: Self) {
483 self.__priv_repr = self.__priv_repr.and_not(other.__priv_repr);
486 /// Iterates the contents of the set in order from the least significant bit to the most
489 /// Note that iterator invalidation is impossible as the iterator contains a copy of this type,
490 /// rather than holding a reference to it.
491 pub fn iter(&self) -> EnumSetIter<T> {
492 EnumSetIter::new(*self)
495 /// Returns a `T::Repr` representing the elements of this set.
497 /// Unlike the other `as_*` methods, this method is zero-cost and guaranteed not to fail,
498 /// panic or truncate any bits.
500 /// In order to use this method, the definition of `T` must have the `#[enumset(repr = "…")]`
503 pub fn as_repr(&self) -> <T as EnumSetTypeWithRepr>::Repr
505 T: EnumSetTypeWithRepr,
510 /// Constructs a bitset from a `T::Repr` without checking for invalid bits.
512 /// Unlike the other `from_*` methods, this method is zero-cost and guaranteed not to fail,
513 /// panic or truncate any bits, provided the conditions under “Safety” are upheld.
515 /// In order to use this method, the definition of `T` must have the `#[enumset(repr = "…")]`
520 /// All bits in the provided parameter `bits` that don't correspond to an enum variant of
521 /// `T` must be set to 0. Behavior is **undefined** if any of these bits are set to 1.
523 pub unsafe fn from_repr_unchecked(bits: <T as EnumSetTypeWithRepr>::Repr) -> Self
525 T: EnumSetTypeWithRepr,
527 Self { __priv_repr: bits }
530 /// Constructs a bitset from a `T::Repr`.
532 /// If a bit that doesn't correspond to an enum variant is set, this
533 /// method will panic.
535 /// In order to use this method, the definition of `T` must have the `#[enumset(repr = "…")]`
538 pub fn from_repr(bits: <T as EnumSetTypeWithRepr>::Repr) -> Self
540 T: EnumSetTypeWithRepr,
542 Self::try_from_repr(bits).expect("Bitset contains invalid variants.")
545 /// Attempts to constructs a bitset from a `T::Repr`.
547 /// If a bit that doesn't correspond to an enum variant is set, this
548 /// method will return `None`.
550 /// In order to use this method, the definition of `T` must have the `#[enumset(repr = "…")]`
553 pub fn try_from_repr(bits: <T as EnumSetTypeWithRepr>::Repr) -> Option<Self>
555 T: EnumSetTypeWithRepr,
557 let mask = Self::all().__priv_repr;
558 if bits.and_not(mask).is_empty() {
559 Some(EnumSet { __priv_repr: bits })
565 /// Constructs a bitset from a `T::Repr`, ignoring invalid variants.
567 /// In order to use this method, the definition of `T` must have the `#[enumset(repr = "…")]`
570 pub fn from_repr_truncated(bits: <T as EnumSetTypeWithRepr>::Repr) -> Self
572 T: EnumSetTypeWithRepr,
574 let mask = Self::all().as_repr();
575 let bits = bits & mask;
576 EnumSet { __priv_repr: bits }
580 /// Helper macro for generating conversion functions.
581 macro_rules! conversion_impls {
584 $underlying:ty, $underlying_str:expr,
585 $from_fn:ident $to_fn:ident $from_fn_opt:ident $to_fn_opt:ident,
586 $from:ident $try_from:ident $from_truncated:ident
587 $to:ident $try_to:ident $to_truncated:ident
590 impl <T : EnumSetType> EnumSet<T> {$(
591 #[doc = "Returns a `"]
592 #[doc = $underlying_str]
593 #[doc = "` representing the elements of this set.\n\nIf the underlying bitset will \
595 #[doc = $underlying_str]
596 #[doc = "` or contains bits that do not correspond to an enum variant, this method \
599 pub fn $to(&self) -> $underlying {
600 self.$try_to().expect("Bitset will not fit into this type.")
603 #[doc = "Tries to return a `"]
604 #[doc = $underlying_str]
605 #[doc = "` representing the elements of this set.\n\nIf the underlying bitset will \
607 #[doc = $underlying_str]
608 #[doc = "` or contains bits that do not correspond to an enum variant, this method \
609 will instead return `None`."]
611 pub fn $try_to(&self) -> Option<$underlying> {
612 EnumSetTypeRepr::$to_fn_opt(&self.__priv_repr)
615 #[doc = "Returns a truncated `"]
616 #[doc = $underlying_str]
617 #[doc = "` representing the elements of this set.\n\nIf the underlying bitset will \
619 #[doc = $underlying_str]
620 #[doc = "`, this method will truncate any bits that don't fit or do not correspond \
621 to an enum variant."]
623 pub fn $to_truncated(&self) -> $underlying {
624 EnumSetTypeRepr::$to_fn(&self.__priv_repr)
627 #[doc = "Constructs a bitset from a `"]
628 #[doc = $underlying_str]
629 #[doc = "`.\n\nIf a bit that doesn't correspond to an enum variant is set, this \
632 pub fn $from(bits: $underlying) -> Self {
633 Self::$try_from(bits).expect("Bitset contains invalid variants.")
636 #[doc = "Attempts to constructs a bitset from a `"]
637 #[doc = $underlying_str]
638 #[doc = "`.\n\nIf a bit that doesn't correspond to an enum variant is set, this \
639 method will return `None`."]
641 pub fn $try_from(bits: $underlying) -> Option<Self> {
642 let bits = T::Repr::$from_fn_opt(bits);
643 let mask = Self::all().__priv_repr;
644 bits.and_then(|bits| if bits.and_not(mask).is_empty() {
645 Some(EnumSet { __priv_repr: bits })
651 #[doc = "Constructs a bitset from a `"]
652 #[doc = $underlying_str]
653 #[doc = "`, ignoring invalid variants."]
655 pub fn $from_truncated(bits: $underlying) -> Self {
656 let mask = Self::all().$to_truncated();
657 let bits = <T::Repr as EnumSetTypeRepr>::$from_fn(bits & mask);
658 EnumSet { __priv_repr: bits }
664 for_num!(u8, "u8", from_u8 to_u8 from_u8_opt to_u8_opt,
665 from_u8 try_from_u8 from_u8_truncated as_u8 try_as_u8 as_u8_truncated);
666 for_num!(u16, "u16", from_u16 to_u16 from_u16_opt to_u16_opt,
667 from_u16 try_from_u16 from_u16_truncated as_u16 try_as_u16 as_u16_truncated);
668 for_num!(u32, "u32", from_u32 to_u32 from_u32_opt to_u32_opt,
669 from_u32 try_from_u32 from_u32_truncated as_u32 try_as_u32 as_u32_truncated);
670 for_num!(u64, "u64", from_u64 to_u64 from_u64_opt to_u64_opt,
671 from_u64 try_from_u64 from_u64_truncated as_u64 try_as_u64 as_u64_truncated);
672 for_num!(u128, "u128", from_u128 to_u128 from_u128_opt to_u128_opt,
673 from_u128 try_from_u128 from_u128_truncated as_u128 try_as_u128 as_u128_truncated);
674 for_num!(usize, "usize", from_usize to_usize from_usize_opt to_usize_opt,
675 from_usize try_from_usize from_usize_truncated
676 as_usize try_as_usize as_usize_truncated);
679 impl <T: EnumSetType> Default for EnumSet<T> {
680 /// Returns an empty set.
681 fn default() -> Self {
686 impl <T: EnumSetType> IntoIterator for EnumSet<T> {
688 type IntoIter = EnumSetIter<T>;
690 fn into_iter(self) -> Self::IntoIter {
694 impl <T: EnumSetType> Sum for EnumSet<T> {
695 fn sum<I: Iterator<Item=Self>>(iter: I) -> Self {
696 iter.fold(EnumSet::empty(), |a, v| a | v)
699 impl <'a, T: EnumSetType> Sum<&'a EnumSet<T>> for EnumSet<T> {
700 fn sum<I: Iterator<Item=&'a Self>>(iter: I) -> Self {
701 iter.fold(EnumSet::empty(), |a, v| a | *v)
704 impl <T: EnumSetType> Sum<T> for EnumSet<T> {
705 fn sum<I: Iterator<Item=T>>(iter: I) -> Self {
706 iter.fold(EnumSet::empty(), |a, v| a | v)
709 impl <'a, T: EnumSetType> Sum<&'a T> for EnumSet<T> {
710 fn sum<I: Iterator<Item=&'a T>>(iter: I) -> Self {
711 iter.fold(EnumSet::empty(), |a, v| a | *v)
715 impl <T: EnumSetType, O: Into<EnumSet<T>>> Sub<O> for EnumSet<T> {
718 fn sub(self, other: O) -> Self::Output {
719 self.difference(other.into())
722 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitAnd<O> for EnumSet<T> {
725 fn bitand(self, other: O) -> Self::Output {
726 self.intersection(other.into())
729 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitOr<O> for EnumSet<T> {
732 fn bitor(self, other: O) -> Self::Output {
733 self.union(other.into())
736 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitXor<O> for EnumSet<T> {
739 fn bitxor(self, other: O) -> Self::Output {
740 self.symmetrical_difference(other.into())
744 impl <T: EnumSetType, O: Into<EnumSet<T>>> SubAssign<O> for EnumSet<T> {
746 fn sub_assign(&mut self, rhs: O) {
750 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitAndAssign<O> for EnumSet<T> {
752 fn bitand_assign(&mut self, rhs: O) {
756 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitOrAssign<O> for EnumSet<T> {
758 fn bitor_assign(&mut self, rhs: O) {
762 impl <T: EnumSetType, O: Into<EnumSet<T>>> BitXorAssign<O> for EnumSet<T> {
764 fn bitxor_assign(&mut self, rhs: O) {
769 impl <T: EnumSetType> Not for EnumSet<T> {
772 fn not(self) -> Self::Output {
777 impl <T: EnumSetType> From<T> for EnumSet<T> {
778 fn from(t: T) -> Self {
783 impl <T: EnumSetType> PartialEq<T> for EnumSet<T> {
784 fn eq(&self, other: &T) -> bool {
785 self.__priv_repr == EnumSet::only(*other).__priv_repr
788 impl <T: EnumSetType + Debug> Debug for EnumSet<T> {
789 fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
790 let mut is_first = true;
791 f.write_str("EnumSet(")?;
792 for v in self.iter() {
793 if !is_first { f.write_str(" | ")?; }
802 #[allow(clippy::derive_hash_xor_eq)] // This impl exists to change trait bounds only.
803 impl <T: EnumSetType> Hash for EnumSet<T> {
804 fn hash<H: Hasher>(&self, state: &mut H) {
805 self.__priv_repr.hash(state)
808 impl <T: EnumSetType> PartialOrd for EnumSet<T> {
809 fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
810 self.__priv_repr.partial_cmp(&other.__priv_repr)
813 impl <T: EnumSetType> Ord for EnumSet<T> {
814 fn cmp(&self, other: &Self) -> Ordering {
815 self.__priv_repr.cmp(&other.__priv_repr)
819 #[cfg(feature = "serde")]
820 impl <T: EnumSetType> Serialize for EnumSet<T> {
821 fn serialize<S: serde::Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
822 T::serialize(*self, serializer)
826 #[cfg(feature = "serde")]
827 impl <'de, T: EnumSetType> Deserialize<'de> for EnumSet<T> {
828 fn deserialize<D: serde::Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error> {
829 T::deserialize(deserializer)
833 /// The iterator used by [`EnumSet`]s.
834 #[derive(Clone, Debug)]
835 pub struct EnumSetIter<T: EnumSetType> {
838 impl <T: EnumSetType> EnumSetIter<T> {
839 fn new(set: EnumSet<T>) -> EnumSetIter<T> {
844 impl <T: EnumSetType> Iterator for EnumSetIter<T> {
847 fn next(&mut self) -> Option<Self::Item> {
848 if self.set.is_empty() {
851 let bit = self.set.__priv_repr.trailing_zeros();
852 self.set.__priv_repr.remove_bit(bit);
853 unsafe { Some(T::enum_from_u32(bit)) }
856 fn size_hint(&self) -> (usize, Option<usize>) {
857 let left = self.set.len();
862 impl <T: EnumSetType> DoubleEndedIterator for EnumSetIter<T> {
863 fn next_back(&mut self) -> Option<Self::Item> {
864 if self.set.is_empty() {
867 let bit = T::Repr::WIDTH - 1 - self.set.__priv_repr.leading_zeros();
868 self.set.__priv_repr.remove_bit(bit);
869 unsafe { Some(T::enum_from_u32(bit)) }
874 impl<T: EnumSetType> ExactSizeIterator for EnumSetIter<T> {}
876 impl<T: EnumSetType> Extend<T> for EnumSet<T> {
877 fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
878 iter.into_iter().for_each(|v| { self.insert(v); });
882 impl<T: EnumSetType> FromIterator<T> for EnumSet<T> {
883 fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
884 let mut set = EnumSet::default();
890 impl<T: EnumSetType> Extend<EnumSet<T>> for EnumSet<T> {
891 fn extend<I: IntoIterator<Item = EnumSet<T>>>(&mut self, iter: I) {
892 iter.into_iter().for_each(|v| { self.insert_all(v); });
896 impl<T: EnumSetType> FromIterator<EnumSet<T>> for EnumSet<T> {
897 fn from_iter<I: IntoIterator<Item = EnumSet<T>>>(iter: I) -> Self {
898 let mut set = EnumSet::default();
904 /// Creates a EnumSet literal, which can be used in const contexts.
906 /// The syntax used is `enum_set!(Type::A | Type::B | Type::C)`. Each variant must be of the same
907 /// type, or a error will occur at compile-time.
909 /// This macro accepts trailing `|`s to allow easier use in other macros.
914 /// # use enumset::*;
915 /// # #[derive(EnumSetType, Debug)] enum Enum { A, B, C }
916 /// const CONST_SET: EnumSet<Enum> = enum_set!(Enum::A | Enum::B);
917 /// assert_eq!(CONST_SET, Enum::A | Enum::B);
920 /// This macro is strongly typed. For example, the following will not compile:
923 /// # use enumset::*;
924 /// # #[derive(EnumSetType, Debug)] enum Enum { A, B, C }
925 /// # #[derive(EnumSetType, Debug)] enum Enum2 { A, B, C }
926 /// let type_error = enum_set!(Enum::A | Enum2::B);
929 macro_rules! enum_set {
931 $crate::EnumSet { __priv_repr: 0 }
933 ($value:path $(|)*) => {
935 #[allow(deprecated)] let value = $value.__impl_enumset_internal__const_only();
939 ($value:path | $($rest:path)|* $(|)*) => {
941 #[allow(deprecated)] let value = $value.__impl_enumset_internal__const_only();
942 $(#[allow(deprecated)] let value = $rest.__impl_enumset_internal__const_merge(value);)*