Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
eventGetEventSequence :: (HasCallStack, MonadIO m) => Event -> m EventSequencegi-gdk3 GI.Gdk.Unions.Event If event if of type EventTypeTouchBegin, EventTypeTouchUpdate, EventTypeTouchEnd or EventTypeTouchCancel, returns the EventSequence to which the event belongs. Otherwise, return Nothing. Since: 3.4
unSequence :: SequenceT (m :: Type -> Type) a -> m amonad-schedule Control.Monad.Schedule.Sequence No documentation available.
-
prelude-compat Data.List2010 No documentation available.
-
rhine FRP.Rhine.ResamplingBuffer.Collect Reimplementation of collect with sequences, which gives a performance benefit if the sequence needs to be reversed or searched.
peekSequence :: (IsSequence t, Store (Element t), Index t ~ Int) => Peek tstore Data.Store.Internal Implement peek for an IsSequence of Store instances. Note that many monomorphic containers have more efficient implementations (for example, via memcpy).
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).
sizeSequence :: (IsSequence t, Store (Element t)) => Size tstore Data.Store.Internal Implement size for an IsSequence of Store instances. Note that many monomorphic containers have more efficient implementations (for example, via memcpy).
bsequence' :: (Applicative e, TraversableB b) => b e -> e (b Identity)barbies Data.Functor.Barbie c'BZ_SEQUENCE_ERROR :: Num a => abzlib-conduit Data.Conduit.BZlib.Internal No documentation available.
changeSequence :: [Change a] -> [Change a]drifter Drifter This is a helper for the common case of where you just want dependencies to run in list order. This will take the input list and set their dependencies to run in the given sequence.