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. maybeInjectExecutableHash :: FilePath -> IO ()

    executable-hash System.Executable.Hash.Internal

    Injects an executable hash into the specified binary. If it doesn't exist, then this prints a message to stdout indicating that it failed to inject the hash.

  2. maybeEq :: (a -> a -> Bool) -> Maybe a -> Maybe a -> Bool

    extrapolate Test.Extrapolate.Utils

    No documentation available.

  3. maybeOrd :: (a -> a -> Bool) -> Maybe a -> Maybe a -> Bool

    extrapolate Test.Extrapolate.Utils

    No documentation available.

  4. maybeError :: FitsError -> Maybe a -> Either String a

    fits-parse Data.Fits.Read

    No documentation available.

  5. maybeToFocus :: Maybe Int -> Focus

    focuslist Data.FocusList

    Convert a Maybe Int to a Focus. 

    >>> maybeToFocus (Just 100)
Focus 100

    >>> maybeToFocus Nothing
NoFocus
    maybeToFocus and getFocus witness an isomorphism. 
    focus == maybeToFocus (getFocus focus)

    maybeInt == getFocus (maybeToFocus maybeInt)
    complexity: O(1)

  6. maybeToEither :: e -> Maybe a -> Either e a

    from-sum Control.FromSum

    Convert a Maybe to an Either. If the Maybe is Just, then return the value in Right. 

    >>> maybeToEither 3 $ Just "hello"
Right "hello"
    If the Maybe is Nothing, then use the given e as Left. 
    >>> maybeToEither 3 Nothing
Left 3

  7. maybeToEitherOr :: Maybe a -> e -> Either e a

    from-sum Control.FromSum

    A fliped version of maybeToEither. 

    >>> maybeToEitherOr (Just "hello") 3
Right "hello"

    >>> maybeToEitherOr Nothing 3
Left 3

  8. maybeResult :: Result r -> Maybe r

    frontmatter Data.Frontmatter

    Convert a Result value to a Maybe value. A Partial result is treated as failure.

  9. maybeL :: Maybe a -> r -> (a -> r) -> r

    generic-case Generics.Case

    Same as maybe, except the Maybe comes before the case functions. Equivalent type signature: 

    maybeL :: forall a r. Analysis (Maybe a) r
    The implementation is just: 
    maybeL = gcase @(Maybe a)

  10. maybeR :: forall a r . r -> (a -> r) -> Maybe a -> r

    generic-case Generics.Case

    maybe, implemented using gcaseR. Equivalent type signature: 

    maybeR :: forall a r. AnalysisR (Maybe a) r
    The implementation is just: 
    maybeR = gcaseR @(Maybe a)

Page 51 of many | Previous | Next