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 :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

    vec Data.Vec.Pull

    Convert list [a] to Vec n a. Returns Nothing if lengths don't match exactly. 

    >>> L.fromPull <$> fromList "foo" :: Maybe (L.Vec N.Nat3 Char)
Just ('f' ::: 'o' ::: 'o' ::: VNil)

    >>> L.fromPull <$> fromList "quux" :: Maybe (L.Vec N.Nat3 Char)
Nothing

    >>> L.fromPull <$> fromList "xy" :: Maybe (L.Vec N.Nat3 Char)
Nothing

  2. fromList :: [String] -> Trie

    word-trie Data.Trie

    Take a list of String and compress it into a Trie

  3. fromList :: forall ik k v . (Ord k, Ord ik, Enum ik, Bounded ik) => Proxy ik -> [(NonEmpty k, v)] -> MKMap k v

    yarn-lock Data.MultiKeyedMap

    Build a map from a list of key/value pairs.

  4. fromList :: [(BS, a)] -> Trie a

    zenacy-html Zenacy.HTML.Internal.Trie

    Creates a trie from a list of tuples containing key and value.

  5. fromList :: (a -> a -> Ordering) -> (a -> Val) -> [a] -> FTree a

    FenwickTree Data.Tree.Fenwick

    Creates a tree from a list and helper functions: compare, and value.

  6. fromList :: (Interval k e, Ord k) => [(k, v)] -> IntervalMap k v

    IntervalMap Data.IntervalMap.Generic.Lazy

    O(n log n). Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained.

  7. fromList :: (Interval k e, Ord k) => [(k, v)] -> IntervalMap k v

    IntervalMap Data.IntervalMap.Generic.Strict

    O(n log n). Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained.

  8. fromList :: (Interval k e, Ord k) => [(k, v)] -> IntervalMap k v

    IntervalMap Data.IntervalMap.Lazy

    O(n log n). Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained.

  9. fromList :: (Interval k e, Ord k) => [(k, v)] -> IntervalMap k v

    IntervalMap Data.IntervalMap.Strict

    O(n log n). Build a map from a list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained.

  10. fromList :: (Interval k e, Ord k) => [k] -> IntervalSet k

    IntervalMap Data.IntervalSet

    O(n log n). Build a set from a list of elements. See also fromAscList. If the list contains duplicate values, the last value is retained.

Page 36 of many | Previous | Next