Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. HashMapValue :: HashMap Text AnyValue -> AnyValue

   hs-opentelemetry-api	OpenTelemetry.Internal.Common.Types

   No documentation available.

2. HashMapValue :: HashMap Text AnyValue -> AnyValue

   hs-opentelemetry-api	OpenTelemetry.LogAttributes

   No documentation available.

3. getAttributeMap :: LogAttributes -> (Int, HashMap Text AnyValue)

   hs-opentelemetry-api	OpenTelemetry.LogAttributes

   No documentation available.

4. HashMapValue :: HashMap Text AnyValue -> AnyValue

   hs-opentelemetry-api	OpenTelemetry.Logs.Core

   No documentation available.

5. data InsOrdHashMap k v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   HashMap which tries its best to remember insertion order of elements.

6. foldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> m

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

7. fromHashMap :: HashMap k v -> InsOrdHashMap k v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

8. hashMap :: forall k a b p f . (Profunctor p, Functor f) => p (HashMap k a) (f (HashMap k b)) -> p (InsOrdHashMap k a) (f (InsOrdHashMap k b))

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   This is a slight lie, as roundtrip doesn't preserve ordering.

9. toHashMap :: InsOrdHashMap k v -> HashMap k v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

10. unorderedFoldMap :: Monoid m => (a -> m) -> InsOrdHashMap k a -> m

    insert-ordered-containers	Data.HashMap.Strict.InsOrd

    More efficient than foldMap, when folding in insertion order is not important.

Page 522 of many | Previous | Next