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.

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

    genvalidity-hspec Test.Validity 

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

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

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

    genvalidity-hspec Test.Validity 

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

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

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

    genvalidity-hspec Test.Validity

  4. idempotentSemigroupLaws :: (Semigroup a, Eq a, Arbitrary a, Show a) => Proxy a -> Laws

    quickcheck-classes Test.QuickCheck.Classes

    Tests the following properties:

    • Idempotent a <> a ≡ a
    Note that this does not test associativity. Make sure to use semigroupLaws in addition to this set of laws. In literature, this class of semigroup is known as a band.

  5. iDATSignature :: ChunkSignature

    JuicyPixels Codec.Picture.Png.Internal.Type

    Signature for a data chuck (with image parts in it)

  6. identity :: (Num a, Traversable t, Applicative t) => t (t a)

    linear Linear.Matrix

    The identity matrix for any dimension vector. 

    >>> identity :: M44 Int
V4 (V4 1 0 0 0) (V4 0 1 0 0) (V4 0 0 1 0) (V4 0 0 0 1)

>>> identity :: V3 (V3 Int)
V3 (V3 1 0 0) (V3 0 1 0) (V3 0 0 1)

  7. idisjoin :: forall k l (is1 :: IxList) i (is2 :: IxList) s t a b . (Is k A_Traversal, Is l A_Traversal, HasSingleIndex is1 i, HasSingleIndex is2 i) => Optic k is1 s t a b -> Optic l is2 s t a b -> IxTraversal i s t a b

    optics-core Optics.IxTraversal

    Try the first IxTraversal. If it returns no entries, try the second one. 

    >>> iover (_1 % itraversed `idisjoin` _2 % itraversed) (+) ([0, 0, 0], (3, 5))
([0,1,2],(3,5))

    >>> iover (ignored `idisjoin` _2 % itraversed) (+) ([0, 0, 0], (3, 5))
([0,0,0],(3,8))

  8. idleAdd :: (HasCallStack, MonadIO m) => Int32 -> SourceFunc -> m Word32

    gi-glib GI.GLib.Functions

    Adds a function to be called whenever there are no higher priority events pending. If the function returns SOURCE_REMOVE or False it is automatically removed from the list of event sources and will not be called again. See [memory management of sources][mainloop-memory-management] for details on how to handle the return value and memory management of data. This internally creates a main loop source using idleSourceNew and attaches it to the global MainContext using sourceAttach, so the callback will be invoked in whichever thread is running that main context. You can do these steps manually if you need greater control or to use a custom main context.

  9. idleRemoveByData :: (HasCallStack, MonadIO m) => Ptr () -> m Bool

    gi-glib GI.GLib.Functions

    Removes the idle function with the given data.

  10. idleSourceNew :: (HasCallStack, MonadIO m) => m Source

    gi-glib GI.GLib.Functions

    Creates a new idle source. The source will not initially be associated with any MainContext and must be added to one with sourceAttach before it will be executed. Note that the default priority for idle sources is PRIORITY_DEFAULT_IDLE, as compared to other sources which have a default priority of PRIORITY_DEFAULT.

Page 276 of many | Previous | Next