Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. mapMaybe :: (a -> Maybe b) -> UniqMap a -> UniqMap b

   clash-lib	Clash.Data.UniqMap

   Apply a function to all elements in the map, keeping those where the result is not Nothing.

2. parseMaybeSingle :: (Char -> Bool) -> Text -> Maybe Text

   clash-lib	Clash.Netlist.Id.Common

   No documentation available.

3. isVoidMaybe :: Bool -> Maybe HWType -> Bool

   clash-lib	Clash.Netlist.Util

   No documentation available.

4. deconstructMaybe :: (HasCallStack, Backend backend) => TExpr -> (Text, Text) -> State (BlockState backend) (TExpr, TExpr)

   clash-lib	Clash.Primitives.DSL

   Deconstruct a Maybe into its constructor Bit and contents of its Just field. Note that the contents might be undefined, if the constructor bit is set to Nothing.

5. hoistMaybe :: forall (m :: Type -> Type) b . Applicative m => Maybe b -> MaybeT m b

   clash-lib	Clash.Util

   Convert a Maybe computation to MaybeT.

6. mapMaybeEdgeKeys :: (Edge e1, Ord n) => (e0 n -> Maybe (e1 n)) -> Graph e0 n el nl -> Graph e1 n el nl

   comfort-graph	Data.Graph.Comfort

   You may only use this for filtering edges and use more specialised types as a result. You must not alter source and target nodes of edges.

7. fuseBothMaybe :: forall (m :: Type -> Type) a b u v c r . Monad m => Pipe a b u m v -> Pipe b c v m r -> Pipe a c u m (Maybe v, r)

   conduino	Data.Conduino

   Like fuseBoth and &|, except does not wait for the upstream pipe to terminate. Return Nothing in the first field if the upstream pipe hasn't terminated, and Just if it has, with the terminating value.

8. iterateMaybe :: forall o i u (m :: Type -> Type) . (o -> Maybe o) -> o -> Pipe i o u m ()

   conduino	Data.Conduino.Combinators

   A version of iterate that can choose to terminate and stop by returning Nothing.

9. repeatMaybeM :: Monad m => m (Maybe o) -> Pipe i o u m ()

   conduino	Data.Conduino.Combinators

   Repeat a monadic action, yielding the item in the Just every time. As soon as it sees Nothing, stop producing forever. Remember that each item will only be "executed" when something downstream requests output.

10. unfoldMaybe :: forall s o i u (m :: Type -> Type) . (s -> Maybe (o, s)) -> s -> Pipe i o u m ()

    conduino	Data.Conduino.Combinators

    A version of unfold that can terminate and end by returning Nothing.

Page 270 of many | Previous | Next