Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

Exact lookup

1. module GI.Gdk.Structs.EventSequence

   GdkEventSequence is an opaque type representing a sequence of related touch events.

2. newtype EventSequence

   gi-gdk4	GI.Gdk.Structs.EventSequence

   Memory-managed wrapper type.

3. EventSequence :: ManagedPtr EventSequence -> EventSequence

   gi-gdk4	GI.Gdk.Structs.EventSequence

   No documentation available.

4. unSequence :: SequenceT (m :: Type -> Type) a -> m a

   monad-schedule	Control.Monad.Schedule.Sequence

   No documentation available.

5. subsequences :: [a] -> [[a]]

   prelude-compat	Data.List2010

   No documentation available.

6. collectSequence :: forall (m :: Type -> Type) cl1 cl2 a . Monad m => ResamplingBuffer m cl1 cl2 a (Seq a)

   rhine	FRP.Rhine.ResamplingBuffer.Collect

   Reimplementation of collect with sequences, which gives a performance benefit if the sequence needs to be reversed or searched.

7. peekSequence :: (IsSequence t, Store (Element t), Index t ~ Int) => Peek t

   store	Data.Store.Internal

   Implement peek for an IsSequence of Store instances. Note that many monomorphic containers have more efficient implementations (for example, via memcpy).

8. pokeSequence :: (IsSequence t, Store (Element t)) => t -> Poke ()

   store	Data.Store.Internal

   Implement poke for an IsSequence of Store instances. Note that many monomorphic containers have more efficient implementations (for example, via memcpy).

9. sizeSequence :: (IsSequence t, Store (Element t)) => Size t

   store	Data.Store.Internal

   Implement size for an IsSequence of Store instances. Note that many monomorphic containers have more efficient implementations (for example, via memcpy).

10. bsequence' :: (Applicative e, TraversableB b) => b e -> e (b Identity)

    barbies	Data.Functor.Barbie

    A version of bsequence with f specialized to Identity.

Page 63 of many | Previous | Next