[1201] | 1 | ;;; -*- Mode: Lisp -*-
|
---|
[302] | 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 |
|
---|
[309] | 22 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 23 | ;;
|
---|
[355] | 24 | ;; Run tests using 5am unit testing framework
|
---|
[309] | 25 | ;;
|
---|
| 26 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
---|
| 27 |
|
---|
[342] | 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 |
|
---|
[286] | 38 | (ql:quickload :fiveam)
|
---|
[301] | 39 |
|
---|
[292] | 40 | (load "ngrobner.asd")
|
---|
[291] | 41 | (asdf:load-system :ngrobner)
|
---|
[286] | 42 |
|
---|
[367] | 43 | (defpackage #:ngrobner-tests
|
---|
[604] | 44 | (:use :cl :it.bese.fiveam
|
---|
| 45 | :ngrobner :priority-queue :monomial
|
---|
[957] | 46 | :utils :order :ring :term :ring-and-order
|
---|
[1069] | 47 | :termlist :polynomial
|
---|
[1024] | 48 | :priority-queue
|
---|
[1175] | 49 | :division
|
---|
[604] | 50 | )
|
---|
| 51 | )
|
---|
[286] | 52 |
|
---|
[367] | 53 | (in-package #:ngrobner-tests)
|
---|
[287] | 54 |
|
---|
[367] | 55 | (def-suite ngrobner-suite
|
---|
[368] | 56 | :description "New Groebner Package Suite")
|
---|
[281] | 57 |
|
---|
[367] | 58 | (in-suite ngrobner-suite)
|
---|
[287] | 59 |
|
---|
[312] | 60 | #+nil
|
---|
[289] | 61 | (test dummy-test
|
---|
[281] | 62 | "Makelist"
|
---|
| 63 | (is (= (+ 2 2)) "2 plus 2 wasn't equal to 4 (using #'= to test equality)")
|
---|
| 64 | (is (= 0 (+ -1 1)))
|
---|
| 65 | (signals
|
---|
| 66 | (error "Trying to add 4 to FOO didn't signal an error")
|
---|
| 67 | (+ 'foo 4))
|
---|
| 68 | (is (= 0 (+ 1 1)) "this should have failed"))
|
---|
[289] | 69 |
|
---|
[293] | 70 | (test makelist-1
|
---|
[303] | 71 | "makelist-1 test"
|
---|
[597] | 72 | (is (equal (makelist-1 (* 2 i) i 0 10) '(0 2 4 6 8 10 12 14 16 18 20)))
|
---|
| 73 | (is (equal (makelist-1 (* 2 i) i 0 10 3) '(0 6 12 18))))
|
---|
[294] | 74 |
|
---|
[303] | 75 | (test makelist
|
---|
[314] | 76 | "makelist"
|
---|
[598] | 77 | (is (equal (makelist (+ (* i i) (* j j)) (i 1 4) (j 1 i)) '(2 5 8 10 13 18 17 20 25 32)))
|
---|
| 78 | (is (equal (makelist (list i j '---> (+ (* i i) (* j j))) (i 1 4) (j 1 i))
|
---|
[303] | 79 | '((1 1 ---> 2) (2 1 ---> 5) (2 2 ---> 8) (3 1 ---> 10) (3 2 ---> 13)
|
---|
| 80 | (3 3 ---> 18) (4 1 ---> 17) (4 2 ---> 20) (4 3 ---> 25) (4 4 ---> 32)))))
|
---|
[290] | 81 |
|
---|
[314] | 82 | (test monom
|
---|
| 83 | "monom"
|
---|
[885] | 84 | (is (every #'= (make-monom :dimension 3) '(0 0 0)) "Trivial monomial is a vector of 0's")
|
---|
| 85 | (is (every #'= (make-monom :initial-exponents '(1 2 3)) '(1 2 3)) "Monomial with powers 1,2,3")
|
---|
[867] | 86 | (let ((p (make-monom :initial-exponents '(1 2 3))))
|
---|
[885] | 87 | (is (every #'= (monom-map (lambda (x) x) p) '(1 2 3)))))
|
---|
[867] | 88 |
|
---|
[303] | 89 |
|
---|
[347] | 90 | (test order
|
---|
| 91 | "order"
|
---|
[948] | 92 | (let ((p (make-monom :initial-exponents '(1 3 2)))
|
---|
| 93 | (q (make-monom :initial-exponents '(1 2 3))))
|
---|
[600] | 94 | (is-true (lex> p q))
|
---|
| 95 | (is-true (grlex> p q))
|
---|
| 96 | (is-true (revlex> p q))
|
---|
| 97 | (is-true (grevlex> p q))
|
---|
[948] | 98 | (is-false (invlex> p q))))
|
---|
| 99 |
|
---|
| 100 | (test elim-order
|
---|
| 101 | "elimination order"
|
---|
| 102 | (let* ((p (make-monom :initial-exponents '(1 2 3)))
|
---|
| 103 | (q (make-monom :initial-exponents '(4 5 6)))
|
---|
| 104 | (elim-order-factory (make-elimination-order-factory))
|
---|
| 105 | (elim-order-1 (funcall elim-order-factory 1))
|
---|
| 106 | (elim-order-2 (funcall elim-order-factory 2)))
|
---|
[949] | 107 | (is-false (funcall elim-order-1 p q))
|
---|
| 108 | (is-false (funcall elim-order-2 p q))))
|
---|
[347] | 109 |
|
---|
[381] | 110 | (test term
|
---|
| 111 | "term"
|
---|
[855] | 112 | (let* ((m1 (make-monom :initial-exponents '(1 2 3)))
|
---|
| 113 | (m2 (make-monom :initial-exponents '(3 5 2)))
|
---|
[602] | 114 | (m3 (monom-mul m1 m2))
|
---|
| 115 | (t1 (make-term m1 7))
|
---|
| 116 | (t2 (make-term m2 9))
|
---|
| 117 | (t3 (make-term m3 (* 7 9))))
|
---|
| 118 | (is (equalp (term-mul *ring-of-integers* t1 t2) t3))))
|
---|
[381] | 119 |
|
---|
[950] | 120 | (test termlist
|
---|
| 121 | "termlist"
|
---|
[968] | 122 | (let* ((t1 (make-term (make-monom :initial-exponents '(1 2 3)) 7))
|
---|
[966] | 123 | (t2 (make-term (make-monom :initial-exponents '(3 5 2)) 9))
|
---|
[967] | 124 | (t11 (make-term (make-monom :initial-exponents '(2 4 6)) 49))
|
---|
[963] | 125 | (t12 (make-term (make-monom :initial-exponents '(4 7 5)) 126))
|
---|
| 126 | (t22 (make-term (make-monom :initial-exponents '(6 10 4)) 81))
|
---|
| 127 | (p (list t2 t1))
|
---|
| 128 | (p-sq (list t22 t12 t11))
|
---|
[956] | 129 | (ring-and-order (make-ring-and-order))
|
---|
| 130 | (q (termlist-expt ring-and-order p 2)))
|
---|
[969] | 131 | (is-true (equalp q p-sq))))
|
---|
[950] | 132 |
|
---|
[970] | 133 | (test poly
|
---|
| 134 | "poly"
|
---|
| 135 | (let* ((t1 (make-term (make-monom :initial-exponents '(1 2 3)) 7))
|
---|
| 136 | (t2 (make-term (make-monom :initial-exponents '(3 5 2)) 9))
|
---|
| 137 | (t11 (make-term (make-monom :initial-exponents '(2 4 6)) 49))
|
---|
| 138 | (t12 (make-term (make-monom :initial-exponents '(4 7 5)) 126))
|
---|
| 139 | (t22 (make-term (make-monom :initial-exponents '(6 10 4)) 81))
|
---|
| 140 | (p (make-poly-from-termlist (list t2 t1)))
|
---|
| 141 | (p-sq (make-poly-from-termlist (list t22 t12 t11)))
|
---|
| 142 | (ring-and-order (make-ring-and-order))
|
---|
[1027] | 143 | (q (poly-expt ring-and-order p 2)))
|
---|
[972] | 144 | (is-true (equalp q p-sq))))
|
---|
[950] | 145 |
|
---|
| 146 |
|
---|
[381] | 147 | (test coerce-to-infix
|
---|
[582] | 148 | "Conversion to infix form"
|
---|
| 149 | (is (equal
|
---|
[605] | 150 | (coerce-to-infix :term (make-term-variable *ring-of-integers* 5 3) '(x y z w u v))
|
---|
[582] | 151 | '(* 1 (EXPT X 0) (EXPT Y 0) (EXPT Z 0) (EXPT W 1) (EXPT U 0)))))
|
---|
[381] | 152 |
|
---|
[584] | 153 | (test priority-queue
|
---|
| 154 | "Priority queue"
|
---|
[607] | 155 | (let ((q (make-priority-queue)))
|
---|
| 156 | (priority-queue-insert q 7)
|
---|
| 157 | (priority-queue-insert q 8)
|
---|
| 158 | (is (= (priority-queue-size q) 3) "Note that there is always a dummy element in the queue.")
|
---|
| 159 | (is (equalp (priority-queue-heap q) #(0 7 8)))
|
---|
| 160 | (is (= (priority-queue-remove q) 7))
|
---|
| 161 | (is (= (priority-queue-remove q) 8))
|
---|
[610] | 162 | (is-true (priority-queue-empty-p q))
|
---|
[613] | 163 | (signals
|
---|
| 164 | (error "Empty queue.")
|
---|
| 165 | (priority-queue-remove q))))
|
---|
[584] | 166 |
|
---|
[634] | 167 | ;;
|
---|
| 168 | ;; Currently parser cannot be tested, as it relies on many maxima functions
|
---|
| 169 | ;; to parse a polynomial expression.
|
---|
| 170 | ;;
|
---|
[614] | 171 | #|
|
---|
| 172 | (test parser
|
---|
| 173 | "Parser"
|
---|
| 174 | (let (($f '((MLIST SIMP) ((MPLUS SIMP) $X ((MTIMES SIMP) -1 $Y)) ((MPLUS SIMP) $X $Y)))
|
---|
[620] | 175 | ($v '((MLIST SIMP) $X $Y)))
|
---|
| 176 | (is-true (parse-poly-list $f $v))))
|
---|
[633] | 177 | |#
|
---|
[614] | 178 |
|
---|
[691] | 179 | (test infix-print
|
---|
[694] | 180 | "Infix printer"
|
---|
[691] | 181 | (is (string= (infix-print '(+ x y) nil) "X+Y"))
|
---|
| 182 | (is (string= (infix-print '(expt x 3) nil) "X^3"))
|
---|
[693] | 183 | (is (string= (infix-print '(+ 1 (expt x 3)) nil) "1+(X^3)"))
|
---|
| 184 | (is (string= (infix-print '(* x y) nil) "X*Y"))
|
---|
| 185 | (is (string= (infix-print '(* x (expt y 2)) nil) "X*(Y^2)")))
|
---|
[832] | 186 |
|
---|
| 187 | (test infix
|
---|
| 188 | "Infix parser"
|
---|
[693] | 189 | (is (equal '#I( x^2 + y^2 ) '(+ (expt x 2) (expt y 2))))
|
---|
[831] | 190 | (is (equal '#I( [ x, y ] ) '(:[ X Y)))
|
---|
| 191 | (is (equal '#I( x + y) '(+ x y)))
|
---|
[864] | 192 | (is (equal '#I( x^3 ) '(expt x 3)))
|
---|
| 193 | (is (equal '#I( 1 + x^3) '(+ 1 (expt x 3))))
|
---|
| 194 | (is (equal '#I( x * y^2 ) '(* x (expt y 2)))))
|
---|
[691] | 195 |
|
---|
[1070] | 196 | (test poly-reader
|
---|
| 197 | "Polynomial reader"
|
---|
[1084] | 198 | (is (equalp (with-input-from-string (s "X^2-Y^2+(-4/3)*U^2*W^3-5")
|
---|
[1089] | 199 | (read-infix-form :stream s))
|
---|
[1083] | 200 | '(+ (- (EXPT X 2) (EXPT Y 2)) (* (- (/ 4 3)) (EXPT U 2) (EXPT W 3)) (- 5))))
|
---|
[1167] | 201 | (is (equalp (string->alist "X^2-Y^2+(-4/3)*U^2*W^3-5" '(x y u w))
|
---|
| 202 | '(((2 0 0 0) . 1)
|
---|
| 203 | ((0 2 0 0) . -1)
|
---|
| 204 | ((0 0 2 3) . -4/3)
|
---|
| 205 | ((0 0 0 0) . -5))))
|
---|
[1173] | 206 | (is (equalp (string->alist "[x^2-y^2+(-4/3)*u^2*w^3-5,y]" '(x y u w))
|
---|
| 207 | '(:[
|
---|
| 208 | (((2 0 0 0) . 1) ((0 2 0 0) . -1) ((0 0 2 3) . -4/3) ((0 0 0 0) . -5))
|
---|
| 209 | (((0 1 0 0) . 1)))))
|
---|
[1099] | 210 | (let ((p (make-poly-from-termlist (list (make-term (make-monom :initial-exponents '(2 0)) 1)
|
---|
| 211 | (make-term (make-monom :initial-exponents '(0 2)) 2)))))
|
---|
[1101] | 212 | (is (equalp (with-input-from-string (s "x^2+2*y^2")
|
---|
| 213 | (read-poly '(x y) :stream s))
|
---|
| 214 | p))
|
---|
[1103] | 215 | (is (equalp (string->poly "x^2+2*y^2" '(x y)) p))))
|
---|
[1023] | 216 |
|
---|
[1174] | 217 | (test division
|
---|
| 218 | "Division in polynomial ring"
|
---|
[1183] | 219 | (let* ((f (string->poly "x^2" '(x y)))
|
---|
[1186] | 220 | (y-sq (string->poly "y^2" '(x y)))
|
---|
[1183] | 221 | (fl (cdr (string->poly "[x+y,x-2*y]" '(x y))))
|
---|
| 222 | (ring *ring-of-integers*)
|
---|
| 223 | (order #'lex>)
|
---|
[1194] | 224 | (ring-and-order (make-ring-and-order :ring ring :order order))
|
---|
| 225 | (quotients (cdr (string->poly "[x-y,0]" '(x y)))))
|
---|
[1192] | 226 | (is (equalp (normal-form ring-and-order f fl) y-sq))
|
---|
[1196] | 227 | (is (equalp (multiple-value-list (poly-pseudo-divide ring-and-order f fl))
|
---|
[1195] | 228 | (list quotients y-sq) 1 2))
|
---|
[1191] | 229 | (is-false (buchberger-criterion ring-and-order fl))))
|
---|
[1174] | 230 |
|
---|
[1188] | 231 |
|
---|
[367] | 232 | (run! 'ngrobner-suite)
|
---|
[346] | 233 | (format t "All tests done!~%")
|
---|
[345] | 234 |
|
---|
| 235 |
|
---|