Tree @fresh-snapshots/main (Download .tar.gz)
- ..
- libtool-origin
- libtool-seed
- BasicThreadPool.cpp
- BerlekampTest.cpp
- BerlekampTestIn
- BerlekampTestOut
- BitMatTest.cpp
- CanZassTest.cpp
- CanZassTestIn
- CanZassTestOut
- cfile
- CharPolyTest.cpp
- CharPolyTestIn
- CharPolyTestOut
- CheckALIGNED_ARRAY.cpp
- CheckAVX.cpp
- CheckAVX2.cpp
- CheckAVX512F.cpp
- CheckBUILTIN_CLZL.cpp
- CheckCHRONO_TIME.cpp
- CheckCompile.cpp
- CheckContract.cpp
- CheckContractAux.cpp
- CheckCOPY_TRAITS1.cpp
- CheckCOPY_TRAITS2.cpp
- CheckFMA.cpp
- CheckLL_TYPE.cpp
- CheckMACOS_TIME.cpp
- CheckPCLMUL.cpp
- CheckPOSIX_TIME.cpp
- CheckSSSE3.cpp
- CheckThreads.cpp
- configure
- CopyFeatures
- ctools.cpp
- DIRNAME
- DispSettings.cpp
- DoConfig
- dosify
- ExceptionTest.cpp
- FacVec.cpp
- FFT.cpp
- fileio.cpp
- G_LLL_FP.cpp
- G_LLL_QP.cpp
- G_LLL_RR.cpp
- G_LLL_XD.cpp
- gen_gmp_aux.cpp
- GenConfigInfo.cpp
- GetPID1.cpp
- GetPID2.cpp
- GetTime0.cpp
- GetTime1.cpp
- GetTime2.cpp
- GetTime3.cpp
- GetTime4.cpp
- GetTime5.cpp
- GF2.cpp
- GF2E.cpp
- GF2EX.cpp
- GF2EXDivCross.cpp
- GF2EXFactoring.cpp
- GF2EXGCDCross.cpp
- GF2EXGCDTest.cpp
- GF2EXKarCross.cpp
- GF2EXModCross.cpp
- GF2EXTest.cpp
- GF2X.cpp
- GF2X1.cpp
- gf2x_version_1_2_or_later_required.cpp
- GF2XFactoring.cpp
- GF2XTest.cpp
- GF2XTimeTest.cpp
- GF2XVec.cpp
- HNF.cpp
- InitSettings.cpp
- lip.cpp
- LLL.cpp
- LLL_FP.cpp
- LLL_QP.cpp
- LLL_RR.cpp
- LLL_XD.cpp
- LLLTest.cpp
- LLLTestIn
- LLLTestOut
- lzz_p.cpp
- lzz_pE.cpp
- lzz_pEX.cpp
- lzz_pEXFactoring.cpp
- lzz_pEXGCDTest.cpp
- lzz_pEXTest.cpp
- lzz_pX.cpp
- lzz_pX1.cpp
- lzz_pXCharPoly.cpp
- lzz_pXFactoring.cpp
- lzz_pXTest.cpp
- mach_desc.win
- MakeCheckFeatures
- MakeDesc.cpp
- MakeDescAux.cpp
- MakeGetPID
- MakeGetTime
- mat_GF2.cpp
- mat_GF2E.cpp
- mat_lzz_p.cpp
- mat_lzz_pE.cpp
- mat_lzz_pTest.cpp
- mat_poly_lzz_p.cpp
- mat_poly_ZZ.cpp
- mat_poly_ZZ_p.cpp
- mat_RR.cpp
- mat_ZZ.cpp
- mat_ZZ_p.cpp
- mat_ZZ_pE.cpp
- MatPrime.cpp
- MatrixTest.cpp
- MatrixTestIn
- MatrixTestOut
- mfile
- MoreFacTest.cpp
- MoreFacTestIn
- newnames.cpp
- NOTES
- pd_FFT.cpp
- Poly1TimeTest.cpp
- Poly2TimeTest.cpp
- Poly3TimeTest.cpp
- ppscript
- quad_float.cpp
- quad_float1.cpp
- QuadTest.cpp
- QuadTestIn
- QuadTestOut
- QuickTest.cpp
- RemoveProg
- ResetFeatures
- RR.cpp
- RRTest.cpp
- RRTestIn
- RRTestOut
- SSMulTest.cpp
- subset.cpp
- TestGetPID.cpp
- TestGetTime.cpp
- TestScript
- thread.cpp
- ThreadTest.cpp
- Timing.cpp
- tools.cpp
- unixify
- vec_GF2.cpp
- vec_GF2E.cpp
- vec_lzz_p.cpp
- vec_lzz_pE.cpp
- vec_RR.cpp
- vec_ZZ.cpp
- vec_ZZ_p.cpp
- vec_ZZ_pE.cpp
- VERSION_INFO
- WINDIR
- Wizard
- WizardAux
- WordVector.cpp
- xdouble.cpp
- ZZ.cpp
- ZZ_p.cpp
- ZZ_pE.cpp
- ZZ_pEX.cpp
- ZZ_pEXFactoring.cpp
- ZZ_pEXGCDTest.cpp
- ZZ_pEXTest.cpp
- ZZ_pX.cpp
- ZZ_pX1.cpp
- ZZ_pXCharPoly.cpp
- ZZ_pXFactoring.cpp
- ZZ_pXTest.cpp
- ZZTest.cpp
- ZZVec.cpp
- ZZX.cpp
- ZZX1.cpp
- ZZXCharPoly.cpp
- ZZXFacTest.cpp
- ZZXFacTestIn
- ZZXFacTestOut
- ZZXFactoring.cpp
vec_lzz_pE.cpp @fresh-snapshots/main — raw · history · blame
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 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 | #include <NTL/vec_lzz_pE.h> NTL_START_IMPL void InnerProduct(zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b) { long n = min(a.length(), b.length()); long i; zz_pX accum, t; clear(accum); for (i = 0; i < n; i++) { mul(t, rep(a[i]), rep(b[i])); add(accum, accum, t); } conv(x, accum); } void InnerProduct(zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b, long offset) { if (offset < 0) LogicError("InnerProduct: negative offset"); if (NTL_OVERFLOW(offset, 1, 0)) ResourceError("InnerProduct: offset too big"); long n = min(a.length(), b.length()+offset); long i; zz_pX accum, t; clear(accum); for (i = offset; i < n; i++) { mul(t, rep(a[i]), rep(b[i-offset])); add(accum, accum, t); } conv(x, accum); } void mul(vec_zz_pE& x, const vec_zz_pE& a, const zz_pE& b_in) { zz_pE b = b_in; long n = a.length(); x.SetLength(n); long i; for (i = 0; i < n; i++) mul(x[i], a[i], b); } void mul(vec_zz_pE& x, const vec_zz_pE& a, const zz_p& b_in) { NTL_zz_pRegister(b); b = b_in; long n = a.length(); x.SetLength(n); long i; for (i = 0; i < n; i++) mul(x[i], a[i], b); } void mul(vec_zz_pE& x, const vec_zz_pE& a, long b_in) { NTL_zz_pRegister(b); b = b_in; long n = a.length(); x.SetLength(n); long i; for (i = 0; i < n; i++) mul(x[i], a[i], b); } void add(vec_zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b) { long n = a.length(); if (b.length() != n) LogicError("vector add: dimension mismatch"); x.SetLength(n); long i; for (i = 0; i < n; i++) add(x[i], a[i], b[i]); } void sub(vec_zz_pE& x, const vec_zz_pE& a, const vec_zz_pE& b) { long n = a.length(); if (b.length() != n) LogicError("vector sub: dimension mismatch"); x.SetLength(n); long i; for (i = 0; i < n; i++) sub(x[i], a[i], b[i]); } void negate(vec_zz_pE& x, const vec_zz_pE& a) { long n = a.length(); x.SetLength(n); long i; for (i = 0; i < n; i++) negate(x[i], a[i]); } void clear(vec_zz_pE& x) { long n = x.length(); long i; for (i = 0; i < n; i++) clear(x[i]); } long IsZero(const vec_zz_pE& a) { long n = a.length(); long i; for (i = 0; i < n; i++) if (!IsZero(a[i])) return 0; return 1; } vec_zz_pE operator+(const vec_zz_pE& a, const vec_zz_pE& b) { vec_zz_pE res; add(res, a, b); NTL_OPT_RETURN(vec_zz_pE, res); } vec_zz_pE operator-(const vec_zz_pE& a, const vec_zz_pE& b) { vec_zz_pE res; sub(res, a, b); NTL_OPT_RETURN(vec_zz_pE, res); } vec_zz_pE operator-(const vec_zz_pE& a) { vec_zz_pE res; negate(res, a); NTL_OPT_RETURN(vec_zz_pE, res); } zz_pE operator*(const vec_zz_pE& a, const vec_zz_pE& b) { zz_pE res; InnerProduct(res, a, b); return res; } void VectorCopy(vec_zz_pE& x, const vec_zz_pE& a, long n) { if (n < 0) LogicError("VectorCopy: negative length"); if (NTL_OVERFLOW(n, 1, 0)) ResourceError("overflow in VectorCopy"); long m = min(n, a.length()); x.SetLength(n); long i; for (i = 0; i < m; i++) x[i] = a[i]; for (i = m; i < n; i++) clear(x[i]); } void random(vec_zz_pE& x, long n) { x.SetLength(n); for (long i = 0; i < n; i++) random(x[i]); } NTL_END_IMPL |