| /dports/math/reduce/Reduce-svn5758-src/packages/pm/ |
| H A D | pmpatch.red | 68 % If the i'th element of `list' is `nil' then the i'th argument of `fn'
69 % is left unsimplified by simp. If `list' is longer that the argument
70 % list of `fn' then the extra indicators are ignored. If `list' is
83 % Simplify list u according to list v. If mode is NIL use AEVAL
125 then return simp z
126 else if z := opmtch u then return simp z
129 % for each j in x collect simp j))
138 then return if y then negsq simp z else simp z;
141 and x and minusf numr(x := simp car x)
145 then return if y then negsq simp z else simp z>>;
|
| /dports/math/p5-Math-Symbolic-Custom-Simplification/Math-Symbolic-Custom-Simplification-1.01/t/ |
| H A D | 01basic.t | 22 my $simp;
24 $simp = $tree->simplify();
27 ok(ref($simp) =~ /^Math::Symbolic/, 'result is valid');
29 ok($tree->is_identical($simp), 'result eq original');
32 ok(!$tree->is_identical($simp)&&!$tree->is_simple_constant(),
36 ok($simp->is_simple_constant(), 'result constant');
|
| /dports/math/reduce/Reduce-svn5758-src/packages/alg/ |
| H A D | simptrig.red | 128 r := simp u;
156 simp!-trig1(car u,simp!-trig!-arg cadr u);
161 % car x is either nil or coeff of term linear in pi, cdr x is arg
165 % check that car x is a rational number with a suitable range
166 %%% This check is too simple, it assumes that denr y is a number
174 % check that intpart is a (sort of) number
267 w := simp cdr z;
290 put('sin,'simpfn,'simp!-trig);
291 put('cos,'simpfn,'simp!-trig);
292 put('sec,'simpfn,'simp!-trig);
[all …]
|
| H A D | simp.red | 92 u:= simp u;
137 % car alglist!* is a table, inspected here in simp and set (only) in
226 symbolic procedure simp u;
228 % This case is sufficiently common it is done first.
377 simp car u;
420 simpexpon1(u,'simp!*);
501 x := simp u;
594 % when precise is on and there is a risk of
1122 then return if y then negsq simp z else simp z;
1134 then return if y then negsq simp z else simp z>>;
[all …]
|
| H A D | logsort.red | 36 % !*combinelogs := t; % Default value is ON.
41 x:= simp prepsq x where !*uncached=t; !*expandlogs := nil;
42 return simp!* comblog prepsq!* x end;
47 x:= simp x where !*uncached=t; !*expandlogs := nil;
59 where y=numr simp!* x)
60 then prepsq!* clogsq simp!* x
94 % y := multf(a,numr simp!* list('log,logarg(cadr mvar y,g)));
96 % in this loop, y is a log term, r is a term, and z the reductum.
116 % Only combine a log if at most one of the arguments is complex.
122 a4: a := prepsq simp!* a;
[all …]
|
| /dports/misc/cloc/cloc-1.90/tests/inputs/ |
| H A D | dlist.lean | 9 A difference list is a function that, given a list, returns the original
47 local attribute [simp] function.comp
67 by cases l; simp
73 { intros, funext x, simp [l_invariant x] },
74 simp [h]
78 by simp
81 by simp
85 by cases l₁; cases l₂; simp; rsimp
91 by cases l; simp; rsimp
134 simp
[all …]
|
| /dports/math/scilab/scilab-6.1.1/scilab/modules/overloading/macros/ |
| H A D | %r_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,
46 [num1,den1] = simp(num1,den1)
56 [num1,den1] = simp([num1, num2]*fact, den1)
66 [num2,den2] = simp(num2, den2),
76 [num1,den1] = simp(num1,den1)
81 f = simp(f)
|
| /dports/math/reduce/Reduce-svn5758-src/packages/misc/ |
| H A D | boolean.red | 30 % A form in propositional calculus is transformed to a canonical DNF
52 symbolic procedure simp!-prop u;
61 if w=0 then return simp !'false;
66 w:=simp!-prop!-dist w;
68 w :=simp!-prop!-form w;
74 put('boolean,'simpfn,'simp!-prop);
76 symbolic procedure simp!-prop1(u,m);
82 w:=multf(w,simp!-prop1(q,m))>>
85 w:=addf(w,simp!-prop1(q,m))>>
108 symbolic procedure simp!-prop2 w;
[all …]
|
| H A D | changevr.red | 91 % Below everything is perplexed :
121 %% v := simp!* v;
159 % is improved. If the new provided flag DEREXP is OFF then
161 % but if DEREXP is ON then the chain rule is taken further to
169 %% % U is a standard power, V a kernel.
193 %% a: w := diffsq(simp car z,v) . w;
261 %% w := quotsq(simp{'df,u,x},simp{'df,v,x});
312 %% then <<w := simp car x;
326 %% if numr(b:=simp{'df,a,v}) then <<
334 %% j: if (x := opmtch w) then w := simp x
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/mrvlimit/ |
| H A D | expon.red | 42 write "temp is ", temp;
76 %write "current is ", current;
207 % input to this procedure is a list
235 else if ((current=lisp mk!*sq simp 'minus) and part(li,k+1)=expt)
263 <<if (part(ans,k)=lisp mk!*sq simp 'minus) then
291 % ww in series is 0
294 then <<if (freeof(expt_list,(lisp mk!*sq simp 'minus)))
311 << if ((part(expt_list,l)=(lisp mk!*sq simp 'minus))
321 else <<if (freeof(expt_list,lisp mk!*sq simp 'minus))
329 else << % doesn't matter what is in the number list, as minus is
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/tps/ |
| H A D | tpssum.red | 28 % Allows power series whose general term is given to be manipulated.
40 % this is now partially checked by the system
56 simp!* subst(current!-index,sumvar,coeff));
62 simp!* subst(current!-index, sumvar, coeff) >>
81 if not kernp simp!* sumvar then
84 coeff:= prepsqxx simp!* cadr a;
86 depvar := car a; about:=prepsqxx simp!* cadr a;
88 power:= prepsqxx simp!* caddr a;
89 if not kernp simp!* depvar then
103 until (term:=simp!* subst(lowlim,sumvar,coeff)) neq '(nil . 1);
|
| /dports/math/scilab/scilab-6.1.1/scilab/modules/overloading/tests/nonreg_tests/ |
| H A D | bug_13893.tst | 4 // Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
7 // This file is distributed under the same license as the Scilab package.
16 // simp() function does not set a rational denominator at 1 when numerator is equal to zero
19 r_res = simp(r);
|
| /dports/math/reduce/Reduce-svn5758-src/packages/sparse/ |
| H A D | spmateig.red | 7 % The following code is for the functions to calculate eigenvalues and
45 % Result is a list of lists:
47 % where eival-eq is a polynomial and eigenvector is a matrix.
51 % is needed(done).
96 if (val=simp 0) then cnt:=cnt+1
123 <<w:=simp cdr xx;
132 <<if xx='(nil) then <<m:=rr+1; j:=simp nil>>
133 else << j:=simp cdr xx; m:=car xx>>;
135 <<if m=rr then <<diag:=j; j:=simp nil>>
198 <<w:=simp cdr xx;
[all …]
|
| H A D | sparsmat.red | 274 % It is non-destructive.
447 % It is non-destructive.
701 newval:=addsq(simp val1,simp val2);
849 newval:=multsq(simp val1,simp val2);
920 % It is an important function as it is the one which enables me to
1022 zz := simp 0;
1029 << xx := simp 1;
1065 val1:=multsq(simp findelem2(list,1,1), simp findelem2(list,2,2));
1066 val2:=multsq(simp findelem2(list,2,1), simp findelem2(list,1,2));
1199 << sum := simp 0;
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/redlog/dcfsf/ |
| H A D | dcfsf.red | 176 % Differentially closed field simp term. [u] is Lisp Prefix. Returns
178 numr simp u;
196 vf := simp car u;
215 % Differentially closed field chain simp atomic formula. [u] is the
218 % which is the corresponding conjunction.
222 % Differentially closed field chain simp atomic formula. [u] is the
240 % Differentially closed field simp atomic formula. [u] is Lisp
244 lhs := simp cadr u;
247 rhs := simp caddr u;
289 % formula for binary operator. [op] is a relation [lhs] is a term.
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/xcolor/ |
| H A D | cface.red | 54 << SU_order := simp car u$
62 << Spur_TT := simp car u$ >>$
77 % u is a kernel.
90 % u is a s.q..
95 SU_order := simp list('!*sq,SU_order,nil)$
97 Spur_TT := simp list('!*sq,Spur_TT,nil)$
103 % u is a s.f..
105 % 1) v is a list of QG and G3 operators$
106 % 2) w is other (s.f.).
114 simpcgraph1((!*q2f simp prepf u where !*factor=nil,!*exp=t),v,w)
|
| /dports/math/reduce/Reduce-svn5758-src/packages/solve/ |
| H A D | solve1.red | 261 % level of decomposition is considered.
287 is itself a function of var, mu is an integer. Uses roots of
452 % True if equation is symmetric in its coefficients. f is midpoint.
467 % True if equation is antisymmetric in its coefficients. f is
489 u := simp!* caar u;
556 % addsq(simp!*'(times i pi),
560 solvesq(subtrsq(simp!* caar u,simp!* list('expt,'e,mk!*sq cadddr u)),
574 solvesq(simp!*
653 % gcd. This gcd is stored in !!GCD.
698 If the tag is anything but t, the list of solve solutions is empty. See
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/defint/ |
| H A D | definta.red | 136 simp prepsq u>>;
332 coef:=multsq(simp!* cadddr s1,simp!* cadddr s2);
389 return simp 'fail
427 return simp 'unknown;
459 v := simp v;
462 return simp 'fail
555 % If the Meijer G-function is is a function of a variable which is not
625 % If the Meijer G-function is is a function of a variable which is not
691 s := simp!* s;
1880 prepsq subsqnew(simp!* u,simp!* v,z)$
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/redlog/acfsf/ |
| H A D | acfsf.red | 165 % Algebraically closed field simp term. [u] is Lisp Prefix. Returns
167 numr simp u;
187 % Algebraically closed field chain simp atomic formula. [u] is the
190 % which is the corresponding conjunction.
194 % Algebraically closed field chain simp atomic formula. [u] is the
212 % Algebraically closed field simp atomic formula. [u] is Lisp
216 lhs := simp cadr u;
219 rhs := simp caddr u;
261 % formula for binary operator. [op] is a relation [lhs] is a term.
267 % operator. [op] is a relation; [argl] is a list $(t_1,t_2)$ of
[all …]
|
| /dports/math/spot/spot-2.10.2/doc/tl/ |
| H A D | tl.tex | 135 \def\simp{\rightrightharpoons}
136 \def\Simp{\stackrel{+}{\simp}}
356 \item \samp{Fab} is not an atomic proposition, this is actually
1092 \\\texttt{is\_in\_nenoform()}& Whether the formula is in negative
1326 q\OR \G r$ is not syntactically safe, yet it is a safety formula
1490 \label{sec:basic-simp-ltl}
1848 $f\simpe g$ iff $f\simp g$ and $g\simp f$.
2034 ``$f \simp \F g$ \textit{if} $f\simp g$''.
2052 \def\bor#1#2#3#4{$\begin{aligned}#1 &\simp #2 \\{}\lor #3 &\simp #4\end{aligned}$}
2053 \def\band#1#2#3#4{$\begin{aligned}#1 &\simp #2 \\{}\land #3 &\simp #4\end{aligned}$}
[all …]
|
| /dports/math/py-spot/spot-2.10.2/doc/tl/ |
| H A D | tl.tex | 135 \def\simp{\rightrightharpoons}
136 \def\Simp{\stackrel{+}{\simp}}
356 \item \samp{Fab} is not an atomic proposition, this is actually
1092 \\\texttt{is\_in\_nenoform()}& Whether the formula is in negative
1326 q\OR \G r$ is not syntactically safe, yet it is a safety formula
1490 \label{sec:basic-simp-ltl}
1848 $f\simpe g$ iff $f\simp g$ and $g\simp f$.
2034 ``$f \simp \F g$ \textit{if} $f\simp g$''.
2052 \def\bor#1#2#3#4{$\begin{aligned}#1 &\simp #2 \\{}\lor #3 &\simp #4\end{aligned}$}
2053 \def\band#1#2#3#4{$\begin{aligned}#1 &\simp #2 \\{}\land #3 &\simp #4\end{aligned}$}
[all …]
|
| /dports/math/reduce/Reduce-svn5758-src/packages/poly/ |
| H A D | polyop.red | 45 % the variables in kernlist. If kernlist is not a list it is treated
47 % The denominator of u is ignored, and "degree" here does not may attention
49 % operator or function (eg sin, cos, log, sqrt) are ignored. Really u is
62 u := numr simp!* u;
63 kernlist := prepsq simp!* kernlist;
108 u := simp!* car u;
124 % Note. This is an older definition still used by some packages.
128 u := simp!* u;
144 u := simp!* u;
161 u := simp!* u;
[all …]
|
| H A D | interpol.red | 32 % The Aitken-Neville schema is used; it is stable for
39 simp car p . simp cdr p . simp cdr p;
40 x:= simp x;
41 % outer loop as long as there is more than 1 element.
|
| /dports/math/R-cran-psych/psych/man/ |
| H A D | circ.tests.Rd | 5 …is a circumplex structure where the variables are uniformly spaced on the perimeter of a circle in…
16 …is simple structure (Thurstone, 1947). According to one common interpretation, data are simple str…
18 …lex make. Second, circumplex structure implies that the domain in question is optimally represente…
20 …m ellipsoidal structures. Unfortunately, their work was done in Pascal and is not easily available…
30 To interpret the values of these various tests, it is useful to compare the particular solution to …
32 \value{A list of four items is returned. These are the gap, fisher, rotation and variance test res…
51 simp.data <- item.sim(24,500)
52 simp.fa <- factor.pa(simp.data,2)
53 plot(simp.fa,title="Simple Structure")
54 st <- circ.tests(simp.fa)
|
| /dports/math/reduce/Reduce-svn5758-src/packages/crack/ |
| H A D | crintfix.red | 119 % U is a standard power, V a kernel.
139 a: w := diffsq(simp car z,v) . w;
203 not_df_p(w := diffsq(simp!* cadr cadr u, v))
212 then <<w := simp car x;
222 j: if (x := opmtch w) then w := simp x
238 % This routine is called by diffp via the hook
244 y := simp!* cadr u; % SQ form integrand
266 % True if the SQ form y is not a df kernel.
288 % If the switch PartialIntDf is turned on then integration by parts is
302 then <<v := simp subst('int!*,'int,v);
[all …]
|