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.
lookup :: Ord c => [c] -> TMap c a -> Maybe atrie-simple Data.Trie.Map lookup xs tmap returns Just a if tmap contains mapping from xs to a, and returns Nothing if not.
lookup :: (Eq k, Hashable k) => k -> Map k v -> STM (Maybe v)ttrie Control.Concurrent.STM.Map O(log n). Return the value associated with the given key, or Nothing. Note: This might increase the map's memory consumption by putting the key into the map. If that is not acceptable, use phantomLookup.
lookup :: forall t x proxy . Typeable t => proxy t -> TypeMap x -> Maybe (Item x t)type-map Data.TypeMap.Dynamic Lookup an element indexed by type t.
lookup :: Typeable t => TypeMap x -> Maybe (Item x t)type-map Data.TypeMap.Dynamic.Alt Lookup an element indexed by type t.
lookup :: forall t x proxy . Typeable t => proxy t -> TypeMap x -> Maybe (Item x t)type-map Data.TypeMap.Internal.Dynamic Lookup an element indexed by type t.
lookup :: Typeable t => TypeMap x -> Maybe (Item x t)type-map Data.TypeMap.Internal.Dynamic.Alt Lookup an element indexed by type t.
lookup :: Ord k => k -> IntervalMap k v -> Maybe vIntervalMap Data.IntervalMap.Generic.Lazy O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.
lookup :: Ord k => k -> IntervalMap k v -> Maybe vIntervalMap Data.IntervalMap.Generic.Strict O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.
lookup :: Ord k => k -> IntervalMap k v -> Maybe vIntervalMap Data.IntervalMap.Lazy O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.
lookup :: Ord k => k -> IntervalMap k v -> Maybe vIntervalMap Data.IntervalMap.Strict O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.