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
//! Tools for [`Iterator`]s over maps ([`HashMap`], [`BTreeMap`], etc),
//! or any two-element tuple (like `(K, V)`).
//!
//! Just import [`IterMap`] to get extra methods on iterators. See that trait
//! for more documentation and examples.
//!
//! [`HashMap`]: std::collections::HashMap
//! [`BTreeMap`]: std::collections::BTreeMap
mod filter;
mod iter;
mod map_keys;
mod map_values;
#[cfg(any(test, doctest))]
mod tests;
use core::iter::Iterator;
#[doc(hidden)]
pub use self::filter::{FilterKeys, FilterValues};
#[doc(hidden)]
pub use self::{map_keys::MapKeys, map_values::MapValues};
/// Adds additional methods for `Iterator`s over maps (e.g., `HashMap`,
/// `BTreeMap`, etc.) and other two-element tuples (like `(K, V)`).
pub trait IterMap<I, K, V>: Sized {
/// Maps map keys, or the first element of a two-element tuple (like
/// `(K, V)`), leaving the other element intact and untouched.
///
/// # Examples
/// ```
/// # use std::collections::HashMap;
/// #
/// use itermap::IterMap;
///
/// let map = HashMap::<&str, &str>::from([
/// ("a", "A"),
/// ("b", "B"),
/// ]);
///
/// let map: HashMap<String, &str> = map
/// .into_iter()
/// .map_keys(String::from)
/// .collect();
/// ```
///
/// Any iterator of two-element tuples will work.
/// ```
/// use itermap::IterMap;
///
/// let items: Vec<(&str, &str)> = vec![
/// ("a", "A"),
/// ("b", "B"),
/// ];
///
/// let items: Vec<(String, &str)> = items
/// .into_iter()
/// .map_keys(String::from)
/// .collect();
/// ```
fn map_keys<Fk, L>(self, f: Fk) -> MapKeys<I, Fk>
where
Fk: FnMut(K) -> L;
/// Maps map values (or the second element of a two-element tuple like
/// `(K, V)`), leaving the other element intact and untouched.
///
/// # Examples
///
/// ```
/// # use std::collections::HashMap;
/// #
/// use itermap::IterMap;
///
/// let map = HashMap::<&str, &str>::from([
/// ("a", "A"),
/// ("b", "B"),
/// ]);
///
/// let map: HashMap<&str, String> = map
/// .into_iter()
/// .map_values(String::from)
/// .collect();
/// ```
///
/// Any iterator of two-element tuples will work.
/// ```
/// use itermap::IterMap;
///
/// let items: Vec<(&str, &str)> = vec![
/// ("a", "A"),
/// ("b", "B"),
/// ];
///
/// let items: Vec<(&str, String)> = items
/// .into_iter()
/// .map_values(String::from)
/// .collect();
/// ```
fn map_values<Fv, W>(self, f: Fv) -> MapValues<I, Fv>
where
Fv: FnMut(V) -> W;
/// Allows filtering based on map keys (or the first element of a
/// two-element tuple like `(K, V)`).
///
/// # Example
///
/// ```
/// # use std::collections::HashMap;
/// #
/// use itermap::IterMap;
/// # use pretty_assertions::assert_eq;
///
/// let mut map = HashMap::from([
/// ("a", "A"),
/// ("b", "B"),
/// ("c", "C"),
/// ("d", "D"),
/// ("e", "E"),
/// ]);
///
/// let filtered: HashMap<_, _> = map
/// .clone()
/// .into_iter()
/// .filter_keys(|v| v != &"c")
/// .collect();
///
/// map.remove("c");
///
/// assert_eq!(map, filtered);
/// ```
///
/// Any iterator of two-element tuples will work.
/// ```
/// use itermap::IterMap;
/// # use pretty_assertions::assert_eq;
///
/// let mut items = vec![
/// ("a", "A"),
/// ("b", "B"),
/// ("c", "C"),
/// ("d", "D"),
/// ("e", "E"),
/// ];
///
/// let filtered: Vec<(_, _)> = items
/// .clone()
/// .into_iter()
/// .filter_keys(|v| v != &"c")
/// .collect();
///
/// items.remove(2);
///
/// assert_eq!(items, filtered);
/// ```
fn filter_keys<Fk>(self, key_op: Fk) -> FilterKeys<I, Fk>
where
Fk: FnMut(&K) -> bool;
/// Allows filtering based on map values (or the second element of a
/// two-element tuple like `(K, V)`).
///
/// # Example
///
/// ```
/// # use std::collections::HashMap;
/// #
/// use itermap::IterMap;
/// # use pretty_assertions::assert_eq;
///
/// let mut map = HashMap::from([
/// ("a", "A"),
/// ("b", "B"),
/// ("c", "C"),
/// ("d", "D"),
/// ("e", "E"),
/// ]);
///
/// let filtered: HashMap<_, _> = map
/// .clone()
/// .into_iter()
/// .filter_values(|v| v != &"C")
/// .collect();
///
/// map.remove("c");
///
/// assert_eq!(map, filtered);
/// ```
///
/// Any iterator of two-element tuples will work.
/// ```
/// use itermap::IterMap;
/// # use pretty_assertions::assert_eq;
///
/// let mut items = vec![
/// ("a", "A"),
/// ("b", "B"),
/// ("c", "C"),
/// ("d", "D"),
/// ("e", "E"),
/// ];
///
/// let filtered: Vec<(_, _)> = items
/// .clone()
/// .into_iter()
/// .filter_values(|v| v != &"C")
/// .collect();
///
/// items.remove(2);
///
/// assert_eq!(items, filtered);
/// ```
fn filter_values<Fv>(self, value_op: Fv) -> FilterValues<I, Fv>
where
Fv: FnMut(&V) -> bool;
}
impl<I, K, V> IterMap<I, K, V> for I
where
I: Iterator<Item = (K, V)>,
{
fn map_keys<Fk, L>(self, key_op: Fk) -> MapKeys<I, Fk>
where
Fk: FnMut(K) -> L,
{
MapKeys::new(self, key_op)
}
fn map_values<Fv, W>(self, value_op: Fv) -> MapValues<I, Fv>
where
Fv: FnMut(V) -> W,
{
MapValues::new(self, value_op)
}
fn filter_keys<Fk>(self, key_op: Fk) -> FilterKeys<I, Fk>
where
Fk: FnMut(&K) -> bool,
{
FilterKeys::new(self, key_op)
}
fn filter_values<Fv>(self, value_op: Fv) -> FilterValues<I, Fv>
where
Fv: FnMut(&V) -> bool,
{
FilterValues::new(self, value_op)
}
}