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.

Exact lookup

1. data IdentifierQuotation

   relational-schemas	Database.Custom.PostgreSQL

   Configuration for quotation of identifiers of SQL.

2. data IdentifierQuotation

   relational-schemas	Database.Custom.SQLServer

   Configuration for quotation of identifiers of SQL.

3. data IdentifierQuotation

   relational-schemas	Database.Custom.SQLite3

   Configuration for quotation of identifiers of SQL.

4. newtype Identity a

   verset	Verset

   Identity functor and monad. (a non-strict monad)

   Examples

   >>> fmap (+1) (Identity 0)
   Identity 1
   

   >>> Identity [1, 2, 3] <> Identity [4, 5, 6]
   Identity [1,2,3,4,5,6]
   

   >>> do
   x <- Identity 10
   y <- Identity (x + 5)
   pure (x + y)
   Identity 25
   

5. Identity :: a -> Identity a

   verset	Verset

   No documentation available.

6. idleGCDelayTime :: GCFlags -> RtsTime

   base	GHC.RTS.Flags

   No documentation available.

7. idempotentIOProperty :: Testable prop => IO prop -> Property

   QuickCheck	Test.QuickCheck

   Do I/O inside a property. Warning: during shrinking, the I/O may not always be re-executed. Instead, the I/O may be executed once and then its result retained. If this is not acceptable, use ioProperty instead.

8. idempotentIOProperty :: Testable prop => IO prop -> Property

   tasty-quickcheck	Test.Tasty.QuickCheck

   Do I/O inside a property. Warning: during shrinking, the I/O may not always be re-executed. Instead, the I/O may be executed once and then its result retained. If this is not acceptable, use ioProperty instead.

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

   lens	Control.Lens.Combinators

   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.

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

    lens	Control.Lens.Fold

    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.

Page 261 of many | Previous | Next