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
use std::collections::HashMap;
use once_cell::sync::Lazy;
use proc_macro::{Group, Ident, Literal, TokenStream, TokenTree};
use regex::Regex;
static RE: Lazy<Regex> = Lazy::new(|| Regex::new(r"_int(?:_([^_ \s]+))?_").unwrap());
fn map_tokens(token: TokenTree, counters: &mut HashMap<String, usize>) -> TokenTree {
match token {
TokenTree::Ident(v) => {
let mut ident = v.to_string();
let mut has_changed = false;
#[allow(clippy::redundant_clone)]
for captures in RE.captures_iter(&ident.clone()) {
let id = match captures.get(1) {
Some(id) => id.as_str().to_string(),
_ => "!@".to_string(),
};
let counter = match counters.get_mut(&id) {
Some(v) => v,
_ => {
counters.insert(id.clone(), 0);
counters.get_mut(&id).unwrap()
}
};
let full_match = &captures[0];
if full_match == ident {
let to_ret = TokenTree::Literal(Literal::usize_unsuffixed(*counter));
*counter += 1;
return to_ret;
} else {
has_changed = true;
ident = ident.replace(&captures[0], &counter.to_string());
*counter += 1;
}
}
if has_changed {
return TokenTree::Ident(Ident::new(&ident, v.span()));
}
TokenTree::Ident(v)
}
TokenTree::Group(v) => TokenTree::Group(Group::new(
v.delimiter(),
v.stream()
.into_iter()
.map(|token| map_tokens(token, counters))
.collect(),
)),
v => v,
}
}
/// Count without wrapping (panic if counter exceeds usize).
/// Every instance of `_int_` and `_int_countername_` will be replaced with the counter value and then the counter will be increased.
///
/// # Examples
///
/// ## Ident to literal
/// ```rust
/// use count_macro::count;
///
/// let a = count!(vec![_int_, _int_, _int_]);
/// assert_eq!(a, vec![0, 1, 2]);
///
/// ```
///
/// ## Ident to ident
/// ```rust
/// use count_macro::count;
///
/// count! {
/// let a_int_ = "Hello";
/// let a_int_ = "World";
/// }
///
/// assert_eq!(a0, "Hello");
/// assert_eq!(a1, "World");
///
/// ```
///
/// ## In macro
/// ```rust
/// use count_macro::count;
///
/// macro_rules! my_macro {
/// ($($v:expr),*) => {
/// count!{
/// $(
/// let _ = $v; // Ignoring $v
///
/// println!("{}", _int_);
/// )*
/// }
/// };
/// }
///
/// my_macro!('@', '@', '@', '@'); // Will print from 0 to 3
///
/// ```
/// ## Multiple counters
/// ```rust
/// use count_macro::count;
///
/// // With two different counters
/// // _int_ does not increment _int_name_
/// count! {
/// let a_int_ = _int_name_;
/// let a_int_ = _int_name_;
/// let a_int_ = _int_name_;
/// }
///
/// assert_eq!(a0, 0);
/// assert_eq!(a1, 1);
/// assert_eq!(a2, 2);
///
/// ```
#[proc_macro]
pub fn count(item: TokenStream) -> TokenStream {
let mut counters = HashMap::new();
item.into_iter()
.map(|token| map_tokens(token, &mut counters))
.collect()
}
fn wrapping_map_tokens(token: TokenTree, counters: &mut HashMap<String, usize>) -> TokenTree {
match token {
TokenTree::Ident(v) => {
let mut ident = v.to_string();
let mut has_changed = false;
#[allow(clippy::redundant_clone)]
for captures in RE.captures_iter(&ident.clone()) {
let id = match captures.get(1) {
Some(id) => id.as_str().to_string(),
_ => "!@".to_string(),
};
let counter = match counters.get_mut(&id) {
Some(v) => v,
_ => {
counters.insert(id.clone(), 0);
counters.get_mut(&id).unwrap()
}
};
let full_match = &captures[0];
if full_match == ident {
let to_ret = TokenTree::Literal(Literal::usize_unsuffixed(*counter));
*counter = counter.wrapping_add(1);
return to_ret;
} else {
has_changed = true;
ident = ident.replace(&captures[0], &counter.to_string());
*counter = counter.wrapping_add(1);
}
}
if has_changed {
return TokenTree::Ident(Ident::new(&ident, v.span()));
}
TokenTree::Ident(v)
}
TokenTree::Group(v) => TokenTree::Group(Group::new(
v.delimiter(),
v.stream()
.into_iter()
.map(|token| map_tokens(token, counters))
.collect(),
)),
v => v,
}
}
/// Count with wrapping (wraps to 0 if counter exceeds usize).
/// Every instance of `_int_` and `_int_countername_` will be replaced with the counter value and then the counter will be increased.
///
/// # Examples
///
/// ## Ident to literal
/// ```rust
/// use count_macro::wrapping_count;
///
/// let a = wrapping_count!(vec![_int_, _int_, _int_]);
/// assert_eq!(a, vec![0, 1, 2]);
///
/// ```
///
/// ## Ident to ident
/// ```rust
/// use count_macro::wrapping_count;
///
/// wrapping_count! {
/// let a_int_ = "Hello";
/// let a_int_ = "World";
/// }
///
/// assert_eq!(a0, "Hello");
/// assert_eq!(a1, "World");
///
/// ```
///
/// ## In macro
/// ```rust
/// use count_macro::wrapping_count;
///
/// macro_rules! my_macro {
/// ($($v:expr),*) => {
/// wrapping_count!{
/// $(
/// let _ = $v; // Ignoring $v
///
/// println!("{}", _int_);
/// )*
/// }
/// };
/// }
///
/// my_macro!('@', '@', '@', '@'); // Will print from 0 to 3
///
/// ```
///
/// ## Multiple counters
/// ```rust
/// use count_macro::wrapping_count;
///
/// // With two different counters
/// // _int_ does not increment _int_name_
/// wrapping_count! {
/// let a_int_ = _int_name_;
/// let a_int_ = _int_name_;
/// let a_int_ = _int_name_;
/// }
///
/// assert_eq!(a0, 0);
/// assert_eq!(a1, 1);
/// assert_eq!(a2, 2);
///
/// ```
#[proc_macro]
pub fn wrapping_count(item: TokenStream) -> TokenStream {
let mut counters = HashMap::new();
item.into_iter()
.map(|token| wrapping_map_tokens(token, &mut counters))
.collect()
}