Hoogle Search
Within LTS Haskell 24.62 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
gi-glib GI.GLib.Structs.Sequence Returns an iterator pointing to the position of the first item found equal to data according to cmpFunc and cmpData. If more than one item is equal, it is not guaranteed that it is the first which is returned. In that case, you can use sequenceIterNext and sequenceIterPrev to get others. cmpFunc is called with two items of the seq, and cmpData. It should return 0 if the items are equal, a negative value if the first item comes before the second, and a positive value if the second item comes before the first. This function will fail if the data contained in the sequence is unsorted. Since: 2.28
-
gi-glib GI.GLib.Structs.Sequence Like sequenceLookup, but uses a SequenceIterCompareFunc instead of a CompareDataFunc as the compare function. iterCmp is called with two iterators pointing into seq. It should return 0 if the iterators are equal, a negative value if the first iterator comes before the second, and a positive value if the second iterator comes before the first. This function will fail if the data contained in the sequence is unsorted. Since: 2.28
treeLookup :: (HasCallStack, MonadIO m) => Tree -> Ptr () -> m (Ptr ())gi-glib GI.GLib.Structs.Tree Gets the value corresponding to the given key. Since a Tree is automatically balanced as key/value pairs are added, key lookup is O(log n) (where n is the number of key/value pairs in the tree).
treeLookupExtended :: (HasCallStack, MonadIO m) => Tree -> Ptr () -> m (Bool, Ptr (), Ptr ())gi-glib GI.GLib.Structs.Tree Looks up a key in the Tree, returning the original key and the associated value. This is useful if you need to free the memory allocated for the original key, for example before calling treeRemove.
treeLookupNode :: (HasCallStack, MonadIO m) => Tree -> Ptr () -> m (Maybe TreeNode)gi-glib GI.GLib.Structs.Tree Gets the tree node corresponding to the given key. Since a Tree is automatically balanced as key/value pairs are added, key lookup is O(log n) (where n is the number of key/value pairs in the tree). Since: 2.68
-
gi-glib GI.GLib.Structs.VariantDict Looks up a value in a VariantDict. If key is not found in dictionary, Nothing is returned. The expectedType string specifies what type of value is expected. If the value associated with key has a different type then Nothing is returned. If the key is found and the value has the correct type, it is returned. If expectedType was specified then any non-Nothing return value will have this type. Since: 2.40
signalLookup :: (HasCallStack, MonadIO m) => Text -> GType -> m Word32gi-gobject GI.GObject.Functions Given the name of the signal and the type of object it connects to, gets the signal's identifying integer. Emitting the signal by number is somewhat faster than using the name each time. Also tries the ancestors of the given type. The type class passed as itype must already have been instantiated (for example, using typeClassRef) for this function to work, as signals are always installed during class initialization. See g_signal_new() for details on allowed signal names.
-
gi-gobject GI.GObject.Structs.ParamSpecPool Looks up a ParamSpec in the pool.
-
mono-traversable Data.Containers Insert a key-value pair into a map, return the previous key's value if it existed. Inserts the value directly if the key does not exist in the map. Otherwise, apply a supplied function that accepts the key, the new value, and the previous value and insert that result into the map.
-
mono-traversable Data.Containers Apply a function to the value of a given key. If the map does not contain the key this returns Nothing and the input map. If the map does contain the key but the function returns Nothing, this returns the previous value and the map with the key-value pair removed. If the map contains the key and the function returns a value, this returns the new value and the map with the key-value pair with the new value.