Safe Haskell | None |
---|---|
Language | Haskell2010 |
Game.LambdaHack.Core.Frequency
Description
A list of entities with relative frequencies of appearance.
Synopsis
- data Frequency a
- uniformFreq :: Text -> [a] -> Frequency a
- toFreq :: Text -> [(Int, a)] -> Frequency a
- scaleFreq :: Show a => Int -> Frequency a -> Frequency a
- renameFreq :: Text -> Frequency a -> Frequency a
- setFreq :: Eq a => Frequency a -> a -> Int -> Frequency a
- nullFreq :: Frequency a -> Bool
- runFrequency :: Frequency a -> [(Int, a)]
- nameFrequency :: Frequency a -> Text
- minFreq :: Ord a => Frequency a -> Maybe a
- maxFreq :: Ord a => Frequency a -> Maybe a
- mostFreq :: Frequency a -> Maybe a
The Frequency
type
The frequency distribution type. Not normalized (operations may or may not group the same elements and sum their frequencies). However, elements with zero frequency are removed upon construction.
The Eq
instance compares raw representations, not relative,
normalized frequencies, so operations don't need to preserve
the expected equalities.
Instances
Monad Frequency Source # | |
Functor Frequency Source # | |
Applicative Frequency Source # | |
Defined in Game.LambdaHack.Core.Frequency | |
Foldable Frequency Source # | |
Defined in Game.LambdaHack.Core.Frequency Methods fold :: Monoid m => Frequency m -> m foldMap :: Monoid m => (a -> m) -> Frequency a -> m # foldMap' :: Monoid m => (a -> m) -> Frequency a -> m foldr :: (a -> b -> b) -> b -> Frequency a -> b # foldr' :: (a -> b -> b) -> b -> Frequency a -> b foldl :: (b -> a -> b) -> b -> Frequency a -> b # foldl' :: (b -> a -> b) -> b -> Frequency a -> b # foldr1 :: (a -> a -> a) -> Frequency a -> a # foldl1 :: (a -> a -> a) -> Frequency a -> a # elem :: Eq a => a -> Frequency a -> Bool # maximum :: Ord a => Frequency a -> a # minimum :: Ord a => Frequency a -> a # | |
Traversable Frequency Source # | |
Defined in Game.LambdaHack.Core.Frequency | |
MonadPlus Frequency Source # | |
Alternative Frequency Source # | |
Eq a => Eq (Frequency a) Source # | |
Ord a => Ord (Frequency a) Source # | |
Defined in Game.LambdaHack.Core.Frequency | |
Show a => Show (Frequency a) Source # | |
Generic (Frequency a) Source # | |
type Rep (Frequency a) Source # | |
Defined in Game.LambdaHack.Core.Frequency type Rep (Frequency a) = D1 ('MetaData "Frequency" "Game.LambdaHack.Core.Frequency" "LambdaHack-0.9.5.0-IfKZ3m76YlCDhiCPrOePIo" 'False) (C1 ('MetaCons "Frequency" 'PrefixI 'True) (S1 ('MetaSel ('Just "runFrequency") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 [(Int, a)]) :*: S1 ('MetaSel ('Just "nameFrequency") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Text))) |
Construction
uniformFreq :: Text -> [a] -> Frequency a Source #
Uniform discrete frequency distribution.
toFreq :: Text -> [(Int, a)] -> Frequency a Source #
Takes a name and a list of frequencies and items into the frequency distribution.
Transformation
scaleFreq :: Show a => Int -> Frequency a -> Frequency a Source #
Scale frequency distribution, multiplying it by a positive integer constant.
Consumption
runFrequency :: Frequency a -> [(Int, a)] Source #
give acces to raw frequency values
nameFrequency :: Frequency a -> Text Source #
short description for debug, etc.