Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromLists :: Context a => [[a]] -> Matrix amatrices Data.Matrix.Storable O(m*n) Create matrix from list of lists, it doesn't check if the list of list is a valid matrix
toList :: Context a => Matrix a -> [a]matrices Data.Matrix.Storable O(m*n) Create a list by concatenating rows
toLists :: Context a => Matrix a -> [[a]]matrices Data.Matrix.Storable O(m*n) List of lists
fromList :: Context a => (Int, Int) -> [a] -> Matrix amatrices Data.Matrix.Unboxed No documentation available.
fromLists :: Context a => [[a]] -> Matrix amatrices Data.Matrix.Unboxed O(m*n) Create matrix from list of lists, it doesn't check if the list of list is a valid matrix
toList :: Context a => Matrix a -> [a]matrices Data.Matrix.Unboxed O(m*n) Create a list by concatenating rows
toLists :: Context a => Matrix a -> [[a]]matrices Data.Matrix.Unboxed O(m*n) List of lists
fromList :: (Eq k, Hashable k) => [(k, a)] -> MonoidalHashMap k amonoidal-containers Data.HashMap.Monoidal O(n*log n). Construct a map with the supplied mappings. If the list contains duplicate mappings, values will be replaced.
fromListWith :: (Eq k, Hashable k) => (a -> a -> a) -> [(k, a)] -> MonoidalHashMap k amonoidal-containers Data.HashMap.Monoidal O(n*log n). Construct a map with the supplied mappings. If the list contains duplicate mappings, values will be merged using the provided combining function.
toList :: MonoidalHashMap k a -> [(k, a)]monoidal-containers Data.HashMap.Monoidal O(n*log n). Return a list of this map's elements. The list is produced lazily. The order of its elements is unspecified.