Hoogle Search
Within LTS Haskell 24.31 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
witness Data.Type.Witness.General.ListElement No documentation available.
fromLists :: (Ord i, Num i, Enum i, HasZero b) => Size i -> [[b]] -> Matrix i bAgda Agda.Termination.SparseMatrix fromLists sz rs constructs a matrix from a list of lists of values (a list of rows). O(size) where size = rows × cols. Precondition: length rs == rows sz and all ((cols sz ==) . length) rs.
fromListPrecondition :: (Eq k, Eq v, Eq (Tag v), HasTag v) => [(k, v)] -> BoolAgda Agda.Utils.BiMap No documentation available.
fromListN :: IsList l => Int -> [Item l] -> lAgda Agda.Utils.List1 The fromListN function takes the input list's length and potentially uses it to construct the structure l more efficiently compared to fromList. If the given number does not equal to the input list's length the behaviour of fromListN is not specified.
fromListN (length xs) xs == fromList xs
fromListSafe :: List1 a -> [a] -> List1 aAgda Agda.Utils.List1 Safe version of fromList.
fromList1 :: List1 a -> List2 aAgda Agda.Utils.List2 Unsafe! O(1).
fromList1Either :: List1 a -> Either a (List2 a)Agda Agda.Utils.List2 fromList1Maybe :: List1 a -> Maybe (List2 a)Agda Agda.Utils.List2 Safe. O(1).
fromListMaybe :: [a] -> Maybe (List2 a)Agda Agda.Utils.List2 Safe. O(1).
fromListExternal :: (C a, Storable a) => Int -> [KeyCount w a] -> IO (T w a)battleship-combinatorics Combinatorics.Battleship.Count.CountMap Create a CountMap from a large list of elements. Neither the argument nor the result needs to fit in memory. You only have to provide enough space on disk. The result is lazily read from a temporary file. That is, this file should neither be modified nor deleted while processing the result. Even more, fromListExternal must not be called again while processing the result. You may better choose writeSorted.