Skip to content

Commit 49207c2

Browse files
committed
rename to evaluate
1 parent 7dd0bdf commit 49207c2

3 files changed

Lines changed: 9 additions & 9 deletions

File tree

build/main.cjs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -822,7 +822,7 @@ class PolField {
822822
return v;
823823
}
824824

825-
eval1(p,x) {
825+
evaluate(p,x) {
826826
const F = this.F;
827827
if (p.length == 0) return F.zero;
828828
const m = this._next2Power(p.length);
@@ -853,7 +853,7 @@ class PolField {
853853
let mpol = this.ruffini(roots, points[i][0]);
854854
const factor =
855855
this.F.mul(
856-
this.F.inv(this.eval1(mpol, points[i][0])),
856+
this.F.inv(this.evaluate(mpol, points[i][0])),
857857
points[i][1]);
858858
mpol = this.mulScalar(mpol, factor);
859859
sum = this.add(sum, mpol);

src/polfield.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -192,7 +192,7 @@ export default class PolField {
192192
return v;
193193
}
194194

195-
eval1(p,x) {
195+
evaluate(p,x) {
196196
const F = this.F;
197197
if (p.length == 0) return F.zero;
198198
const m = this._next2Power(p.length);
@@ -223,7 +223,7 @@ export default class PolField {
223223
let mpol = this.ruffini(roots, points[i][0]);
224224
const factor =
225225
this.F.mul(
226-
this.F.inv(this.eval1(mpol, points[i][0])),
226+
this.F.inv(this.evaluate(mpol, points[i][0])),
227227
points[i][1]);
228228
mpol = this.mulScalar(mpol, factor);
229229
sum = this.add(sum, mpol);

test/pols.js

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -128,13 +128,13 @@ describe("Polynomial field", () => {
128128
it("Should evaluate and zero", () => {
129129
const PF = new PolField(new ZqField(r));
130130
const p = [PF.F.neg(PF.F.e(2)), PF.F.e(1)];
131-
const v = PF.eval1(p, PF.F.e(2));
131+
const v = PF.evaluate(p, PF.F.e(2));
132132
assert(PF.F.eq(v, PF.F.e(0)));
133133
});
134134
it("Should evaluate bigger number", () => {
135135
const PF = new PolField(new ZqField(r));
136136
const p = [PF.F.e(1), PF.F.e(2), PF.F.e(3)];
137-
const v = PF.eval1(p, PF.F.e(2));
137+
const v = PF.evaluate(p, PF.F.e(2));
138138
assert(PF.F.eq(v, PF.F.e(17)));
139139
});
140140
it("Should create lagrange polynomial minmal", () => {
@@ -148,7 +148,7 @@ describe("Polynomial field", () => {
148148
const p=PF.lagrange(points);
149149

150150
for (let i=0; i<points.length; i++) {
151-
const v = PF.eval1(p, points[i][0]);
151+
const v = PF.evaluate(p, points[i][0]);
152152
assert(PF.F.eq(v, points[i][1]));
153153
}
154154
});
@@ -164,7 +164,7 @@ describe("Polynomial field", () => {
164164
const p=PF.lagrange(points);
165165

166166
for (let i=0; i<points.length; i++) {
167-
const v = PF.eval1(p, points[i][0]);
167+
const v = PF.evaluate(p, points[i][0]);
168168
assert(PF.F.eq(v, points[i][1]));
169169
}
170170
});
@@ -211,7 +211,7 @@ describe("Polynomial field", () => {
211211
const p = PF.ifft(a);
212212

213213
for (let i=0; i<a.length; i++) {
214-
const s = PF.eval1(p, PF.oneRoot(8,i));
214+
const s = PF.evaluate(p, PF.oneRoot(8,i));
215215
assert(PF.F.eq(s, a[i]));
216216
}
217217

0 commit comments

Comments
 (0)