Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data IndexCounts entity
- data IndexSet entity
- newtype Index entity = Index Int
- data EntityTable entity
- data ReindexTable entity
- data IndexTable entity
- data Indexer entity
- indexTableEntityTable :: IndexTable entity -> EntityTable 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
- lookupNewIndex :: Index entity -> ReindexTable entity -> Maybe (Index entity)
- mergeIndexSets :: IndexSet entity -> IndexSet entity -> IndexSet entity
- topCountedIndexSet :: Int -> IndexCounts a -> IndexSet a
- indexSetByMinCount :: Word32 -> IndexCounts a -> IndexSet a
- countIndexSet :: IndexSet a -> Int
- newIndexToOldIndexTable :: IndexSet a -> EntityTable (Index a)
- oldIndexToNewIndexTable :: IndexSet a -> ReindexTable a
- filterEntityTable :: IndexSet a -> EntityTable a -> EntityTable a
Documentation
data IndexCounts entity Source #
Instances
Serialize (IndexCounts a) # | |
Defined in Indexation.Instances.Cereal put :: Putter (IndexCounts a) # get :: Get (IndexCounts a) # |
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 ReindexTable entity Source #
Map from old to new indices.
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) # |
indexTableEntityTable :: IndexTable entity -> EntityTable entity Source #
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 #
lookupNewIndex :: Index entity -> ReindexTable entity -> Maybe (Index entity) Source #
topCountedIndexSet :: Int -> IndexCounts a -> IndexSet a Source #
indexSetByMinCount :: Word32 -> IndexCounts a -> IndexSet a Source #
countIndexSet :: IndexSet a -> Int Source #
newIndexToOldIndexTable :: IndexSet a -> EntityTable (Index a) Source #
oldIndexToNewIndexTable :: IndexSet a -> ReindexTable a Source #
filterEntityTable :: IndexSet a -> EntityTable a -> EntityTable a Source #