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. pattern VideoSuggestions_ProcessingWarningsItem_ProblematicHdrLookupTable :: VideoSuggestions_ProcessingWarningsItem

   gogol-youtube	Gogol.YouTube.Types

   Problematic HDR lookup table attached.

2. getDomainLookupEnd :: MonadDOM m => PerformanceResourceTiming -> m DOMHighResTimeStamp

   jsaddle-dom	JSDOM.Generated.PerformanceResourceTiming

   Mozilla PerformanceResourceTiming.domainLookupEnd documentation

3. getDomainLookupStart :: MonadDOM m => PerformanceResourceTiming -> m DOMHighResTimeStamp

   jsaddle-dom	JSDOM.Generated.PerformanceResourceTiming

   Mozilla PerformanceResourceTiming.domainLookupStart documentation

4. getDomainLookupEnd :: MonadDOM m => PerformanceTiming -> m Word64

   jsaddle-dom	JSDOM.Generated.PerformanceTiming

   Mozilla PerformanceTiming.domainLookupEnd documentation

5. getDomainLookupStart :: MonadDOM m => PerformanceTiming -> m Word64

   jsaddle-dom	JSDOM.Generated.PerformanceTiming

   Mozilla PerformanceTiming.domainLookupStart documentation

6. insertLookupWithKey :: forall s k a . Hashable k => (Key s k -> a -> a -> a) -> k -> a -> HashMap s k a -> (Maybe (Key s k, a), SomeHashMapWith (InsertProof 'Hashed k s) k a)

   refined-containers	Data.HashMap.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. updateLookupWithKey :: forall s k a . Hashable k => (Key s k -> a -> Maybe a) -> k -> HashMap s k a -> (Maybe (Key s k, a), SomeHashMapWith (SupersetProof 'Hashed s) k a)

   refined-containers	Data.HashMap.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.

8. insertLookupWithKey :: forall s k a . Hashable k => (Key s k -> a -> a -> a) -> k -> a -> HashMap s k a -> (Maybe (Key s k, a), SomeHashMapWith (InsertProof 'Hashed k s) k a)

   refined-containers	Data.HashMap.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.

9. updateLookupWithKey :: forall s k a . Hashable k => (Key s k -> a -> Maybe a) -> k -> HashMap s k a -> (Maybe (Key s k, a), SomeHashMapWith (SupersetProof 'Hashed s) k a)

   refined-containers	Data.HashMap.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.

10. 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.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.

Page 251 of many | Previous | Next