Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. eventGetEventSequence :: (HasCallStack, MonadIO m, IsEvent a) => a -> m EventSequence

    gi-gdk4 GI.Gdk.Objects.Event

    Returns the event sequence to which the event belongs. Related touch events are connected in a sequence. Other events typically don't have event sequence information.

  2. module GI.Gdk.Structs.EventSequence

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

  3. newtype EventSequence

    gi-gdk4 GI.Gdk.Structs.EventSequence

    Memory-managed wrapper type.

  4. EventSequence :: ManagedPtr EventSequence -> EventSequence

    gi-gdk4 GI.Gdk.Structs.EventSequence

    No documentation available.

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

    monad-schedule Control.Monad.Schedule.Sequence

    No documentation available.

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

    prelude-compat Data.List2010

    No documentation available.

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

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

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

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

Page 63 of many | Previous | Next