- Timestamp:
- 2016-05-29T23:53:57-07:00 (8 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/pair-queue.lisp
r3940 r3941 61 61 can be any type of data, and a function PAIR-ORDER-FN used to compaire 62 62 the calculated keys to determine which pair is more promising and 63 should be considered first. 64 The normal selection strategy for a given monomial order PAIR-ORDER-FN consists in 65 selecting the pair with theminimal LCM of leading monomials first."))63 should be considered first. The normal selection strategy for a given 64 monomial order PAIR-ORDER-FN consists in selecting the pair with the 65 minimal LCM of leading monomials first.")) 66 66 67 67 (defmethod print-object ((self selection-strategy) stream) … … 92 92 (pair-order-fn pair-order-fn) 93 93 (pq pq)) 94 (setf pq (make-priority-queue 94 self 95 (setf pq (make-priority-queue 95 96 :element-type 'critical-pair 96 97 :element-key #'(lambda (pair) (funcall pair-key-fn (critical-pair-first pair) (critical-pair-second pair)))
Note:
See TracChangeset
for help on using the changeset viewer.