Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

  1. data OSet a

    ordered-containers Data.Set.Ordered

    No documentation available.

  2. toSet :: OSet a -> Set a

    ordered-containers Data.Set.Ordered

    Convert an OSet to a Set. O(n), where n is the size of the OSet.

  3. applyMapKeysSet :: Ord k => Map k (Maybe v) -> Set k -> Set k

    reflex Data.Map.Misc

    Given a Map k (Maybe v) representing keys to insert/update (Just) or delete (Nothing), produce a new Set k from the given input set. Equivalent to: 

    applyMapKeysSet patch (keysSet m) == keysSet (applyMap patch m)
    but avoids the intervening Map and needs no values.

  4. posByteOffset :: Pos -> !Int

    HsYAML Data.YAML

    0-based byte offset

  5. posCharOffset :: Pos -> !Int

    HsYAML Data.YAML

    0-based character (Unicode code-point) offset

  6. posByteOffset :: Pos -> !Int

    HsYAML Data.YAML.Event

    0-based byte offset

  7. posCharOffset :: Pos -> !Int

    HsYAML Data.YAML.Event

    0-based character (Unicode code-point) offset

  8. tByteOffset :: Token -> !Int

    HsYAML Data.YAML.Token

    0-base byte offset in stream.

  9. tCharOffset :: Token -> !Int

    HsYAML Data.YAML.Token

    0-base character offset in stream.

  10. module Data.EnumBitSet

    Similar to Data.Edison.Coll.EnumSet but it allows to choose the underlying type for bit storage. This is really a low-level module for type-safe foreign function interfaces. The integer representation of the enumeration type is the bit position of the flag within the bitvector.

Page 116 of many | Previous | Next