Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- class Ord b a where
- newtype Lexicographical a = Lexicographical a
- circuitGE :: Arithmetic a => [ArithmeticCircuit a] -> [ArithmeticCircuit a] -> Bool (ArithmeticCircuit a)
- circuitGT :: Arithmetic a => [ArithmeticCircuit a] -> [ArithmeticCircuit a] -> Bool (ArithmeticCircuit a)
- getBitsBE :: SymbolicData a x => x -> [ArithmeticCircuit a]
Documentation
Instances
newtype Lexicographical a Source #
A newtype wrapper for easy definition of Ord instances (though not necessarily a most effective one)
Instances
SymbolicData a x => SymbolicData a (Lexicographical x) Source # | |
Defined in ZkFold.Symbolic.Data.Ord pieces :: Lexicographical x -> [ArithmeticCircuit a] Source # restore :: [ArithmeticCircuit a] -> Lexicographical x Source # | |
SymbolicData a x => Ord (Bool (ArithmeticCircuit a)) (Lexicographical x) Source # | Every |
Defined in ZkFold.Symbolic.Data.Ord (<=) :: Lexicographical x -> Lexicographical x -> Bool (ArithmeticCircuit a) Source # (<) :: Lexicographical x -> Lexicographical x -> Bool (ArithmeticCircuit a) Source # (>=) :: Lexicographical x -> Lexicographical x -> Bool (ArithmeticCircuit a) Source # (>) :: Lexicographical x -> Lexicographical x -> Bool (ArithmeticCircuit a) Source # max :: Lexicographical x -> Lexicographical x -> Lexicographical x Source # min :: Lexicographical x -> Lexicographical x -> Lexicographical x Source # |
circuitGE :: Arithmetic a => [ArithmeticCircuit a] -> [ArithmeticCircuit a] -> Bool (ArithmeticCircuit a) Source #
Given two lists of bits of equal length, compares them lexicographically.
circuitGT :: Arithmetic a => [ArithmeticCircuit a] -> [ArithmeticCircuit a] -> Bool (ArithmeticCircuit a) Source #
Given two lists of bits of equal length, compares them lexicographically.
getBitsBE :: SymbolicData a x => x -> [ArithmeticCircuit a] Source #
getBitsBE x
returns a list of circuits computing bits of x
, eldest to
youngest.