Merge pull request #31 from veronicaz41/vzheng/ses

[fix] Rename eval to make it SES compatible

Author: OBrezhniev

build/main.cjs

@@ -496,7 +496,7 @@ class PolField {
         return v;
     }
 
-    eval(p,x) {
+    evaluate(p,x) {
         const F = this.F;
         if (p.length == 0) return F.zero;
         const m = this._next2Power(p.length);
@@ -527,7 +527,7 @@ class PolField {
             let mpol = this.ruffini(roots, points[i][0]);
             const factor =
                 this.F.mul(
-                    this.F.inv(this.eval(mpol, points[i][0])),
+                    this.F.inv(this.evaluate(mpol, points[i][0])),
                     points[i][1]);
             mpol = this.mulScalar(mpol, factor);
             sum = this.add(sum, mpol);

src/polfield.js

@@ -192,7 +192,7 @@ export default class PolField {
         return v;
     }
 
-    eval(p,x) {
+    evaluate(p,x) {
         const F = this.F;
         if (p.length == 0) return F.zero;
         const m = this._next2Power(p.length);
@@ -223,7 +223,7 @@ export default class PolField {
             let mpol = this.ruffini(roots, points[i][0]);
             const factor =
                 this.F.mul(
-                    this.F.inv(this.eval(mpol, points[i][0])),
+                    this.F.inv(this.evaluate(mpol, points[i][0])),
                     points[i][1]);
             mpol = this.mulScalar(mpol, factor);
             sum = this.add(sum, mpol);

test/pols.js

@@ -128,13 +128,13 @@ describe("Polynomial field", () => {
     it("Should evaluate and zero", () => {
         const PF = new PolField(new ZqField(r));
         const p = [PF.F.neg(PF.F.e(2)), PF.F.e(1)];
-        const v = PF.eval(p, PF.F.e(2));
+        const v = PF.evaluate(p, PF.F.e(2));
         assert(PF.F.eq(v, PF.F.e(0)));
     });
     it("Should evaluate bigger number", () => {
         const PF = new PolField(new ZqField(r));
         const p = [PF.F.e(1), PF.F.e(2), PF.F.e(3)];
-        const v = PF.eval(p, PF.F.e(2));
+        const v = PF.evaluate(p, PF.F.e(2));
         assert(PF.F.eq(v, PF.F.e(17)));
     });
     it("Should create lagrange polynomial minmal", () => {
@@ -148,7 +148,7 @@ describe("Polynomial field", () => {
         const p=PF.lagrange(points);
 
         for (let i=0; i<points.length; i++) {
-            const v = PF.eval(p, points[i][0]);
+            const v = PF.evaluate(p, points[i][0]);
             assert(PF.F.eq(v, points[i][1]));
         }
     });
@@ -164,7 +164,7 @@ describe("Polynomial field", () => {
         const p=PF.lagrange(points);
 
         for (let i=0; i<points.length; i++) {
-            const v = PF.eval(p, points[i][0]);
+            const v = PF.evaluate(p, points[i][0]);
             assert(PF.F.eq(v, points[i][1]));
         }
     });
@@ -211,7 +211,7 @@ describe("Polynomial field", () => {
         const p = PF.ifft(a);
 
         for (let i=0; i<a.length; i++) {
-            const s = PF.eval(p, PF.oneRoot(8,i));
+            const s = PF.evaluate(p, PF.oneRoot(8,i));
             assert(PF.F.eq(s, a[i]));
         }