本文整理汇总了C++中vec_ZZ类的典型用法代码示例。如果您正苦于以下问题：C++ vec_ZZ类的具体用法？C++ vec_ZZ怎么用？C++ vec_ZZ使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
在下文中一共展示了vec_ZZ类的20个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的C++代码示例。
示例1: intVecCRT
bool intVecCRT(vec_ZZ& vp, const ZZ& p, const zzvec& vq, long q)
{
long pInv = InvMod(rem(p,q), q); // p^{-1} mod q
long n = min(vp.length(),vq.length());
long q_over_2 = q/2;
ZZ tmp;
long vqi;
mulmod_precon_t pqInv = PrepMulModPrecon(pInv, q);
for (long i=0; i<n; i++) {
conv(vqi, vq[i]); // convert to single precision
long vq_minus_vp_mod_q = SubMod(vqi, rem(vp[i],q), q);
long delta_times_pInv = MulModPrecon(vq_minus_vp_mod_q, pInv, q, pqInv);
if (delta_times_pInv > q_over_2) delta_times_pInv -= q;
mul(tmp, delta_times_pInv, p); // tmp = [(vq_i-vp_i)*p^{-1}]_q * p
vp[i] += tmp;
}
// other entries (if any) are 0 mod q
for (long i=vq.length(); i<vp.length(); i++) {
long minus_vp_mod_q = NegateMod(rem(vp[i],q), q);
long delta_times_pInv = MulModPrecon(minus_vp_mod_q, pInv, q, pqInv);
if (delta_times_pInv > q_over_2) delta_times_pInv -= q;
mul(tmp, delta_times_pInv, p); // tmp = [(vq_i-vp_i)*p^{-1}]_q * p
vp[i] += tmp;
}
return (vp.length()==vq.length());
}
开发者ID:deepinit-arek，项目名称:HElib，代码行数:30，代码来源:NumbTh.cpp
示例2: mul
void mul(vec_ZZ& x, const vec_ZZ& a, long b)
{
long n = a.length();
x.SetLength(n);
long i;
for (i = 0; i < n; i++)
mul(x[i], a[i], b);
}
开发者ID:axelexic，项目名称:NTL，代码行数:8，代码来源:vec_ZZ.c
示例3: negate
void negate(vec_ZZ& x, const vec_ZZ& a)
{
long n = a.length();
x.SetLength(n);
long i;
for (i = 0; i < n; i++)
negate(x[i], a[i]);
}
开发者ID:axelexic，项目名称:NTL，代码行数:8，代码来源:vec_ZZ.c
示例4: sub
void sub(vec_ZZ& x, const vec_ZZ& a, const vec_ZZ& 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]);
}
开发者ID:axelexic，项目名称:NTL，代码行数:9，代码来源:vec_ZZ.c
示例5: MulSubFrom
static void MulSubFrom(vec_ZZ& c, const vec_ZZ& c2, long x)
// c = c - x*c2
{
long n = c.length();
if (c2.length() != n) Error("MulSubFrom: length mismatch");
long i;
for (i = 1; i <= n; i++)
MulSubFrom(c(i), c2(i), x);
}
开发者ID:Macaulay2，项目名称:Singular，代码行数:12，代码来源:LLL.c
示例6: conv
void conv(vec_zz_p& x, const vec_ZZ& a)
{
long i, n;
n = a.length();
x.SetLength(n);
zz_p* xp = x.elts();
const ZZ* ap = a.elts();
for (i = 0; i < n; i++)
conv(xp[i], ap[i]);
}
开发者ID:Macaulay2，项目名称:Singular，代码行数:13，代码来源:vec_lzz_p.c
示例7: conv
NTL_START_IMPL
// NOTE: the signature for this is in lzz_p.h
void conv(vec_zz_p& x, const vec_ZZ& a)
{
long i, n;
n = a.length();
x.SetLength(n);
VectorConv(n, x.elts(), a.elts());
}
开发者ID:tell，项目名称:ntl-unix，代码行数:13，代码来源:vec_lzz_p.cpp
示例8: SubDiv
static
void SubDiv(vec_ZZ& e, const vec_ZZ& t, long p)
{
long n = e.length();
if (t.length() != n) Error("SubDiv: dimension mismatch");
ZZ s;
long i;
for (i = 0; i < n; i++) {
sub(s, e[i], t[i]);
div(e[i], s, p);
}
}
开发者ID:tvtritin，项目名称:Fuzzy-extractor，代码行数:14，代码来源:mat_ZZ.c
示例9: MulSubDiv
static void MulSubDiv(vec_ZZ& c, const vec_ZZ& c1, const vec_ZZ& c2,
const ZZ& x, const ZZ& y, const ZZ& z)
// c = (x*c1 + y*c2)/z
{
long n = c1.length();
if (c2.length() != n) Error("MulSubDiv: length mismatch");
c.SetLength(n);
long i;
for (i = 1; i <= n; i++)
MulSubDiv(c(i), c1(i), c2(i), x, y, z);
}
开发者ID:Macaulay2，项目名称:Singular，代码行数:14，代码来源:LLL.c
示例10: clear
void clear(vec_ZZ& x)
{
long n = x.length();
long i;
for (i = 0; i < n; i++)
clear(x[i]);
}
开发者ID:axelexic，项目名称:NTL，代码行数:7，代码来源:vec_ZZ.c
示例11: CRT
long CRT(vec_ZZ& gg, ZZ& a, const vec_zz_p& G)
{
long n = gg.length();
if (G.length() != n) Error("CRT: vector length mismatch");
long p = zz_p::modulus();
ZZ new_a;
mul(new_a, a, p);
long a_inv;
a_inv = rem(a, p);
a_inv = InvMod(a_inv, p);
long p1;
p1 = p >> 1;
ZZ a1;
RightShift(a1, a, 1);
long p_odd = (p & 1);
long modified = 0;
long h;
ZZ g;
long i;
for (i = 0; i < n; i++) {
if (!CRTInRange(gg[i], a)) {
modified = 1;
rem(g, gg[i], a);
if (g > a1) sub(g, g, a);
}
else
g = gg[i];
h = rem(g, p);
h = SubMod(rep(G[i]), h, p);
h = MulMod(h, a_inv, p);
if (h > p1)
h = h - p;
if (h != 0) {
modified = 1;
if (!p_odd && g > 0 && (h == p1))
MulSubFrom(g, a, h);
else
MulAddTo(g, a, h);
}
gg[i] = g;
}
a = new_a;
return modified;
}
开发者ID:Macaulay2，项目名称:Singular，代码行数:59，代码来源:vec_lzz_p.c
示例12: VectorCopy
void VectorCopy(vec_ZZ& x, const vec_ZZ& 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]);
}
开发者ID:axelexic，项目名称:NTL，代码行数:17，代码来源:vec_ZZ.c
示例13: InnerProduct
NTL_START_IMPL
void InnerProduct(ZZ& xx, const vec_ZZ& a, const vec_ZZ& b)
{
ZZ t1, x;
long n = min(a.length(), b.length());
long i;
clear(x);
for (i = 1; i <= n; i++) {
mul(t1, a(i), b(i));
add(x, x, t1);
}
xx = x;
}
开发者ID:axelexic，项目名称:NTL，代码行数:18，代码来源:vec_ZZ.c
示例14: ExactDiv
static
void ExactDiv(vec_ZZ& x, const ZZ& d)
{
long n = x.length();
long i;
for (i = 0; i < n; i++)
if (!divide(x[i], x[i], d))
Error("inexact division");
}
开发者ID:tvtritin，项目名称:Fuzzy-extractor，代码行数:10，代码来源:mat_ZZ.c
示例15: IsZero
long IsZero(const vec_ZZ& a)
{
long n = a.length();
long i;
for (i = 0; i < n; i++)
if (!IsZero(a[i]))
return 0;
return 1;
}
开发者ID:axelexic，项目名称:NTL，代码行数:11，代码来源:vec_ZZ.c
示例16: vec_shift
vec_ZZ vec_shift(vec_ZZ v, int dim)
{
vec_ZZ shifted_vec;
int len;
len = v.length();
shifted_vec.SetLength(dim);
// if (len>dim-1)
// cout<<"incorrect length "<<len<<" "<<dim<<endl;
for (int i=0; i<len-1;i++)
shifted_vec[i+1] = v[i];
return shifted_vec;
}
开发者ID:zhenfeizhang，项目名称:hybrid_GH，代码行数:12，代码来源:tools.cpp
示例17: RowTransform2
static void RowTransform2(vec_ZZ& A, vec_ZZ& B, const ZZ& MU1)
// x = x + y*MU
{
NTL_ZZRegister(T);
NTL_ZZRegister(MU);
long k;
long n = A.length();
long i;
MU = MU1;
if (MU == 1) {
for (i = 1; i <= n; i++)
add(A(i), A(i), B(i));
return;
}
if (MU == -1) {
for (i = 1; i <= n; i++)
sub(A(i), A(i), B(i));
return;
}
if (MU == 0) return;
if (NumTwos(MU) >= NTL_ZZ_NBITS)
k = MakeOdd(MU);
else
k = 0;
if (MU.WideSinglePrecision()) {
long mu1;
conv(mu1, MU);
for (i = 1; i <= n; i++) {
mul(T, B(i), mu1);
if (k > 0) LeftShift(T, T, k);
add(A(i), A(i), T);
}
}
else {
for (i = 1; i <= n; i++) {
mul(T, B(i), MU);
if (k > 0) LeftShift(T, T, k);
add(A(i), A(i), T);
}
}
}
开发者ID:axelexic，项目名称:NTL，代码行数:51，代码来源:LLL_XD.c
示例18: mul_aux
static
void mul_aux(vec_ZZ& x, const vec_ZZ& a, const mat_ZZ& B)
{
long n = B.NumRows();
long l = B.NumCols();
if (n != a.length())
Error("matrix mul: dimension mismatch");
x.SetLength(l);
long i, k;
ZZ acc, tmp;
for (i = 1; i <= l; i++) {
clear(acc);
for (k = 1; k <= n; k++) {
mul(tmp, a(k), B(k,i));
add(acc, acc, tmp);
}
x(i) = acc;
}
}
开发者ID:tvtritin，项目名称:Fuzzy-extractor，代码行数:23，代码来源:mat_ZZ.c
示例19: SubsetSumSolution
NTL_CLIENT
long SubsetSumSolution(const vec_ZZ& z)
{
long n = z.length()-3;
long j;
if (z(n+1) != 0) return 0;
if (z(n+2) != -1 && z(n+2) != 1) return 0;
for (j = 1; j <= n; j++)
if (z(j) != -1 && z(j) != 1) return 0;
return 1;
}
开发者ID:shayne-fletcher，项目名称:cppf，代码行数:14，代码来源:subset.cpp
示例20: MulAdd
static
void MulAdd(vec_ZZ& x, const ZZ& prod, const vec_zz_p& h)
{
long n = x.length();
if (h.length() != n) Error("MulAdd: dimension mismatch");
ZZ t;
long i;
for (i = 0; i < n; i++) {
mul(t, prod, rep(h[i]));
add(x[i], x[i], t);
}
}
开发者ID:tvtritin，项目名称:Fuzzy-extractor，代码行数:14，代码来源:mat_ZZ.c
注：本文中的vec_ZZ类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。 |
客服电话
APP下载
官方微信
请发表评论