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.
-
xmonad XMonad No documentation available.
windowBracket :: (a -> Bool) -> X a -> X axmonad XMonad.Operations Perform an X action and check its return value against a predicate p. If p holds, unwind changes to the WindowSet and replay them using windows.
windowBracket_ :: X Any -> X ()xmonad XMonad.Operations Perform an X action. If it returns Any True, unwind the changes to the WindowSet and replay them using windows. This is a version of windowBracket that discards the return value and handles an X action that reports its need for refresh via Any.
IdiomBracketError_ :: ErrorNameAgda Agda.Interaction.Options.Errors No documentation available.
IdiomBrackets :: Range -> [Expr] -> ExprAgda Agda.Syntax.Concrete ex: (| e1 | e2 | .. | en |) or (|)
appBrackets :: PrecedenceStack -> BoolAgda Agda.Syntax.Fixity Does a function application need brackets?
appBrackets' :: Bool -> PrecedenceStack -> BoolAgda Agda.Syntax.Fixity Does a function application need brackets?
lamBrackets :: PrecedenceStack -> BoolAgda Agda.Syntax.Fixity Does a lambda-like thing (lambda, let or pi) need brackets in the given context? A peculiar thing with lambdas is that they don't need brackets in certain right operand contexts. To decide we need to look at the stack of precedences and not just the current precedence. Example: m₁ >>= (λ x → x) >>= m₂ (for _>>=_ left associative).
opBrackets :: Fixity -> PrecedenceStack -> BoolAgda Agda.Syntax.Fixity Do we need to bracket an operator application of the given fixity in a context with the given precedence.
opBrackets' :: Bool -> Fixity -> PrecedenceStack -> BoolAgda Agda.Syntax.Fixity Do we need to bracket an operator application of the given fixity in a context with the given precedence.