4 use std::collections::{HashSet, BTreeSet};
6 #[derive(EnumSetType, Debug)]
9 #[derive(EnumSetType, Debug)]
14 #[derive(EnumSetType, Debug)]
16 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
18 #[derive(Clone, Copy, Debug, EnumSetType, Eq, PartialEq)]
19 #[enumset(no_super_impls)]
20 pub enum SmallEnumExplicitDerive {
21 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
23 #[derive(EnumSetType, Debug)]
25 _00, _01, _02, _03, _04, _05, _06, _07,
26 _10, _11, _12, _13, _14, _15, _16, _17,
27 _20, _21, _22, _23, _24, _25, _26, _27,
28 _30, _31, _32, _33, _34, _35, _36, _37,
29 _40, _41, _42, _43, _44, _45, _46, _47,
30 _50, _51, _52, _53, _54, _55, _56, _57,
31 _60, _61, _62, _63, _64, _65, _66, _67,
32 _70, _71, _72, _73, _74, _75, _76, _77,
33 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
35 #[derive(EnumSetType, Debug)]
37 A, B, C, D, E, F, G, H,
39 #[derive(EnumSetType, Debug)]
41 A, B, C, D, E, F, G, H, _8, _9, _10, _11, _12, _13, _14, _15,
42 _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31,
43 _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47,
44 _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58, _59, _60, _61, _62, _63,
45 _64, _65, _66, _67, _68, _69, _70, _71, _72, _73, _74, _75, _76, _77, _78, _79,
46 _80, _81, _82, _83, _84, _85, _86, _87, _88, _89, _90, _91, _92, _93, _94, _95,
47 _96, _97, _98, _99, _100, _101, _102, _103, _104, _105, _106, _107, _108, _109,
48 _110, _111, _112, _113, _114, _115, _116, _117, _118, _119, _120, _121, _122,
49 _123, _124, _125, _126, _127,
51 #[derive(EnumSetType, Debug)]
53 A = 0xA, B = 20, C = 30, D = 40, E = 50, F = 60, G = 70, H = 80,
57 #[derive(EnumSetType, Debug)]
59 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
62 #[derive(EnumSetType, Debug)]
64 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
67 #[derive(EnumSetType, Debug)]
69 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
72 #[derive(EnumSetType, Debug)]
74 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
77 macro_rules! test_variants {
78 ($enum_name:ident $all_empty_test:ident $($variant:ident,)*) => {
80 fn $all_empty_test() {
81 let all = EnumSet::<$enum_name>::all();
82 let empty = EnumSet::<$enum_name>::empty();
85 assert!(!empty.contains($enum_name::$variant));
86 assert!(all.contains($enum_name::$variant));
91 test_variants! { SmallEnum small_enum_all_empty
92 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
94 test_variants! { SmallEnumExplicitDerive small_enum_explicit_derive_all_empty
95 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
97 test_variants! { LargeEnum large_enum_all_empty
98 _00, _01, _02, _03, _04, _05, _06, _07,
99 _10, _11, _12, _13, _14, _15, _16, _17,
100 _20, _21, _22, _23, _24, _25, _26, _27,
101 _30, _31, _32, _33, _34, _35, _36, _37,
102 _40, _41, _42, _43, _44, _45, _46, _47,
103 _50, _51, _52, _53, _54, _55, _56, _57,
104 _60, _61, _62, _63, _64, _65, _66, _67,
105 _70, _71, _72, _73, _74, _75, _76, _77,
106 A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z,
108 test_variants! { SparseEnum sparse_enum_all_empty
112 macro_rules! test_enum {
113 ($e:ident, $mem_size:expr) => {
114 const CONST_SET: EnumSet<$e> = enum_set!($e::A | $e::C);
115 const CONST_1_SET: EnumSet<$e> = enum_set!($e::A);
116 const EMPTY_SET: EnumSet<$e> = enum_set!();
119 assert_eq!(CONST_SET.len(), 2);
120 assert_eq!(CONST_1_SET.len(), 1);
121 assert!(CONST_SET.contains($e::A));
122 assert!(CONST_SET.contains($e::C));
123 assert!(EMPTY_SET.is_empty());
127 fn basic_add_remove() {
128 let mut set = EnumSet::new();
132 assert_eq!(set, $e::A | $e::B | $e::C);
134 assert_eq!(set, $e::A | $e::C);
136 assert_eq!(set, $e::A | $e::C | $e::D);
137 set.insert_all($e::F | $e::E | $e::G);
138 assert_eq!(set, $e::A | $e::C | $e::D | $e::F | $e::E | $e::G);
139 set.remove_all($e::A | $e::D | $e::G);
140 assert_eq!(set, $e::C | $e::F | $e::E);
141 assert!(!set.is_empty());
143 assert!(set.is_empty());
147 fn already_present_element() {
148 let mut set = EnumSet::new();
149 assert!(set.insert($e::A));
150 assert!(!set.insert($e::A));
152 assert!(set.insert($e::A));
156 fn empty_is_empty() {
157 assert_eq!(EnumSet::<$e>::empty().len(), 0)
162 assert_eq!(EnumSet::<$e>::all().len(), EnumSet::<$e>::variant_count() as usize)
167 let mut set = EnumSet::new();
170 set.extend($e::C | $e::E);
172 let mut set_2 = EnumSet::new();
173 let vec: Vec<_> = set.iter().collect();
175 assert!(!set_2.contains(val));
178 assert_eq!(set, set_2);
180 let mut set_3 = EnumSet::new();
182 assert!(!set_3.contains(val));
185 assert_eq!(set, set_3);
187 let mut set_4 = EnumSet::new();
188 let vec: EnumSet<_> = set.into_iter().map(EnumSet::only).collect();
190 assert!(!set_4.contains(val));
193 assert_eq!(set, set_4);
195 let mut set_5 = EnumSet::new();
196 let vec: EnumSet<_> = set.iter().collect();
198 assert!(!set_5.contains(val));
201 assert_eq!(set, set_5);
205 fn iter_ordering_test() {
206 let set_a = $e::A | $e::B | $e::E;
207 let vec_a: Vec<_> = set_a.iter().collect();
208 assert_eq!(vec_a, &[$e::A, $e::B, $e::E]);
210 let set_a = $e::B | $e::D | $e::G;
211 let vec_a: Vec<_> = set_a.iter().collect();
212 assert_eq!(vec_a, &[$e::B, $e::D, $e::G]);
215 fn check_iter_size_hint(set: EnumSet<$e>) {
216 let count = set.len();
217 let mut itr = set.iter();
218 for idx in 0 .. count {
219 assert_eq!(itr.size_hint(), (count-idx, Some(count-idx)));
220 assert_eq!(itr.len(), count-idx);
221 assert!(itr.next().is_some());
223 assert_eq!(itr.size_hint(), (0, Some(0)));
224 assert_eq!(itr.len(), 0);
227 fn test_iter_size_hint() {
228 check_iter_size_hint(EnumSet::<$e>::all());
229 let mut set = EnumSet::new();
233 check_iter_size_hint(set);
238 let set = $e::A | $e::B | $e::C | $e::E;
239 let set2 = set.iter().filter(|&v| v != $e::B).collect::<EnumSet<_>>();
240 assert_eq!(set2, $e::A | $e::C | $e::E);
244 fn basic_ops_test() {
245 assert_eq!(($e::A | $e::B) | ($e::B | $e::C), $e::A | $e::B | $e::C);
246 assert_eq!(($e::A | $e::B) & ($e::B | $e::C), $e::B);
247 assert_eq!(($e::A | $e::B) ^ ($e::B | $e::C), $e::A | $e::C);
248 assert_eq!(($e::A | $e::B) - ($e::B | $e::C), $e::A);
249 assert_eq!($e::A | !$e::A, EnumSet::<$e>::all());
253 fn mutable_ops_test() {
254 let mut set = $e::A | $e::B;
255 assert_eq!(set, $e::A | $e::B);
256 set |= $e::C | $e::D;
257 assert_eq!(set, $e::A | $e::B | $e::C | $e::D);
259 assert_eq!(set, $e::A | $e::B | $e::D);
260 set ^= $e::B | $e::E;
261 assert_eq!(set, $e::A | $e::D | $e::E);
262 set &= $e::A | $e::E | $e::F;
263 assert_eq!(set, $e::A | $e::E);
267 fn basic_set_status() {
268 assert!(($e::A | $e::B | $e::C).is_disjoint($e::D | $e::E | $e::F));
269 assert!(!($e::A | $e::B | $e::C | $e::D).is_disjoint($e::D | $e::E | $e::F));
270 assert!(($e::A | $e::B).is_subset($e::A | $e::B | $e::C));
271 assert!(!($e::A | $e::D).is_subset($e::A | $e::B | $e::C));
276 assert_eq!(format!("{:?}", $e::A | $e::B | $e::D), "EnumSet(A | B | D)");
281 let value = $e::A | $e::C | $e::D | $e::F | $e::E | $e::G;
282 assert_eq!(EnumSet::from_u128(value.as_u128()), value);
288 if EnumSet::<$e>::variant_count() == 128 {
289 panic!("(test skipped)")
291 EnumSet::<$e>::from_u128(!0);
295 fn match_const_test() {
297 CONST_SET => { /* ok */ }
298 _ => panic!("match fell through?"),
304 const SET_TEST_A: EnumSet<$e> = enum_set!($e::A | $e::B | $e::C);
305 const SET_TEST_B: EnumSet<$e> = enum_set!($e::A | $e::B | $e::D);
306 const SET_TEST_C: EnumSet<$e> = enum_set!($e::A | $e::B | $e::E);
307 const SET_TEST_D: EnumSet<$e> = enum_set!($e::A | $e::B | $e::F);
308 const SET_TEST_E: EnumSet<$e> = enum_set!($e::A | $e::B | $e::G);
309 macro_rules! test_set {
311 assert!(!$set.contains(&SET_TEST_A));
312 assert!(!$set.contains(&SET_TEST_B));
313 assert!(!$set.contains(&SET_TEST_C));
314 assert!(!$set.contains(&SET_TEST_D));
315 assert!(!$set.contains(&SET_TEST_E));
316 $set.insert(SET_TEST_A);
317 $set.insert(SET_TEST_C);
318 assert!($set.contains(&SET_TEST_A));
319 assert!(!$set.contains(&SET_TEST_B));
320 assert!($set.contains(&SET_TEST_C));
321 assert!(!$set.contains(&SET_TEST_D));
322 assert!(!$set.contains(&SET_TEST_E));
323 $set.remove(&SET_TEST_C);
324 $set.remove(&SET_TEST_D);
325 assert!($set.contains(&SET_TEST_A));
326 assert!(!$set.contains(&SET_TEST_B));
327 assert!(!$set.contains(&SET_TEST_C));
328 assert!(!$set.contains(&SET_TEST_D));
329 assert!(!$set.contains(&SET_TEST_E));
330 $set.insert(SET_TEST_A);
331 $set.insert(SET_TEST_D);
332 assert!($set.contains(&SET_TEST_A));
333 assert!(!$set.contains(&SET_TEST_B));
334 assert!(!$set.contains(&SET_TEST_C));
335 assert!($set.contains(&SET_TEST_D));
336 assert!(!$set.contains(&SET_TEST_E));
340 let mut hash_set = HashSet::new();
343 let mut tree_set = BTreeSet::new();
349 let target = $e::A | $e::B | $e::D | $e::E | $e::G | $e::H;
351 let list_a = [$e::A | $e::B, $e::D | $e::E, $e::G | $e::H];
352 let sum_a: EnumSet<$e> = list_a.iter().map(|x| *x).sum();
353 assert_eq!(target, sum_a);
354 let sum_b: EnumSet<$e> = list_a.iter().sum();
355 assert_eq!(target, sum_b);
357 let list_b = [$e::A, $e::B, $e::D, $e::E, $e::G, $e::H];
358 let sum_c: EnumSet<$e> = list_b.iter().map(|x| *x).sum();
359 assert_eq!(target, sum_c);
360 let sum_d: EnumSet<$e> = list_b.iter().sum();
361 assert_eq!(target, sum_d);
366 assert_eq!(::std::mem::size_of::<EnumSet<$e>>(), $mem_size);
371 ($m:ident, $($tt:tt)*) => { mod $m { use super::*; $($tt)*; } }
374 tests!(small_enum, test_enum!(SmallEnum, 4));
375 tests!(small_enum_explicit_derive, test_enum!(SmallEnumExplicitDerive, 4));
376 tests!(large_enum, test_enum!(LargeEnum, 16));
377 tests!(enum8, test_enum!(Enum8, 1));
378 tests!(enum128, test_enum!(Enum128, 16));
379 tests!(sparse_enum, test_enum!(SparseEnum, 16));
380 tests!(repr_enum_u32, test_enum!(ReprEnum, 4));
381 tests!(repr_enum_u64, test_enum!(ReprEnum2, 4));
382 tests!(repr_enum_isize, test_enum!(ReprEnum3, 4));
383 tests!(repr_enum_c, test_enum!(ReprEnum4, 4));
385 #[derive(EnumSetType, Debug)]
386 pub enum ThresholdEnum {
388 U8 = 0, U16 = 8, U32 = 16, U64 = 32, U128 = 64,
390 macro_rules! bits_tests {
392 $mod_name:ident, $threshold_expr:expr, ($($too_big_expr:expr),*), $ty:ty,
393 $to:ident $try_to:ident $to_truncated:ident
394 $from:ident $try_from:ident $from_truncated:ident
398 use crate::ThresholdEnum::*;
403 $threshold_expr | B | C | D,
404 $threshold_expr | A | D,
405 $threshold_expr | B | C,
407 assert_eq!(mask, EnumSet::<ThresholdEnum>::$from(mask.$to()));
408 assert_eq!(mask.$to_truncated(), mask.$to());
409 assert_eq!(Some(mask.$to()), mask.$try_to())
416 let invalid_mask: $ty = 0x80;
417 EnumSet::<ThresholdEnum>::$from(invalid_mask);
421 fn try_from_invalid() {
422 assert!(EnumSet::<ThresholdEnum>::$try_from(0xFF).is_none());
427 fn try_to_overflow() {
428 let set: EnumSet<ThresholdEnum> = $too_big_expr.into();
429 assert!(set.$try_to().is_none());
434 fn truncated_overflow() {
435 let trunc_invalid = EnumSet::<ThresholdEnum>::$from_truncated(0xFE);
436 assert_eq!(A | B | C | D, trunc_invalid);
438 let set: EnumSet<ThresholdEnum> = $too_big_expr | A;
439 assert_eq!(2, set.$to_truncated());
446 bits_tests!(test_u8_bits, U8, (U16), u8,
447 as_u8 try_as_u8 as_u8_truncated from_u8 try_from_u8 from_u8_truncated);
448 bits_tests!(test_u16_bits, U16, (U32), u16,
449 as_u16 try_as_u16 as_u16_truncated from_u16 try_from_u16 from_u16_truncated);
450 bits_tests!(test_u32_bits, U32, (U64), u32,
451 as_u32 try_as_u32 as_u32_truncated from_u32 try_from_u32 from_u32_truncated);
452 bits_tests!(test_u64_bits, U64, (U128), u64,
453 as_u64 try_as_u64 as_u64_truncated from_u64 try_from_u64 from_u64_truncated);
454 bits_tests!(test_u128_bits, U128, (), u128,
455 as_u128 try_as_u128 as_u128_truncated from_u128 try_from_u128 from_u128_truncated);
456 bits_tests!(test_uize_bits, U32, (U128), usize,
457 as_usize try_as_usize as_usize_truncated
458 from_usize try_from_usize from_usize_truncated);