[2cfffe] | 1 | |
---|
| 2 | /**************************************************************************\ |
---|
| 3 | |
---|
| 4 | MODULE: vec_zz_pE |
---|
| 5 | |
---|
| 6 | SUMMARY: |
---|
| 7 | |
---|
| 8 | Provides vectors over zz_pE, along with some related operations. |
---|
| 9 | |
---|
| 10 | \**************************************************************************/ |
---|
| 11 | |
---|
| 12 | #include <NTL/lzz_pE.h> |
---|
| 13 | #include <NTL/vec_ZZ.h> |
---|
| 14 | #include <NTL/vector.h> |
---|
| 15 | |
---|
| 16 | NTL_vector_decl(zz_pE,vec_zz_pE) |
---|
| 17 | |
---|
| 18 | NTL_io_vector_decl(zz_pE,vec_zz_pE) |
---|
| 19 | // I/O operators are defined |
---|
| 20 | |
---|
| 21 | NTL_eq_vector_decl(zz_pE,vec_zz_pE) |
---|
| 22 | // operators == and != are defined |
---|
| 23 | |
---|
| 24 | void mul(vec_zz_pE& x, const vec_zz_pE& a, const zz_pE& b); |
---|
| 25 | void mul(vec_zz_pE& x, const vec_zz_pE& a, const zz_p& b); |
---|
| 26 | void mul(vec_zz_pE& x, const vec_zz_pE& a, long b); |
---|
| 27 | |
---|
| 28 | void mul(vec_zz_pE& x, const zz_pE& a, const vec_zz_pE& b); |
---|
| 29 | void mul(vec_zz_pE& x, const zz_p& a, const vec_zz_pE& b); |
---|
| 30 | void mul(vec_zz_pE& x, long a, const vec_zz_pE& b); |
---|
| 31 | // x = a * b |
---|
| 32 | |
---|
| 33 | void add(vec_zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b); |
---|
| 34 | // x = a + b |
---|
| 35 | |
---|
| 36 | void sub(vec_zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b); |
---|
| 37 | // x = a - b |
---|
| 38 | |
---|
| 39 | void clear(vec_zz_pE& x); |
---|
| 40 | // x = 0 (length unchanged) |
---|
| 41 | |
---|
| 42 | void negate(vec_zz_pE& x, const vec_zz_pE& a); |
---|
| 43 | // x = -a |
---|
| 44 | |
---|
| 45 | long IsZero(const vec_zz_pE& a); |
---|
| 46 | // test if a is the zero vector |
---|
| 47 | |
---|
| 48 | |
---|
| 49 | void InnerProduct(zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b); |
---|
| 50 | // x = sum_{i=0}^{n-1} a[i]*b[i], where n = min(a.length(), |
---|
| 51 | // b.length()) |
---|
| 52 | |
---|
| 53 | void InnerProduct(zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b, |
---|
| 54 | long offset); |
---|
[e6caf81] | 55 | // x = sum_{i=offset}^{n-1} a[i]*b[i-offset], where n = min(a.length(), |
---|
[2cfffe] | 56 | // b.length()+offset) |
---|
| 57 | |
---|
| 58 | void VectorCopy(vec_zz_pE& x, const vec_zz_pE& a, long n); |
---|
| 59 | vec_zz_pE VectorCopy(const vec_zz_pE& a, long n); |
---|
| 60 | // x = a copy of a of length exactly n. |
---|
| 61 | // The input is truncated or padded with zeroes, as necessary. |
---|
| 62 | |
---|
| 63 | |
---|
| 64 | |
---|
| 65 | |
---|
| 66 | |
---|
| 67 | // operator notation: |
---|
| 68 | |
---|
| 69 | vec_zz_pE operator+(const vec_zz_pE& a, const vec_zz_pE& b); |
---|
| 70 | vec_zz_pE operator-(const vec_zz_pE& a, const vec_zz_pE& b); |
---|
| 71 | |
---|
| 72 | vec_zz_pE operator-(const vec_zz_pE& a); |
---|
| 73 | |
---|
| 74 | |
---|
| 75 | // vector/scalar multiplication: |
---|
| 76 | |
---|
| 77 | vec_zz_pE operator*(const vec_zz_pE& a, const zz_pE& b); |
---|
| 78 | vec_zz_pE operator*(const vec_zz_pE& a, const zz_p& b); |
---|
| 79 | vec_zz_pE operator*(const vec_zz_pE& a, long b); |
---|
| 80 | |
---|
| 81 | vec_zz_pE operator*(const zz_pE& a, const vec_zz_pE& b); |
---|
| 82 | vec_zz_pE operator*(const zz_p& a, const vec_zz_pE& b); |
---|
| 83 | vec_zz_pE operator*(long a, const vec_zz_pE& b); |
---|
| 84 | |
---|
| 85 | // inner product: |
---|
| 86 | |
---|
| 87 | zz_pE operator*(const vec_zz_pE& a, const vec_zz_pE& b); |
---|
| 88 | |
---|
| 89 | |
---|
| 90 | // assignment operator notation: |
---|
| 91 | |
---|
| 92 | vec_zz_pE& operator+=(vec_zz_pE& x, const vec_zz_pE& a); |
---|
| 93 | vec_zz_pE& operator-=(vec_zz_pE& x, const vec_zz_pE& a); |
---|
| 94 | |
---|
| 95 | vec_zz_pE& operator*=(vec_zz_pE& x, const zz_pE& a); |
---|
| 96 | vec_zz_pE& operator*=(vec_zz_pE& x, const zz_p& a); |
---|
| 97 | vec_zz_pE& operator*=(vec_zz_pE& x, long a); |
---|
| 98 | |
---|