pub fn iter_radius_1(&self) -> NeighbourIter<CellT> {
        // Note: We might use ::ndarray::ArrayBase::windows() if it wasn't for the wrapping borders.
        NeighbourIter {
            tile: self,
            q: 0,
            r: 0,
        }
    }
/// Iterate over all cells (in axial-storage order), yielding the cell and its 6 neighbours
Iterate over all cells (in axial-storage order), yielding the cell and its 6 neighbours
Iterate over all cells ( in axial - storage order ) yielding the cell and its 6 neighbours
pub fn iter_radius_1(&self) -> NeighbourIter<CellT> {
        // Note: We might use ::ndarray::ArrayBase::windows() if it wasn't for the wrapping borders.
        NeighbourIter {
            tile: self,
            q: 0,
            r: 0,
        }
    }
pub fn iter_radius_1 ( & self ) -> NeighbourIter < CellT > { // Note: We might use ::ndarray::ArrayBase::windows() if it wasn't for the wrapping borders. NeighbourIter { tile : self , q : 0 , r : 0 , } }
Iterate over all cells (in axial-storage order), yielding the cell and its 6 neighbours
Iterate over all cells ( in axial - storage order ) yielding the cell and its 6 neighbours
&self
&self