1 2 3 4 5 6 7 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 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
//! An enum mapping type.
//!
//! It is implemented using an array type, so using it is as fast as using Rust
//! arrays.
//!
//! # Examples
//!
//! ```
//! use enum_map::{enum_map, Enum, EnumMap};
//!
//! #[derive(Debug, Enum)]
//! enum Example {
//! A,
//! B,
//! C,
//! }
//!
//! let mut map = enum_map! {
//! Example::A => 1,
//! Example::B => 2,
//! Example::C => 3,
//! };
//! map[Example::C] = 4;
//!
//! assert_eq!(map[Example::A], 1);
//!
//! for (key, &value) in &map {
//! println!("{:?} has {} as value.", key, value);
//! }
//! ```
#![no_std]
#![deny(missing_docs)]
#[cfg(feature = "arbitrary")]
mod arbitrary;
mod enum_map_impls;
mod internal;
mod iter;
#[cfg(feature = "serde")]
mod serde;
#[doc(hidden)]
pub use core::mem::{ManuallyDrop, MaybeUninit};
#[doc(hidden)]
pub use core::ptr;
pub use enum_map_derive::Enum;
use internal::Array;
pub use internal::Enum;
pub use iter::{IntoIter, Iter, IterMut, Values, ValuesMut};
// Type invariant: arr[..len] must be initialized
#[doc(hidden)]
#[non_exhaustive]
pub struct ArrayVec<K, V>
where
K: Enum<V>,
{
pub array: MaybeUninit<K::Array>,
pub length: usize,
}
impl<K, V> ArrayVec<K, V>
where
K: Enum<V>,
{
#[doc(hidden)]
// This function is marked as unsafe to prevent user from causing unsafety
// by using undocumented ArrayVec.
pub unsafe fn new() -> Self {
ArrayVec {
array: MaybeUninit::uninit(),
length: 0,
}
}
#[doc(hidden)]
pub fn storage_length(&self) -> usize {
K::Array::LENGTH
}
#[doc(hidden)]
pub fn get_key(&self) -> K {
K::from_usize(self.length)
}
#[doc(hidden)]
// Unsafe as it can write out of bounds.
pub unsafe fn push(&mut self, value: V) {
self.array
.as_mut_ptr()
.cast::<V>()
.add(self.length)
.write(value);
self.length += 1;
}
}
impl<K, V> Drop for ArrayVec<K, V>
where
K: Enum<V>,
{
fn drop(&mut self) {
// This is safe as arr[..len] is initialized due to
// __ArrayVecInner's type invariant.
unsafe {
ptr::slice_from_raw_parts_mut(self.array.as_mut_ptr() as *mut V, self.length)
.drop_in_place();
}
}
}
#[doc(hidden)]
pub union TypeEqualizer<K, V>
where
K: Enum<V>,
{
pub init: (),
pub enum_map: ManuallyDrop<EnumMap<K, V>>,
pub array_vec: ManuallyDrop<ArrayVec<K, V>>,
}
/// Enum map constructor.
///
/// This macro allows to create a new enum map in a type safe way. It takes
/// a list of `,` separated pairs separated by `=>`. Left side is `|`
/// separated list of enum keys, or `_` to match all unmatched enum keys,
/// while right side is a value.
///
/// The iteration order when using this macro is not guaranteed to be
/// consistent. Future releases of this crate may change it, and this is not
/// considered to be a breaking change.
///
/// # Examples
///
/// ```
/// # extern crate enum_map;
/// use enum_map::{enum_map, Enum};
///
/// #[derive(Enum)]
/// enum Example {
/// A,
/// B,
/// C,
/// D,
/// }
///
/// let enum_map = enum_map! {
/// Example::A | Example::B => 1,
/// Example::C => 2,
/// _ => 3,
/// };
/// assert_eq!(enum_map[Example::A], 1);
/// assert_eq!(enum_map[Example::B], 1);
/// assert_eq!(enum_map[Example::C], 2);
/// assert_eq!(enum_map[Example::D], 3);
/// ```
#[macro_export]
macro_rules! enum_map {
{$($t:tt)*} => {{
let mut type_equalizer = $crate::TypeEqualizer { init: () };
if false {
// Safe because this code is unreachable
unsafe {
type_equalizer.enum_map = $crate::MaybeUninit::assume_init($crate::MaybeUninit::uninit());
$crate::ManuallyDrop::into_inner(type_equalizer.enum_map)
}
} else {
// Safe because we are going to follow ArrayVec invariant
type_equalizer.array_vec = $crate::ManuallyDrop::new(unsafe { $crate::ArrayVec::new() });
// Safe because we just wrote to array_vec field.
let mut vec = $crate::ManuallyDrop::into_inner(unsafe { type_equalizer.array_vec });
for _ in 0..$crate::ArrayVec::storage_length(&vec) {
let _please_do_not_use_continue_without_label;
let value;
struct __PleaseDoNotUseBreakWithoutLabel;
#[allow(unreachable_code)]
loop {
_please_do_not_use_continue_without_label = ();
value = match $crate::ArrayVec::get_key(&vec) { $($t)* };
break __PleaseDoNotUseBreakWithoutLabel;
};
// Safe because this method will be called at most storage_length times.
unsafe { $crate::ArrayVec::push(&mut vec, value); }
}
vec.length = 0;
// Safe because the array was fully initialized.
$crate::EnumMap::from_array(unsafe { $crate::ptr::read($crate::MaybeUninit::as_ptr(&vec.array)) })
}
}};
}
/// An enum mapping.
///
/// This internally uses an array which stores a value for each possible
/// enum value. To work, it requires implementation of internal (private,
/// although public due to macro limitations) trait which allows extracting
/// information about an enum, which can be automatically generated using
/// `#[derive(Enum)]` macro.
///
/// Additionally, `bool` and `u8` automatically derives from `Enum`. While
/// `u8` is not technically an enum, it's convenient to consider it like one.
/// In particular, [reverse-complement in benchmark game] could be using `u8`
/// as an enum.
///
/// # Examples
///
/// ```
/// # extern crate enum_map;
/// use enum_map::{enum_map, Enum, EnumMap};
///
/// #[derive(Enum)]
/// enum Example {
/// A,
/// B,
/// C,
/// }
///
/// let mut map = EnumMap::default();
/// // new initializes map with default values
/// assert_eq!(map[Example::A], 0);
/// map[Example::A] = 3;
/// assert_eq!(map[Example::A], 3);
/// ```
///
/// [reverse-complement in benchmark game]:
/// http://benchmarksgame.alioth.debian.org/u64q/program.php?test=revcomp&lang=rust&id=2
pub struct EnumMap<K: Enum<V>, V> {
array: K::Array,
}
impl<K: Enum<V>, V: Default> EnumMap<K, V> {
/// Clear enum map with default values.
///
/// # Examples
///
/// ```
/// # extern crate enum_map;
/// use enum_map::{Enum, EnumMap};
///
/// #[derive(Enum)]
/// enum Example {
/// A,
/// B,
/// }
///
/// let mut enum_map = EnumMap::<_, String>::default();
/// enum_map[Example::B] = "foo".into();
/// enum_map.clear();
/// assert_eq!(enum_map[Example::A], "");
/// assert_eq!(enum_map[Example::B], "");
/// ```
#[inline]
pub fn clear(&mut self) {
for v in self.as_mut_slice() {
*v = V::default();
}
}
}
#[allow(clippy::len_without_is_empty)]
impl<K: Enum<V>, V> EnumMap<K, V> {
/// Creates an enum map from array.
#[inline]
pub fn from_array(array: K::Array) -> EnumMap<K, V> {
EnumMap { array }
}
/// Returns an iterator over enum map.
#[inline]
pub fn iter(&self) -> Iter<K, V> {
self.into_iter()
}
/// Returns a mutable iterator over enum map.
#[inline]
pub fn iter_mut(&mut self) -> IterMut<K, V> {
self.into_iter()
}
/// Returns number of elements in enum map.
#[inline]
pub fn len(&self) -> usize {
self.as_slice().len()
}
/// Swaps two indexes.
///
/// # Examples
///
/// ```
/// # extern crate enum_map;
/// use enum_map::enum_map;
///
/// let mut map = enum_map! { false => 0, true => 1 };
/// map.swap(false, true);
/// assert_eq!(map[false], 1);
/// assert_eq!(map[true], 0);
/// ```
#[inline]
pub fn swap(&mut self, a: K, b: K) {
self.as_mut_slice().swap(a.into_usize(), b.into_usize())
}
/// Converts an enum map to a slice representing values.
#[inline]
pub fn as_slice(&self) -> &[V] {
self.array.slice()
}
/// Converts a mutable enum map to a mutable slice representing values.
#[inline]
pub fn as_mut_slice(&mut self) -> &mut [V] {
self.array.slice_mut()
}
}