s426159/DALGLI0
1
0
Fork 0
forked from kalmar/DALGLI0
Code Releases Activity

02 power

Browse Source
This commit is contained in:
Kacper Kruczek 2018-07-01 11:43:24 +02:00
parent 9bf6d4721e
commit be73ad2fde
1 changed files with 34 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

62
polynomial.js
View File

@ -8,13 +8,17 @@ class Polynomial {
exports.Class = Polynomial; exports.Class = Polynomial;
function add(p1, p2) { function get_mod(p1, p2) {
let n; let n;
if (p1.mod !== p2.mod) { if (p1.mod !== p2.mod) {
throw "different modulo" throw "different modulo"
} else { } else {
n = p1.mod; return p1.mod;
} }
}
function prepare(p1, p2) {
let n = get_mod(p1, p2);
let len_p1 = p1.coefficients.length; let len_p1 = p1.coefficients.length;
let len_p2 = p2.coefficients.length; let len_p2 = p2.coefficients.length;
result = new Array(Math.max(len_p1, len_p2)).fill(0); result = new Array(Math.max(len_p1, len_p2)).fill(0);
@ -23,6 +27,19 @@ function add(p1, p2) {
} else { } else {
for (let x = 0; x < len_p2 - len_p1; x++) p1.coefficients.push(0); for (let x = 0; x < len_p2 - len_p1; x++) p1.coefficients.push(0);
} }
return {
result,
n
};
}
function add(p1, p2) {
let {
result,
n
} = prepare(p1, p2);
for (let i = 0; i < result.length; i++) { for (let i = 0; i < result.length; i++) {
result[i] = (p1.coefficients[i] + p2.coefficients[i]) % n; result[i] = (p1.coefficients[i] + p2.coefficients[i]) % n;
} }
@ -31,20 +48,10 @@ function add(p1, p2) {
exports.add = add; exports.add = add;
function sub(p1, p2) { function sub(p1, p2) {
let n; let {
if (p1.mod !== p2.mod) { result,
throw "different modulo" n
} else { } = prepare(p1, p2);
n = p1.mod;
}
let len_p1 = p1.coefficients.length;
let len_p2 = p2.coefficients.length;
result = new Array(Math.max(len_p1, len_p2)).fill(0);
if (len_p1 > len_p2) {
for (let x = 0; x < len_p1 - len_p2; x++) p2.coefficients.push(0);
} else {
for (let x = 0; x < len_p2 - len_p1; x++) p1.coefficients.push(0);
}
for (let i = 0; i < result.length; i++) { for (let i = 0; i < result.length; i++) {
result[i] = (p1.coefficients[i] - p2.coefficients[i]) % n; result[i] = (p1.coefficients[i] - p2.coefficients[i]) % n;
} }
@ -53,12 +60,7 @@ function sub(p1, p2) {
exports.sub = sub; exports.sub = sub;
function sub(p1, p2) { function sub(p1, p2) {
let n; let n = get_mod(p1, p2);
if (p1.mod !== p2.mod) {
throw "different modulo"
} else {
n = p1.mod;
}
let len_p1 = p1.coefficients.length; let len_p1 = p1.coefficients.length;
let len_p2 = p2.coefficients.length; let len_p2 = p2.coefficients.length;
result = new Array(Math.max(len_p1, len_p2)).fill(0); result = new Array(Math.max(len_p1, len_p2)).fill(0);
@ -75,12 +77,7 @@ function sub(p1, p2) {
exports.add = add; exports.add = add;
function multiply(p1, p2) { function multiply(p1, p2) {
let n; let n = get_mod(p1, p2);
if (p1.mod !== p2.mod) {
throw "different modulo"
} else {
n = p1.mod;
}
let f = p1.coefficients; let f = p1.coefficients;
let g = p2.coefficients; let g = p2.coefficients;
result = new Array(f.length + g.length - 1).fill(0); result = new Array(f.length + g.length - 1).fill(0);
@ -95,6 +92,15 @@ function multiply(p1, p2) {
} }
exports.multiply = multiply; exports.multiply = multiply;
function power(p1, pow) {
let result = p1;
for (let i = 1; i < pow; i++) {
result = multiply(result, p1);
}
return result;
}
exports.power = power;
function divide(p1, p2) { function divide(p1, p2) {
let n; let n;
if (p1.mod !== p2.mod) { if (p1.mod !== p2.mod) {