Struct AutoPatternConstraint 

pub struct AutoPatternConstraint<'a, 'b, Pos, Ter, Pat> {
    pub position_constraints: &'a HashConstraintMap<Pos, Ter, Pat>,
    pub pattern_constraints: &'b HashMap<Ter, Vec<Pat>, BuildHasherDefault<FxHasher>>,
}

A pair of an HashConstraintMap and an AutoTerrainPatternMap.

• The constraint map tells the auto-tiler which cells have undecided patterns, which cells have fixed patterns, the terrain type of the undecided cells, and the order in which to fill them.
• The terrain map tells the auto-tiler which patterns are available for each terrain type, and the order in which the patterns should be tried.

See AutoTileContext for a way to construct an AutoTerrainPatternMap.

Fields

position_constraints: &'a HashConstraintMap<Pos, Ter, Pat>

The position constraints define the specific problem for the autotiler to solve by giving it the constraints for each cell, including the cells whose tiles are already determined and the cells that are yet to be determined.

pattern_constraints: &'b HashMap<Ter, Vec<Pat>, BuildHasherDefault<FxHasher>>

The pattern contraints define the patterns that are available for each terrain. This will usually remain fixed across many calls to the autotiler, and so it may be reused so long as the set of tiles does not change. See AutoTileContext for a way to construct an AutoTerrainPatternMap.

Trait Implementations

impl<'b, Pos, Ter, Pat> AutoConstrain for AutoPatternConstraint<'_, 'b, Pos, Ter, Pat>

where Pos: OffsetPosition, Ter: Hash + Eq, Pat: TilePattern<Offset = <Pos as OffsetPosition>::Offset, Diagonal = <Pos as OffsetPosition>::Diagonal> + Clone + Debug, <Pos as OffsetPosition>::Offset: Debug,

type Position = Pos

The type of a tile’s position.

type Terrain = ListTerrain<'b, Pat>

The type of tile terrains. Each terrain represents a set of possible patterns.

fn all_positions( &self, ) -> impl Iterator<Item = &<AutoPatternConstraint<'_, 'b, Pos, Ter, Pat> as AutoConstrain>::Position>

An iterator for all the positions that the autotiler should consider when choosing tiles. The autotiler will select tiles for position in the order they are delivered by this iterator.

fn constraint_at( &self, position: &Pos, ) -> TileConstraint<ListTerrain<'b, Pat>, Pat>

The contraint for the given position. This allows the autotiler to examine adjacent cells when deciding if a particular pattern is a valid choice for the cell under consideration.

fn is_legal( &self, from: &Pat, offset: &<Pos as OffsetPosition>::Offset, to: &Pat, ) -> bool

True if the given patterns may be placed adjacent to each other with the given offset. For example, if offset is up, then return true if to may be legally placed above from.

fn is_legal_diagonal( &self, from: &Pat, diagonal: &<Pos as OffsetPosition>::Diagonal, to: &Pat, ) -> bool

True if the given patterns may be placed adjacent to each other with the given offset. For example, if offset is up, then return true if to may be legally placed above from.