Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. rSingleton :: DiscreteOrdered v => v -> RSet v

    Ranged-sets Data.Ranged.RangedSet

    Create a Ranged Set from a single element.

  2. prop_emptyNonSingleton :: Bool

    Ranged-sets Data.Ranged.Ranges

    The empty range is not a singleton.

    prop_emptyNonSingleton = rangeSingletonValue emptyRange == Nothing
    

  3. prop_fullNonSingleton :: Bool

    Ranged-sets Data.Ranged.Ranges

    The full range is not a singleton.

    prop_fullNonSingleton = rangeSingletonValue fullRange == Nothing
    

  4. prop_intSingleton :: Integer -> Integer -> Property

    Ranged-sets Data.Ranged.Ranges

    For all integers x and y, any range formed from boundaries on either side of x and y is a singleton iff it contains exactly one integer.

  5. prop_nonSingleton :: Double -> Double -> Property

    Ranged-sets Data.Ranged.Ranges

    For real x and y, x < y implies that any range between them is a non-singleton.

  6. prop_singletonRangeConverse :: DiscreteOrdered a => a -> Bool

    Ranged-sets Data.Ranged.Ranges

    A singleton range can have its value extracted.

    prop_singletonRangeConverse v =
    rangeSingletonValue (singletonRange v) == Just v
    

  7. prop_singletonRangeHas :: DiscreteOrdered a => a -> Bool

    Ranged-sets Data.Ranged.Ranges

    Range Singleton has its member.

    prop_singletonRangeHas v = singletonRange v `rangeHas` v
    

  8. prop_singletonRangeHasOnly :: DiscreteOrdered a => a -> a -> Bool

    Ranged-sets Data.Ranged.Ranges

    Range Singleton has only its member.

    prop_singletonHasOnly v1 v2 =
    (v1 == v2) == (singletonRange v1 `rangeHas` v2)
    

  9. rangeSingletonValue :: DiscreteOrdered v => Range v -> Maybe v

    Ranged-sets Data.Ranged.Ranges

    If the range is a singleton, returns Just the value. Otherwise returns Nothing. Known bug: This always returns Nothing for ranges including BoundaryBelowAll or BoundaryAboveAll. For bounded types this can be incorrect. For instance, the following range only contains one value:

    Range (BoundaryBelow maxBound) BoundaryAboveAll
    

  10. npSingleton :: forall k f1 (x :: k) (y :: k) p f2 . (Profunctor p, Functor f2) => p (f1 x) (f2 (f1 y)) -> p (NP f1 '[x]) (f2 (NP f1 '[y]))

    generics-sop-lens Generics.SOP.Lens

    No documentation available.

Page 73 of many | Previous | Next