src/matrun.lisp

   1 ;;; -*-  Mode: Lisp; Package: Maxima; Syntax: Common-Lisp; Base: 10 -*- ;;;;
   2 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   3 ;;;     The data in this file contains enhancments.                    ;;;;;
   4 ;;;                                                                    ;;;;;
   5 ;;;  Copyright (c) 1984,1987 by William Schelter,University of Texas   ;;;;;
   6 ;;;     All rights reserved                                            ;;;;;
   7 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   8 ;;;     (c) Copyright 1982 Massachusetts Institute of Technology         ;;;
   9 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
  10
  11 (in-package :maxima)
  12
  13 (macsyma-module matrun)
  14
  15 ;;; TRANSLATION properties for the FSUBRs in this file
  16 ;;; can be found in MAXSRC;TRANS5 >.  Be sure to check on those
  17 ;;; if any semantic changes are made.
  18
  19 (declare-top (special $rules $maxapplyheight $maxapplydepth))
  20
  21 ;;  $MAXAPPLYDEPTH is the maximum depth within an expression to which
  22 ;;  APPLYi will delve.  If $MAXAPPLYDEPTH is 0, it is applied only to
  23 ;;  top level.
  24 (defmvar $maxapplydepth 10000.)
  25
  26 ;;  If $MAXAPPLYHEIGHT is 0, only atoms are affected by $APPLYB1 and
  27 ;;  $APPLYB2.
  28 (defmvar $maxapplyheight 10000.)
  29
  30 (defmvar matchreverse nil)
  31
  32 (defmspec $disprule (l) (setq l (cdr l))
  33     (if (and (eq (car l) '$all) (null (cdr l)))
  34       (disprule1 (cdr $rules))
  35       (disprule1 l)))
  36
  37 (defun disprule1 (l)
  38   `((mlist simp) ,@(loop for r in l collect (cadr ($ldisp (consrule r))))))
  39
  40 (defun consrule (x)
  41   (let ((rule (mget x '$rule)))
  42     (if rule (list '(msetq simp) x (cons '(marrow simp) (cdr rule)))
  43         (merror (intl:gettext "disprule: ~:M is not a user rule.") x))))
  44
  45 (defmfun $remrule (op rule)
  46   (prog (rules)
  47      (setq op (getopr op))
  48      (cond ((not (eq rule '$all))
  49             (removerule op rule) (return (getop op)))
  50            ((null (setq rules (mget op 'oldrules)))
  51             (merror (intl:gettext "remrule: no rules known for operator ~:@M") op)))
  52      next (cond ((or (null rules) (null (cdr rules)))
  53                  (mputprop op 1 'rulenum) (return (getop op)))
  54                 (t (removerule op (car rules))
  55                    (setq rules (cdr rules)) (go next)))))
  56
  57 (defun removerule (op rule)
  58   (cond ((member rule *builtin-$rules* :test #'eq)
  59          (mget op 'oldrules))
  60         (t
  61          (prog
  62              (oldrules old othrulename othrule)
  63             (setq oldrules (mget op 'oldrules))
  64             (cond ((or (null rule) (null (setq oldrules (member rule oldrules :test #'equal))))
  65                    (merror (intl:gettext "remrule: no such rule: ~:M") rule))
  66                   ((null (car (setq oldrules (cdr oldrules))))
  67                    (setq oldrules (cdr oldrules))
  68                    (setq othrulename 'simpargs1)
  69                    (setq othrule #'(lambda (a bb c) (declare (ignore bb)) (simpargs a c))))
  70                   (t (setq othrulename (car oldrules))
  71                      (setq othrule (cadr (getl (car oldrules) '(expr subr))))))
  72             (putprop rule othrule 'expr)
  73             (setq old (cdr (member rule (reverse (mget op 'oldrules)) :test #'equal)))
  74             (if old (putprop (car old)
  75                              (subst othrulename rule (get (car old) 'expr))
  76                              'expr))
  77             (if (boundp rule) (makunbound rule))
  78             (mremprop rule '$rule)
  79             (mremprop rule '$ruletype)
  80             (mremprop rule 'ruleof)
  81             (remprop rule 'expr)
  82             (setq $rules (delete rule $rules :count 1 :test #'eq))
  83             (putprop rule othrulename 'expr)
  84             (if (eq (get op 'operators) rule)
  85                 (putprop op othrulename 'operators))
  86             (return (mputprop op (delete rule (mget op 'oldrules) :test #'eq) 'oldrules))))))
  87
  88 (defmfun findbe (e)
  89   (cond ((equal e 1) '(1 . 0))
  90         ((equal e 0) '(0 . 1))
  91         ((atom e) (cons e 1))
  92         ((eq (caar e) 'mexpt) (cons (cadr e) (caddr e)))
  93         (t (cons e 1))))
  94
  95 (defmfun findfun (e p c)
  96   (prog ()
  97      (cond ((and (null (atom e)) (eq (caar e) p)) (return e))
  98            ((or (atom e) (not (eq (caar e) c))) (matcherr))
  99            ((and (null matchreverse) (member c '(mplus mtimes) :test #'eq))
 100             (setq e (reverse (cdr e))) (go b)))
 101      a    (setq e (cdr e))
 102      b    (cond ((null e) (matcherr))
 103                 ((and (not (atom (car e))) (eq (caaar e) p)) (return (car e))))
 104      (go a)))
 105
 106 (defmfun findexpon (e1 base* c)
 107   (prog (e)
 108      (setq e e1)
 109      (cond ((and (mexptp e) (alike1 base* (cadr e)))
 110             (return (caddr e)))
 111            ((or (atom e) (not (eq (caar e) c))) (go c))
 112            ((and (null matchreverse) (member c '(mplus mtimes) :test #'eq))
 113             (setq e (reverse (cdr e))) (go b)))
 114      a    (setq e (cdr e))
 115      b    (cond ((null e) (go c))
 116                 ((and (mexptp (car e)) (alike1 base* (cadar e)))
 117                  (return (caddar e))))
 118      (go a)
 119      c    (cond ((or (and (not (atom e1)) (member c '(mplus mtimes) :test #'eq)
 120                           (eq c (caar e1)) (memalike base* e1))
 121                      (alike1 e1 base*)
 122                      (and (not (atom base*)) (eq c (caar base*))))
 123                  (return 1))
 124                 ((eq c 'mexpt) (matcherr))
 125                 (t (return 0)))))
 126
 127 (defmfun findbase (e expon c)
 128   (prog ()
 129      (cond ((equal expon 0)
 130             (if (and (eq c 'mexpt) (not (equal 1 e))) (matcherr))
 131             (return 1))
 132            ((equal expon 1) (return e))
 133            ((and (numberp expon) (> expon 0) (equal e 0))
 134             (return 0))
 135            ((and (mexptp e) (alike1 expon (caddr e)))
 136             (return (cadr e)))
 137            ((or (atom e) (not (eq (caar e) c))) (matcherr))
 138            ((and (null matchreverse) (member c '(mplus mtimes) :test #'eq))
 139             (setq e (reverse (cdr e))) (go b)))
 140      a    (setq e (cdr e))
 141      b    (cond ((null e)
 142                  (return (if (and (realp expon) (minusp expon)) 1 0)))
 143                 ((and (mexptp (car e)) (alike1 expon (caddar e)))
 144                  (return (cadar e))))
 145      (go a)))
 146
 147 (defmfun part+ (e p preds)
 148   (prog (flag saved val)
 149      (if (not (mplusp e)) (matcherr))
 150      (cond ((> (length p) (length preds))
 151             (setq p (reverse p))
 152             (setq p (nthkdr p (- (length p) (length preds))))
 153             (setq p (nreverse p))))
 154      (setq e (copy-tree e)) ; PREVIOUSLY: (setq e ($ratexpand e))
 155      (setq e (cdr e))
 156      a    (cond ((null p) (cond ((null e) (return t)) (t (matcherr))))
 157                 ((and (cdr preds) (member (car (caddar preds)) '(msetq setq) :test #'eq))
 158                  (cond (flag (merror (intl:gettext "PART+: two or more pattern variables match anything.")))
 159                        (t (setq flag t p (reverse p) preds (reverse preds))
 160                           (go a))))
 161                 ((not (atom (car p)))
 162                  (prog (mye)
 163                     (setq mye e)
 164                     loop (cond ((null mye) (matcherr)))
 165                     (setq val (catch 'match (mcall (car preds) (car mye))))
 166                     (cond ((null val)
 167                            (setq mye (cdr mye)) (go loop))
 168                           (t (return (setq e (delete (car mye) e :count 1 :test #'equal))))))
 169                  (go b))
 170                 (t (mset (car p) 0)))
 171      (setq saved 0)
 172      (mapc
 173       #'(lambda (z)
 174           (cond ((null (setq val (catch 'match (mcall (car preds) z)))) nil)
 175                 (t (setq saved (add2* saved val))
 176                    (setq e (delete z e :count 1 :test #'equal)))))
 177       e)
 178      (cond ((and (equal saved 0)
 179                  (null (setq val (catch 'match (mcall (car preds) 0)))))
 180             (matcherr)))
 181      (mset (car p) saved)
 182      b (setq preds (cdr preds) p (cdr p))
 183      (go a)))
 184
 185 (defmfun part* (e p preds)
 186   (prog (flag saved val)
 187      (if (not (mtimesp e)) (matcherr))
 188      (cond ((> (length p) (length preds))
 189             (setq p (reverse p))
 190             (setq p (nthkdr p (- (length p) (length preds))))
 191             (setq p (nreverse p))))
 192      (setq e (copy-tree e)) ; PREVIOUSLY: (setq e ($factor e))
 193      (setq e (cdr e))
 194      a    (cond ((null p) (cond ((null e) (return t)) (t (matcherr))))
 195                 ((and (cdr preds) (member (car (caddar preds)) '(msetq setq) :test #'eq))
 196                  (cond (flag (merror (intl:gettext "PART*: two or more pattern variables match anything.")))
 197                        (t (setq flag t p (reverse p) preds (reverse preds))
 198                           (go a))))
 199                 ((not (atom (car p)))
 200                  (prog (mye)
 201                     (setq mye e)
 202                     loop (cond ((null mye) (matcherr)))
 203                     (setq val (catch 'match (mcall (car preds) (car mye))))
 204                     (cond ((null val)
 205                            (setq mye (cdr mye)) (go loop))
 206                           (t (return (setq e (delete (car mye) e :count 1 :test #'equal))))))
 207                  (go b))
 208                 (t (mset (car p) 1)))
 209      (setq saved 1)
 210      (mapc
 211       #'(lambda (z) (setq val (catch 'match (mcall (car preds) z)))
 212                 (cond ((null val) nil)
 213                       (t (setq saved (mul2* saved val))
 214                          (setq e (delete z e :count 1 :test #'equal)))))
 215       e)
 216      (cond ((and (equal saved 1)
 217                  (null (setq val (catch 'match (mcall (car preds) 1)))))
 218             (matcherr)))
 219      (mset (car p) saved)
 220      b    (setq preds (cdr preds) p (cdr p))
 221      (go a)))
 222
 223 ;;; TRANSLATE property in MAXSRC;TRANS5 >
 224
 225 (defmspec $apply1 (l) (setq l (cdr l))
 226           (let ((expr (meval (car l))))
 227             (mapc #'(lambda (z) (setq expr (apply1 expr z 0))) (cdr l))
 228             expr))
 229
 230 (defmfun apply1 (expr *rule depth)
 231   (cond
 232     ((> depth $maxapplydepth) expr)
 233     (t
 234      (prog nil
 235         (*rulechk *rule)
 236         (setq expr (rule-apply *rule expr))
 237         b    (cond
 238                ((or (atom expr) (mnump expr)) (return expr))
 239                ((eq (caar expr) 'mrat)
 240                 (setq expr (ratdisrep expr)) (go b))
 241                (t
 242                 (return
 243                   (simplifya
 244                    (cons
 245                     (delsimp (car expr))
 246                     (mapcar #'(lambda (z) (apply1 z *rule (1+ depth)))
 247                             (cdr expr)))
 248                    t))))))))
 249
 250 (defmspec $applyb1 (l)  (setq l (cdr l))
 251           (let ((expr (meval (car l))))
 252             (mapc #'(lambda (z) (setq expr (car (apply1hack expr z)))) (cdr l))
 253             expr))
 254
 255 (defmfun apply1hack (expr *rule)
 256   (prog (pairs max)
 257      (*rulechk *rule)
 258      (setq max 0)
 259      b    (cond
 260             ((atom expr) (return (cons (multiple-value-bind (ans rule-hit) (mcall *rule expr) (if rule-hit ans expr)) 0)))
 261             ((specrepp expr) (setq expr (specdisrep expr)) (go b)))
 262      (setq pairs (mapcar #'(lambda (z) (apply1hack z *rule))
 263                          (cdr expr)))
 264      (setq max 0)
 265      (mapc #'(lambda (l) (setq max (max max (cdr l)))) pairs)
 266      (setq expr (simplifya (cons (delsimp (car expr))
 267                                  (mapcar #'car pairs))
 268                            t))
 269      (cond ((= max $maxapplyheight) (return (cons expr max))))
 270      (setq expr (rule-apply *rule expr))
 271      (return (cons expr (1+ max)))))
 272
 273 (defun *rulechk (*rule)
 274   (if (and (symbolp *rule) (not (fboundp *rule)) (not (mfboundp *rule)))
 275       (merror (intl:gettext "apply1: no such rule: ~:M") *rule)))
 276
 277 (defun rule-apply (*rule expr)
 278   (prog (ans rule-hit)
 279    loop (multiple-value-setq (ans rule-hit) (mcall *rule expr))
 280    (cond ((and rule-hit (not (alike1 ans expr)))
 281           (setq expr ans) (go loop)))
 282    (return expr)))
 283
 284 (defmspec $apply2 (l) (setq l (cdr l))
 285           (let ((rulelist (cdr l))) (apply2 rulelist (meval (car l)) 0)))
 286
 287 (defmfun apply2 (rulelist expr depth)
 288   (cond
 289     ((> depth $maxapplydepth) expr)
 290     (t
 291      (prog (ans ruleptr rule-hit)
 292       a    (setq ruleptr rulelist)
 293       b    (cond
 294              ((null ruleptr)
 295               (cond
 296                 ((atom expr) (return expr))
 297                 ((eq (caar expr) 'mrat)
 298                  (setq expr (ratdisrep expr)) (go b))
 299                 (t
 300                  (return
 301                    (simplifya
 302                     (cons
 303                      (delsimp (car expr))
 304                      (mapcar #'(lambda (z) (apply2 rulelist z (1+ depth)))
 305                              (cdr expr)))
 306                     t))))))
 307       (cond ((progn (multiple-value-setq (ans rule-hit) (mcall (car ruleptr) expr)) rule-hit)
 308              (setq expr ans)
 309              (go a))
 310             (t (setq ruleptr (cdr ruleptr)) (go b)))))))
 311
 312 (defmspec $applyb2 (l) (setq l (cdr l))
 313           (let ((rulelist (cdr l))) (car (apply2hack rulelist (meval (car l))))))
 314
 315 (defmfun apply2hack (rulelist e)
 316   (prog (pairs max)
 317      (setq max 0)
 318      (cond ((atom e) (return (cons (apply2 rulelist e -1) 0)))
 319            ((specrepp e) (return (apply2hack rulelist (specdisrep e)))))
 320      (setq pairs (mapcar #'(lambda (x) (apply2hack rulelist x)) (cdr e)))
 321      (setq max 0)
 322      (mapc #'(lambda (l) (setq max (max max (cdr l)))) pairs)
 323      (setq e (simplifya (cons (delsimp (car e)) (mapcar #'car pairs)) t))
 324      (cond ((= max $maxapplyheight) (return (cons e max)))
 325            (t (return (cons (apply2 rulelist e -1) (1+ max)))))))