expr

package

v0.14.0 Latest Latest Go to latest Published: Aug 22, 2025 License: Apache-2.0 Imports: 3 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type LinearExpression[E constraint.Element] []Term[E]

func NewLinearExpression[E constraint.Element](vID int, cID E) LinearExpression[E]

NewLinearExpression helper to initialize a linear expression with one term

func (l LinearExpression[E]) Clone() LinearExpression[E]

func (l LinearExpression[E]) Equal(o LinearExpression[E]) bool

Equals returns true if both SORTED expressions are the same

pre conditions: l and o are sorted

func (l LinearExpression[E]) HashCode() [16]byte

HashCode returns a collision-resistant identifier of the linear expression. It is constructed from the hash codes of the terms.

func (l LinearExpression[E]) Len() int

Len return the length of the Variable (implements Sort interface)

func (l LinearExpression[E]) Less(i, j int) bool

Less returns true if variableID for term at i is less than variableID for term at j (implements Sort interface)

func (l LinearExpression[E]) Swap(i, j int)

Swap swaps terms in the Variable (implements Sort interface)

type Term[E constraint.Element] struct {
	VID   int
	Coeff E
}

func NewTerm[E constraint.Element](vID int, cID E) Term[E]

func (t Term[E]) HashCode() [16]byte

HashCode returns a collision resistant hash code identifier for the term.

func (t *Term[E]) SetCoeff(c E)

func (t Term[E]) WireID() int

TODO @gbotrel make that return a uint32