Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. idroppingWhile :: (Indexable i p, Profunctor q, Applicative f) => (i -> a -> Bool) -> Optical (Indexed i) q (Compose (State Bool) f) s t a a -> Optical p q f s t a a

    diagrams-lib Diagrams.Prelude

    Obtain an IndexedFold by dropping elements from another IndexedFold, IndexedLens, IndexedGetter or IndexedTraversal while a predicate holds.

    idroppingWhile :: (i -> a -> Bool) -> IndexedFold i s a          -> IndexedFold i s a
    idroppingWhile :: (i -> a -> Bool) -> IndexedTraversal' i s a    -> IndexedFold i s a -- see notes
    idroppingWhile :: (i -> a -> Bool) -> IndexedLens' i s a         -> IndexedFold i s a -- see notes
    idroppingWhile :: (i -> a -> Bool) -> IndexedGetter i s a        -> IndexedFold i s a
    
    Note: As with droppingWhile applying idroppingWhile to an IndexedLens or IndexedTraversal will still allow you to use it as a pseudo-IndexedTraversal, but if you change the value of the first target to one where the predicate returns True, then you will break the Traversal laws and Traversal fusion will no longer be sound.

  2. idempotent :: (Show a, Eq a, GenValid a) => (a -> a) -> Property

    genvalidity-sydtest Test.Syd.Validity

    No documentation available.

  3. idempotentOnArbitrary :: (Show a, Eq a, Arbitrary a) => (a -> a) -> Property

    genvalidity-sydtest Test.Syd.Validity

    id is idempotent for any type:

    idempotentOnArbitrary (id :: Int -> Int)
    
    const, given any input, is idempotent for any type as well:
    \int -> idempotentOnArbitrary (const int :: Int -> Int)
    

  4. idempotentOnGen :: (Show a, Eq a) => (a -> a) -> Gen a -> (a -> [a]) -> Property

    genvalidity-sydtest Test.Syd.Validity

    No documentation available.

  5. identity :: (Show a, Eq a, GenValid a) => (a -> a -> a) -> a -> Property

    genvalidity-sydtest Test.Syd.Validity

    identity ((*) :: Int -> Int -> Int) 1
    
    identity ((+) :: Int -> Int -> Int) 0
    

  6. identityOnArbitrary :: (Show a, Eq a, Arbitrary a) => (a -> a -> a) -> a -> Property

    genvalidity-sydtest Test.Syd.Validity

    identityOnArbitrary ((*) :: Int -> Int -> Int) 1
    
    identityOnArbitrary ((+) :: Int -> Int -> Int) 0
    

  7. identityOnGen :: (Show a, Eq a) => (a -> a -> a) -> a -> Gen a -> (a -> [a]) -> Property

    genvalidity-sydtest Test.Syd.Validity

  8. idempotent :: (Show a, Eq a, GenValid a) => (a -> a) -> Property

    genvalidity-sydtest Test.Syd.Validity.Functions.Idempotence

    No documentation available.

  9. idempotentOnArbitrary :: (Show a, Eq a, Arbitrary a) => (a -> a) -> Property

    genvalidity-sydtest Test.Syd.Validity.Functions.Idempotence

    id is idempotent for any type:

    idempotentOnArbitrary (id :: Int -> Int)
    
    const, given any input, is idempotent for any type as well:
    \int -> idempotentOnArbitrary (const int :: Int -> Int)
    

  10. idempotentOnGen :: (Show a, Eq a) => (a -> a) -> Gen a -> (a -> [a]) -> Property

    genvalidity-sydtest Test.Syd.Validity.Functions.Idempotence

    No documentation available.

Page 278 of many | Previous | Next