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.

Exact lookup

1. fromListPrefix :: 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 input list is too short.

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

   >>> L.fromPull <$> fromListPrefix "quux" :: Maybe (L.Vec N.Nat3 Char)
   Just ('q' ::: 'u' ::: 'u' ::: VNil)
   

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

2. fromListWith :: (Interval k e, Ord k) => (a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Generic.Lazy

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

3. fromListWithKey :: (Interval k e, Ord k) => (k -> a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Generic.Lazy

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

4. fromListWith :: (Interval k e, Ord k) => (a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Generic.Strict

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

5. fromListWithKey :: (Interval k e, Ord k) => (k -> a -> a -> a) -> [(k, a)] -> IntervalMap k a

   IntervalMap	Data.IntervalMap.Generic.Strict

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

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

   IntervalMap	Data.IntervalMap.Lazy

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

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

   IntervalMap	Data.IntervalMap.Lazy

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

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

   IntervalMap	Data.IntervalMap.Strict

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

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

   IntervalMap	Data.IntervalMap.Strict

   O(n log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWith.

10. fromListEnd :: [a] -> Zipper a

    ListZipper	Data.List.Zipper

    fromListEnd xs returns a zipper containing the elements of xs, focused just off the right end of the list.

Page 62 of many | Previous | Next