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. type OrderedMapRow a = OMap a a

    csv-conduit Data.CSV.Conduit.Types

    An OrderedMapRow is a dictionary based on Ordered where column names are keys and row's individual cell values are the values of the OMap. Unlike MapRow, OrderedMapRow preserves the insertion ordering of columns. OrderedMapRow is a reasonable default in most cases.

  2. genMapCursorBy :: Gen kc -> Gen vc -> Gen k -> Gen v -> Gen (MapCursor kc vc k v)

    cursor-gen Cursor.Map.Gen

    No documentation available.

  3. genMapCursorByDependent :: Gen (kc, v) -> Gen (k, vc) -> Gen (k, v) -> Gen (MapCursor kc vc k v)

    cursor-gen Cursor.Map.Gen

    No documentation available.

  4. trustMap :: (v -> v) -> Checked p v -> Checked p v

    data-checked Data.Checked

    Apply a fuction that preserves the property to the checked value.

  5. trustMap :: p -> (v -> v) -> Checked p v -> Checked p v

    data-checked Data.Checked.Strict

    Apply a fuction that preserves the property to the checked value. Note that p is evaluated to WHNF, so you can't use undefined.

  6. data IntervalMap r a

    data-interval Data.IntervalMap.Lazy

    A Map from non-empty, disjoint intervals over k to values a. Unlike IntervalSet, IntervalMap never merge adjacent mappings, even if adjacent intervals are connected and mapped to the same value.

  7. isProperSubmapOf :: (Ord k, Eq a) => IntervalMap k a -> IntervalMap k a -> Bool

    data-interval Data.IntervalMap.Lazy

    Is this a proper submap? (ie. a submap but not equal). Defined as (isProperSubmapOf = isProperSubmapOfBy (==)).

  8. isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> IntervalMap k a -> IntervalMap k b -> Bool

    data-interval Data.IntervalMap.Lazy

    Is this a proper submap? (ie. a submap but not equal). The expression (isProperSubmapOfBy f m1 m2) returns True when m1 and m2 are not equal, all keys in m1 are in m2, and when f returns True when applied to their respective values.

  9. isSubmapOf :: (Ord k, Eq a) => IntervalMap k a -> IntervalMap k a -> Bool

    data-interval Data.IntervalMap.Lazy

    This function is defined as (isSubmapOf = isSubmapOfBy (==)).

  10. isSubmapOfBy :: Ord k => (a -> b -> Bool) -> IntervalMap k a -> IntervalMap k b -> Bool

    data-interval Data.IntervalMap.Lazy

    The expression (isSubmapOfBy f t1 t2) returns True if all keys in t1 are in tree t2, and when f returns True when applied to their respective values.

Page 1144 of many | Previous | Next