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.

Exact lookup

1. splitLookup :: Int -> IntMap s a -> Some2IntMapWith (SplitProof 'Int s (Key s, a)) a a

   refined-containers	Data.IntMap.Refined

   Return two disjoint submaps: those whose keys are less than the given key, and those whose keys are greater than the given key. If the key was in the map, also return the associated value and the proof that it was in the map.

2. updateLookupWithKey :: (Key s -> a -> Maybe a) -> Int -> IntMap s a -> (Maybe (Key s, a), SomeIntMapWith (SupersetProof 'Int s) a)

   refined-containers	Data.IntMap.Refined

   If the given key is in the map, update or delete it using the given function with a proof that the key was in the map; otherwise the map is unchanged. Alongside return the new value if it was updated, or the old value if it was deleted, and a proof that the key was in the map.

3. insertLookupWithKey :: (Key s -> a -> a -> a) -> Int -> a -> IntMap s a -> (Maybe (Key s, a), SomeIntMapWith (InsertProof 'Int Int s) a)

   refined-containers	Data.IntMap.Strict.Refined

   Insert a key-value pair into the map using a combining function, and if the key was already present, the old value is returned along with the proof that the key was present.

4. splitLookup :: Int -> IntMap s a -> Some2IntMapWith (SplitProof 'Int s (Key s, a)) a a

   refined-containers	Data.IntMap.Strict.Refined

   Return two disjoint submaps: those whose keys are less than the given key, and those whose keys are greater than the given key. If the key was in the map, also return the associated value and the proof that it was in the map.

5. updateLookupWithKey :: (Key s -> a -> Maybe a) -> Int -> IntMap s a -> (Maybe (Key s, a), SomeIntMapWith (SupersetProof 'Int s) a)

   refined-containers	Data.IntMap.Strict.Refined

   If the given key is in the map, update or delete it using the given function with a proof that the key was in the map; otherwise the map is unchanged. Alongside return the new value if it was updated, or the old value if it was deleted, and a proof that the key was in the map.

6. insertLookupWithKey :: forall s k a . Ord k => (Key s k -> a -> a -> a) -> k -> a -> Map s k a -> (Maybe (Key s k, a), SomeMapWith (InsertProof 'Regular k s) k a)

   refined-containers	Data.Map.Refined

   Insert a key-value pair into the map using a combining function, and if the key was already present, the old value is returned along with the proof that the key was present.

7. splitLookup :: forall s k a . Ord k => k -> Map s k a -> Some2MapWith (SplitProof 'Regular s (Key s k, a)) k a a

   refined-containers	Data.Map.Refined

   Return two disjoint submaps: those whose keys are less than the given key, and those whose keys are greater than the given key. If the key was in the map, also return the associated value and the proof that it was in the map.

8. updateLookupWithKey :: forall s k a . Ord k => (Key s k -> a -> Maybe a) -> k -> Map s k a -> (Maybe (Key s k, a), SomeMapWith (SupersetProof 'Regular s) k a)

   refined-containers	Data.Map.Refined

   If the given key is in the map, update or delete it using the given function with a proof that the key was in the map; otherwise the map is unchanged. Alongside return the new value if it was updated, or the old value if it was deleted, and a proof that the key was in the map.

9. insertLookupWithKey :: forall s k a . Ord k => (Key s k -> a -> a -> a) -> k -> a -> Map s k a -> (Maybe (Key s k, a), SomeMapWith (InsertProof 'Regular k s) k a)

   refined-containers	Data.Map.Strict.Refined

   Insert a key-value pair into the map using a combining function, and if the key was already present, the old value is returned along with the proof that the key was present.

10. splitLookup :: forall s k a . Ord k => k -> Map s k a -> Some2MapWith (SplitProof 'Regular s (Key s k, a)) k a a

    refined-containers	Data.Map.Strict.Refined

    Return two disjoint submaps: those whose keys are less than the given key, and those whose keys are greater than the given key. If the key was in the map, also return the associated value and the proof that it was in the map.

Page 252 of many | Previous | Next