Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. fromList :: (HashTable h, Hashable k) => [(k, v)] -> h RealWorld k v

   RefSerialize	Data.RefSerialize.Serialize

   No documentation available.

2. fromList :: MonadSearch m => [a] -> m a

   backtracking	Control.Monad.Search

   No documentation available.

3. fromList :: (C a, Storable a) => [KeyCount w a] -> T w a

   battleship-combinatorics	Combinatorics.Battleship.Count.CountMap

   No documentation available.

4. fromList :: [Use] -> T w

   battleship-combinatorics	Combinatorics.Battleship.Count.Frontier

   No documentation available.

5. fromList :: [(ShipSize, NumberOfShips)] -> T

   battleship-combinatorics	Combinatorics.Battleship.Fleet

   No documentation available.

6. fromList :: DomCodCnt l r => [(Dom l, Dom r)] -> Bimap l r

   bimaps	Data.Bijection.Class

   Given a list of pairs [(x,y)], turn it into a bimap (x->y, y->x).

7. fromList :: [a] -> Maybe (BinList a)

   binary-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, it returns Nothing.

8. fromList :: (a -> [Hash]) -> Int -> [a] -> Bloom a

   bloomfilter	Data.BloomFilter

   Create an immutable Bloom filter, populating it from a list of values. Here is an example that uses the cheapHashes function from the Data.BloomFilter.Hash module to create a hash function that returns three hashes.

   import Data.BloomFilter.Hash (cheapHashes)
   
   filt = fromList (cheapHashes 3) 1024 ["foo", "bar", "quux"]
   
   

9. fromList :: Enum a => T [] a -> T a

   board-games	Game.Mastermind.NonEmptyEnumSet

   No documentation available.

10. fromList :: Int -> [a] -> BQueue a

    bounded-queue	Data.Queue.Bounded

    Naively keeps the first <math> values of the input list (as defined by the given limiting Int value) and does not attempt any elegant queue-like cycling.

Page 27 of many | Previous | Next