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
use RoaringTreemap; use RoaringBitmap; use super::util; use std::ops::Range; use std::collections::BTreeMap; use std::collections::btree_map::Entry; impl RoaringTreemap { /// Creates an empty `RoaringTreemap`. /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// let mut rb = RoaringTreemap::new(); /// ``` pub fn new() -> RoaringTreemap { RoaringTreemap { map: BTreeMap::new() } } /// Adds a value to the set. Returns `true` if the value was not already present in the set. /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// assert_eq!(rb.insert(3), true); /// assert_eq!(rb.insert(3), false); /// assert_eq!(rb.contains(3), true); /// ``` pub fn insert(&mut self, value: u64) -> bool { let (hi, lo) = util::split(value); self.map.entry(hi).or_insert_with(RoaringBitmap::new).insert(lo) } /// Removes a value from the set. Returns `true` if the value was present in the set. /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// rb.insert(3); /// assert_eq!(rb.remove(3), true); /// assert_eq!(rb.remove(3), false); /// assert_eq!(rb.contains(3), false); /// ``` pub fn remove(&mut self, value: u64) -> bool { let (hi, lo) = util::split(value); match self.map.entry(hi) { Entry::Vacant(_) => false, Entry::Occupied(mut ent) => { if ent.get_mut().remove(lo) { if ent.get().is_empty() { ent.remove(); } true } else { false } }, } } /// Removes a range of values from the set specific as [start..end). /// Returns the number of removed values. /// /// Note that due to the exclusive end you can't remove the item at the /// last index (u64::MAX) using this function! /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// rb.insert(2); /// rb.insert(3); /// assert_eq!(rb.remove_range(2..4), 2); /// ``` pub fn remove_range(&mut self, range: Range<u64>) -> u64 { if range.start == range.end { return 0; } let mut keys_to_remove = Vec::new(); let mut removed = 0; // inclusive bounds for start and end let (start_hi, start_lo) = util::split(range.start); let (end_hi, end_lo) = util::split(range.end - 1); for (&key, rb) in &mut self.map { if key >= start_hi && key <= end_hi { let a = if key == start_hi { u64::from(start_lo) } else { 0 }; let b = if key == end_hi { u64::from(end_lo) + 1 // make it exclusive } else { u64::from(u32::max_value()) + 1 }; if a == 0 && b == u64::from(u32::max_value()) + 1 { removed += rb.len(); keys_to_remove.push(key); } else { removed += rb.remove_range(a..b); if rb.is_empty() { keys_to_remove.push(key); } } } } for key in keys_to_remove { self.map.remove(&key); } removed } /// Returns `true` if this set contains the specified integer. /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// rb.insert(1); /// assert_eq!(rb.contains(0), false); /// assert_eq!(rb.contains(1), true); /// assert_eq!(rb.contains(100), false); /// ``` pub fn contains(&self, value: u64) -> bool { let (hi, lo) = util::split(value); match self.map.get(&hi) { None => false, Some(r) => r.contains(lo), } } /// Clears all integers in this set. /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// rb.insert(1); /// assert_eq!(rb.contains(1), true); /// rb.clear(); /// assert_eq!(rb.contains(1), false); /// ``` pub fn clear(&mut self) { self.map.clear(); } /// Returns `true` if there are no integers in this set. /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// assert_eq!(rb.is_empty(), true); /// /// rb.insert(3); /// assert_eq!(rb.is_empty(), false); /// ``` pub fn is_empty(&self) -> bool { self.map .values() .all(RoaringBitmap::is_empty) } /// Returns the number of distinct integers added to the set. /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// assert_eq!(rb.len(), 0); /// /// rb.insert(3); /// assert_eq!(rb.len(), 1); /// /// rb.insert(3); /// rb.insert(4); /// assert_eq!(rb.len(), 2); /// ``` pub fn len(&self) -> u64 { self.map .values() .map(RoaringBitmap::len) .sum() } /// Returns the minimum value in the set (if the set is non-empty). /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// assert_eq!(rb.min(), None); /// /// rb.insert(3); /// rb.insert(4); /// assert_eq!(rb.min(), Some(3)); /// ``` pub fn min(&self) -> Option<u64> { self.map .iter() .find(|&(_, rb)| rb.min().is_some()) .map(|(k, rb)| util::join(*k, rb.min().unwrap())) } /// Returns the maximum value in the set (if the set is non-empty). /// /// # Examples /// /// ```rust /// use roaring::RoaringTreemap; /// /// let mut rb = RoaringTreemap::new(); /// assert_eq!(rb.max(), None); /// /// rb.insert(3); /// rb.insert(4); /// assert_eq!(rb.max(), Some(4)); /// ``` pub fn max(&self) -> Option<u64> { self.map .iter() .rev() .find(|&(_, rb)| rb.max().is_some()) .map(|(k, rb)| util::join(*k, rb.max().unwrap())) } } impl Default for RoaringTreemap { fn default() -> RoaringTreemap { RoaringTreemap::new() } }