xor -is:package

xor :: Bits a => a -> a -> a
base Data.Bits GHC.Bits, protolude Protolude, relude Relude.Numeric, base-prelude BasePrelude, universum Universum.Base, foundation Foundation.Bits, ghc-lib-parser GHC.Prelude.Basic, ghc-internal GHC.Internal.Bits GHC.Internal.Data.Bits, rebase Rebase.Prelude, incipit-base Incipit.Base
Bitwise "xor"
xor :: NonEmpty Bool -> Bool
base Data.List.NonEmpty, base-compat Data.List.NonEmpty.Compat, rio RIO.NonEmpty, base-compat-batteries Data.List.NonEmpty.Compat, Agda Agda.Utils.List1
Compute n-ary logic exclusive OR operation on NonEmpty list.
xor :: Bits a => a -> a -> a
ghc GHC.Prelude.Basic
xor :: (ByteArrayAccess a, ByteArrayAccess b, ByteArray c) => a -> b -> c
memory Data.ByteArray
Create a xor of bytes between a and b. the returns byte array is the size of the smallest input.
xor :: forall n a b c . (ByteArrayN n a, ByteArrayN n b, ByteArrayN n c, ByteArrayAccess a, ByteArrayAccess b, KnownNat n) => a -> b -> c
memory Data.ByteArray.Sized
Create a xor of bytes between a and b. the returns byte array is the size of the smallest input.
xor :: MaskComposite
clay Clay Clay.Mask
xor :: Boolean b => b -> b -> b
cond Data.Algebra.Boolean
Logical exclusive disjunction. (infixr 1)
xor :: BV w -> BV w -> BV w
bv-sized Data.BitVector.Sized
Bitwise xor.
xor :: (Enum a, Bits w) => T w a -> T w a -> T w a
enumset Data.EnumBitSet
xor :: [Term] -> Term
what4 What4.Protocol.SMTLib2.Syntax
Xor of all terms
xor :: BVDomain w -> BVDomain w -> BVDomain w
what4 What4.Utils.BVDomain
xor :: Domain w -> Domain w -> Domain w
what4 What4.Utils.BVDomain.Bitwise What4.Utils.BVDomain.XOR
xor :: Key -> Nonce -> ByteString -> ByteString
saltine Crypto.Saltine.Core.Stream
Computes the exclusive-or between a message and a cryptographic random stream indexed by the Key and the Nonce. This renders the output indistinguishable from random noise so long as the Nonce is not used more than once. Note: while this can be used for encryption and decryption, it is possible for an attacker to manipulate the message in transit without detection. USE AT YOUR OWN RISK.
xor :: Stream Bool -> Stream Bool -> Stream Bool
copilot-language Copilot.Language.Operators.Boolean
Apply the exclusive-or (xor) operator to two boolean streams, point-wise.
xor :: Wrd n -> Wrd n -> Wrd n
bin Data.Wrd
xor :: Counter -> Int -> IO Int
atomic-counter Control.Concurrent.Counter Control.Concurrent.Counter.Lifted.IO
Atomically combine old value with a new one via bitwise xor. Returns old counter value.
xor :: Counter s -> Int -> ST s Int
atomic-counter Control.Concurrent.Counter.Lifted.ST
Atomically combine old value with a new one via bitwise xor. Returns old counter value.
xor :: Counter s -> Int# -> State# s -> (# State# s, Int# #)
atomic-counter Control.Concurrent.Counter.Unlifted
Atomically combine old value with a new one via bitwise xor. Returns old counter value.
xor :: Boolean b => b -> b -> b
ersatz Ersatz.Bit
Exclusive-or
xor :: (Boolean b, Generic b, GBoolean (Rep b)) => b -> b -> b
ersatz Ersatz.Bit
Exclusive-or
xor :: C bits => bits -> bits -> bits
set-cover Math.SetCover.Bit
newtype Xor a
base Data.Bits
Monoid under bitwise XOR. 
>>> getXor (Xor 0xab <> Xor 0x12) :: Word8
185
Xor :: a -> Xor a
base Data.Bits
XOR :: Reg -> Reg -> RI -> Instr
ghc GHC.CmmToAsm.PPC.Instr
XOR :: Operand -> Operand -> Operand -> Instr
ghc GHC.CmmToAsm.RV64.Instr
XOR (integer only) 
rd = rn ⊕ op2