struct AntennaMap {
height: usize,
width: usize,
antenna: HashMap<char, Vec<(usize, usize)>>,
}
Expand description
Represent the puzzle grid by its upper bounds and the position of antenna grouped by frequency
Fields§
§height: usize
§width: usize
§antenna: HashMap<char, Vec<(usize, usize)>>
Trait Implementations§
source§impl Debug for AntennaMap
impl Debug for AntennaMap
source§impl PartialEq for AntennaMap
impl PartialEq for AntennaMap
impl Eq for AntennaMap
impl StructuralPartialEq for AntennaMap
Auto Trait Implementations§
impl Freeze for AntennaMap
impl RefUnwindSafe for AntennaMap
impl Send for AntennaMap
impl Sync for AntennaMap
impl Unpin for AntennaMap
impl UnwindSafe for AntennaMap
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.