Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. sequenceIterGetPosition :: (HasCallStack, MonadIO m) => SequenceIter -> m Int32

   gi-glib	GI.GLib.Structs.SequenceIter

   Returns the position of iter Since: 2.14

2. sequenceIterGetSequence :: (HasCallStack, MonadIO m) => SequenceIter -> m Sequence

   gi-glib	GI.GLib.Structs.SequenceIter

   Returns the Sequence that iter points into. Since: 2.14

3. sequenceIterIsBegin :: (HasCallStack, MonadIO m) => SequenceIter -> m Bool

   gi-glib	GI.GLib.Structs.SequenceIter

   Returns whether iter is the begin iterator Since: 2.14

4. sequenceIterIsEnd :: (HasCallStack, MonadIO m) => SequenceIter -> m Bool

   gi-glib	GI.GLib.Structs.SequenceIter

   Returns whether iter is the end iterator Since: 2.14

5. sequenceIterMove :: (HasCallStack, MonadIO m) => SequenceIter -> Int32 -> m SequenceIter

   gi-glib	GI.GLib.Structs.SequenceIter

   Returns the SequenceIter which is delta positions away from iter. If iter is closer than -delta positions to the beginning of the sequence, the begin iterator is returned. If iter is closer than delta positions to the end of the sequence, the end iterator is returned. Since: 2.14

6. sequenceIterNext :: (HasCallStack, MonadIO m) => SequenceIter -> m SequenceIter

   gi-glib	GI.GLib.Structs.SequenceIter

   Returns an iterator pointing to the next position after iter. If iter is the end iterator, the end iterator is returned. Since: 2.14

7. sequenceIterPrev :: (HasCallStack, MonadIO m) => SequenceIter -> m SequenceIter

   gi-glib	GI.GLib.Structs.SequenceIter

   Returns an iterator pointing to the previous position before iter. If iter is the begin iterator, the begin iterator is returned. Since: 2.14

8. sequenceBy :: Traversable t => (forall x . () => x -> f x) -> (forall x y . () => f (x -> y) -> f x -> f y) -> t (f a) -> f (t a)

   reflection	Data.Reflection

   Sequence a container using its Traversable instance using explicitly provided Applicative operations. This is like sequence where the Applicative instance can be manually specified.

9. sequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()

   mono-traversable	Data.MonoTraversable.Unprefixed

   Synonym for osequence_

10. sequenceA :: Applicative f => Exceptional e (f a) -> f (Exceptional e a)

    explicit-exception	Control.Monad.Exception.Asynchronous.Lazy

    No documentation available.

Page 29 of many | Previous | Next