Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
A map from Data.Intmap.Strict. O(n log(n)) for most operations.
Yields safe runtime representations of type Maybe c
.
A store that keeps membership, but holds no values.
Produces flag
runtime values.
Class for flags, used by Set
to yield runtime representations.
A cache around another store. The wrapped store must produce safe representations using Maybe. Note that iterating over a cache is linear in its size, so large, sparsely populated caches will actually decrease performance.
Cachable s => Store (Cache n s) Source # | |
Cachable s => HasMembers (Cache n s) Source # | |
(KnownNat n, Cachable s) => Initializable (Cache n s) Source # | |
(KnownNat n, Cachable s) => Cachable (Cache n s) Source # | |
type SafeRW (Cache n s) Source # | |
type Stores (Cache n s) Source # | |
type InitArgs (Cache n s) Source # | |
A Unique contains exactly one component belonging to some entity. Writing to it overwrites both the previous component and its owner.
Global value. Must be given an initial value upon construction.