Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. fromListReversed :: [a] -> List a

    strict-list StrictList

    Construct from a lazy list in reversed order.

  2. fromListBE :: Bits b => [Bool] -> b

    bitwise Data.Bits.Bitwise

    Convert a big-endian list of bits to Bits.

  3. fromListLE :: Bits b => [Bool] -> b

    bitwise Data.Bits.Bitwise

    Convert a little-endian list of bits to Bits.

  4. fromListWith :: CryptHandle -> (v -> v -> v) -> [(Bytes, v)] -> IO (Map v)

    bytehash Data.Bytes.HashMap

    No documentation available.

  5. fromListWith :: CryptHandle -> (Word -> Word -> Word) -> [(Bytes, Word)] -> IO Map

    bytehash Data.Bytes.HashMap.Word

    No documentation available.

  6. fromListWithDef :: forall (v :: Type -> Type) a . Vector v a => a -> [a] -> Chimera v a

    chimera Data.Chimera

    Create a stream of values from a given prefix, followed by default value afterwards.

  7. fromList' :: IndexedListLiterals input length output => [output] -> input

    indexed-list-literals Data.IndexedListLiterals

    a partial fromList with bad error messages

  8. fromListP :: forall input (length :: Nat) output len . (KnownNat length, ILL input length output) => len length -> [output] -> Maybe input

    indexed-list-literals Data.IndexedListLiterals

    the fromList variants take a list and convert it into a tuple it's sort of the inverse of toList 

    > fromListP (len @3) [1,2,3]
Just (1,2,3)

    > fromListP (len @3) ["word","up"]
Nothing

    > fromListP (len @1) ['z']
Just (Only 'z') @

  9. fromListBalanced :: [a] -> AList a

    monad-par-extras Control.Monad.Par.AList

    Convert an ordinary list, but do so using Append and ASing rather than AList

  10. fromListWith :: (Ord k, MonoidNull v) => (v -> v -> v) -> [(k, v)] -> MonoidMap k v

    monoidmap-internal Data.MonoidMap.Internal

    Constructs a MonoidMap from a list of key-value pairs, with a combining function for values. If the list contains more than one value for the same key, values are combined together in the order that they appear with the given combining function. Satisfies the following property for all possible keys k: 

    get k (fromListWith f kvs) ==
maybe mempty (foldl1 f)
(nonEmpty (snd <$> filter ((== k) . fst) kvs))

Page 53 of many | Previous | Next