Hoogle Search
Within LTS Haskell 24.64 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
splitLookup :: Enum key => key -> EnumMap key a -> (EnumMap key a, Maybe a, EnumMap key a)regex-tdfa Data.IntMap.EnumMap2 No documentation available.
-
regex-tdfa Data.IntMap.EnumMap2 No documentation available.
scannerLookupSymbol :: (HasCallStack, MonadIO m) => Scanner -> Text -> m (Ptr ())gi-glib GI.GLib.Structs.Scanner Looks up a symbol in the current scope and return its value. If the symbol is not bound in the current scope, Nothing is returned.
scannerScopeLookupSymbol :: (HasCallStack, MonadIO m) => Scanner -> Word32 -> Text -> m (Ptr ())gi-glib GI.GLib.Structs.Scanner Looks up a symbol in a scope and return its value. If the symbol is not bound in the scope, Nothing is returned.
-
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