Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. fromList :: SmallSetElement a => [a] -> SmallSet a

    Agda Agda.Utils.SmallSet

    Time O(n).

  2. fromList :: [Key] -> IntSet

    Agda Agda.Utils.VarSet

    Create a set from a list of integers.

  3. fromList :: [(Key, v)] -> KeyMap v

    Blammo Data.Aeson.Compat

    Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence. 

    >>> fromList [("a", 'x'), ("a", 'y')]
fromList [("a",'y')]

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

    RefSerialize Data.RefSerialize.Serialize

    No documentation available.

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

    backtracking Control.Monad.Search

    No documentation available.

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

    battleship-combinatorics Combinatorics.Battleship.Count.CountMap

    No documentation available.

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

    battleship-combinatorics Combinatorics.Battleship.Count.Frontier

    No documentation available.

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

    battleship-combinatorics Combinatorics.Battleship.Fleet

    No documentation available.

  9. 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).

  10. 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.

Page 27 of many | Previous | Next