- Timestamp:
- 2015-06-20T19:51:14-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/polynomial.lisp
r2773 r2774 118 118 ;; NOTE: R contains the result in reverse order. Can it 119 119 ;; be more efficient to produce the terms in correct order? 120 (unless (endp q) (setf r (nreconc r q))) 120 (unless (endp q) 121 ,@(when uminus-fn 122 `(mapc #'(lambda (x) (setf x (funcall ,uminus-fn x))) q)) 123 (setf r (nreconc r q))) 121 124 r) 122 125 (multiple-value-bind
Note:
See TracChangeset
for help on using the changeset viewer.