Home
last modified time | relevance | path

Searched +refs:lambda +refs:meqp (Results 1 – 9 of 9) sorted by relevance

/dports/math/maxima/maxima-5.43.2/share/linearalgebra/
H A Dmring.lisp151 :add-id #'(lambda () 0)
157 #'(lambda (s)
169 :great #'(lambda (a b) (declare (ignore a)) (eq t (meqp b 0)))
178 :add-id #'(lambda () 0)
180 :fzerop #'(lambda (s) (eq t (meqp s 0)))
192 :great #'(lambda (a b) (declare (ignore a)) (eq t (meqp b 0)))
203 :fzerop #'(lambda (s) (eq t (meqp (sratsimp s) 0)))
277 :psqrt #'(lambda (a)
302 :psqrt #'(lambda (a)
378 :great #'(lambda (a b) (declare (ignore a)) (eq t (meqp b 0)))
[all …]
/dports/math/maxima/maxima-5.43.2/src/
H A Dmaxmin.lisp59 (eq t (meqp x (neg y))))
66 (cons '($max) (mapcar #'(lambda (e) (limit e var val 'think)) (cdr expr))))
79 …(if (op-equalp li '$max) (setq acc (append acc (mapcar #'(lambda (s) (simplifya s z)) (margs li))))
120 (member-if #'(lambda (s) (add-inversep ai s)) sgn)
161 (cons '($min) (mapcar #'(lambda (e) (limit e var val 'think)) (cdr expr))))
170 …(if (op-equalp li '$min) (setq acc (append acc (mapcar #'(lambda (s) (simplifya s z)) (margs li))))
213 ((eq t (meqp a b)) "=")
H A Dcompar.lisp1062 (defun meqp (a b) function
1162 (every #'(lambda (p q) (eq t (meqp p q))) (margs aa) (margs bb))) t)
1169 (if (every #'(lambda (s) (eq nil (meqp ak s))) b) (throw 'done t)))
1171 (if (every #'(lambda (s) (eq nil (meqp bk s))) a) (throw 'done t)))
1196 (let ((b (meqp x y)))
2119 (cond ((eq 'meqp (caar f))
2139 ((eq 'meqp (caar f))
2155 ((eq 'meqp (caar f))
2170 ((eq 'meqp (caar f))
2185 ((eq 'meqp (caar f))
[all …]
H A Dtrpred.lisp151 ((eq '$number mode) `(meqp ,(cdr arg1) ,(cdr arg2)))
153 (wrap-an-is `(meqp ,(dconvx arg1) ,(dconvx arg2)) form)))))
179 (mapc #'(lambda (l) (setq nl (cons `(assume ,(dtranslate l)) nl)))
H A Ddb.lisp153 (setq x (mapcar #'(lambda (form) `(unlab ,form)) x))
350 (mapc #'(lambda (sym) (push+sto (sel sym +labs) nil)) +labs)
352 (mapc #'(lambda (sym) (zl-remprop sym 'ulabs)) ulabs)
430 (mapc #'(lambda (lis) (addf y lis)) s))
436 (mapc #'(lambda (lis) (ind1 dat lis)) (cdar dat))
442 (mapc #'(lambda (lis) (ind1 dat lis)) pat))
511 (fact 'meqp x (car *nobjects*)))
528 (fact 'meqp (cadr lis) x))
589 (mapc #'(lambda (lis) (remov4 fact lis))
713 (mapc #'(lambda (lis) (mark+0 cl lab lis)) (sel cl data)))
[all …]
H A Dconjugate.lisp124 (and (eq t (meqp (cdr z) 0))
303 (simplify (cons (list (mop e)) (mapcar #'(lambda (s) (take '($conjugate) s)) (margs e)))))
H A Dnset.lisp123 (setq a (mapcar #'(lambda (x) (simplifya x z)) (cdr a)))
305 (mapcar #'(lambda (s)
521 (mapcan #'(lambda (e)
578 #'(lambda (xx) (declare (ignore xx)) (throw 'subset nil))
597 #'(lambda (xx) (declare (ignore xx)) (throw 'disjoint nil))
777 (setq p (member t p :key #'(lambda (x) (> x 1))))
924 ((some #'(lambda (s) (eq t (meqp s lk))) acc)) ;; lk = some member of acc, do nothing
1122 (reduce #'(lambda (x y) (mfuncall f x y)) s :from-end left
1134 `(setf (get ,fn '$nary) (list #'(lambda ,arg ,f-body) ,id)))
1138 (cons '(mlist) (apply 'append (mapcar #'(lambda (x)
[all …]
H A Dlimit.lisp295 (cond ((eq t (meqp ra rb))
618 (mapcar #'(lambda (x)
647 (mapcar #'(lambda (x)
1008 (lambda (term)
1858 (mapcar #'(lambda (a)
2371 ((every #'(lambda (x)
2547 (mapcar #'(lambda (e)
3198 (mapcar (lambda (x y)
3230 (mapcar (lambda (e)
3269 (mapcar (lambda (exp)
[all …]
/dports/math/maxima/maxima-5.43.2/share/to_poly_solve/
H A Dto_poly.lisp72 (setq proviso (delete t (mapcar (lambda (s) (mnqp s 0)) q)))
184 (setq p (mapcar #'(lambda (s) (list-subst np-subs s)) p)))
199 (setq p (mapcar #'(lambda (s) (list-subst np-subs s)) p)))
259 (setq eqs (mapcar #'(lambda (s) ($ratexpand (meqhk s))) (margs eqs)))
265 (if (not (every #'(lambda (s) ($polynomialp s `((mlist) ,x)
266 `((lambda) ((mlist) s) (($freeof) ,x s)))) eqs))
348 (if (not (every #'(lambda (s) ($polynomialp s x `((lambda) ((mlist) s) (($lfreeof) ,x s)))) eqs))
389 (mapcan #'(lambda (s) (gather-nonrational-powers s vars)) (margs e)))
397 (t (mapcan #'(lambda (s) (gather-exp-args s vars)) (margs e)))))
580 (cond ((eq t (meqp e ec)) t)
[all …]