Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data IndexSet entity
- newtype Index entity = Index Int
- data EntityTable entity
- data IndexTable entity
- data Indexer entity
- lookupEntity :: Index entity -> EntityTable entity -> Maybe entity
- lookupIndex :: (Eq entity, Hashable entity) => entity -> IndexTable entity -> Maybe (Index entity)
- createIndexSet :: (Eq entity, Hashable entity, Foldable foldable) => IndexTable entity -> foldable entity -> IndexSet entity
- lookupInIndexSet :: Index entity -> IndexSet entity -> Bool
Documentation
Set of indices.
A more efficient alternative to HashSet (Index entity)
.
data EntityTable entity Source #
Instances
Serialize entity => Serialize (EntityTable entity) # | |
Defined in Indexation.Instances.Cereal put :: Putter (EntityTable entity) # get :: Get (EntityTable entity) # |
data IndexTable entity Source #
Instances
(Serialize entity, Eq entity, Hashable entity) => Serialize (IndexTable entity) # | |
Defined in Indexation.Instances.Cereal put :: Putter (IndexTable entity) # get :: Get (IndexTable entity) # |
lookupEntity :: Index entity -> EntityTable entity -> Maybe entity Source #
lookupIndex :: (Eq entity, Hashable entity) => entity -> IndexTable entity -> Maybe (Index entity) Source #
createIndexSet :: (Eq entity, Hashable entity, Foldable foldable) => IndexTable entity -> foldable entity -> IndexSet entity Source #