| License | BSD-3-Clause |
|---|---|
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
Swarm.Game.Scenario.Topography.Structure.Recognition.Prep
Description
Synopsis
- mkEntityLookup :: (Hashable a, Eq a) => [StructureWithGrid b a] -> HashMap a (AutomatonInfo a (AtomicKeySymbol a) (StructureSearcher b a))
Documentation
mkEntityLookup :: (Hashable a, Eq a) => [StructureWithGrid b a] -> HashMap a (AutomatonInfo a (AtomicKeySymbol a) (StructureSearcher b a)) Source #
Make the first-phase lookup map, keyed by Entity,
along with automatons whose key symbols are "Maybe Entity".
Each automaton in this first layer will attempt to match the underlying world row against all rows within all structures (so long as they contain the keyed entity).