本文整理汇总了C++中rep函数的典型用法代码示例。如果您正苦于以下问题：C++ rep函数的具体用法？C++ rep怎么用？C++ rep使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了rep函数的20个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的C++代码示例。
示例1: read_dem
//.........这里部分代码省略.........
case '4': return Ext4;
case '5': return Ext5;
case '6': return Ext6;
case 'e': return AE;
case 'f': return EA0;
/*
a = read_dem ();
return EA (a);
*/
case 'm': return MP;
case 'a': return AI;
case 'b': return AK;
case 'c': return AS;
case 'r': return RPA;
case '0': return ZeroIsOrd;
case '+': return SucIsOrd;
case 'w': return LimIsOrd;
case 'p': return PredIsOrd;
case 'n': return StepIsOrd;
case 'W': return TfI;
case '<':
a = read_dem ();
return left (a);
case '>':
a = read_dem ();
return right (a);
case '\'':
a = read_dem ();
return rep(a);
case '%':
/*printf ("*1*");*/
a = read_dem ();
/*printf ("*2*");*/
trace_dem ("read", a);
/*printf ("*3*");*/
b = red (a);
/*printf ("*4*");*/
trace_dem ("red", b);
return b;
/* return red (a); */
case 'R':
a = read_dem ();
return red1 (a, 0);
case '@':
a = read_dem ();
return reduc (a, 1);
case '~':
a = read_dem ();
return reduc (a, 0);
case '$':
a = read_dem ();
return redu (a);
case 'x':
a = read_dem ();
b = read_dem ();
开发者ID:jbailhache，项目名称:log，代码行数:67，代码来源:READ.CPP
示例2: inv
void inv(GF2E& d, mat_GF2E& X, const mat_GF2E& A)
{
long n = A.NumRows();
if (A.NumCols() != n)
LogicError("inv: nonsquare matrix");
if (n == 0) {
set(d);
X.SetDims(0, 0);
return;
}
long i, j, k, pos;
GF2X t1, t2;
GF2X *x, *y;
const GF2XModulus& p = GF2E::modulus();
vec_GF2XVec M;
M.SetLength(n);
for (i = 0; i < n; i++) {
M[i].SetSize(2*n, 2*GF2E::WordLength());
for (j = 0; j < n; j++) {
M[i][j] = rep(A[i][j]);
clear(M[i][n+j]);
}
set(M[i][n+i]);
}
GF2X det;
set(det);
for (k = 0; k < n; k++) {
pos = -1;
for (i = k; i < n; i++) {
rem(t1, M[i][k], p);
M[i][k] = t1;
if (pos == -1 && !IsZero(t1)) {
pos = i;
}
}
if (pos != -1) {
if (k != pos) {
swap(M[pos], M[k]);
}
MulMod(det, det, M[k][k], p);
// make M[k, k] == -1 mod p, and make row k reduced
InvMod(t1, M[k][k], p);
for (j = k+1; j < 2*n; j++) {
rem(t2, M[k][j], p);
MulMod(M[k][j], t2, t1, p);
}
for (i = k+1; i < n; i++) {
// M[i] = M[i] + M[k]*M[i,k]
t1 = M[i][k]; // this is already reduced
x = M[i].elts() + (k+1);
y = M[k].elts() + (k+1);
for (j = k+1; j < 2*n; j++, x++, y++) {
// *x = *x + (*y)*t1
mul(t2, *y, t1);
add(*x, *x, t2);
}
}
}
else {
clear(d);
return;
}
}
X.SetDims(n, n);
for (k = 0; k < n; k++) {
for (i = n-1; i >= 0; i--) {
clear(t1);
for (j = i+1; j < n; j++) {
mul(t2, rep(X[j][k]), M[i][j]);
add(t1, t1, t2);
}
add(t1, t1, M[i][n+k]);
conv(X[i][k], t1);
}
}
conv(d, det);
}
开发者ID:95krasovsky，项目名称:SecretSharingSchemes，代码行数:96，代码来源:mat_GF2E.c
示例3: kernel
void kernel(mat_GF2E& X, const mat_GF2E& A)
{
long m = A.NumRows();
long n = A.NumCols();
mat_GF2E M;
long r;
transpose(M, A);
r = gauss(M);
X.SetDims(m-r, m);
long i, j, k, s;
GF2X t1, t2;
GF2E T3;
vec_long D;
D.SetLength(m);
for (j = 0; j < m; j++) D[j] = -1;
vec_GF2E inverses;
inverses.SetLength(m);
j = -1;
for (i = 0; i < r; i++) {
do {
j++;
} while (IsZero(M[i][j]));
D[j] = i;
inv(inverses[j], M[i][j]);
}
for (k = 0; k < m-r; k++) {
vec_GF2E& v = X[k];
long pos = 0;
for (j = m-1; j >= 0; j--) {
if (D[j] == -1) {
if (pos == k)
set(v[j]);
else
clear(v[j]);
pos++;
}
else {
i = D[j];
clear(t1);
for (s = j+1; s < m; s++) {
mul(t2, rep(v[s]), rep(M[i][s]));
add(t1, t1, t2);
}
conv(T3, t1);
mul(T3, T3, inverses[j]);
v[j] = T3;
}
}
}
}
开发者ID:95krasovsky，项目名称:SecretSharingSchemes，代码行数:63，代码来源:mat_GF2E.c
示例4: hasher
hasher(string s, int _m) : m(_m), h(size(s)+1), p(size(s)+1) {
p[0] = 1; h[0] = 0;
rep(i,0,size(s)) p[i+1] = (ll)p[i] * b % m;
rep(i,0,size(s)) h[i+1] = ((ll)h[i] * b + s[i]) % m; }
开发者ID:Cybuster，项目名称:CompetitiveProgramming，代码行数:4，代码来源:hasher.cpp
示例5: determinant
void determinant(GF2E& d, const mat_GF2E& M_in)
{
long k, n;
long i, j;
long pos;
GF2X t1, t2;
GF2X *x, *y;
const GF2XModulus& p = GF2E::modulus();
n = M_in.NumRows();
if (M_in.NumCols() != n)
LogicError("determinant: nonsquare matrix");
if (n == 0) {
set(d);
return;
}
vec_GF2XVec M;
M.SetLength(n);
for (i = 0; i < n; i++) {
M[i].SetSize(n, 2*GF2E::WordLength());
for (j = 0; j < n; j++)
M[i][j] = rep(M_in[i][j]);
}
GF2X det;
set(det);
for (k = 0; k < n; k++) {
pos = -1;
for (i = k; i < n; i++) {
rem(t1, M[i][k], p);
M[i][k] = t1;
if (pos == -1 && !IsZero(t1))
pos = i;
}
if (pos != -1) {
if (k != pos) {
swap(M[pos], M[k]);
}
MulMod(det, det, M[k][k], p);
// make M[k, k] == -1 mod p, and make row k reduced
InvMod(t1, M[k][k], p);
for (j = k+1; j < n; j++) {
rem(t2, M[k][j], p);
MulMod(M[k][j], t2, t1, p);
}
for (i = k+1; i < n; i++) {
// M[i] = M[i] + M[k]*M[i,k]
t1 = M[i][k]; // this is already reduced
x = M[i].elts() + (k+1);
y = M[k].elts() + (k+1);
for (j = k+1; j < n; j++, x++, y++) {
// *x = *x + (*y)*t1
mul(t2, *y, t1);
add(*x, *x, t2);
}
}
}
else {
clear(d);
return;
}
}
conv(d, det);
}
开发者ID:95krasovsky，项目名称:SecretSharingSchemes，代码行数:80，代码来源:mat_GF2E.c
示例6: a_height
Coord Display::a_height() const {
DisplayRep& d = *rep();
return d.height_;
}
开发者ID:PNCG，项目名称:neuron，代码行数:4，代码来源:display.cpp
示例7: rep
Display::~Display()
{
DisplayRep* d = rep();
//Resource::unref_deferred(d->style_);
delete d;
}
开发者ID:PNCG，项目名称:neuron，代码行数:6，代码来源:display.cpp
示例8: gauss
long gauss(mat_zz_p& M, long w)
{
long k, l;
long i, j;
long pos;
zz_p t1, t2, t3;
zz_p *x, *y;
long n = M.NumRows();
long m = M.NumCols();
if (w < 0 || w > m)
LogicError("gauss: bad args");
long p = zz_p::modulus();
mulmod_t pinv = zz_p::ModulusInverse();
long T1, T2;
l = 0;
for (k = 0; k < w && l < n; k++) {
pos = -1;
for (i = l; i < n; i++) {
if (!IsZero(M[i][k])) {
pos = i;
break;
}
}
if (pos != -1) {
swap(M[pos], M[l]);
inv(t3, M[l][k]);
negate(t3, t3);
for (i = l+1; i < n; i++) {
// M[i] = M[i] + M[l]*M[i,k]*t3
mul(t1, M[i][k], t3);
T1 = rep(t1);
mulmod_precon_t T1pinv = PrepMulModPrecon(T1, p, pinv);
clear(M[i][k]);
x = M[i].elts() + (k+1);
y = M[l].elts() + (k+1);
for (j = k+1; j < m; j++, x++, y++) {
// *x = *x + (*y)*t1
T2 = MulModPrecon(rep(*y), T1, p, T1pinv);
T2 = AddMod(T2, rep(*x), p);
(*x).LoopHole() = T2;
}
}
l++;
}
}
return l;
}
开发者ID:brown722，项目名称:FHE-BGV，代码行数:63，代码来源:mat_lzz_p.c
示例9: solve
void solve(ZZ_p& d, vec_ZZ_p& X,
const mat_ZZ_p& A, const vec_ZZ_p& b)
{
long n = A.NumRows();
if (A.NumCols() != n)
LogicError("solve: nonsquare matrix");
if (b.length() != n)
LogicError("solve: dimension mismatch");
if (n == 0) {
set(d);
X.SetLength(0);
return;
}
long i, j, k, pos;
ZZ t1, t2;
ZZ *x, *y;
const ZZ& p = ZZ_p::modulus();
vec_ZZVec M;
sqr(t1, p);
mul(t1, t1, n);
M.SetLength(n);
for (i = 0; i < n; i++) {
M[i].SetSize(n+1, t1.size());
for (j = 0; j < n; j++)
M[i][j] = rep(A[j][i]);
M[i][n] = rep(b[i]);
}
ZZ det;
set(det);
for (k = 0; k < n; k++) {
pos = -1;
for (i = k; i < n; i++) {
rem(t1, M[i][k], p);
M[i][k] = t1;
if (pos == -1 && !IsZero(t1)) {
pos = i;
}
}
if (pos != -1) {
if (k != pos) {
swap(M[pos], M[k]);
NegateMod(det, det, p);
}
MulMod(det, det, M[k][k], p);
// make M[k, k] == -1 mod p, and make row k reduced
InvMod(t1, M[k][k], p);
NegateMod(t1, t1, p);
for (j = k+1; j <= n; j++) {
rem(t2, M[k][j], p);
MulMod(M[k][j], t2, t1, p);
}
for (i = k+1; i < n; i++) {
// M[i] = M[i] + M[k]*M[i,k]
t1 = M[i][k]; // this is already reduced
x = M[i].elts() + (k+1);
y = M[k].elts() + (k+1);
for (j = k+1; j <= n; j++, x++, y++) {
// *x = *x + (*y)*t1
mul(t2, *y, t1);
add(*x, *x, t2);
}
}
}
else {
clear(d);
return;
}
}
X.SetLength(n);
for (i = n-1; i >= 0; i--) {
clear(t1);
for (j = i+1; j < n; j++) {
mul(t2, rep(X[j]), M[i][j]);
add(t1, t1, t2);
}
sub(t1, t1, M[i][n]);
conv(X[i], t1);
}
conv(d, det);
//.........这里部分代码省略.........
开发者ID:axelexic，项目名称:NTL，代码行数:101，代码来源:mat_ZZ_p.c
示例10: mul_aux
static
void mul_aux(mat_zz_p& X, const mat_zz_p& A, const mat_zz_p& B)
{
long n = A.NumRows();
long l = A.NumCols();
long m = B.NumCols();
if (l != B.NumRows())
LogicError("matrix mul: dimension mismatch");
X.SetDims(n, m);
if (m > 1) { // new preconditioning code
long p = zz_p::modulus();
mulmod_t pinv = zz_p::ModulusInverse();
vec_long::Watcher watch_mul_aux_vec(mul_aux_vec);
mul_aux_vec.SetLength(m);
long *acc = mul_aux_vec.elts();
long i, j, k;
for (i = 0; i < n; i++) {
const zz_p* ap = A[i].elts();
for (j = 0; j < m; j++) acc[j] = 0;
for (k = 0; k < l; k++) {
long aa = rep(ap[k]);
if (aa != 0) {
const zz_p* bp = B[k].elts();
long T1;
mulmod_precon_t aapinv = PrepMulModPrecon(aa, p, pinv);
for (j = 0; j < m; j++) {
T1 = MulModPrecon(rep(bp[j]), aa, p, aapinv);
acc[j] = AddMod(acc[j], T1, p);
}
}
}
zz_p *xp = X[i].elts();
for (j = 0; j < m; j++)
xp[j].LoopHole() = acc[j];
}
}
else { // just use the old code, w/o preconditioning
long p = zz_p::modulus();
mulmod_t pinv = zz_p::ModulusInverse();
long i, j, k;
long acc, tmp;
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
acc = 0;
for(k = 1; k <= l; k++) {
tmp = MulMod(rep(A(i,k)), rep(B(k,j)), p, pinv);
acc = AddMod(acc, tmp, p);
}
X(i,j).LoopHole() = acc;
}
}
}
}
开发者ID:brown722，项目名称:FHE-BGV，代码行数:69，代码来源:mat_lzz_p.c
示例11: inv
void inv(zz_p& d, mat_zz_p& X, const mat_zz_p& A)
{
long n = A.NumRows();
if (A.NumCols() != n)
LogicError("inv: nonsquare matrix");
if (n == 0) {
set(d);
X.SetDims(0, 0);
return;
}
long i, j, k, pos;
zz_p t1, t2, t3;
zz_p *x, *y;
mat_zz_p M;
M.SetDims(n, 2*n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = A[i][j];
clear(M[i][n+j]);
}
set(M[i][n+i]);
}
zz_p det;
set(det);
long p = zz_p::modulus();
mulmod_t pinv = zz_p::ModulusInverse();
for (k = 0; k < n; k++) {
pos = -1;
for (i = k; i < n; i++) {
if (!IsZero(M[i][k])) {
pos = i;
break;
}
}
if (pos != -1) {
if (k != pos) {
swap(M[pos], M[k]);
negate(det, det);
}
mul(det, det, M[k][k]);
inv(t3, M[k][k]);
M[k][k] = t3;
for (i = k+1; i < n; i++) {
// M[i] = M[i] - M[k]*M[i,k]*t3
mul(t1, M[i][k], t3);
negate(t1, t1);
x = M[i].elts() + (k+1);
y = M[k].elts() + (k+1);
long T1 = rep(t1);
mulmod_precon_t t1pinv = PrepMulModPrecon(T1, p, pinv); // T1*pinv;
long T2;
for (j = k+1; j < 2*n; j++, x++, y++) {
// *x = *x + (*y)*t1
T2 = MulModPrecon(rep(*y), T1, p, t1pinv);
x->LoopHole() = AddMod(rep(*x), T2, p);
}
}
}
else {
clear(d);
return;
}
}
X.SetDims(n, n);
for (k = 0; k < n; k++) {
for (i = n-1; i >= 0; i--) {
clear(t1);
for (j = i+1; j < n; j++) {
mul(t2, X[j][k], M[i][j]);
add(t1, t1, t2);
}
sub(t1, M[i][n+k], t1);
mul(X[i][k], t1, M[i][i]);
}
}
d = det;
}
开发者ID:brown722，项目名称:FHE-BGV，代码行数:94，代码来源:mat_lzz_p.c
示例12: determinant
void determinant(zz_p& d, const mat_zz_p& M_in)
{
long k, n;
long i, j;
long pos;
zz_p t1, t2, t3;
zz_p *x, *y;
mat_zz_p M;
M = M_in;
n = M.NumRows();
if (M.NumCols() != n)
LogicError("determinant: nonsquare matrix");
if (n == 0) {
set(d);
return;
}
zz_p det;
set(det);
long p = zz_p::modulus();
mulmod_t pinv = zz_p::ModulusInverse();
for (k = 0; k < n; k++) {
pos = -1;
for (i = k; i < n; i++) {
if (!IsZero(M[i][k])) {
pos = i;
break;
}
}
if (pos != -1) {
if (k != pos) {
swap(M[pos], M[k]);
negate(det, det);
}
mul(det, det, M[k][k]);
inv(t3, M[k][k]);
for (i = k+1; i < n; i++) {
// M[i] = M[i] - M[k]*M[i,k]*t3
mul(t1, M[i][k], t3);
negate(t1, t1);
x = M[i].elts() + (k+1);
y = M[k].elts() + (k+1);
long T1 = rep(t1);
mulmod_precon_t t1pinv = PrepMulModPrecon(T1, p, pinv); // T1*pinv;
long T2;
for (j = k+1; j < n; j++, x++, y++) {
// *x = *x + (*y)*t1
T2 = MulModPrecon(rep(*y), T1, p, t1pinv);
x->LoopHole() = AddMod(rep(*x), T2, p);
}
}
}
else {
clear(d);
return;
}
}
d = det;
}
开发者ID:brown722，项目名称:FHE-BGV，代码行数:76，代码来源:mat_lzz_p.c
示例13: mul
void mul(vec_zz_p& x, const vec_zz_p& a, const mat_zz_p& B)
{
long l = a.length();
long m = B.NumCols();
if (l != B.NumRows())
LogicError("matrix mul: dimension mismatch");
if (m == 0) {
x.SetLength(0);
}
else if (m == 1) {
long p = zz_p::modulus();
mulmod_t pinv = zz_p::ModulusInverse();
long acc, tmp;
long k;
acc = 0;
for(k = 1; k <= l; k++) {
tmp = MulMod(rep(a(k)), rep(B(k,1)), p, pinv);
acc = AddMod(acc, tmp, p);
}
x.SetLength(1);
x(1).LoopHole() = acc;
}
else { // m > 1. precondition
long p = zz_p::modulus();
mulmod_t pinv = zz_p::ModulusInverse();
vec_long::Watcher watch_mul_aux_vec(mul_aux_vec);
mul_aux_vec.SetLength(m);
long *acc = mul_aux_vec.elts();
long j, k;
const zz_p* ap = a.elts();
for (j = 0; j < m; j++) acc[j] = 0;
for (k = 0; k < l; k++) {
long aa = rep(ap[k]);
if (aa != 0) {
const zz_p* bp = B[k].elts();
long T1;
mulmod_precon_t aapinv = PrepMulModPrecon(aa, p, pinv);
for (j = 0; j < m; j++) {
T1 = MulModPrecon(rep(bp[j]), aa, p, aapinv);
acc[j] = AddMod(acc[j], T1, p);
}
}
}
x.SetLength(m);
zz_p *xp = x.elts();
for (j = 0; j < m; j++)
xp[j].LoopHole() = acc[j];
}
}
开发者ID:brown722，项目名称:FHE-BGV，代码行数:68，代码来源:mat_lzz_p.c
示例14: installFunctions
static void installFunctions(malEnvPtr env) {
for (auto &function : malFunctionTable) {
rep(function, env);
}
}
开发者ID:BlinkD，项目名称:mal，代码行数:5，代码来源:step4_if_fn_do.cpp
示例15: debug
void debug() {
printf("%d %d\n", n, m);
rep(i,n) {
rep(j,m) cout << a[i][j] << " ";
puts("");
}
开发者ID:bill125，项目名称:OI，代码行数:6，代码来源:Matrix_Multi.cpp
示例16: a_width
Coord Display::a_width() const
{
DisplayRep& d = *rep();
return d.width_;
}
开发者ID:PNCG，项目名称:neuron，代码行数:5，代码来源:display.cpp
示例17: conv
inline void conv(NTL::vec_long& to, NTL::vec_zz_p& from)
{
to.SetLength(from.length());
for (long i=0; i<from.length(); i++) to[i]=rep(from[i]);
}
开发者ID:dwu4，项目名称:fhe-si，代码行数:5，代码来源:CModulus.cpp
示例18: init_is_square
void init_is_square() {
rep(i,0,64) M |= 1ULL << (63-(i*i)%64); }
开发者ID:Cybuster，项目名称:CompetitiveProgramming，代码行数:2，代码来源:is_square.cpp
示例19: bn254_fp2_to_mpz
//-------------------------------------------
// i/o operation (octet string)
//-------------------------------------------
void bn254_fp2_to_mpz(mpz_t a, const Element x)
{
mpz_set(a, rep(rep0(x))); // a = rep0
mpz_addmul(a, rep(rep1(x)), field(x)->base->order); //a = a + rep1*p
}
开发者ID:akirakanaoka，项目名称:teplatest，代码行数:8，代码来源:bn254_fp2.c
示例20: rep
void SmackModuleGenerator::generateProgram(llvm::Module& M) {
Naming naming;
SmackRep rep(&M.getDataLayout(), naming, program, getAnalysis<Regions>());
std::list<Decl*>& decls = program.getDeclarations();
DEBUG(errs() << "Analyzing globals...\n");
for (auto& G : M.globals()) {
auto ds = rep.globalDecl(&G);
decls.insert(decls.end(), ds.begin(), ds.end());
}
DEBUG(errs() << "Analyzing functions...\n");
for (auto& F : M) {
// Reset the counters for per-function names
naming.reset();
DEBUG(errs() << "Analyzing function: " << naming.get(F) << "\n");
auto ds = rep.globalDecl(&F);
decls.insert(decls.end(), ds.begin(), ds.end());
auto procs = rep.procedure(&F);
assert(procs.size() > 0);
if (naming.get(F) != Naming::DECLARATIONS_PROC)
decls.insert(decls.end(), procs.begin(), procs.end());
if (F.isDeclaration())
continue;
if (!F.empty() && !F.getEntryBlock().empty()) {
DEBUG(errs() << "Analyzing function body: " << naming.get(F) << "\n");
for (auto P : procs) {
SmackInstGenerator igen(getAnalysis<LoopInfoWrapperPass>(F).getLoopInfo(), rep, *P, naming);
DEBUG(errs() << "Generating body for " << naming.get(F) << "\n");
igen.visit(F);
DEBUG(errs() << "\n");
// First execute static initializers, in the main procedure.
if (F.hasName() && SmackOptions::isEntryPoint(F.getName())) {
P->insert(Stmt::call(Naming::INITIALIZE_PROC));
} else if (naming.get(F).find(Naming::INIT_FUNC_PREFIX) == 0)
rep.addInitFunc(&F);
}
DEBUG(errs() << "Finished analyzing function: " << naming.get(F) << "\n\n");
}
// MODIFIES
// ... to do below, after memory splitting is determined.
}
auto ds = rep.auxiliaryDeclarations();
decls.insert(decls.end(), ds.begin(), ds.end());
decls.insert(decls.end(), rep.getInitFuncs());
// NOTE we must do this after instruction generation, since we would not
// otherwise know how many regions to declare.
program.appendPrelude(rep.getPrelude());
std::list<Decl*> kill_list;
for (auto D : program) {
if (auto P = dyn_cast<ProcDecl>(D)) {
if (D->getName().find(Naming::CONTRACT_EXPR) != std::string::npos) {
decls.insert(decls.end(), Decl::code(P));
kill_list.push_back(P);
}
}
}
for (auto D : kill_list)
decls.erase(std::remove(decls.begin(), decls.end(), D), decls.end());
}
开发者ID:chubbymaggie，项目名称:smack，代码行数:77，代码来源:SmackModuleGenerator.cpp
注：本文中的rep函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。 |
客服电话
APP下载
官方微信
请发表评论