h&j      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuv Safe-Inferred6 cond!A newtype wrapper that derives a ( instance from any type that is both a w instance and a x6 instance, such that boolean logic operations on the  wrapper correspond to bitwise logic operations on the inner type. It should be noted that  is defined as  0 and  is defined as  .In addition, a number of other classes are automatically derived from the inner type. These classes were chosen on the basis that many other w instances defined in base are also instances of these classes.cond8A boolean algebra regarded as a monoid under equivalence cond9A boolean algebra regarded as a monoid under exclusive or cond8A boolean algebra regarded as a monoid under conjunctioncond8A boolean algebra regarded as a monoid under disjunctioncondA class for boolean algebras. Instances of this class are expected to obey all the laws of  8https://en.wikipedia.org/wiki/Boolean_algebra_(structureboolean algebra).Minimal complete definition:  or ,  or (, ),  or .cond6Truth value, defined as the top of the bounded latticecond:False value, defined as the bottom of the bounded lattice.condLogical negation.condLogical conjunction. (infixr 3)cond)Logical inclusive disjunction. (infixr 2)cond)Logical exclusive disjunction. (infixr 1)condLogical implication. (infixr 1)cond!Logical biconditional. (infixr 1)cond*The logical conjunction of several values.cond*The logical disjunction of several values.cond2The negated logical conjunction of several values.  =  . cond2The negated logical disjunction of several values.  =  . condThe logical conjunction of the mapping of a function over several values. condThe logical disjunction of the mapping of a function over several values.ycondz for a group of exponent 2!condInjection from { into a boolean algebra.$condThe trivial boolean algebra%cond6Could be done via `deriving via` from GHC8.6.1 onwards&condPointwise boolean algebra.'cond6Could be done via `deriving via` from GHC8.6.1 onwards(cond6Could be done via `deriving via` from GHC8.6.1 onwards)cond6Could be done via `deriving via` from GHC8.6.1 onwards3cond8Opposite boolean algebra: exchanges true and false, and  and , etc"  !"!   32111 Safe-Inferred RcondConversion of values to {. Instances of R that are also  should obey the following laws: %p || q = if toBool p then true else q &p && q = if toBool p then q else falseTcondA simple conditional operatorUcondT with the { argument at the end (infixr 1).Vcond?A catamorphism (aka fold) for booleans. This is analogous to |, }, and . The first argument is the false case, the second argument is the true case, and the last argument is the predicate value.WcondLisp-style conditionals. If no conditions match, then a runtime exception is thrown. Here's a trivial example:  signum x = cond [(x > 0 , 1 ) ,(x < 0 , -1) ,(otherwise , 0 )] XcondAnalogous to the W function with a default value supplied, which will be used when no condition in the list is matched.Ycond)Lisp-style conditionals generalized over ~.. If no conditions match, then the result is . This is a safer variant of W.(Here's a highly contrived example using :   signum x = fromMaybe 0 . condPlus $ [(x > 0, 1 ) ,(x < 0, -1)] !Alternatively, you could use the n operator from Hoare's ternary conditional choice operator, like so:  signum x = 0 <| condPlus [(x > 0, 1 ) ,(x < 0, -1)] Zcond4Conditional composition. If the predicate is False,  is returned instead of the second argument. This function, for example, can be used to conditionally add functions to a composition chain.[condComposes a predicate function and 2 functions into a single function. The first function is called when the predicate yields True, the second when the predicate yields False.Note that after importing Control.Monad.Instances, [ becomes a special case of \.\condT lifted to  . Unlike  T, this is short-circuiting in the monad, such that only the predicate action and one of the remaining argument actions are executed.]cond%Lifted inclusive disjunction. Unlike  (), This function is short-circuiting in the monad. Fixity is the same as  (infixr 2).^condLifted conjunction. Unlike  (), this function is short-circuiting in the monad. Fixity is the same as  (infxr 3)._condLifted boolean negation.`cond%Lifted boolean exclusive disjunction.acondW lifted to 9. If no conditions match, a runtime exception is thrown.bcondY lifted to . If no conditions match, then  is returned.ccondA synonym for  .dcondGeneralization of econdGeneralization of fcondGeneralization of gcond A variant of e with a monadic predicate.hcond A variant of f with a monadic predicate.icond A variant of d with a monadic predicate.jcond[ lifted to .kcond1Conditional monoid operator. If the predicate is (, the second argument is replaced with 8. The fixity of this operator is one level higher than . It can also be used to chain multiple predicates together, like this: )even (length ls) ?<> not (null ls) ?<> lslcondAn operator that allows you to write C-style ternary conditionals of the form:  p ? t ?? fNote that parentheses are required in order to chain sequences of conditionals together. This is probably a good thing.mcondRight bracket of the conditional choice operator. If the predicate is  , returns , otherwise it returns  the right-hand argument.ncondLeft bracket of the conditional choice operator. This is equivalent to ocondA monadic variant of m.pcondA monadic variant of n.qcondUnicode rebinding of n. rcondUnicode rebinding of m.!RSTUVWXYZ[\]^_`abcdefghijklmnopqr!RSTUV\]^_`WXYabcZk[jlmnoprqdiegfh U1Z9 ]2^3k7l0m0n0o0p0q0r0         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxywz{|w}~www}w}www}w}w}w}w}w}ww cond-0.5.1-FZ3N2iKxsZ4LbYkzhHDePData.Algebra.BooleanControl.Conditional Data.Eithereither Control.MonadguardwhenunlessBitwisegetBitsOppgetOppEquivB getEquivBXorBgetXorBAllBgetAllBAnyBgetAnyBBooleantruefalsenot&&||xor--><-->andornandnorallanyfromBool $fBoolean(,,) $fBoolean(,) $fBoolean() $fBooleanEndo $fBooleanFUN $fBooleanDual $fBooleanAll $fBooleanAny $fBooleanBool $fMonoidAnyB$fSemigroupAnyB $fMonoidAllB$fSemigroupAllB $fMonoidXorB$fSemigroupXorB$fMonoidEquivB$fSemigroupEquivB $fBooleanOpp$fBooleanBitwise $fNumBitwise $fBitsBitwise $fEqBitwise $fOrdBitwise$fBoundedBitwise $fEnumBitwise $fShowBitwise $fReadBitwise $fRealBitwise$fIntegralBitwise $fDataBitwise $fIxBitwise$fStorableBitwise$fPrintfArgBitwise$fEqOpp$fOrdOpp $fShowOpp $fEqEquivB $fOrdEquivB $fShowEquivB$fEqXorB $fOrdXorB $fShowXorB$fEqAllB $fOrdAllB $fShowAllB$fEqAnyB $fOrdAnyB $fShowAnyBToBooltoBoolif'??boolcond condDefaultcondPlus?.selectifM<||><&&>notMxorMcondM condPlusM otherwiseMwhenMunlessMguardMselectM?<>?|><||>><<|⊲⊳ $fToBoolDual $fToBoolAll $fToBoolAny $fToBoolBoolbaseGHC.BitsBitsGHC.NumNum stimesPeriod2GHC.Basestimesghc-prim GHC.TypesBool Data.Foldablefoldr Data.Maybemaybe MonadPlusmzero fromMaybeControl.CategoryidMonadliftM3liftM2returnFalsemempty<>True GHC.MaybeNothingJust