ZkFold.Symbolic.Data.Ord

Documentation

class Ord b a where

Methods

(<=) :: a -> a -> b

(<) :: a -> a -> b

(>=) :: a -> a -> b

(>) :: a -> a -> b

max :: a -> a -> a

min :: a -> a -> a

Instances

Ord a => Ord Bool a

Defined in ZkFold.Symbolic.Data.Ord

Methods

(<=) :: a -> a -> Bool

(<) :: a -> a -> Bool

(>=) :: a -> a -> Bool

(>) :: a -> a -> Bool

max :: a -> a -> a

min :: a -> a -> a

Symbolic c => Ord (Bool c) (FieldElement c)

Defined in ZkFold.Symbolic.Data.FieldElement

Methods

(<=) :: FieldElement c -> FieldElement c -> Bool c

(<) :: FieldElement c -> FieldElement c -> Bool c

(>=) :: FieldElement c -> FieldElement c -> Bool c

(>) :: FieldElement c -> FieldElement c -> Bool c

max :: FieldElement c -> FieldElement c -> FieldElement c

min :: FieldElement c -> FieldElement c -> FieldElement c

(Symbolic c, Representable f, Traversable f) => Ord (Bool c) (c f)

Every SymbolicData type can be compared lexicographically.

Defined in ZkFold.Symbolic.Data.Ord

Methods

(<=) :: c f -> c f -> Bool c

(<) :: c f -> c f -> Bool c

(>=) :: c f -> c f -> Bool c

(>) :: c f -> c f -> Bool c

max :: c f -> c f -> c f

min :: c f -> c f -> c f

(Symbolic c, KnownNat n, KnownRegisterSize r, KnownRegisters c n r, regSize ~ GetRegisterSize (BaseField c) n r, KnownNat (Ceil regSize OrdWord)) => Ord (Bool c) (UInt n r c)

Defined in ZkFold.Symbolic.Data.UInt

Methods

(<=) :: UInt n r c -> UInt n r c -> Bool c

(<) :: UInt n r c -> UInt n r c -> Bool c

(>=) :: UInt n r c -> UInt n r c -> Bool c

(>) :: UInt n r c -> UInt n r c -> Bool c

max :: UInt n r c -> UInt n r c -> UInt n r c

min :: UInt n r c -> UInt n r c -> UInt n r c

blueprintGE :: forall r i a w m f. (Arithmetic a, MonadCircuit i a w m, Zip f, Foldable f, KnownNat r) => f i -> f i -> m i

bitwiseGE :: forall r c f. (Symbolic c, Zip f, Foldable f, KnownNat r) => c f -> c f -> Bool c

Given two lists of bits of equal length, compares them lexicographically.

bitwiseGT :: forall r c f. (Symbolic c, Zip f, Foldable f, KnownNat r) => c f -> c f -> Bool c

Given two lists of bits of equal length, compares them lexicographically.

getBitsBE :: forall c x. (SymbolicOutput x, Context x ~ c) => x -> c List

getBitsBE x returns a list of circuits computing bits of x, eldest to youngest.