- Timestamp:
- 2015-06-19T08:12:04-07:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/order.lisp
r2432 r2433 43 43 ;; pure lexicographic 44 44 (defgeneric lex> (p q &optional start end) 45 (:method ((p monom) (q monom) &optional (start 0) (end ( monom-dimension p)))45 (:method ((p monom) (q monom) &optional (start 0) (end (r-dimension p))) 46 46 "Return T if P>Q with respect to lexicographic order, otherwise NIL. 47 47 The second returned value is T if P=Q, otherwise it is NIL." … … 57 57 ;; total degree order , ties broken by lexicographic 58 58 (defgeneric grlex> (p q &optional start end) 59 (:method ((p monom) (q monom) &optional (start 0) (end ( monom-dimension p)))59 (:method ((p monom) (q monom) &optional (start 0) (end (r-dimension p))) 60 60 "Return T if P>Q with respect to graded lexicographic order, otherwise NIL. 61 61 The second returned value is T if P=Q, otherwise it is NIL." … … 72 72 73 73 ;; reverse lexicographic 74 (def method revlex> ((p monom) (q monom) &optional (start 0) (end (monom-dimension p)))74 (defgeneric revlex> ((p monom) (q monom) &optional (start 0) (end (r-dimension p))) 75 75 "Return T if P>Q with respect to reverse lexicographic order, NIL 76 76 otherwise. The second returned value is T if P=Q, otherwise it is … … 90 90 91 91 ;; total degree, ties broken by reverse lexicographic 92 (defmethod grevlex> ((p monom) (q monom) &optional (start 0) (end ( monom-dimension p)))92 (defmethod grevlex> ((p monom) (q monom) &optional (start 0) (end (r-dimension p))) 93 93 "Return T if P>Q with respect to graded reverse lexicographic order, 94 94 NIL otherwise. The second returned value is T if P=Q, otherwise it is NIL." … … 103 103 (revlex> p q start end))))) 104 104 105 (defmethod invlex> ((p monom) (q monom) &optional (start 0) (end ( monom-dimension p)))105 (defmethod invlex> ((p monom) (q monom) &optional (start 0) (end (r-dimension p))) 106 106 "Return T if P>Q with respect to inverse lexicographic order, NIL otherwise 107 107 The second returned value is T if P=Q, otherwise it is NIL." … … 119 119 (defun reverse-monomial-order (order) 120 120 "Create the inverse monomial order to the given monomial order ORDER." 121 #'(lambda (p q &optional (start 0) (end ( monom-dimension q)))121 #'(lambda (p q &optional (start 0) (end (r-dimension q))) 122 122 (declare (type monom p q) (type fixnum start end)) 123 123 (funcall order q p start end))) … … 135 135 i.e. for eliminating the first variable. Thus, the order compares the degrees of the 136 136 first variable in P and Q first, with ties broken by SECONDARY-ELIMINATION-ORDER." 137 #'(lambda (p q &optional (start 0) (end ( monom-dimension p)))137 #'(lambda (p q &optional (start 0) (end (r-dimension p))) 138 138 (declare (type monom p q) (type fixnum start end)) 139 139 (cond … … 170 170 (make-elimination-order-factory-1 secondary-elimination-order)) 171 171 (t 172 #'(lambda (p q &optional (start 0) (end ( monom-dimension p)))172 #'(lambda (p q &optional (start 0) (end (r-dimension p))) 173 173 (declare (type monom p q) (type fixnum start end)) 174 174 (multiple-value-bind (primary equal)
Note:
See TracChangeset
for help on using the changeset viewer.