close Warning: Can't synchronize with repository "(default)" (The repository directory has changed, you should resynchronize the repository with: trac-admin $ENV repository resync '(default)'). Look in the Trac log for more information.

source: branches/f4grobner/5am-poly.lisp@ 4240

Last change on this file since 4240 was 3776, checked in by Marek Rychlik, 8 years ago

* empty log message *

File size: 8.0 KB
Line 
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)
39
40;; Unless NGROBNER system loaded by ASDF,
41;; load the dependencies directly
42#-ngrobner
43(progn
44 (require :copy "copy")
45 (require :monom "monom")
46 (require :utils "utils")
47 (require :polynomial "polynomial"))
48
49(defpackage #:5am-poly
50 (:use :cl :it.bese.fiveam :monom :polynomial))
51
52(in-package :5am-poly)
53
54(def-suite poly-suite
55 :description "Polynomial package suite")
56
57(in-suite poly-suite)
58
59;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
60;;
61;; POLY class tests
62;;
63;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
64
65(def-fixture poly-add-context ()
66 (let ((p (make-instance 'poly))
67 (q (make-instance 'poly :order nil))
68 (p+q (make-instance 'poly))
69 (p-q (make-instance 'poly))
70 (p-uminus (make-instance 'poly)))
71 ;; Populate the polynomials; the lists of (exponents . coefficient) pairs
72 ;; must be in increasing order in Q, but Q is unordered (:ORDER NIL)
73 ;; so it will be automatically sorted.
74 (dolist (x '( ((2) . 22) ((4) . 44) ((5) . 55) ((8) . 88) ((9) . 99) ))
75 (poly-insert-term p (make-instance 'term :exponents (car x) :coeff (cdr x))))
76 (dolist (x '( ((9) . 90) ((0) . 11) ((2) . 20) ((3) . 33) ((4) . -44) ((7) . 77) ((8) . 88) ))
77 (poly-insert-term q (make-instance 'term :exponents (car x) :coeff (cdr x))))
78 ;; P+Q
79 (dolist (x '(((0) . 11) ((2) . 42) ((3) . 33) ((5) . 55) ((7) . 77) ((8) . 176) ((9) . 189) ))
80 (poly-insert-term p+q (make-instance 'term :exponents (car x) :coeff (cdr x))))
81 ;; P-Q
82 (dolist (x '(((0) . -11) ((2) . 2) ((3) . -33) ((4) . 88) ((5) . 55) ((7) . -77) ((9) . 9)))
83 (poly-insert-term p-q (make-instance 'term :exponents (car x) :coeff (cdr x))))
84 ;; -P
85 (dolist (x '( ((2) . -22) ((4) . -44) ((5) . -55) ((8) . -88) ((9) . -99)))
86 (poly-insert-term p-uminus (make-instance 'term :exponents (car x) :coeff (cdr x))))
87 ;;(print p) (print q) (print p+q) (print p-q)
88 (&body)))
89
90(test poly-add
91 "Polynomial addition"
92 (with-fixture poly-add-context () (is (universal-equalp (add-to p q) p+q)))
93 (with-fixture poly-add-context () (is (universal-equalp (add p q) p+q)))
94 (with-fixture poly-add-context () (is (universal-equalp (subtract-from p q) p-q)))
95 (with-fixture poly-add-context () (is (universal-equalp (subtract p q) p-q)))
96 (with-fixture poly-add-context () (is (universal-equalp (unary-minus p) p-uminus)))
97 )
98
99(def-fixture poly-multiply-context ()
100 (let ((p (make-instance 'poly))
101 (q (make-instance 'poly :order nil))
102 (p*q (make-instance 'poly)))
103 ;; Populate the polynomials; the lists of (exponents . coefficient) pairs
104 ;; must be in increasing order in Q, but Q is unordered (:ORDER NIL)
105 ;; so it will be automatically sorted.
106 (dolist (x '( ((0) . 1) ((1) . 2) ))
107 (poly-insert-term p (make-instance 'term :exponents (car x) :coeff (cdr x))))
108 (dolist (x '( ((0) . 1) ((1) . 3) ))
109 (poly-insert-term q (make-instance 'term :exponents (car x) :coeff (cdr x))))
110 ;; P*Q
111 (dolist (x '( ((0) . 1) ((1) . 5) ((2) . 6)))
112 (poly-insert-term p*q (make-instance 'term :exponents (car x) :coeff (cdr x))))
113 (&body)))
114
115
116(test poly-multiply
117 "Polynomial multiplication"
118 (with-fixture poly-multiply-context () (is (universal-equalp (multiply p q) p*q)))
119 )
120
121(test poly-standard-extension
122 "Standard extension"
123 (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
124 (q (alist->poly '( ((0) . 1) ((2) . 3))))
125 (plist (list p q))
126 (p-ext (alist->poly '( ((1 0 0) . 1) ((1 0 1) . 2))))
127 (q-ext (alist->poly '( ((0 1 0) . 1) ((0 1 2) . 3))))
128 (plist-st-ext (list p-ext q-ext)))
129 (is (universal-equalp (standard-extension plist) plist-st-ext))))
130
131(test poly-standard-extension-1
132 "Standard extension 1"
133 (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
134 (q (alist->poly '( ((0) . 1) ((2) . 3))))
135 (plist (list p q))
136 (p-ext (alist->poly '( ((0 0 0) . -1) ((1 0 0) . 1) ((1 0 1) . 2))))
137 (q-ext (alist->poly '( ((0 0 0) . -1) ((0 1 0) . 1) ((0 1 2) . 3))))
138 (plist-st-ext (list p-ext q-ext)))
139 (is (universal-equalp (standard-extension-1 plist) plist-st-ext))))
140
141(test poly-standard-sum
142 "Standard sum"
143 (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
144 (q (alist->poly '( ((0) . 1) ((2) . 3))))
145 (plist (list p q))
146 (std-sum (alist->poly '(((0 0 0) . -1) ((0 1 0) . 1) ((0 1 2) . 3)
147 ((1 0 0) . 1) ((1 0 1) . 2)))))
148 (is (universal-equalp (standard-sum plist) std-sum))))
149
150(test poly-s-polynomial
151 "S-Polynomial"
152 (let* ((f (alist->poly '( ((1 0 0) . 1) ((1 0 1) . 2)))) ;x+2*x*z |*y*z
153 (g (alist->poly '( ((0 1 0) . 1) ((0 1 2) . 2)))) ;y+2*y*z^2 |*x
154 (s-poly (alist->poly '( ((1 1 0) . -1) ((1 1 1) . 1)))); x*y*z - x*y
155 )
156 (is (universal-equalp (s-polynomial f g) s-poly))))
157
158(test poly-content
159 "Poly-content"
160 (let* ((p (alist->poly '( ((1 0 0) . 12) ((1 0 1) . 15))))
161 (pc 3))
162 (is (universal-equalp (poly-content p) pc))))
163
164(test poly-primitive-part
165 "Poly-primitive-part"
166 (let* ((p (alist->poly '( ((1 0 0) . 12) ((1 0 1) . 15))))
167 (pp (alist->poly '( ((1 0 0) . 4) ((1 0 1) . 5)))))
168 (is (universal-equalp (poly-primitive-part p) pp))))
169
170(test saturation-extension
171 "Saturation-extension"
172 (let* ((f (list (alist->poly '( ((1 0 0) . 2) ((1 0 1) . 3))) ;2*x+3*x*z
173 (alist->poly '( ((1 0 0) . 5) ((0 1 2) . 7)))) ;5*x+7*y*z^2
174 )
175 (p (alist->poly '( ((1 1 1) . 11) ((2 3 4) . 13)))) ;11*x*y*z+13*x^2*y^3*z^4
176 (sat-ext (list (alist->poly '( ((0 1 0 0) . 2) ((0 1 0 1) . 3)))
177 (alist->poly '( ((0 1 0 0) . 5) ((0 0 1 2) . 7)))
178 (alist->poly '( ((0 0 0 0) . -1) ((1 1 1 1) . 11) ((1 2 3 4) . 13) )))))
179 (is (universal-equalp (saturation-extension f (list p)) sat-ext))))
180
181(test saturation-extension-1
182 "Saturation-extension-1"
183 (let* ((f (list (alist->poly '( ((1 0 0) . 2) ((1 0 1) . 3))) ;2*x+3*x*z
184 (alist->poly '( ((1 0 0) . 5) ((0 1 2) . 7)))) ;5*x+7*y*z^2
185 )
186 (p (alist->poly '( ((1 1 1) . 11) ((2 3 4) . 13)))) ;11*x*y*z+13*x^2*y^3*z^4
187 (sat-ext-1 (list (alist->poly '( ((0 1 0 0) . 2) ((0 1 0 1) . 3)))
188 (alist->poly '( ((0 1 0 0) . 5) ((0 0 1 2) . 7)))
189 (alist->poly '( ((0 0 0 0) . -1) ((1 1 1 1) . 11) ((1 2 3 4) . 13) )))))
190 (is (universal-equalp (saturation-extension-1 f p) sat-ext-1))))
191
192(test universal-expt
193 "Universal-expt"
194 (let ((f (alist->poly '( ((0) . 1) ((1) . 1))))
195 (f2 (alist->poly '( ((0) . 1) ((1) . 2) ((2) . 1))))
196 (f3 (alist->poly '( ((0) . 1) ((1) . 3) ((2) . 3) ((3) . 1)))))
197 (is (universal-equalp (universal-expt f 2) f2))
198 (is (universal-equalp (universal-expt f 3) f3))))
199
200(run! 'poly-suite)
201(format t "All tests done!~%")
202
203
Note: See TracBrowser for help on using the repository browser.