- Timestamp:
- 2016-05-31T20:48:32-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/division.lisp
r4072 r4074 102 102 ;; Loop invariant: c*f=sum ai*fi+r+p, where p must eventually become 0 103 103 (do ((r (make-zero-for f)) 104 (c (make-unit-for f))104 (c 1) 105 105 (a (make-list (length fl) :initial-element (make-zero-for f))) 106 106 (division-count 0)
Note:
See TracChangeset
for help on using the changeset viewer.