Home
last modified time | relevance | path

Searched +refs:set +refs:modulus (Results 1 – 25 of 5205) sorted by relevance

12345678910>>...209

/dports/security/seal/SEAL-3.7.2/native/src/seal/util/
H A Dntt.cpp251 modulus_ = modulus; in initialize()
270 root.set(root_, modulus_); in initialize()
274 root_powers_[reverse_bits(i, coeff_count_power_)].set(power, modulus_); in initialize()
277 root_powers_[0].set(static_cast<uint64_t>(1), modulus_); in initialize()
280 root.set(inv_root_, modulus_); in initialize()
284 inv_root_powers_[reverse_bits(i - 1, coeff_count_power_) + 1].set(power, modulus_); in initialize()
287 inv_root_powers_[0].set(static_cast<uint64_t>(1), modulus_); in initialize()
383 if (!modulus.size()) in CreateNTTTables()
420 std::uint64_t modulus = tables.modulus().value(); in ntt_negacyclic_harvey()
430 if (I >= modulus) in ntt_negacyclic_harvey()
[all …]
/dports/math/R-cran-gmp/gmp/src/
H A Dbigvec.cc10 modulus(0), in bigvec()
20 modulus(vecteur.modulus.size()), in bigvec()
26 modulus.resize(vecteur.modulus.size()); in bigvec()
62 s += modulus[i%modulus.size()].str(b); in str()
88 void bigvec::set(unsigned int row, unsigned int col, const bigmod & val) { in set() function in bigvec
89 set( row + col*nrow,val); in set()
114 void bigvec::set(unsigned int i,const bigmod & val) in set() function in bigvec
140 modulus.push_back(modulus[j % nrow_mod]); in set()
182 modulus.push_back(modulus[i % nrow_mod]); in push_back()
255 modulus.resize(rhs.modulus.size()); in operator =()
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/alg/
H A Dsmallmod.red32 fluid '(!*balanced_mod current!-modulus modulus!/2);
36 symbolic procedure set!-modulus p; set!-general!-modulus p;
38 symbolic procedure set!-small!-modulus p;
40 scalar previous!-modulus;
41 if p>largest!-small!-modulus
43 previous!-modulus:=current!-modulus;
44 current!-modulus:=p;
45 modulus!/2 := p/2;
46 return previous!-modulus
132 else if n>=current!-modulus-1 and primep current!-modulus
[all …]
H A Dgenmod.red35 fluid '(!*balanced_mod current!-modulus modulus!/2);
39 symbolic procedure set!-general!-modulus p;
43 previous!-modulus:=current!-modulus;
44 current!-modulus:=p;
45 modulus!/2 := p/2;
47 % that CSL supports "set-small-modulus" setting a general potentially bignum
51 % checking the identity of the Lisp system I now see if set!-small!-modulus
57 '((lambda (!*protfg) (set!-small!-modulus (expt 2 64))) t)
61 set!-small!-modulus p;
68 if result >= current!-modulus then result:=result-current!-modulus;
[all …]
/dports/math/4ti2/4ti2-Release_1_6_9/src/zsolve/
H A DRelation.hpp47 set (type); in Relation()
50 Relation (const T& modulus) in Relation() argument
52 set (modulus); in Relation()
55 void set (RelationType type) in set() function in _4ti2_zsolve_::Relation
68 void set (const T& modulus) in set() function in _4ti2_zsolve_::Relation
71 m_modulus = modulus; in set()
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fq_embed_templates/
H A Dembed.c26 TEMPLATE(T, set)(gen_sup, gen_sub, sup_ctx); in TEMPLATE()
40 TEMPLATE(T, poly_t) modulus, fact; in _TEMPLATE()
43 TEMPLATE(T, poly_init) (modulus, sup_ctx); in _TEMPLATE()
45 TEMPLATE4(T, poly_set, B, poly)(modulus, in _TEMPLATE()
52 while (TEMPLATE(T, poly_degree)(modulus, sup_ctx) != 1) in _TEMPLATE()
55 (fact, state, modulus, 1, sup_ctx)) in _TEMPLATE()
58 TEMPLATE(T, poly_set)(modulus, fact, sup_ctx); in _TEMPLATE()
62 TEMPLATE(T, set)(gen_sup, modulus->coeffs, sup_ctx); in _TEMPLATE()
67 TEMPLATE(T, poly_clear) (modulus, sup_ctx); in _TEMPLATE()
/dports/math/e-antic/flint2-ae7ec89/fq_embed_templates/
H A Dembed.c26 TEMPLATE(T, set)(gen_sup, gen_sub, sup_ctx); in TEMPLATE()
40 TEMPLATE(T, poly_t) modulus, fact; in _TEMPLATE()
43 TEMPLATE(T, poly_init) (modulus, sup_ctx); in _TEMPLATE()
45 TEMPLATE4(T, poly_set, B, poly)(modulus, in _TEMPLATE()
52 while (TEMPLATE(T, poly_degree)(modulus, sup_ctx) != 1) in _TEMPLATE()
55 (fact, state, modulus, 1, sup_ctx)) in _TEMPLATE()
58 TEMPLATE(T, poly_set)(modulus, fact, sup_ctx); in _TEMPLATE()
62 TEMPLATE(T, set)(gen_sup, modulus->coeffs, sup_ctx); in _TEMPLATE()
67 TEMPLATE(T, poly_clear) (modulus, sup_ctx); in _TEMPLATE()
/dports/math/flint2/flint-2.8.4/fq_embed_templates/
H A Dembed.c26 TEMPLATE(T, set)(gen_sup, gen_sub, sup_ctx); in TEMPLATE()
40 TEMPLATE(T, poly_t) modulus, fact; in _TEMPLATE()
43 TEMPLATE(T, poly_init) (modulus, sup_ctx); in _TEMPLATE()
45 TEMPLATE4(T, poly_set, B, poly)(modulus, in _TEMPLATE()
52 while (TEMPLATE(T, poly_degree)(modulus, sup_ctx) != 1) in _TEMPLATE()
55 (fact, state, modulus, 1, sup_ctx)) in _TEMPLATE()
58 TEMPLATE(T, poly_set)(modulus, fact, sup_ctx); in _TEMPLATE()
62 TEMPLATE(T, set)(gen_sup, modulus->coeffs, sup_ctx); in _TEMPLATE()
67 TEMPLATE(T, poly_clear) (modulus, sup_ctx); in _TEMPLATE()
/dports/math/gmp-ecm/ecm-7.0.4/
H A Dpm1fs2.c1760 set_long_t *set = sets->sets; in mem_poly_from_sets_V() local
1768 set = sets_nextset (set); in mem_poly_from_sets_V()
1769 c = set->card; in mem_poly_from_sets_V()
1808 ASSERT_ALWAYS (set->elem[0] == -set->elem[set->card - 1]); in poly_from_sets_V()
1823 V (Qt, Q, set->elem[0], modulus); /* First set in sets is {-k, k} */ in poly_from_sets_V()
1843 set = sets_nextset (set); in poly_from_sets_V()
1847 c = set->card; in poly_from_sets_V()
1854 ASSERT_ALWAYS (set->elem[0] == -set->elem[c - 1]); in poly_from_sets_V()
1855 V (Qt, Q, set->elem[0], modulus); in poly_from_sets_V()
1872 ASSERT_ALWAYS (set->elem[i] == -set->elem[c - 1L - i]); in poly_from_sets_V()
[all …]
/dports/biology/bbmap/bbmap/current/structures/
H A DIntHashSet.java38 set.add(x); in main()
47 set.remove(x); in main()
56 set.add(x); in main()
65 set.remove(x); in main()
90 set.add(value); in main()
340 final int limit=array.length, initial=(int)((value&MASK)%modulus);
357 final int limit=array.length, initial=(int)((value&MASK)%modulus);
380 assert(newPrime>modulus) : "Overflow: "+size+", "+size2+", "+modulus+", "+newPrime;
381 modulus=(int)newPrime;
384 sizeLimit=(int)(modulus*loadFactor);
[all …]
H A DLongHashSet.java38 set.add(x); in main()
47 set.remove(x); in main()
56 set.add(x); in main()
65 set.remove(x); in main()
90 set.add(value); in main()
309 final int limit=array.length, initial=(int)((value&MASK)%modulus);
326 final int limit=array.length, initial=(int)((value&MASK)%modulus);
349 assert(newPrime>modulus) : "Overflow: "+size+", "+size2+", "+modulus+", "+newPrime;
350 modulus=(int)newPrime;
353 sizeLimit=(int)(modulus*loadFactor);
[all …]
H A DIntHashMapBinary.java18 IntHashMapBinary set=new IntHashMapBinary(32, 0.7f); in main() local
19 test(set); in main()
67 public int put(int key, int value){return set(key, value);} in put()
70 public int set(int key, int value){ in set() method in IntHashMapBinary
173 final int limit=keys.length, initial=key&modulus;
190 final int limit=keys.length, initial=key&modulus;
204 resize(Tools.max(2, modulus+1)*2L);
213 assert(newModulus>modulus);
217 modulus=(int)newModulus;
235 set(k, v);
[all …]
/dports/math/R-cran-gmp/gmp/man/
H A Dmodulus.Rd1 \name{modulus}
2 \alias{modulus}
3 \alias{modulus<-}
4 \alias{modulus.bigz}
5 \alias{modulus<-.bigz}
11 Or the modulus can be set to \eqn{m} which means
16 modulus(a)
17 modulus(a) <- value
29 modulus(x) <- 31
34 # reset modulus to "none":
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/factor/
H A Dalphas.red29 fluid '(alphalist current!-modulus hensel!-growth!-size
51 om:=set!-modulus hensel!-growth!-size;
58 set!-modulus om
65 om:=set!-modulus hensel!-growth!-size;
73 set!-modulus om
80 om:=set!-modulus hensel!-growth!-size;
83 set!-modulus om;
H A Dunihens.red72 old!-modulus:=set!-modulus p;
138 set!-modulus old!-modulus;
231 set!-modulus om;
268 set!-modulus m;
283 set!-modulus m;
294 set!-modulus m;
533 % set!-modulus om
565 set!-modulus om
572 set!-modulus m;
914 set!-modulus oldm
[all …]
H A Dimageset.red48 image!-set!-modulus
51 modulus!/2
155 % image-set-modulus. If the boolean tagged with a variable is true then
163 image!-set!-modulus:=iadd1 image!-set!-modulus;
164 old!.m:=set!-modulus image!-set!-modulus;
167 if n>modulus!/2 then n:=n-current!-modulus;
173 if n>modulus!/2 then n:=n-current!-modulus >>;
176 old!.m:=set!-modulus image!-set!-modulus;
189 if n>modulus!/2 then n:=n-current!-modulus;
197 set!-modulus old!.m;
[all …]
H A Dfacstr.red35 best!-set!-pointer
36 current!-modulus
69 % modulus.
73 om:=set!-modulus hensel!-growth!-size;
86 s:=getv(valid!-image!-sets,best!-set!-pointer);
87 vset!-mod!-p:=for each v in get!-image!-set s collect
105 prin2!* "The modulus is "; printstr current!-modulus >>;
116 set!-modulus om;
153 set!-modulus om;
163 set!-modulus om;
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/crypto/bls12381/
H A Dfp.go85 z := new(fe).set(r1)
92 c.set(z)
100 u := new(fe).set(&modulus)
101 v := new(fe).set(e)
143 if r.cmp(&modulus) != -1 || z > 0 {
144 lsubAssign(r, &modulus)
146 u.set(&modulus)
153 inv.set(u)
157 u, v := new(fe).set(a), new(fe)
/dports/security/palisade/palisade-release-d76213499af44558170cca6c72c5314755fec23c/src/core/lib/math/
H A Dnbtheory.cpp56 usint modulusWidth = modulus.GetMSB();
150 std::set<IntType> primeFactors;
191 std::set<IntType> primeFactors;
235 std::set<IntType> primeFactors;
433 void PrimeFactorize(IntType n, std::set<IntType> &primeFactors) {
592 auto mu = modulus.ComputeMu();
676 auto mu = modulus.ComputeMu();
680 val = val.Mod(modulus, mu);
714 IntVector result(n, modulus);
716 auto mu = modulus.ComputeMu();
[all …]
/dports/devel/stxxl/stxxl-1.4.1/tests/containers/
H A Dtest_matrix.cpp47 unsigned_type step, counter, modulus; member
50 modulus_integers(unsigned_type start = 1, unsigned_type step = 1, unsigned_type modulus = 0) in modulus_integers()
53 modulus(modulus) in modulus_integers()
59 if (modulus != 0 && counter >= modulus) in operator ++()
60 counter %= modulus; in operator ++()
182 matrix_stats_before.set(); in test1()
189 matrix_stats_after.set(); in test1()
220 matrix_stats_before.set(); in test1()
227 matrix_stats_after.set(); in test1()
315 matrix_stats_before.set(); in test2()
[all …]
/dports/math/gap/gap-4.11.0/pkg/resclasses-4.7.2/doc/
H A Dmanual.six13 033[101X", "1", [ 1, 0, 0 ], 1, 4, "set-theoretic unions of residue classes",
16 "\033[1X\033[33X\033[0;-2YEntering residue classes and set-theoretic unions\
18 "entering residue classes and set-theoretic unions thereof",
111 4, "modulus of a residue class", "X8753CC098447BE0D" ],
138 [ 1, 1, 2 ], 39, 4, "modulus of a residue class union",
158 that modulus", "1.1-3", [ 1, 1, 3 ], 98, 5,
159 "allresidueclassesmodulo by modulus of the default ring of that modulus"
296 fault ring of that modulus", "2.1-3", [ 2, 1, 3 ], 59, 13,
298 that modulus", "X8198386A809A6B17" ],
352 [ "\033[2XZ_pi\033[102X by set of non-invertible primes", "3.1-1",
[all …]
/dports/math/calc/calc-2.14.0.14/help/
H A Dsrandom30 Blum modulus:
36 Some integer squared modulo the Blum modulus.
70 modulus until we get a smaller value (modulus wrap). The
73 /* assume n is the current Blum modulus */
88 The newn value is used as the new Blum modulus. This modulus
101 srandom(0, newn); /* set Blum modulus & def quad res */
102 srandom(seed); /* set quadratic residue */
159 value < p*q. The following may be useful to set ir:
220 srandom(0, newn); /* set Blum modulus & def quad res */
221 srandom(seed); /* set quadratic residue */
[all …]
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/doc/
H A DFp_rational_function.tex35 denominator of $f$. Each \code{Fp_rational_function} has it's own modulus which must be set
61 initializes with a copy of the polynomial $f$. The modulus is set to the modulus of $f$.
70 initializes with a copy of the rational function $f$. The modulus is set to the modulus of
83 assignment functions set the modulus of the result to the modulus of the input variable (if
113 set the numerator of $f$ to $g$. If the modulus of $g$ is different from the modulus of $f$,
118 set the denominator of $f$ to $g$. If the modulus of $g$ is different from the modulus of
142 also set to zero.
200 is bigger than the degree of the numerator of $f$, then $a$ is set to zero. For negative
206 $i$ is bigger than the degree of the denominator of $f$, then $a$ is set to zero. For
332 $\deg(r) < \deg (d)$. $f$ is set to $r / d$.
[all …]
/dports/sysutils/py-salt/salt-3004.1/doc/topics/tutorials/
H A Djinja_to_execution_module.rst32 {% set storage = default_settings.storage %}
43 {% set colo = pillar.get('inventory', {}).get('colo', 'Unknown') %}
44 {% set servers_list = pillar.get('storage_servers', {}).get(colo, [storage.depot_ip, ]) %}
46 {% set modulus = servers_list | count %}
47 {% set integer_id = opts.id | replace('foo', '') | int %}
48 {% set server_index = integer_id % modulus %}
50 {% set server_index = 0 %}
77 {% set storage = default_settings.storage %}
132 This loadbalances across storage servers by using the modulus of the client's id number.
150 modulus = len(servers_list)
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/arch/alpha/lib/
H A Ddivide.S65 #define modulus $2 macro
73 #define modulus $27 macro
94 .set noat
106 bis $24,$24,modulus
111 LONGIFY(modulus)
125 1: cmpult divisor,modulus,compare
130 1: cmpult divisor,modulus,compare
141 cmpule divisor,modulus,compare
142 subq modulus,divisor,tmp1
145 cmovne compare,tmp1,modulus

12345678910>>...209