forked from Consensys/gnark
-
Notifications
You must be signed in to change notification settings - Fork 0
/
term.go
64 lines (53 loc) · 1.52 KB
/
term.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
// Copyright 2020 ConsenSys AG
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package constraint
import (
"math"
)
// ids of the coefficients with simple values in any cs.coeffs slice.
const (
CoeffIdZero = iota
CoeffIdOne
CoeffIdTwo
CoeffIdMinusOne
CoeffIdMinusTwo
)
// Term represents a coeff * variable in a constraint system
type Term struct {
CID, VID uint32
}
func (t *Term) MarkConstant() {
t.VID = math.MaxUint32
}
func (t *Term) IsConstant() bool {
return t.VID == math.MaxUint32
}
func (t *Term) WireID() int {
return int(t.VID)
}
func (t *Term) CoeffID() int {
return int(t.CID)
}
func (t Term) String(r Resolver) string {
sbb := NewStringBuilder(r)
sbb.WriteTerm(t)
return sbb.String()
}
// implements constraint.Compressible
// Compress compresses the term into a slice of uint32 words.
// For compatibility with test engine and LinearExpression, the term is encoded as:
// 1, CID, VID (i.e a LinearExpression with a single term)
func (t Term) Compress(to *[]uint32) {
(*to) = append((*to), 1, t.CID, t.VID)
}