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.
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.
fromListWith :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListR that takes a function for combining values on conflict. The first argument to the combining function is the "new" value from the initial portion of the list; the second argument is the value that has been accumulated into the trie from the tail of the list (just like the first argument to foldr). Thus, fromList = fromListWith const.
fromListWith' :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListWith which applies the combining function strictly. This function is a good consumer for list fusion. If you need list fusion and are running into stack overflow problems with fromListWith, then this function may solve the problem.