Safe Haskell | None |
---|---|
Language | Haskell98 |
- newtype BinVarG v a = BinVarG {
- _cuts :: v a
- type BinVar = BinVarG Vector
- unsafeBinVar :: v a -> BinVarG v a
- binVar :: (Vector v a, Vector v Bool, Ord a) => v a -> BinVarG v a
- cuts :: BinVarG v a -> v a
- deleteCut :: (Vector v a, Ord a, Fractional a) => BinVarG v a -> Int -> BinVarG v a
- addCut :: (Vector v a, Ord a) => BinVarG v a -> a -> BinVarG v a
Documentation
Bins of variable size. Bins are defined by a vector of cuts
marking the boundary between bins. This assumes that the entire
range is continuous. There are n+1 cuts for n bins. This also
implies that cuts are in ascending order.
(Bin1D b, Vector v (BinValue b), Vector v Bool, (~) * a (BinValue b), Fractional a) => ConvertBin b (BinVarG v a) Source # | |
Eq (v a) => Eq (BinVarG v a) Source # | |
(Vector v a, Vector v Bool, Read a, Ord a) => Read (BinVarG v a) Source # | |
(Vector v a, Show a) => Show (BinVarG v a) Source # | |
NFData (v a) => NFData (BinVarG v a) Source # | |
(Vector v a, Ord a, Fractional a) => VariableBin (BinVarG v a) Source # | |
(Vector v a, Ord a, Fractional a) => SliceableBin (BinVarG v a) Source # | |
(Vector v a, Ord a, Fractional a) => Bin1D (BinVarG v a) Source # | |
(Vector v a, Ord a, Fractional a) => IntervalBin (BinVarG v a) Source # | |
(Vector v a, Vector v Bool, Ord a, Fractional a) => BinEq (BinVarG v a) Source # | Equality is up to 3e-11 (2/3th of digits) |
(Vector v a, Ord a, Fractional a) => Bin (BinVarG v a) Source # | |
type BinValue (BinVarG v a) Source # | |
Create variable bins unsafely