Home
last modified time | relevance | path

Searched refs:QuoInt (Results 1 – 25 of 278) sorted by relevance

12345678910>>...12

/dports/math/gap/gap-4.11.0/src/
H A Drational.c240 numS = SumInt( ProdInt( numL, QuoInt( denR, gcd1 ) ), in SumRat()
241 ProdInt( numR, QuoInt( denL, gcd1 ) ) ); in SumRat()
243 numS = QuoInt( numS, gcd2 ); in SumRat()
244 denS = ProdInt( QuoInt( denL, gcd1 ), QuoInt( denR, gcd2 ) ); in SumRat()
375 numD = DiffInt( ProdInt( numL, QuoInt( denR, gcd1 ) ), in DiffRat()
378 numD = QuoInt( numD, gcd2 ); in DiffRat()
379 denD = ProdInt( QuoInt( denL, gcd1 ), QuoInt( denR, gcd2 ) ); in DiffRat()
443 numP = ProdInt( QuoInt( numL, gcd1 ), QuoInt( numR, gcd2 ) ); in ProdRat()
444 denP = ProdInt( QuoInt( denL, gcd2 ), QuoInt( denR, gcd1 ) ); in ProdRat()
548 numQ = ProdInt( QuoInt( numL, gcd1 ), QuoInt( denR, gcd2 ) ); in QuoRat()
[all …]
/dports/math/gap/gap-4.11.0/pkg/SmallGrp-1.4.1/small8/
H A Dsmlgp8.g111 op := QuoInt( op, 2 );
190 file := QuoInt( i + 2499, 2500 );
221 cf := QuoInt( cf, 2 ^ lf );
237 n1 := QuoInt( n1, 2 );
243 n1 := QuoInt( n1, 2 );
245 cf := QuoInt( cf, 2 ^ llf );
246 cs := QuoInt( cs, 2 ^ 54 );
257 cf := QuoInt( cf, sf );
268 cs := QuoInt( cs, ss );
/dports/math/gap/gap-4.11.0/tst/testinstall/
H A Dintarith.tst15 gap> QuoInt(1,1);
291 # QuoInt
317 gap> QuoInt(bigNeg, 0);
319 gap> QuoInt(smlNeg, 0);
321 gap> QuoInt(smlPos, 0);
323 gap> QuoInt(bigPos, 0);
325 gap> QuoInt(fail,1);
327 gap> QuoInt(1,fail);
331 gap> QuoInt(-2^28, -1);
333 gap> QuoInt(-2^60, -1);
[all …]
H A Dinteger.tst24 gap> QuoInt(5, 3);
26 gap> QuoInt(-5, 3);
28 gap> QuoInt(-5, -3);
30 gap> QuoInt(5, -3);
/dports/math/gap/gap-4.11.0/pkg/datastructures-0.2.5/tst/
H A Dplistdeque.tst48 gap> q := PlistDeque(QuoInt(N, 3));;
100 gap> for i in [1..QuoInt(N, 2)] do PushFront(q,i); od;
101 gap> out1 := List([1..QuoInt(N, 3)], x -> PopBack(q));;
102 gap> out2 := List([1..QuoInt(N, 3)], x -> PopFront(q));;
104 gap> out3 := List([1..QuoInt(N, 3)], x -> PopFront(q));;
106 gap> out1 = [N,N-1..N - QuoInt(N, 3) + 1];
/dports/math/gap/gap-4.11.0/pkg/cvec-2.7.4/test/
H A Dmatmultest.g10 for i in [1..QuoInt(NumberColumns(m)+96,97)] do
11 for j in [1..QuoInt(NumberRows(m)+96,97)] do
44 nrblocks := QuoInt(m+le-1,le);
79 reps := QuoInt(5000,t);
119 reps := QuoInt(5000,t);
157 bo := QuoInt(bo+1,2);
170 reps := QuoInt(1000,t);
243 count := Maximum(QuoInt(count,Maximum(1,QuoInt(time,2000))),1);
249 size := QuoInt(uplim+lowlim,2);
252 sizeh := QuoInt(size,2);
[all …]
/dports/math/gap/gap-4.11.0/pkg/irredsol-1.4/lib/
H A Dutil.gi18 return QuoInt(n, 2^i) mod 2 = 1;
80 n := QuoInt(n, q);
129 n := QuoInt(n, 2);
152 n := QuoInt(n, 2);
165 n := QuoInt(n, ros[j]);
/dports/math/gap/gap-4.11.0/pkg/polycyclic-2.15.1/gap/action/
H A Ddixon.gi30 return QuoInt( a * 3, 4 );
127 t2 := QuoInt( 3 * 7 * d^2 * t2, 2 * LogInt(d,2) );
131 return QuoInt( t^n + 1, t );
176 t := 7 * d^2 * s / QuoInt( 2 * LogInt(d,2), 3 );
177 return QuoInt( t^Length(gens) + 1, t );
/dports/math/gap/gap-4.11.0/pkg/EDIM-1.3.5/lib/
H A Dutil.gi40 while n mod p = 0 do Add( factors, p ); n := QuoInt(n, p); od;
47 while n mod p = 0 do Add( factors, p ); n := QuoInt(n, p); od;
56 n := QuoInt(n, p);
111 q := QuoInt(a,as); s := -s;
135 p2 := QuoInt(p,2);
186 p2 := QuoInt(p, 2);
239 CheapFactorsInt(QuoInt(p, gcd))));
H A Dedim.gi51 p2 := QuoInt(p,2);
120 prr2 := p^QuoInt(rr,2);
149 prr2 := p^QuoInt(rr,2);
161 prr2 := p^QuoInt(rr,2);
211 prr2 := p^QuoInt(rr,2);
240 prr2 := p^QuoInt(rr,2);
251 prr2 := p^QuoInt(rr,2);
311 prr2 := p^QuoInt(rr,2);
336 prr2 := p^QuoInt(rr,2);
347 prr2 := p^QuoInt(rr,2);
[all …]
/dports/math/gap/gap-4.11.0/hpcgap/lib/
H A Dinteger.gi383 return QuoInt( n + QuoInt( m - 1, 2 ), m );
385 return QuoInt( n - QuoInt( m - 1, 2 ), m );
387 return QuoInt( n - QuoInt( m + 1, 2 ), m );
389 return QuoInt( n + QuoInt( m + 1, 2 ), m );
441 i := QuoInt( i, q );
894 q := QuoInt( f, g );
1020 return QuoInt(Log2Int(n), 3);
1360 return QuoInt( n, m );
1520 q := QuoInt( n, m );
1569 q := QuoInt(n,m);
[all …]
/dports/math/gap/gap-4.11.0/lib/
H A Dinteger.gi383 return QuoInt( n + QuoInt( m - 1, 2 ), m );
385 return QuoInt( n - QuoInt( m - 1, 2 ), m );
387 return QuoInt( n - QuoInt( m + 1, 2 ), m );
389 return QuoInt( n + QuoInt( m + 1, 2 ), m );
441 i := QuoInt( i, q );
886 q := QuoInt( f, g );
1012 return QuoInt(Log2Int(n), 3);
1352 return QuoInt( n, m );
1512 q := QuoInt( n, m );
1561 q := QuoInt(n,m);
[all …]
H A Dmatint.gi39 t:=QuoInt(t,x);
66 q:=MATINTsplit(QuoInt(d[i],g),g);
94 M[i]:=QuoInt(g,h);
97 g:=QuoInt(a,h);
100 b:=QuoInt(v[i],h);
139 q := QuoInt(f-(f mod g),g);
207 b := QuoInt(A[i],g.gcd);
439 q := QuoInt(A[i,c1],A[r,c1]);
516 q := QuoInt(A[r,j],A[r,r]);
961 q := QuoInt(A[i,c1],A[r,c1]);
[all …]
H A Dgrppcrep.gi258 l := QuoInt( dE, r );
280 c := PrimitiveRoot( E ) ^ QuoInt( LogFFE( e, PrimitiveRoot(E) ),
281 QuoInt( p^dE - 1, p^l - 1 ) );
373 c := PrimitiveRoot( E ) ^ QuoInt( LogFFE( e, PrimitiveRoot(E) ), r );
379 c := c * PrimitiveRoot( E ) ^ QuoInt( p^dE-1, r );
389 c := PrimitiveRoot( L ) ^ QuoInt( LogFFE( e, PrimitiveRoot( L ) ), r );
428 w := PrimitiveRoot(E)^QuoInt( p^b-1, r );
430 w := w * PrimitiveRoot(E)^QuoInt( p^b-1, r );
440 w := PrimitiveRoot( F )^QuoInt( p^d - 1, r );
445 w := w * PrimitiveRoot( F )^QuoInt( p^d - 1, r );
/dports/math/gap/gap-4.11.0/pkg/recog-1.3.2/misc/obsolete/
H A Dblackbox.gi84 vars.B := QuoInt(vars.A,2);
87 vars.C := QuoInt(vars.A,4);
151 vars.B := QuoInt(vars.A,2);
177 vars.E := QuoInt(vars.D,3);
286 vars.B := QuoInt(vars.A,2);
293 vars.C := QuoInt(vars.A,3);
305 vars.D := QuoInt(vars.A,2);
403 vars.B := QuoInt(vars.A,3);
475 vars.B := QuoInt(vars.A,2);
482 vars.C := QuoInt(vars.A,5);
[all …]
/dports/math/gap/gap-4.11.0/pkg/lpres-1.0.1/gap/
H A Dhnf.gi28 A[j]:=A[j]-(QuoInt(A[j][HNF.Heads[i]],A[i][HNF.Heads[i]])+1) * A[i];
30 A[j]:=A[j]-(QuoInt(A[j][HNF.Heads[i]],A[i][HNF.Heads[i]])) * A[i];
70 q:=-QuoInt(HNF.mat[row][column],HNF.mat[corner][column])+1;
73 q:=QuoInt(HNF.mat[row][column],HNF.mat[corner][column]);
249 ev:=ev-(QuoInt(ev[i],HNF.mat[l][i]))*HNF.mat[l];
251 ev:=ev-(QuoInt(ev[i],HNF.mat[l][i])-1)*HNF.mat[l];
/dports/math/gap/gap-4.11.0/pkg/recog-1.3.2/misc/bbox/
H A DJ2G1-find1.g29 vars.B := QuoInt(vars.A,2);
36 vars.C := QuoInt(vars.A,3);
48 vars.D := QuoInt(vars.A,2);
H A DM11G1-find1.g26 vars.B := QuoInt(vars.A,2);
29 vars.C := QuoInt(vars.A,4);
H A DLyG1-find1.g27 vars.B := QuoInt(vars.A,2);
34 vars.C := QuoInt(vars.A,5);
H A DM12G1-find1.g28 vars.B := QuoInt(vars.A,2);
54 vars.E := QuoInt(vars.D,3);
/dports/math/gap/gap-4.11.0/hpcgap/demo/
H A Dpartests.g36 SpinInners.(which)(QuoInt(microseconds*SpinsPerSecond.(which),1000000));
48 SpinsPerSecond.(n) := QuoInt(200*ct,t);
/dports/math/gap/gap-4.11.0/pkg/io-4.7.0/gap/
H A Dcallwithtimeout.gi49 seconds := QuoInt(nano, 10^9);
50 microseconds := QuoInt(nano mod 10^9, 1000);
H A Drealrandom.gi57 q := QuoInt(2^l,d+1); # now q*(d+1) <= 2^l < (q+1)*(d+1)
60 # Thus if we do QuoInt(x,q) we get something
69 i := QuoInt(i,q);
/dports/math/gap/gap-4.11.0/pkg/SmallGrp-1.4.1/small6/
H A Dsmlgp6.g94 pos := QuoInt( i + 2499, 2500 );
142 n := QuoInt( n,2^ll );
153 n := QuoInt( n, size );
/dports/math/gap/gap-4.11.0/pkg/Browse/app/
H A Dmouse.g19 tm:= QuoInt( yx[1] - 4 * hg, 2 );
20 lm:= QuoInt( yx[2] - 4 * wd, 2 );
56 NCurses.PutLine(win1, 0, QuoInt(NCurses.getmaxyx(win1)[2], 2) - 6,

12345678910>>...12