- Timestamp:
- 2016-05-31T15:59:20-07:00 (8 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/polynomial.lisp
r4034 r4035 204 204 205 205 (defmethod unary-inverse :before ((self poly)) 206 (with-slots (termlist) 207 (assert (and (= (length termlist) 1) (zerop (total-degree (car termlist)) 0)) 208 nil 209 "To be invertible, the polynomial must have 1 term of total degree 0."))) 210 211 (defmethod unary-inverse ((self poly)) 206 "Checks invertibility of a polynomial SELF. To be invertable, the 207 polynomial must be an invertible, constant polynomial." 212 208 (with-slots (termlist) 213 209 self 214 (setf (car termlist) (unary-inverse (car termlist))))) 210 (assert (and (= (length termlist) 1) (zerop (total-degree (car termlist)))) 211 nil 212 "To be invertible, the polynomial must have 1 term of total degree 0."))) 213 214 (defmethod unary-inverse ((self poly)) 215 "Returns the unary inverse of a polynomial SELF." 216 (with-slots (termlist) 217 self 218 (setf (car termlist) (unary-inverse (car termlist))) 219 self)) 215 220 216 221 (defmethod multiply-by ((self poly) (other monom))
Note:
See TracChangeset
for help on using the changeset viewer.