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@ 4334

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

* empty log message *

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