Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. subsequences :: [a] -> [[a]]

   protolude	Protolude

   The subsequences function returns the list of all subsequences of the argument.

   Laziness

   subsequences does not look ahead unless it must:

   >>> take 1 (subsequences undefined)
   [[]]
   
   >>> take 2 (subsequences ('a' : undefined))
   ["","a"]
   

   Examples

   >>> subsequences "abc"
   ["","a","b","ab","c","ac","bc","abc"]
   

   This function is productive on infinite inputs:

   >>> take 8 $ subsequences ['a'..]
   ["","a","b","ab","c","ac","bc","abc"]
   

2. seq :: a -> b -> b

   protolude	Protolude.Base

   The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.

3. diffMapNoEq :: Ord k => Map k v -> Map k v -> Map k (Maybe v)

   reflex	Data.Map.Misc

   Produce a Map k (Maybe v) by comparing two Map k vs, old and new respectively. Just represents an association present in new and Nothing represents an association only present in old but no longer present in new. Similar to diffMap but doesn't require Eq on the values, thus can't tell if a value has changed or not.

4. sequenceDMapWithAdjust :: forall (k :: Type -> Type) t m . (GCompare k, Adjustable t m) => DMap k m -> Event t (PatchDMap k m) -> m (DMap k Identity, Event t (PatchDMap k Identity))

   reflex	Reflex.Adjustable.Class

   Traverse a DMap of Adjustable actions, running each of them. The provided Event of patches to the DMap can add, remove, or update values.

5. sequenceDMapWithAdjustWithMove :: forall (k :: Type -> Type) t m . (GCompare k, Adjustable t m) => DMap k m -> Event t (PatchDMapWithMove k m) -> m (DMap k Identity, Event t (PatchDMapWithMove k Identity))

   reflex	Reflex.Adjustable.Class

   Traverses a DMap of Adjustable actions, running each of them. The provided Event of patches to the DMap can add, remove, update, move, or swap values.

6. sequenceDMapWithAdjustEventWriterTWith :: forall t m p p' w k v v' . (Reflex t, MonadHold t m, Semigroup w, Patch (p' (Some k) (Event t w)), PatchTarget (p' (Some k) (Event t w)) ~ Map (Some k) (Event t w), GCompare k, Patch (p' (Some k) w), PatchTarget (p' (Some k) w) ~ Map (Some k) w) => ((forall a . () => k a -> v a -> m (Compose ((,) (Event t w)) v' a)) -> DMap k v -> Event t (p k v) -> EventWriterT t w m (DMap k (Compose ((,) (Event t w)) v'), Event t (p k (Compose ((,) (Event t w)) v')))) -> ((forall a . () => Compose ((,) (Event t w)) v' a -> v' a) -> p k (Compose ((,) (Event t w)) v') -> p k v') -> ((forall a . () => Compose ((,) (Event t w)) v' a -> Event t w) -> p k (Compose ((,) (Event t w)) v') -> p' (Some k) (Event t w)) -> (Incremental t (p' (Some k) (Event t w)) -> Event t (PatchTarget (p' (Some k) w))) -> (Event t (p' (Some k) (Event t w)) -> Event t (p' (Some k) w)) -> (forall a . () => k a -> v a -> EventWriterT t w m (v' a)) -> DMap k v -> Event t (p k v) -> EventWriterT t w m (DMap k v', Event t (p k v'))

   reflex	Reflex.EventWriter.Base

   Like runWithReplaceEventWriterTWith, but for sequenceDMapWithAdjust.

7. data RequesterData (f :: Type -> Type)

   reflex	Reflex.Requester.Base

   No documentation available.

8. data RequesterDataKey a

   reflex	Reflex.Requester.Base

   No documentation available.

9. newtype RequesterT t (request :: Type -> Type) (response :: Type -> Type) (m :: Type -> Type) a

   reflex	Reflex.Requester.Base

   A basic implementation of Requester.

10. RequesterT :: StateT (RequesterState t request) (ReaderT (EventSelectorInt t (Any :: Type)) m) a -> RequesterT t (request :: Type -> Type) (response :: Type -> Type) (m :: Type -> Type) a

    reflex	Reflex.Requester.Base

    No documentation available.

Page 356 of many | Previous | Next