Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. data SList (a :: [k])

    sop-core Data.SOP

    Explicit singleton list. A singleton list can be used to reveal the structure of a type-level list argument that the function is quantified over. For every type-level list xs, there is one non-bottom value of type SList xs. Note that these singleton lists are polymorphic in the list elements; we do not require a singleton representation for them.

  2. cpara_SList :: All c xs => proxy c -> r ('[] :: [k]) -> (forall (y :: k) (ys :: [k]) . (c y, All c ys) => r ys -> r (y ': ys)) -> r xs

    sop-core Data.SOP

    Constrained paramorphism for a type-level list. The advantage of writing functions in terms of cpara_SList is that they are then typically not recursive, and can be unfolded statically if the type-level list is statically known.

  3. lengthSList :: forall k (xs :: [k]) proxy . SListI xs => proxy xs -> Int

    sop-core Data.SOP

    The length of a type-level list.

  4. type family SListIN (h :: k -> Type -> l -> Type) :: l -> Constraint

    sop-core Data.SOP.Constraint

    A generalization of SListI. The family SListIN expands to SListI or SListI2 depending on whether the argument is indexed by a list or a list of lists.

  5. cpara_SList :: All c xs => proxy c -> r ('[] :: [k]) -> (forall (y :: k) (ys :: [k]) . (c y, All c ys) => r ys -> r (y ': ys)) -> r xs

    sop-core Data.SOP.Constraint

    Constrained paramorphism for a type-level list. The advantage of writing functions in terms of cpara_SList is that they are then typically not recursive, and can be unfolded statically if the type-level list is statically known.

  6. data SList (a :: [k])

    sop-core Data.SOP.Sing

    Explicit singleton list. A singleton list can be used to reveal the structure of a type-level list argument that the function is quantified over. For every type-level list xs, there is one non-bottom value of type SList xs. Note that these singleton lists are polymorphic in the list elements; we do not require a singleton representation for them.

  7. lengthSList :: forall k (xs :: [k]) proxy . SListI xs => proxy xs -> Int

    sop-core Data.SOP.Sing

    The length of a type-level list.

  8. fromAscListWithKey :: GEq k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> DMap k2 f

    dependent-map Data.Dependent.Map

    O(n). Build a map from an ascending list in linear time with a combining function for equal keys. The precondition (input list is ascending) is not checked.

  9. fromListWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> DMap k2 f

    dependent-map Data.Dependent.Map

    O(n*log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey.

  10. toList :: Ord a => Heap a b -> [(a, b)]

    fgl Data.Graph.Inductive.Internal.Heap

    No documentation available.

Page 80 of many | Previous | Next