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
//! # rotate-enum crate //! //! This crate provides a simple macro that implements `prev()` and `next()` methods to an enum. //! //! ## Motivation //! //! Sometimes you define an enum like this //! //! ``` //! enum Direction { //! Up, //! Left, //! Down, //! Right, //! } //! ``` //! //! and you want to rotate them in some logic, //! //! ``` //! # use rotate_enum::RotateEnum; //! # #[derive(RotateEnum, PartialEq, Clone, Copy)] //! # enum Direction { //! # Up, //! # Left, //! # Down, //! # Right, //! # } //! let up = Direction::Up; //! let left = Direction::Left; //! let down = Direction::Down; //! let right = Direction::Right; //! //! assert!(up.next() == left); //! assert!(left.next() == down); //! assert!(down.next() == right); //! assert!(right.next() == up); //! //! assert!(up.prev() == right); //! assert!(left.prev() == up); //! assert!(down.prev() == left); //! assert!(right.prev() == down); //! ``` //! //! You can of course implement these methods manually, but it's repetitive and error prone. //! Don't you think it should be automated? //! This crate provides a `RotateEnum` derive macro to just do this. //! //! ## Shifting //! //! This crate also provides [`ShiftEnum`], which will exhaust at the end of the enum list, //! rather than rotating. //! //! ``` //! # use rotate_enum::ShiftEnum; //! # #[derive(ShiftEnum, PartialEq, Clone, Copy)] //! # enum Direction { //! # Up, //! # Left, //! # Down, //! # Right, //! # } //! let up = Direction::Up; //! let left = Direction::Left; //! let down = Direction::Down; //! let right = Direction::Right; //! //! assert!(up.next() == Some(left)); //! assert!(left.next() == Some(down)); //! assert!(down.next() == Some(right)); //! assert!(right.next() == None); //! //! assert!(up.prev() == None); //! assert!(left.prev() == Some(up)); //! assert!(down.prev() == Some(left)); //! assert!(right.prev() == Some(down)); //! ``` //! //! ## Usage //! //! ```rust //! use rotate_enum::RotateEnum; //! //! #[derive(RotateEnum)] //! enum Direction { //! Up, //! Left, //! Down, //! Right, //! } //! ``` //! use core::panic; use proc_macro::TokenStream; use quote::quote; use syn::{parse_macro_input, Data, DeriveInput}; /// This derive macro will implement `next()` and `prev()` methods that rotates /// the variant to the annotated enum. /// /// For code examples, see [module-level docs](index.html). /// /// # Requirements /// /// * It must be applied to an enum. Structs are not supported or won't make sense. /// * Enums with any associated data are not supported. /// /// # Generated methods /// /// For example, this macro will implement functions like below for /// `enum Direction`. /// /// ``` /// # enum Direction { /// # Up, /// # Left, /// # Down, /// # Right, /// # } /// impl Direction { /// fn next(self) -> Self { /// match self { /// Self::Up => Self::Left, /// Self::Left => Self::Down, /// Self::Down => Self::Right, /// Self::Right => Self::Up, /// } /// } /// /// fn prev(self) -> Self { /// match self { /// Self::Up => Self::Right, /// Self::Left => Self::Up, /// Self::Down => Self::Left, /// Self::Right => Self::Down, /// } /// } /// } /// ``` #[proc_macro_derive(RotateEnum)] pub fn rotate_enum(input: TokenStream) -> TokenStream { let input = parse_macro_input!(input as DeriveInput); let name = input.ident; let variants = if let Data::Enum(data) = &input.data { data.variants.iter().collect::<Vec<_>>() } else { panic!("derive(RotateEnum) must be applied to an enum"); }; let nexts = variants .iter() .skip(1) .chain(variants.get(0)) .map(|v| (&v.ident)) .collect::<Vec<_>>(); let tokens = quote! { impl #name{ pub fn next(self) -> Self { match self { #(Self::#variants => Self::#nexts, )* } } pub fn prev(self) -> Self { match self { #(Self::#nexts => Self::#variants, )* } } } }; tokens.into() } /// This derive macro will implement `next()` and `prev()` methods that shifts /// the variant to the annotated enum. /// /// * `next()` will return `Some(Variant)` where `Variant` is next one in the enum, or `None` if it was the first variant of the enum. /// * `prev()` will return `Some(Variant)` where `Variant` is previous one in the enum, or `None` if it was the last variant of the enum. /// /// For code examples, see [module-level docs](index.html). /// /// # Requirements /// /// * It must be applied to an enum. Structs are not supported or won't make sense. /// * Enums with any associated data are not supported. /// /// # Generated methods /// /// For example, this macro will implement functions like below for /// `enum Direction`. /// /// ``` /// # enum Direction { /// # Up, /// # Left, /// # Down, /// # Right, /// # } /// impl Direction { /// fn next(self) -> Option<Self> { /// match self { /// Self::Up => Some(Self::Left), /// Self::Left => Some(Self::Down), /// Self::Down => Some(Self::Right), /// Self::Right => None, /// } /// } /// /// fn prev(self) -> Option<Self> { /// match self { /// Self::Up => None, /// Self::Left => Some(Self::Up), /// Self::Down => Some(Self::Left), /// Self::Right => Some(Self::Down), /// } /// } /// } /// ``` #[proc_macro_derive(ShiftEnum)] pub fn shift_enum(input: TokenStream) -> TokenStream { let input = parse_macro_input!(input as DeriveInput); let name = input.ident; let variants = if let Data::Enum(data) = &input.data { data.variants.iter().collect::<Vec<_>>() } else { panic!("derive(RotateEnum) must be applied to an enum"); }; let nexts = variants .iter() .skip(1) .map(|v| quote! { Some(Self::#v) }) .chain(Some(quote! { None })) .collect::<Vec<_>>(); let none_quote = Some(quote! { None }); let prevs = variants .iter() .take(variants.len() - 1) .map(|v| quote! { Some(Self::#v) }) .collect::<Vec<_>>(); let prevs = none_quote.iter().chain(&prevs).collect::<Vec<_>>(); let tokens = quote! { impl #name{ pub fn next(self) -> Option<Self> { match self { #(Self::#variants => #nexts, )* } } pub fn prev(self) -> Option<Self> { match self { #(Self::#variants => #prevs, )* } } } }; tokens.into() }