/dports/math/reduce/Reduce-svn5758-src/packages/poly/ |
H A D | compopr.red | 129 % if the second is an integer 185 % conj z => z, so z is real-valued or 345 % is real-valued. 399 % in general this is true iff impart(expo*log(base)) is an integer multiple of pi 416 % in general this is true iff arg is realvalued and positive 424 % branch-cut is the negative real axis 438 % branch-cut is the interval (-1, 1) 453 % branch-cut is the interval [-1, 1] 600 % only called when !*keepsqrts is true 756 % When Re(x) is a number in log(x), there is no point in computing the squares [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/redlog/ofsf/ |
H A D | ofsfdpep.red | 361 prodf := numr simp 1; 365 null numr simp rat_sgn 373 return numr simp 0 402 return numr simp 0 457 return numr simp 0; 462 return numr simp 0; 478 return numr simp 0; 486 return numr simp 0; 1111 b := simp 2; 1113 b := addsq(b,simp 1); [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/cali/ |
H A D | groeb.red | 167 <dpmat> gb is the Groebner basis 169 <spairlist> trace is the Groebner trace. 173 rf : {pol,simp} |---> {pol,simp} 180 this is (almost) Mora's SimpStBasis. 233 simp:=red_update(simp,pol); 254 symbolic procedure groeb!=rf1(pol,simp); {red_totalred(simp,pol),simp}; 268 simp:=red_update(simp,pol); 350 simp:=red_update(simp,pol); 373 simp:=red_update(simp,pol); 401 % Delete pairs from p, for which testB is false. [all …]
|
H A D | bcsf.red | 42 This rules list is a list of s.f. pairs, where car should replace cdr. 46 % Standard is : 58 else (numr simp second x . numr simp third x); 71 symbolic procedure bc!=simp u; 84 else rederr"recursion depth of bc!=simp too high" 93 null bc!=simp numr simp prepf u 101 % Test, whether u is invertible. Return the inverse of u or nil. 109 symbolic procedure cali_bc_prod (u,v); bc!=simp multf(u,v); 112 (if null cdr w then bc!=simp car w else typerr(v,"denominator")) 119 symbolic procedure cali_bc_power(u,n); bc!=simp exptf(u,n); [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/defint/ |
H A D | definth.red | 33 % value is list of SQ. 34 for each uu in u collect simp!* uu; 88 ff1 := prepsq simp car u; 95 % until a fix is available 118 f := prepsq simp car u; 126 if not idp var then return error(99,'fail); % something is rotten, if not... 135 alpha := simp!* car temp; 141 new_y := simp y>> 194 if v = 'fail then return simp 'fail 212 % If the Meijer G-function is is a function of a variable which is not [all …]
|
H A D | defintx.red | 163 <<% off complex; % not needed here since complex is off already. 165 on complex; % at this point it is safe to turn complex on. 190 % lower limit is 'minf. Convert this case to upper limit 'inf. 220 % this is the point at which special cases can be tested. 243 % p is a standard form. 339 % p is numerator q is denom mm is deg p nn is deg q 345 % However, for s > 2, the approach is impractical, because the 347 % following, s is tested s > 2. 428 % This is the test for defint(y**(q-1)/(a*y**n +b)**m,y,0,inf); 429 % which is converted to defint(x**(p-1)/(x+z)**m,x,0,inf); [all …]
|
/dports/french/hunspell/fr-hunspell-6.4.1/ |
H A D | fr-classique.aff | 375 SFX F. 0 0 [eë] is:fem is:sg 376 SFX F. 0 s [eë] is:fem is:pl 381 SFX F. de d de is:mas is:sg 382 SFX F. de ds de is:mas is:pl 383 SFX F. fe f fe is:mas is:sg 384 SFX F. fe fs fe is:mas is:pl 449 SFX F. uë u uë is:mas is:sg 451 SFX F. üe u üe is:mas is:sg 456 SFX W. 0 0 e is:fem is:sg 457 SFX W. e es e is:fem is:pl [all …]
|
H A D | fr-moderne.aff | 361 SFX F. 0 0 [eë] is:fem is:sg 362 SFX F. 0 s [eë] is:fem is:pl 367 SFX F. de d de is:mas is:sg 368 SFX F. de ds de is:mas is:pl 369 SFX F. fe f fe is:mas is:sg 370 SFX F. fe fs fe is:mas is:pl 435 SFX F. uë u uë is:mas is:sg 437 SFX F. üe u üe is:mas is:sg 442 SFX W. 0 0 e is:fem is:sg 443 SFX W. e es e is:fem is:pl [all …]
|
H A D | fr-reforme1990.aff | 361 SFX F. 0 0 [eë] is:fem is:sg 362 SFX F. 0 s [eë] is:fem is:pl 367 SFX F. de d de is:mas is:sg 368 SFX F. de ds de is:mas is:pl 369 SFX F. fe f fe is:mas is:sg 370 SFX F. fe fs fe is:mas is:pl 435 SFX F. uë u uë is:mas is:sg 437 SFX F. üe u üe is:mas is:sg 442 SFX W. 0 0 e is:fem is:sg 443 SFX W. e es e is:fem is:pl [all …]
|
H A D | fr-toutesvariantes.aff | 375 SFX F. 0 0 [eë] is:fem is:sg 376 SFX F. 0 s [eë] is:fem is:pl 381 SFX F. de d de is:mas is:sg 382 SFX F. de ds de is:mas is:pl 383 SFX F. fe f fe is:mas is:sg 384 SFX F. fe fs fe is:mas is:pl 449 SFX F. uë u uë is:mas is:sg 451 SFX F. üe u üe is:mas is:sg 456 SFX W. 0 0 e is:fem is:sg 457 SFX W. e es e is:fem is:pl [all …]
|
/dports/math/latte-integrale/latte-version_1_7_6/code/latte/testingSLandTopEhrhart/TopEhrhart/ |
H A D | BirkhoffGenerator.mpl | 2 #This is MAPLE code to generate random $k$-simplices 152 local V,II,simp,r,U,J,simp2; 161 simp:=[straighten(J)]: 163 Rank(Matrix(simp)); 174 simp:=[op(simp),straighten(V)]: 179 return(matrix(simp)); 183 local V,II,simp,r,U,J,simp2; 199 simp:=[straighten(J)]: 201 Rank(Matrix(simp)); 213 simp:=[op(simp),straighten(V)]: [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/taylor/ |
H A D | tayfns.red | 43 prepsq, quotsq, retimes, reval, reversip, simp, simp!*, 59 var!-is!-nth, 181 u := var!-is!-nth(tp,var); 235 % The following is not needed yet 675 % The assumption at this point is that the first term is the one 683 if is!-neg!-pl newpl 811 The simplest case is that of tangent whose equation is 974 % I rather suspect that the idea here is to create a symbol whose name is 1170 % if is!-neg!-pl TayCfPl car l 1180 a1 := simp!* {'sin,mk!*sq a0} . simp!* {'cos,mk!*sq a0}; [all …]
|
/dports/math/reduce/Reduce-svn5758-src/contrib/exptsimp/ |
H A D | exptsimp.red | 24 factorize!-expt1 (cadr u, simp caddr u); 27 % u is the basis of a expt expression 30 x := simp u; 49 % u is a list of expts, result is sorted list of expts 64 not is!-rational!-exponent caddr v 98 % u is a list of expts 113 if is!-rational!-exponent z1 126 k := prepsq simp!* {'expt, cadr car x, 184 symbolic procedure try!-expt!-simp sq; 288 w3 := negsq quotsq (simp!* car w2, simp!* cadr w2); [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/clashes/ |
H A D | diffp | 9 % The version that is in force by default. 12 % U is a standard power, V a kernel. 103 w := quotsq(simp{'df,u,x},simp{'df,v,x}); 218 % is improved. If the new provided flag DEREXP is OFF then 220 % but if DEREXP is ON then the chain rule is taken further to 226 %U is a standard power, V a kernel. 348 % U is a standard power, V a kernel. 439 w := quotsq(simp{'df,u,x},simp{'df,v,x}); 514 % U is a standard power, V a kernel. 607 then <<w := simp car x; [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/tps/ |
H A D | tps.red | 42 % <order> is the exponent of the first term of the series and is also 52 % <expansion!-point> is self-explanatory except that 55 % <value> is the originating prefix form which is needed to allow for 202 % it is only safe to set terms of order >= order of series 226 ps := prepsqxx simp!* ps; 280 p := prepsqxx simp!* p; 308 (prepsqxx simp!* carx(cdr u,'pssetorder), prepsqxx simp!* car u); 355 u:=simp!* u; 366 simp!:ps1 ps ./ 1; 375 simpfn:= 'simp!:ps1 [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/pgauss/ |
H A D | pgauss.tst | 37 % This is an important small example: 42 % In this example the inconsistency is already detected by pgspsimpl: 72 % (the first time is from v1.2, the second from v1.3) 138 sm_redp (nil, numr simp 1); %ok t 139 sm_greenp (nil, numr simp 1); %ok nil 141 sm_redp (nil, numr simp 0); %ok nil 142 sm_greenp (nil, numr simp 0); %ok t 144 sm_redp (nil, numr simp 'a); %ok nil 145 sm_greenp (nil, numr simp 'a); %ok nil 151 unsat := {cond_0mkeqt(numr simp '(plus a 1)),cond_0mkeqt(numr simp '(plus a (minus 1)))}$ [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/redlog/dvfsf/ |
H A D | dvfsfsiat.red | 169 lhs := multf(numr simp ((dvfsf_p!*)**(lv-rv)),lhs) 171 rhs := multf(numr simp ((dvfsf_p!*)**(rv-lv)),rhs); 215 p := numr simp 'p; 255 if rp and lhs = numr simp 1 then 257 if lp and rhs = numr simp 1 then 373 return numr simp {'expt,'p,n}; 376 return numr simp {'times,c,{'expt,'p,n}}; 387 return numr simp {'times,c,{'expt,'p,n}}; 449 negf red lhs,numr simp 1); 459 w := qremf(rhs,numr simp 'p); [all …]
|
/dports/chinese/p5-Encode-CNMap/Encode-CNMap-0.32/t/ |
H A D | 00base.t | 12 &setenv; is( simp_to_gb( $data_gb ), $data_gb, 'GB ->GB' ); 13 &setenv; is( simp_to_b5( $data_gb ), $data_b5, 'GB ->Big5'); 14 &setenv; is( simp_to_utf8( $data_gb ), $data_ugb, 'GB ->utf8'); 15 &setenv; is( simp_to_simputf8( $data_gb ), $data_ugb, 'GB ->simp utf8'); 18 &setenv; is( simp_to_gb( $data_gbk ), $data_gb, 'GBK ->GB' ); 19 &setenv; is( simp_to_b5( $data_gbk ), $data_b5, 'GBK ->Big5'); 21 &setenv; is( simp_to_simputf8( $data_gbk ), $data_ugb, 'GBK ->simp utf8'); 24 &setenv; is( trad_to_gb( $data_b5 ), $data_gb, 'Big5->GB' ); 27 &setenv; is( trad_to_simputf8( $data_b5 ), $data_ugb, 'Big5->simp utf8'); 30 &setenv; is( utf8_to_gb( $data_utf8), $data_gb, 'utf8-> GB' ); [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/alg/ |
H A D | elem.red | 38 % declarations is essential: 101 symbolic inline procedure sq!-is!-sign u; 102 % Returns t is s.q. u is either 1, -1, or 0 112 if sq!-is!-sign x then n:=n * numr x else s:=f.s>>; 124 if sq!-is!-sign x or sq!-is!-sign y then z := quotsq (x,y) 135 m:=if sq!-is!-sign x then numr x; 144 if fixp ex and sq!-is!-sign sb 160 % if U is constant evaluable return sign of u. 161 % the value is set aside. 262 % The next rule is implemented via combine/expand logs. [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/sum/ |
H A D | complx.red | 35 %U is a standard quotient, 36 %Value is the standard quotient real part and imaginary part of U. 51 %U is a standard form. 52 %Value is the standard form real and imag part of U. 72 return simp!* list('sinh,u) 73 . simp!* list('cosh,u)>> 80 w := simp!* list('cos,u); 81 u := simp!* list('sin,u); 83 z := simp!* list('cosh,v); 84 v := simp!* list('sinh,v); [all …]
|
/dports/math/scilab/scilab-6.1.1/scilab/modules/overloading/macros/ |
H A D | %p_a_r.sci | 1 // Scilab ( http://www.scilab.org/ ) - This file is part of Scilab 6 // This file is hereby licensed under the terms of the GNU GPL v2.0, 30 [num,den]=simp(num+m.*den,den) 34 //at leat one matrix is eye*x 40 [num,den]=simp(num+m.*den,den) 42 [num,den]=simp(num+m.*den,den*ones(m)) 44 [num,den]=simp(num+(m+0)*eye(den).*den,den)
|
H A D | %r_a_s.sci | 1 // Scilab ( http://www.scilab.org/ ) - This file is part of Scilab 6 // This file is hereby licensed under the terms of the GNU GPL v2.0, 37 [num,den] = simp(num+m.*den, den) 41 //at leat one matrix is eye*x 47 [num,den] = simp(num+m.*den,den) 49 [num,den] = simp(num+m.*den,den*ones(m)) 51 [num,den] = simp(num+(m+0)*eye(den).*den,den)
|
/dports/math/reduce/Reduce-svn5758-src/packages/int/ |
H A D | halfangl.red | 55 else simp prepsq halfangle(u,x) 82 % R is a rational expression to be converted, 84 % A rational expression is returned. 88 % Converting polynomials, a rational expression is returned. 95 % Converting kernels, a rational expression is returned. 160 if eqcar(y,'int) then error1(); % assume all is hopeless. 193 simp list('quotient, 214 else simp y; 247 simp list('plus,1,list('minus, 270 simp list('plus,1,list('minus, [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/assist/ |
H A D | polyexns.red | 70 % Not clear if it is really useful. 79 % U and V are standard forms. Value is a standard form. 89 % Works ONLY when RATIONAL is ON. 92 s:=simp!* u; 99 % This function assumes that u is a polynomial given 135 % u is numr simp!* (algebraic expression) 152 x:=numr simp!* y; 161 % argument is lt numr simp!* "algebraic value". 199 if lisp (!*factor) then off factor; % This restriction is 218 uu:=simp!* u$ [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/misc/ |
H A D | limits.red | 44 %% equivalent of the original expression is returned. 52 %% The Truncated Power Series package is used for non-critical points. 53 %% L'Hopital's rule is used in critical cases, with preprocessing of 56 %% bounded arithmetic is also employed where applicable. 60 %% that is in reduce-netlib; in fact, some code is lifted bodily. 325 % ex is now the list of coefs and values, but we need the lowest 327 % if this list is empty the result is zero 528 % is found, attempt conversion to quotient form for lhopital. 578 prin2!* "limit of denominator is"; 687 else mk!*sq addsq(simp!* a,simp!* b); [all …]
|