[2637] | 1 | ;;; -*- Mode: Lisp -*-
|
---|
| 2 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 3 | ;;;
|
---|
| 4 | ;;; Copyright (C) 1999, 2002, 2009, 2015 Marek Rychlik <rychlik@u.arizona.edu>
|
---|
| 5 | ;;;
|
---|
| 6 | ;;; This program is free software; you can redistribute it and/or modify
|
---|
| 7 | ;;; it under the terms of the GNU General Public License as published by
|
---|
| 8 | ;;; the Free Software Foundation; either version 2 of the License, or
|
---|
| 9 | ;;; (at your option) any later version.
|
---|
| 10 | ;;;
|
---|
| 11 | ;;; This program is distributed in the hope that it will be useful,
|
---|
| 12 | ;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 13 | ;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 14 | ;;; GNU General Public License for more details.
|
---|
| 15 | ;;;
|
---|
| 16 | ;;; You should have received a copy of the GNU General Public License
|
---|
| 17 | ;;; along with this program; if not, write to the Free Software
|
---|
| 18 | ;;; Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
---|
| 19 | ;;;
|
---|
| 20 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 21 |
|
---|
| 22 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 23 | ;;
|
---|
| 24 | ;; Run tests using 5am unit testing framework
|
---|
| 25 | ;;
|
---|
| 26 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 27 |
|
---|
| 28 | ;; We assume that QuickLisp package manager is installed.
|
---|
| 29 | ;; See :
|
---|
| 30 | ;; https://www.quicklisp.org/beta/
|
---|
| 31 | ;;
|
---|
| 32 |
|
---|
| 33 | ;; The following is unnecessary after running:
|
---|
| 34 | ;; * (ql:add-to-init-file)
|
---|
| 35 | ;; at lisp prompt:
|
---|
| 36 | ;;(load "~/quicklisp/setup")
|
---|
| 37 |
|
---|
| 38 | (ql:quickload :fiveam)
|
---|
[3756] | 39 |
|
---|
[3757] | 40 | (unwind-protect
|
---|
[3758] | 41 | ;; Load system ngrobner via ASDF
|
---|
[3757] | 42 | (progn
|
---|
| 43 | (require :asdf)
|
---|
| 44 | (load "ngrobner.asd")
|
---|
[3758] | 45 | (asdf:load-system :ngrobner)
|
---|
[3761] | 46 | (format t "... Successfully loaded NGROBNER via ASDF!~&"))
|
---|
[3757] | 47 | ;; Or load manually
|
---|
[3761] | 48 | (format t "Could not load NGROBNER via ASDF, attempting manually loading dependencies.~&")
|
---|
[3757] | 49 | (require :copy "copy")
|
---|
| 50 | (require :monom "monom")
|
---|
| 51 | (require :utils "utils")
|
---|
| 52 | (require :polynomial "polynomial"))
|
---|
[2637] | 53 |
|
---|
| 54 | (defpackage #:5am-poly
|
---|
[3492] | 55 | (:use :cl :it.bese.fiveam :monom :polynomial))
|
---|
[2637] | 56 |
|
---|
| 57 | (in-package :5am-poly)
|
---|
| 58 |
|
---|
[2638] | 59 | (def-suite poly-suite
|
---|
[3226] | 60 | :description "Polynomial package suite")
|
---|
[2637] | 61 |
|
---|
[2638] | 62 | (in-suite poly-suite)
|
---|
[2637] | 63 |
|
---|
| 64 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 65 | ;;
|
---|
| 66 | ;; POLY class tests
|
---|
| 67 | ;;
|
---|
| 68 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 69 |
|
---|
[2932] | 70 | (def-fixture poly-add-context ()
|
---|
[3266] | 71 | (let ((p (make-instance 'poly))
|
---|
[2677] | 72 | (q (make-instance 'poly :order nil))
|
---|
[2648] | 73 | (p+q (make-instance 'poly))
|
---|
[2688] | 74 | (p-q (make-instance 'poly))
|
---|
| 75 | (p-uminus (make-instance 'poly)))
|
---|
[2671] | 76 | ;; Populate the polynomials; the lists of (exponents . coefficient) pairs
|
---|
[2678] | 77 | ;; must be in increasing order in Q, but Q is unordered (:ORDER NIL)
|
---|
| 78 | ;; so it will be automatically sorted.
|
---|
[2670] | 79 | (dolist (x '( ((2) . 22) ((4) . 44) ((5) . 55) ((8) . 88) ((9) . 99) ))
|
---|
[3635] | 80 | (poly-insert-term p (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2679] | 81 | (dolist (x '( ((9) . 90) ((0) . 11) ((2) . 20) ((3) . 33) ((4) . -44) ((7) . 77) ((8) . 88) ))
|
---|
[3635] | 82 | (poly-insert-term q (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2737] | 83 | ;; P+Q
|
---|
[2734] | 84 | (dolist (x '(((0) . 11) ((2) . 42) ((3) . 33) ((5) . 55) ((7) . 77) ((8) . 176) ((9) . 189) ))
|
---|
[3635] | 85 | (poly-insert-term p+q (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2737] | 86 | ;; P-Q
|
---|
[2670] | 87 | (dolist (x '(((0) . -11) ((2) . 2) ((3) . -33) ((4) . 88) ((5) . 55) ((7) . -77) ((9) . 9)))
|
---|
[3635] | 88 | (poly-insert-term p-q (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2737] | 89 | ;; -P
|
---|
[3494] | 90 | (dolist (x '( ((2) . -22) ((4) . -44) ((5) . -55) ((8) . -88) ((9) . -99)))
|
---|
[3635] | 91 | (poly-insert-term p-uminus (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2664] | 92 | ;;(print p) (print q) (print p+q) (print p-q)
|
---|
[2637] | 93 | (&body)))
|
---|
| 94 |
|
---|
[2931] | 95 | (test poly-add
|
---|
[2637] | 96 | "Polynomial addition"
|
---|
[3637] | 97 | (with-fixture poly-add-context () (is (universal-equalp (add-to p q) p+q)))
|
---|
[3638] | 98 | (with-fixture poly-add-context () (is (universal-equalp (add p q) p+q)))
|
---|
[3637] | 99 | (with-fixture poly-add-context () (is (universal-equalp (subtract-from p q) p-q)))
|
---|
[3638] | 100 | (with-fixture poly-add-context () (is (universal-equalp (subtract p q) p-q)))
|
---|
[3637] | 101 | (with-fixture poly-add-context () (is (universal-equalp (unary-minus p) p-uminus)))
|
---|
[2652] | 102 | )
|
---|
[2637] | 103 |
|
---|
[2934] | 104 | (def-fixture poly-multiply-context ()
|
---|
[3266] | 105 | (let ((p (make-instance 'poly))
|
---|
[2934] | 106 | (q (make-instance 'poly :order nil))
|
---|
| 107 | (p*q (make-instance 'poly)))
|
---|
| 108 | ;; Populate the polynomials; the lists of (exponents . coefficient) pairs
|
---|
| 109 | ;; must be in increasing order in Q, but Q is unordered (:ORDER NIL)
|
---|
| 110 | ;; so it will be automatically sorted.
|
---|
| 111 | (dolist (x '( ((0) . 1) ((1) . 2) ))
|
---|
[3636] | 112 | (poly-insert-term p (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2934] | 113 | (dolist (x '( ((0) . 1) ((1) . 3) ))
|
---|
[3636] | 114 | (poly-insert-term q (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2934] | 115 | ;; P*Q
|
---|
| 116 | (dolist (x '( ((0) . 1) ((1) . 5) ((2) . 6)))
|
---|
[3636] | 117 | (poly-insert-term p*q (make-instance 'term :exponents (car x) :coeff (cdr x))))
|
---|
[2934] | 118 | (&body)))
|
---|
| 119 |
|
---|
| 120 |
|
---|
[2935] | 121 | (test poly-multiply
|
---|
| 122 | "Polynomial multiplication"
|
---|
[3638] | 123 | (with-fixture poly-multiply-context () (is (universal-equalp (multiply p q) p*q)))
|
---|
[2935] | 124 | )
|
---|
| 125 |
|
---|
[3097] | 126 | (test poly-standard-extension
|
---|
| 127 | "Standard extension"
|
---|
[3266] | 128 | (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
|
---|
[3098] | 129 | (q (alist->poly '( ((0) . 1) ((2) . 3))))
|
---|
[3097] | 130 | (plist (list p q))
|
---|
| 131 | (p-ext (alist->poly '( ((1 0 0) . 1) ((1 0 1) . 2))))
|
---|
| 132 | (q-ext (alist->poly '( ((0 1 0) . 1) ((0 1 2) . 3))))
|
---|
[3098] | 133 | (plist-st-ext (list p-ext q-ext)))
|
---|
[3637] | 134 | (is (universal-equalp (standard-extension plist) plist-st-ext))))
|
---|
[2935] | 135 |
|
---|
[3102] | 136 | (test poly-standard-extension-1
|
---|
| 137 | "Standard extension 1"
|
---|
[3266] | 138 | (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
|
---|
[3102] | 139 | (q (alist->poly '( ((0) . 1) ((2) . 3))))
|
---|
| 140 | (plist (list p q))
|
---|
| 141 | (p-ext (alist->poly '( ((0 0 0) . -1) ((1 0 0) . 1) ((1 0 1) . 2))))
|
---|
| 142 | (q-ext (alist->poly '( ((0 0 0) . -1) ((0 1 0) . 1) ((0 1 2) . 3))))
|
---|
| 143 | (plist-st-ext (list p-ext q-ext)))
|
---|
[3637] | 144 | (is (universal-equalp (standard-extension-1 plist) plist-st-ext))))
|
---|
[3102] | 145 |
|
---|
[3111] | 146 | (test poly-standard-sum
|
---|
| 147 | "Standard sum"
|
---|
[3266] | 148 | (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
|
---|
[3111] | 149 | (q (alist->poly '( ((0) . 1) ((2) . 3))))
|
---|
| 150 | (plist (list p q))
|
---|
[3114] | 151 | (std-sum (alist->poly '(((0 0 0) . -1) ((0 1 0) . 1) ((0 1 2) . 3)
|
---|
| 152 | ((1 0 0) . 1) ((1 0 1) . 2)))))
|
---|
[3637] | 153 | (is (universal-equalp (standard-sum plist) std-sum))))
|
---|
[3111] | 154 |
|
---|
[3658] | 155 | (test poly-s-polynomial
|
---|
| 156 | "S-Polynomial"
|
---|
| 157 | (let* ((f (alist->poly '( ((1 0 0) . 1) ((1 0 1) . 2)))) ;x+2*x*z |*y*z
|
---|
[3674] | 158 | (g (alist->poly '( ((0 1 0) . 1) ((0 1 2) . 2)))) ;y+2*y*z^2 |*x
|
---|
[3675] | 159 | (s-poly (alist->poly '( ((1 1 0) . -1) ((1 1 1) . 1)))); x*y*z - x*y
|
---|
[3658] | 160 | )
|
---|
| 161 | (is (universal-equalp (s-polynomial f g) s-poly))))
|
---|
| 162 |
|
---|
[3680] | 163 | (test poly-content
|
---|
| 164 | "Poly-content"
|
---|
| 165 | (let* ((p (alist->poly '( ((1 0 0) . 12) ((1 0 1) . 15))))
|
---|
| 166 | (pc 3))
|
---|
| 167 | (is (universal-equalp (poly-content p) pc))))
|
---|
[3658] | 168 |
|
---|
[3687] | 169 | (test poly-primitive-part
|
---|
| 170 | "Poly-primitive-part"
|
---|
| 171 | (let* ((p (alist->poly '( ((1 0 0) . 12) ((1 0 1) . 15))))
|
---|
| 172 | (pp (alist->poly '( ((1 0 0) . 4) ((1 0 1) . 5)))))
|
---|
| 173 | (is (universal-equalp (poly-primitive-part p) pp))))
|
---|
[3680] | 174 |
|
---|
[3702] | 175 | (test saturation-extension
|
---|
| 176 | "Saturation-extension"
|
---|
| 177 | (let* ((f (list (alist->poly '( ((1 0 0) . 2) ((1 0 1) . 3))) ;2*x+3*x*z
|
---|
| 178 | (alist->poly '( ((1 0 0) . 5) ((0 1 2) . 7)))) ;5*x+7*y*z^2
|
---|
| 179 | )
|
---|
| 180 | (p (alist->poly '( ((1 1 1) . 11) ((2 3 4) . 13)))) ;11*x*y*z+13*x^2*y^3*z^4
|
---|
| 181 | (sat-ext (list (alist->poly '( ((0 1 0 0) . 2) ((0 1 0 1) . 3)))
|
---|
[3706] | 182 | (alist->poly '( ((0 1 0 0) . 5) ((0 0 1 2) . 7)))
|
---|
[3707] | 183 | (alist->poly '( ((0 0 0 0) . -1) ((1 1 1 1) . 11) ((1 2 3 4) . 13) )))))
|
---|
[3702] | 184 | (is (universal-equalp (saturation-extension f (list p)) sat-ext))))
|
---|
| 185 |
|
---|
| 186 | (test saturation-extension-1
|
---|
| 187 | "Saturation-extension-1"
|
---|
| 188 | (let* ((f (list (alist->poly '( ((1 0 0) . 2) ((1 0 1) . 3))) ;2*x+3*x*z
|
---|
| 189 | (alist->poly '( ((1 0 0) . 5) ((0 1 2) . 7)))) ;5*x+7*y*z^2
|
---|
| 190 | )
|
---|
| 191 | (p (alist->poly '( ((1 1 1) . 11) ((2 3 4) . 13)))) ;11*x*y*z+13*x^2*y^3*z^4
|
---|
| 192 | (sat-ext-1 (list (alist->poly '( ((0 1 0 0) . 2) ((0 1 0 1) . 3)))
|
---|
[3706] | 193 | (alist->poly '( ((0 1 0 0) . 5) ((0 0 1 2) . 7)))
|
---|
| 194 | (alist->poly '( ((0 0 0 0) . -1) ((1 1 1 1) . 11) ((1 2 3 4) . 13) )))))
|
---|
[3702] | 195 | (is (universal-equalp (saturation-extension-1 f p) sat-ext-1))))
|
---|
| 196 |
|
---|
[3715] | 197 | (test universal-expt
|
---|
| 198 | "Universal-expt"
|
---|
| 199 | (let ((f (alist->poly '( ((0) . 1) ((1) . 1))))
|
---|
| 200 | (f2 (alist->poly '( ((0) . 1) ((1) . 2) ((2) . 1))))
|
---|
| 201 | (f3 (alist->poly '( ((0) . 1) ((1) . 3) ((2) . 3) ((3) . 1)))))
|
---|
| 202 | (is (universal-equalp (universal-expt f 2) f2))
|
---|
| 203 | (is (universal-equalp (universal-expt f 3) f3))))
|
---|
| 204 |
|
---|
[2638] | 205 | (run! 'poly-suite)
|
---|
[2637] | 206 | (format t "All tests done!~%")
|
---|
| 207 |
|
---|
| 208 |
|
---|