Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.DataDomain

Synopsis

data DataDomain f a = DataDomain {
- ddRaw :: !(Interval (f a))
- ddFiltered :: !(Maybe (Interval (f a)))
- ddRawCount :: !(f Int)
- ddFilteredCount :: !(f Int)
}
data DataDomainComb = DataDomainComb {
- ddcMergeIntervals :: !(forall a. Ord a => [Interval (I a)] -> Interval (I a))
- ddcMergeCounts :: !([I Int] -> I Int)
- ddcProjInterval :: !(forall a. Interval (CDF I a) -> Interval (I a))
- ddcProjCount :: !(CDF I Int -> I Int)
}
summariseDataDomains :: Divisible a => [DataDomain I a] -> DataDomain (CDF I) a
traverseDataDomain :: (Divisible a, Witherable h) => (forall b. Divisible b => h (f b) -> g b) -> h (DataDomain f a) -> DataDomain g a
traverseDataDomain' :: (Divisible a, Witherable h, Applicative i) => (forall b. Divisible b => h (f b) -> i (g b)) -> h (DataDomain f a) -> i (DataDomain g a)
dataDomainFilterRatio :: (f Int -> Int) -> DataDomain f a -> Double
mkDataDomainInj :: a -> a -> (a -> Int) -> DataDomain I a
mkDataDomain :: a -> a -> a -> a -> (a -> Int) -> DataDomain I a
unionDataDomains :: Ord a => [DataDomain I a] -> DataDomain I a
intersectDataDomains :: Ord a => [DataDomain I a] -> DataDomain I a

Documentation

data DataDomain f a Source #

Constructors

DataDomain
Fields ddRaw :: !(Interval (f a)) ddFiltered :: !(Maybe (Interval (f a))) ddRawCount :: !(f Int) ddFilteredCount :: !(f Int)

Instances

Instances details

Functor f => Functor (DataDomain f) Source #
Instance details Defined in Data.DataDomain Methods fmap :: (a -> b) -> DataDomain f a -> DataDomain f b Source # (<$) :: a -> DataDomain f b -> DataDomain f a Source #
(forall b. FromJSON b => FromJSON (f b), FromJSON a) => FromJSON (DataDomain f a) Source #
Instance details Defined in Data.DataDomain Methods parseJSON :: Value -> Parser (DataDomain f a) # parseJSONList :: Value -> Parser [DataDomain f a] # omittedField :: Maybe (DataDomain f a) #
(forall b. ToJSON b => ToJSON (f b), ToJSON a) => ToJSON (DataDomain f a) Source #
Instance details Defined in Data.DataDomain Methods toJSON :: DataDomain f a -> Value # toEncoding :: DataDomain f a -> Encoding # toJSONList :: [DataDomain f a] -> Value # toEncodingList :: [DataDomain f a] -> Encoding # omitField :: DataDomain f a -> Bool #
Generic (DataDomain f a) Source #
Instance details Defined in Data.DataDomain Associated Types type Rep (DataDomain f a) :: Type -> Type Source # Methods from :: DataDomain f a -> Rep (DataDomain f a) x Source # to :: Rep (DataDomain f a) x -> DataDomain f a Source #
(forall b. Show b => Show (f b), Show a) => Show (DataDomain f a) Source #
Instance details Defined in Data.DataDomain Methods showsPrec :: Int -> DataDomain f a -> ShowS Source # show :: DataDomain f a -> String Source # showList :: [DataDomain f a] -> ShowS Source #
(forall b. NFData b => NFData (f b), NFData a) => NFData (DataDomain f a) Source #
Instance details Defined in Data.DataDomain Methods rnf :: DataDomain f a -> () Source #
type Rep (DataDomain f a) Source #
Instance details Defined in Data.DataDomain type Rep (DataDomain f a) = D1 ('MetaData "DataDomain" "Data.DataDomain" "locli-1.34-inplace" 'False) (C1 ('MetaCons "DataDomain" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ddRaw") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Interval (f a))) :: S1 ('MetaSel ('Just "ddFiltered") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe (Interval (f a))))) :: (S1 ('MetaSel ('Just "ddRawCount") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (f Int)) :*: S1 ('MetaSel ('Just "ddFilteredCount") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (f Int)))))

data DataDomainComb Source #

Key decision of DataDomain merging policy.

Constructors

DataDomainComb
Fields ddcMergeIntervals :: !(forall a. Ord a => [Interval (I a)] -> Interval (I a)) ddcMergeCounts :: !([I Int] -> I Int) ddcProjInterval :: !(forall a. Interval (CDF I a) -> Interval (I a)) ddcProjCount :: !(CDF I Int -> I Int)

summariseDataDomains :: Divisible a => [DataDomain I a] -> DataDomain (CDF I) a Source #

traverseDataDomain :: (Divisible a, Witherable h) => (forall b. Divisible b => h (f b) -> g b) -> h (DataDomain f a) -> DataDomain g a Source #

traverseDataDomain' :: (Divisible a, Witherable h, Applicative i) => (forall b. Divisible b => h (f b) -> i (g b)) -> h (DataDomain f a) -> i (DataDomain g a) Source #

dataDomainFilterRatio :: (f Int -> Int) -> DataDomain f a -> Double Source #

mkDataDomainInj :: a -> a -> (a -> Int) -> DataDomain I a Source #

mkDataDomain :: a -> a -> a -> a -> (a -> Int) -> DataDomain I a Source #

unionDataDomains :: Ord a => [DataDomain I a] -> DataDomain I a Source #

intersectDataDomains :: Ord a => [DataDomain I a] -> DataDomain I a Source #