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.
-
gi-glib GI.GLib.Structs.Node Calls a function for each of the children of a Node. Note that it doesn't descend beneath the child nodes. func must not do anything that would modify the structure of the tree.
queueForeach :: (HasCallStack, MonadIO m) => Queue -> Func -> m ()gi-glib GI.GLib.Structs.Queue Calls func for each element in the queue passing userData to the function. It is safe for func to remove the element from queue, but it must not modify any part of the queue after that element. Since: 2.4
scannerScopeForeachSymbol :: (HasCallStack, MonadIO m) => Scanner -> Word32 -> HFunc -> m ()gi-glib GI.GLib.Structs.Scanner Calls the given function for each of the symbol/value pairs in the given scope of the Scanner. The function is passed the symbol and value of each pair, and the given userData parameter.
sequenceForeach :: (HasCallStack, MonadIO m) => Sequence -> Func -> m ()gi-glib GI.GLib.Structs.Sequence Calls func for each item in the sequence passing userData to the function. func must not modify the sequence itself. Since: 2.14
sequenceForeachRange :: (HasCallStack, MonadIO m) => SequenceIter -> SequenceIter -> Func -> m ()gi-glib GI.GLib.Structs.Sequence Calls func for each item in the range (begin, end) passing userData to the function. func must not modify the sequence itself. Since: 2.14
sequenceInsertBefore :: (HasCallStack, MonadIO m) => SequenceIter -> Ptr () -> m SequenceItergi-glib GI.GLib.Structs.Sequence Inserts a new item just before the item pointed to by iter. Since: 2.14
treeForeach :: (HasCallStack, MonadIO m) => Tree -> TraverseFunc -> m ()gi-glib GI.GLib.Structs.Tree Calls the given function for each of the key/value pairs in the Tree. The function is passed the key and value of each pair, and the given data parameter. The tree is traversed in sorted order. The tree may not be modified while iterating over it (you can't add/remove items). To remove all items matching a predicate, you need to add each item to a list in your TraverseFunc as you walk over the tree, then walk the list and remove each item.
treeForeachNode :: (HasCallStack, MonadIO m) => Tree -> TraverseNodeFunc -> m ()gi-glib GI.GLib.Structs.Tree Calls the given function for each of the nodes in the Tree. The function is passed the pointer to the particular node, and the given data parameter. The tree traversal happens in-order. The tree may not be modified while iterating over it (you can't add/remove items). To remove all items matching a predicate, you need to add each item to a list in your TraverseFunc as you walk over the tree, then walk the list and remove each item. Since: 2.68
type
BindingTransformFunc = Binding -> GValue -> GValue -> IO Boolgi-gobject GI.GObject.Callbacks A function to be called to transform fromValue to toValue. If this is the transformTo function of a binding, then fromValue is the sourceProperty on the source object, and toValue is the targetProperty on the target object. If this is the transformFrom function of a BindingFlagsBidirectional binding, then those roles are reversed. Since: 2.26
type
BindingTransformFunc_WithClosures = Binding -> GValue -> GValue -> Ptr () -> IO Boolgi-gobject GI.GObject.Callbacks A function to be called to transform fromValue to toValue. If this is the transformTo function of a binding, then fromValue is the sourceProperty on the source object, and toValue is the targetProperty on the target object. If this is the transformFrom function of a BindingFlagsBidirectional binding, then those roles are reversed. Since: 2.26