#![allow(dead_code)] use enumset::*; use std::collections::{HashSet, BTreeSet}; #[derive(EnumSetType, Debug)] pub enum EmptyEnum { } #[derive(EnumSetType, Debug)] pub enum Enum1 { A, } #[derive(EnumSetType, Debug)] pub enum SmallEnum { 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, } #[derive(EnumSetType, Debug)] pub enum LargeEnum { _00, _01, _02, _03, _04, _05, _06, _07, _10, _11, _12, _13, _14, _15, _16, _17, _20, _21, _22, _23, _24, _25, _26, _27, _30, _31, _32, _33, _34, _35, _36, _37, _40, _41, _42, _43, _44, _45, _46, _47, _50, _51, _52, _53, _54, _55, _56, _57, _60, _61, _62, _63, _64, _65, _66, _67, _70, _71, _72, _73, _74, _75, _76, _77, 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, } #[derive(EnumSetType, Debug)] pub enum Enum8 { A, B, C, D, E, F, G, H, } #[derive(EnumSetType, Debug)] pub enum Enum128 { A, B, C, D, E, F, G, H, _8, _9, _10, _11, _12, _13, _14, _15, _16, _17, _18, _19, _20, _21, _22, _23, _24, _25, _26, _27, _28, _29, _30, _31, _32, _33, _34, _35, _36, _37, _38, _39, _40, _41, _42, _43, _44, _45, _46, _47, _48, _49, _50, _51, _52, _53, _54, _55, _56, _57, _58, _59, _60, _61, _62, _63, _64, _65, _66, _67, _68, _69, _70, _71, _72, _73, _74, _75, _76, _77, _78, _79, _80, _81, _82, _83, _84, _85, _86, _87, _88, _89, _90, _91, _92, _93, _94, _95, _96, _97, _98, _99, _100, _101, _102, _103, _104, _105, _106, _107, _108, _109, _110, _111, _112, _113, _114, _115, _116, _117, _118, _119, _120, _121, _122, _123, _124, _125, _126, _127, } #[derive(EnumSetType, Debug)] pub enum SparseEnum { A = 0xA, B = 20, C = 30, D = 40, E = 50, F = 60, G = 70, H = 80, } #[repr(u32)] #[derive(EnumSetType, Debug)] pub enum ReprEnum { 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, } #[repr(u64)] #[derive(EnumSetType, Debug)] pub enum ReprEnum2 { 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, } #[repr(isize)] #[derive(EnumSetType, Debug)] pub enum ReprEnum3 { 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, } #[repr(C)] #[derive(EnumSetType, Debug)] pub enum ReprEnum4 { 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, } macro_rules! test_variants { ($enum_name:ident $all_empty_test:ident $($variant:ident,)*) => { #[test] fn $all_empty_test() { let all = EnumSet::<$enum_name>::all(); let empty = EnumSet::<$enum_name>::empty(); $( assert!(!empty.contains($enum_name::$variant)); assert!(all.contains($enum_name::$variant)); )* } } } test_variants! { SmallEnum small_enum_all_empty 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, } test_variants! { LargeEnum large_enum_all_empty _00, _01, _02, _03, _04, _05, _06, _07, _10, _11, _12, _13, _14, _15, _16, _17, _20, _21, _22, _23, _24, _25, _26, _27, _30, _31, _32, _33, _34, _35, _36, _37, _40, _41, _42, _43, _44, _45, _46, _47, _50, _51, _52, _53, _54, _55, _56, _57, _60, _61, _62, _63, _64, _65, _66, _67, _70, _71, _72, _73, _74, _75, _76, _77, 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, } test_variants! { SparseEnum sparse_enum_all_empty A, B, C, D, E, F, G, } macro_rules! test_enum { ($e:ident, $mem_size:expr) => { const CONST_SET: EnumSet<$e> = enum_set!($e::A | $e::C); const EMPTY_SET: EnumSet<$e> = enum_set!(); #[test] fn const_set() { assert_eq!(CONST_SET.len(), 2); assert!(CONST_SET.contains($e::A)); assert!(CONST_SET.contains($e::C)); assert!(EMPTY_SET.is_empty()); } #[test] fn basic_add_remove() { let mut set = EnumSet::new(); set.insert($e::A); set.insert($e::B); set.insert($e::C); assert_eq!(set, $e::A | $e::B | $e::C); set.remove($e::B); assert_eq!(set, $e::A | $e::C); set.insert($e::D); assert_eq!(set, $e::A | $e::C | $e::D); set.insert_all($e::F | $e::E | $e::G); assert_eq!(set, $e::A | $e::C | $e::D | $e::F | $e::E | $e::G); set.remove_all($e::A | $e::D | $e::G); assert_eq!(set, $e::C | $e::F | $e::E); assert!(!set.is_empty()); set.clear(); assert!(set.is_empty()); } #[test] fn already_present_element() { let mut set = EnumSet::new(); assert!(set.insert($e::A)); assert!(!set.insert($e::A)); set.remove($e::A); assert!(set.insert($e::A)); } #[test] fn empty_is_empty() { assert_eq!(EnumSet::<$e>::empty().len(), 0) } #[test] fn all_len() { assert_eq!(EnumSet::<$e>::all().len(), EnumSet::<$e>::variant_count() as usize) } #[test] fn iter_test() { let mut set = EnumSet::new(); set.insert($e::A); set.insert($e::B); set.extend($e::C | $e::E); let mut set_2 = EnumSet::new(); let vec: Vec<_> = set.iter().collect(); for val in vec { assert!(!set_2.contains(val)); set_2.insert(val); } assert_eq!(set, set_2); let mut set_3 = EnumSet::new(); for val in set { assert!(!set_3.contains(val)); set_3.insert(val); } assert_eq!(set, set_3); let mut set_4 = EnumSet::new(); let vec: EnumSet<_> = set.into_iter().map(EnumSet::only).collect(); for val in vec { assert!(!set_4.contains(val)); set_4.insert(val); } assert_eq!(set, set_4); let mut set_5 = EnumSet::new(); let vec: EnumSet<_> = set.iter().collect(); for val in vec { assert!(!set_5.contains(val)); set_5.insert(val); } assert_eq!(set, set_5); } fn check_iter_size_hint(set: EnumSet<$e>) { let count = set.len(); let mut itr = set.iter(); for idx in 0 .. count { assert_eq!(itr.size_hint(), (count-idx, Some(count-idx))); assert_eq!(itr.len(), count-idx); assert!(itr.next().is_some()); } assert_eq!(itr.size_hint(), (0, Some(0))); assert_eq!(itr.len(), 0); } #[test] fn test_iter_size_hint() { check_iter_size_hint(EnumSet::<$e>::all()); let mut set = EnumSet::new(); set.insert($e::A); set.insert($e::C); set.insert($e::E); check_iter_size_hint(set); } #[test] fn iter_ops_test() { let set = $e::A | $e::B | $e::C | $e::E; let set2 = set.iter().filter(|&v| v != $e::B).collect::>(); assert_eq!(set2, $e::A | $e::C | $e::E); } #[test] fn basic_ops_test() { assert_eq!(($e::A | $e::B) | ($e::B | $e::C), $e::A | $e::B | $e::C); assert_eq!(($e::A | $e::B) & ($e::B | $e::C), $e::B); assert_eq!(($e::A | $e::B) ^ ($e::B | $e::C), $e::A | $e::C); assert_eq!(($e::A | $e::B) - ($e::B | $e::C), $e::A); assert_eq!($e::A | !$e::A, EnumSet::<$e>::all()); } #[test] fn mutable_ops_test() { let mut set = $e::A | $e::B; assert_eq!(set, $e::A | $e::B); set |= $e::C | $e::D; assert_eq!(set, $e::A | $e::B | $e::C | $e::D); set -= $e::C; assert_eq!(set, $e::A | $e::B | $e::D); set ^= $e::B | $e::E; assert_eq!(set, $e::A | $e::D | $e::E); set &= $e::A | $e::E | $e::F; assert_eq!(set, $e::A | $e::E); } #[test] fn basic_set_status() { assert!(($e::A | $e::B | $e::C).is_disjoint($e::D | $e::E | $e::F)); assert!(!($e::A | $e::B | $e::C | $e::D).is_disjoint($e::D | $e::E | $e::F)); assert!(($e::A | $e::B).is_subset($e::A | $e::B | $e::C)); assert!(!($e::A | $e::D).is_subset($e::A | $e::B | $e::C)); } #[test] fn debug_impl() { assert_eq!(format!("{:?}", $e::A | $e::B | $e::D), "EnumSet(A | B | D)"); } #[test] fn to_from_bits() { let value = $e::A | $e::C | $e::D | $e::F | $e::E | $e::G; assert_eq!(EnumSet::from_u128(value.as_u128()), value); } #[test] #[should_panic] fn too_many_bits() { if EnumSet::<$e>::variant_count() == 128 { panic!("(test skipped)") } EnumSet::<$e>::from_u128(!0); } #[test] fn match_const_test() { match CONST_SET { CONST_SET => { /* ok */ } _ => panic!("match fell through?"), } } #[test] fn set_test() { const SET_TEST_A: EnumSet<$e> = enum_set!($e::A | $e::B | $e::C); const SET_TEST_B: EnumSet<$e> = enum_set!($e::A | $e::B | $e::D); const SET_TEST_C: EnumSet<$e> = enum_set!($e::A | $e::B | $e::E); const SET_TEST_D: EnumSet<$e> = enum_set!($e::A | $e::B | $e::F); const SET_TEST_E: EnumSet<$e> = enum_set!($e::A | $e::B | $e::G); macro_rules! test_set { ($set:ident) => {{ assert!(!$set.contains(&SET_TEST_A)); assert!(!$set.contains(&SET_TEST_B)); assert!(!$set.contains(&SET_TEST_C)); assert!(!$set.contains(&SET_TEST_D)); assert!(!$set.contains(&SET_TEST_E)); $set.insert(SET_TEST_A); $set.insert(SET_TEST_C); assert!($set.contains(&SET_TEST_A)); assert!(!$set.contains(&SET_TEST_B)); assert!($set.contains(&SET_TEST_C)); assert!(!$set.contains(&SET_TEST_D)); assert!(!$set.contains(&SET_TEST_E)); $set.remove(&SET_TEST_C); $set.remove(&SET_TEST_D); assert!($set.contains(&SET_TEST_A)); assert!(!$set.contains(&SET_TEST_B)); assert!(!$set.contains(&SET_TEST_C)); assert!(!$set.contains(&SET_TEST_D)); assert!(!$set.contains(&SET_TEST_E)); $set.insert(SET_TEST_A); $set.insert(SET_TEST_D); assert!($set.contains(&SET_TEST_A)); assert!(!$set.contains(&SET_TEST_B)); assert!(!$set.contains(&SET_TEST_C)); assert!($set.contains(&SET_TEST_D)); assert!(!$set.contains(&SET_TEST_E)); }} } let mut hash_set = HashSet::new(); test_set!(hash_set); let mut tree_set = BTreeSet::new(); test_set!(tree_set); } #[test] fn check_size() { assert_eq!(::std::mem::size_of::>(), $mem_size); } } } macro_rules! tests { ($m:ident, $($tt:tt)*) => { mod $m { use super::*; $($tt)*; } } } tests!(small_enum, test_enum!(SmallEnum, 4)); tests!(large_enum, test_enum!(LargeEnum, 16)); tests!(enum8, test_enum!(Enum8, 1)); tests!(enum128, test_enum!(Enum128, 16)); tests!(sparse_enum, test_enum!(SparseEnum, 16)); tests!(repr_enum_u32, test_enum!(ReprEnum, 4)); tests!(repr_enum_u64, test_enum!(ReprEnum2, 4)); tests!(repr_enum_isize, test_enum!(ReprEnum3, 4)); tests!(repr_enum_c, test_enum!(ReprEnum4, 4)); #[derive(EnumSetType, Debug)] pub enum ThresholdEnum { A = 1, B, C, D, U8 = 0, U16 = 8, U32 = 16, U64 = 32, U128 = 64, } macro_rules! bits_tests { ( $mod_name:ident, $threshold_expr:expr, ($($too_big_expr:expr),*), $ty:ty, $to:ident $try_to:ident $to_truncated:ident $from:ident $try_from:ident $from_truncated:ident ) => { mod $mod_name { use super::*; use crate::ThresholdEnum::*; #[test] fn to_from_basic() { for &mask in &[ $threshold_expr | B | C | D, $threshold_expr | A | D, $threshold_expr | B | C, ] { assert_eq!(mask, EnumSet::::$from(mask.$to())); assert_eq!(mask.$to_truncated(), mask.$to()); assert_eq!(Some(mask.$to()), mask.$try_to()) } } #[test] #[should_panic] fn from_invalid() { let invalid_mask: $ty = 0x80; EnumSet::::$from(invalid_mask); } #[test] fn try_from_invalid() { assert!(EnumSet::::$try_from(0xFF).is_none()); } $( #[test] fn try_to_overflow() { let set: EnumSet = $too_big_expr.into(); assert!(set.$try_to().is_none()); } )* #[test] fn truncated_overflow() { let trunc_invalid = EnumSet::::$from_truncated(0xFE); assert_eq!(A | B | C | D, trunc_invalid); $( let set: EnumSet = $too_big_expr | A; assert_eq!(2, set.$to_truncated()); )* } } } } bits_tests!(test_u8_bits, U8, (U16), u8, as_u8 try_as_u8 as_u8_truncated from_u8 try_from_u8 from_u8_truncated); bits_tests!(test_u16_bits, U16, (U32), u16, as_u16 try_as_u16 as_u16_truncated from_u16 try_from_u16 from_u16_truncated); bits_tests!(test_u32_bits, U32, (U64), u32, as_u32 try_as_u32 as_u32_truncated from_u32 try_from_u32 from_u32_truncated); bits_tests!(test_u64_bits, U64, (U128), u64, as_u64 try_as_u64 as_u64_truncated from_u64 try_from_u64 from_u64_truncated); bits_tests!(test_u128_bits, U128, (), u128, as_u128 try_as_u128 as_u128_truncated from_u128 try_from_u128 from_u128_truncated); bits_tests!(test_uize_bits, U32, (U128), usize, as_usize try_as_usize as_usize_truncated from_usize try_from_usize from_usize_truncated);