Iterate over all the keys up to the maximum in this set. This will yield intermediate keys on the way up to the max key, even if they are not contained within the set. ``` use cranelift_entity::{entity_impl, EntityRef, EntitySet}; #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)] struct Entity(u32); entity_impl!(Entity); let mut set = EntitySet::new(); set.insert(Entity::new(2)); let mut key
(&self)
| 125 | /// assert!(keys.next().is_none()); |
| 126 | /// ``` |
| 127 | pub fn keys(&self) -> Keys<K> { |
| 128 | Keys::with_len(self.bitset.max().map_or(0, |x| x + 1)) |
| 129 | } |
| 130 | |
| 131 | /// Iterate over the elements of this set. |
| 132 | /// |