| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Plutarch.Extra.Interval
Synopsis
- pmember :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PAsData a :--> (PInterval a :--> PBool))
- pinterval :: forall a (s :: S). PIsData a => Term s (PAsData a :--> (PAsData a :--> PInterval a))
- pfrom :: forall a s. PIsData a => Term s (PAsData a :--> PInterval a)
- pto :: forall a (s :: S). PIsData a => Term s (PAsData a :--> PInterval a)
- palways :: forall a (s :: S). (PIsData a, PLiftData a) => Term s (PInterval a)
- pnever :: forall a (s :: S). (PIsData a, PLiftData a) => Term s (PInterval a)
- psingleton :: forall a (s :: S). PIsData a => Term s (PAsData a :--> PInterval a)
- phull :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PInterval a :--> (PInterval a :--> PInterval a))
- pintersection :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PInterval a :--> (PInterval a :--> PInterval a))
- pcontains :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PInterval a :--> (PInterval a :--> PBool))
- pbefore :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (a :--> (PInterval a :--> PBool))
- pafter :: forall a s. (PEq a, POrd a, PIsData a) => Term s (a :--> (PInterval a :--> PBool))
Documentation
pmember :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PAsData a :--> (PInterval a :--> PBool)) Source #
pinterval :: forall a (s :: S). PIsData a => Term s (PAsData a :--> (PAsData a :--> PInterval a)) Source #
create an interval that includes all values that are greater than or equal - to a and smaller than or equal to b
pfrom :: forall a s. PIsData a => Term s (PAsData a :--> PInterval a) Source #
create an interval that includes all values that are greater than or equal - to a
pto :: forall a (s :: S). PIsData a => Term s (PAsData a :--> PInterval a) Source #
create an interval that includes all values that are smaller than or equal - to a
palways :: forall a (s :: S). (PIsData a, PLiftData a) => Term s (PInterval a) Source #
create an interval that covers every slot
pnever :: forall a (s :: S). (PIsData a, PLiftData a) => Term s (PInterval a) Source #
create an interval that is empty
psingleton :: forall a (s :: S). PIsData a => Term s (PAsData a :--> PInterval a) Source #
create and interval [a, a]
phull :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PInterval a :--> (PInterval a :--> PInterval a)) Source #
`hull i1 i2` is the smallest interval containing i1 and i2
pintersection :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PInterval a :--> (PInterval a :--> PInterval a)) Source #
`intersecion i1 i2` is the largest interval contained in i1 and i2
pcontains :: forall a (s :: S). (PEq a, POrd a, PIsData a) => Term s (PInterval a :--> (PInterval a :--> PBool)) Source #
pcontains # a # b is true if the interval b is entirely contained in a