Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. (&&!=) :: MonadState s m => Setter' s Bool -> Bool -> m ()

    lens-family Lens.Family2.State.Strict

    No documentation available.

  2. (&&=) :: MonadState s m => Setter' s Bool -> Bool -> m ()

    lens-family Lens.Family2.State.Strict

    No documentation available.

  3. (&*&) :: (C u, C v, C a) => T u a -> T v a -> T (Mul u v) a

    numeric-prelude Number.DimensionTerm

    No documentation available.

  4. (&/&) :: (C u, C v, C a) => T u a -> T v a -> T (Mul u (Recip v)) a

    numeric-prelude Number.DimensionTerm

    No documentation available.

  5. (&&~) :: Valuable Bool -> Valuable Bool -> Valuable Bool

    numeric-prelude Number.Peano

    Compute (&&) with minimal costs.

  6. (&&) :: Bool -> Bool -> Bool

    numeric-prelude NumericPrelude

    Boolean "and", lazy in the second argument

  7. (&&) :: Bool -> Bool -> Bool

    numeric-prelude NumericPrelude.Base

    Boolean "and", lazy in the second argument

  8. (&&) :: Bool -> Bool -> Bool

    numhask NumHask.Prelude

    Boolean "and", lazy in the second argument

  9. (&%>) :: Located => [FilePattern] -> ([FilePath] -> Action ()) -> Rules ()

    shake Development.Shake

    Define a rule for building multiple files at the same time. Think of it as the AND (&&) equivalent of %>. As an example, a single invocation of GHC produces both .hi and .o files:

    ["*.o","*.hi"] &%> \[o,hi] -> do
    let hs = o -<.> "hs"
    need ... -- all files the .hs import
    cmd "ghc -c" [hs]
    
    However, in practice, it's usually easier to define rules with %> and make the .hi depend on the .o. When defining rules that build multiple files, all the FilePattern values must have the same sequence of // and * wildcards in the same order. This function will create directories for the result files, if necessary.

  10. (&?>) :: Located => (FilePath -> Maybe [FilePath]) -> ([FilePath] -> Action ()) -> Rules ()

    shake Development.Shake

    Define a rule for building multiple files at the same time, a more powerful and more dangerous version of &%>. Think of it as the AND (&&) equivalent of ?>. Given an application test &?> ..., test should return Just if the rule applies, and should return the list of files that will be produced. This list must include the file passed as an argument and should obey the invariant:

    forAll $ \x ys -> test x == Just ys ==> x `elem` ys && all ((== Just ys) . test) ys
    
    Intuitively, the function defines a set partitioning, mapping each element to the partition that contains it. As an example of a function satisfying the invariant:
    test x | takeExtension x `elem` [".hi",".o"]
    = Just [dropExtension x <.> "hi", dropExtension x <.> "o"]
    test _ = Nothing
    
    Regardless of whether Foo.hi or Foo.o is passed, the function always returns [Foo.hi, Foo.o].

Page 13 of many | Previous | Next