Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. findJustDef :: a -> (a -> Bool) -> [a] -> a

   hledger	Hledger.Cli.Script

   No documentation available.

2. findJustNote :: Partial => String -> (a -> Bool) -> [a] -> a

   hledger	Hledger.Cli.Script

   No documentation available.

3. fmtAdjust :: FieldFormat -> Maybe FormatAdjustment

   hledger	Hledger.Cli.Script

   Kind of filling or padding to be done.

4. fromJustDef :: a -> Maybe a -> a

   hledger	Hledger.Cli.Script

   An alternative name for fromMaybe, to fit the naming scheme of this package. Generally using fromMaybe directly would be considered better style.

5. fromJustNote :: Partial => String -> Maybe a -> a

   hledger	Hledger.Cli.Script

   No documentation available.

6. lookupJust :: (Eq a, Partial) => a -> [(a, b)] -> b

   hledger	Hledger.Cli.Script

   lookupJust key = fromJust . lookup key
   

7. lookupJustDef :: Eq a => b -> a -> [(a, b)] -> b

   hledger	Hledger.Cli.Script

   No documentation available.

8. lookupJustNote :: (Partial, Eq a) => String -> a -> [(a, b)] -> b

   hledger	Hledger.Cli.Script

   No documentation available.

9. takingJusts :: forall a (m :: Type -> Type) . Monad m => MachineT m (Is (Maybe a)) a

   machines	Data.Machine.Process

   A Process that passes through elements unwrapped from Just until a Nothing is found, then stops. This can be constructed from a plan with

   takingJusts :: Process (Maybe a) a
   takingJusts = repeatedly $ await >>= maybe stop yield
   

   Examples:

   >>> run $ takingJusts <~ source [Just 1, Just 2, Nothing, Just 3, Just 4]
   [1,2]
   

10. adjust :: (Ord k, MonoidNull v) => (v -> v) -> k -> MonoidMap k v -> MonoidMap k v

    monoidmap	Data.MonoidMap

    Adjusts the value associated with the given key. Satisfies the following property:

    adjust f k m == set k (f (get k m)) m
    

Page 67 of many | Previous | Next