Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
toListF :: FoldableF t => (forall (tp :: k) . () => f tp -> a) -> t f -> [a]parameterized-utils Data.Parameterized.TraversableF Convert structure to list.
-
parameterized-utils Data.Parameterized.TraversableFC Convert structure to list.
-
parameterized-utils Data.Parameterized.TraversableFC.WithIndex Convert structure to list.
toList :: forall (n :: Natural) a . Vector n a -> [a]parameterized-utils Data.Parameterized.Vector Get the elements of the vector as a list, lowest index first.
-
An implementation of a zipper-like non-empty list structure that tracks an index position in the list (the focus).
-
pointedlist Data.List.PointedList The implementation of the pointed list structure which tracks the current position in the list structure.
PointedList :: [a] -> a -> [a] -> PointedList apointedlist Data.List.PointedList No documentation available.
fromList :: [a] -> Maybe (PointedList a)pointedlist Data.List.PointedList Possibly create a Just PointedList if the provided list has at least one element; otherwise, return Nothing. The provided list's head will be the focus of the list, and the rest of list will follow on the right side.
fromListEnd :: [a] -> Maybe (PointedList a)pointedlist Data.List.PointedList Possibly create a Just PointedList if the provided list has at least one element; otherwise, return Nothing. The provided list's last element will be the focus of the list, following the rest of the list in order, to the left.
-
pointedlist Data.List.PointedList.Circular The implementation of the pointed list structure which tracks the current position in the list structure.