Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. ideaSpan :: Idea -> SrcSpan

   hlint	Language.Haskell.HLint

   The source code the idea relates to.

2. ideaTo :: Idea -> Maybe String

   hlint	Language.Haskell.HLint

   The suggested replacement, or Nothing for no replacement (e.g. on parse errors).

3. id_ :: Text -> Attribute

   lucid	Lucid.Html5

   The id attribute.

4. idct :: (Vector v CD, Vector v Double) => v Double -> v Double

   statistics	Statistics.Transform

   Inverse discrete cosine transform (DCT-III). It's inverse of dct only up to scale parameter:

   (idct . dct) x = (* length x)
   

5. idct_ :: (Vector v CD, Vector v Double) => v CD -> v Double

   statistics	Statistics.Transform

   Inverse discrete cosine transform (DCT-III). Only real part of vector is transformed, imaginary part is ignored.

6. 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.

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

   genvalidity-sydtest	Test.Syd.Validity

   No documentation available.

8. 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)
   

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

   genvalidity-sydtest	Test.Syd.Validity

   No documentation available.

10. 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
    

Page 278 of many | Previous | Next