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.
toList :: Vector v a => v a -> [a]fixed-vector Data.Vector.Fixed Convert vector to the list
fromList :: forall (n :: PeanoNum) a . ArityPeano n => [a] -> ContVec n afixed-vector Data.Vector.Fixed.Cont Convert list to continuation-based vector. Will throw error if list is shorter than resulting vector.
fromList' :: forall (n :: PeanoNum) a . ArityPeano n => [a] -> ContVec n afixed-vector Data.Vector.Fixed.Cont Same as fromList bu throws error is list doesn't have same length as vector.
fromListM :: forall (n :: PeanoNum) a . ArityPeano n => [a] -> Maybe (ContVec n a)fixed-vector Data.Vector.Fixed.Cont Convert list to continuation-based vector. Will fail with Nothing if list doesn't have right length.
toList :: forall (n :: PeanoNum) a . ArityPeano n => ContVec n a -> [a]fixed-vector Data.Vector.Fixed.Cont Convert vector to the list
-
greskell-core Data.Greskell.GMap parseUnwrapList :: (IsList a, i ~ Item a, FromGraphSON i) => GValue -> Parser agreskell-core Data.Greskell.GraphSON Extract GArray from the given GValue, parse the items in the array, and gather them by fromList. Useful to implement FromGraphSON instances for IsList types.
fromList :: Ord a => [a] -> Heap aheaps Data.Heap O(n). Build a heap from a list of values.
fromList . toList ≡ id toList . fromList ≡ sort
toUnsortedList :: Heap a -> [a]heaps Data.Heap O(n). Returns the elements in the heap in some arbitrary, very likely unsorted, order.
>>> toUnsortedList (fromList [3,1,2]) [1,3,2]
fromList . toUnsortedList ≡ id
-
No documentation available.