Hoogle Search
Within LTS Haskell 24.25 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
fromListStorable :: (C a, Storable a) => [KeyCount w a] -> T w abattleship-combinatorics Combinatorics.Battleship.Count.CountMap No documentation available.
fromListDC :: DomCod z => [(Dom z, Cod z)] -> zbimaps Data.Bijection.Class No documentation available.
fromListSplit :: a -> Exponent -> [a] -> (BinList a, [a])binary-list Data.BinaryList O(n). Build a binary list from a linked list. It returns a binary list with length 2 ^ n (where n is the supplied Int argument), and the list of elements of the original list that were not used. If the input list is shorter than 2 ^ n, a default element will be used to complete the binary list. This method for building binary lists is faster than both fromList and fromListWithDefault.
fromListWithDefault :: a -> [a] -> BinList abinary-list Data.BinaryList O(n). Build a binary list from a linked list. If the input list has length different from a power of two, fill to the next power of two with a default element. Warning: this function crashes if the input list length is larger than any power of two in the type Int. However, this is very unlikely.
fromLists :: Enum a => [[T [] a]] -> T aboard-games Game.Mastermind.CodeSet.Union No documentation available.
fromListL :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A left-fold version of fromList. If you run into issues with stack overflows when using fromList or fromListR, then you should use this function instead.
fromListR :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience An explicitly right-fold variant of fromList. It is a good consumer for list fusion. Worst-case behavior is somewhat worse than worst-case for fromListL. The fromList function is currently just an alias for fromListR.
fromListS :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience This variant sorts the list before folding over it. This adds <math> overhead and requires the whole list be in memory at once, but it ensures that the list is in best-case order. The benefits generally outweigh the costs.