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

Last change on this file since 3642 was 3638, checked in by Marek Rychlik, 9 years ago

* empty log message *

File size: 5.9 KB
RevLine 
[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)
39
[3493]40(require :copy "copy")
[3491]41(require :monom "monom")
[3056]42(require :utils "utils")
[2637]43(require :polynomial "polynomial")
44
45(defpackage #:5am-poly
[3492]46 (:use :cl :it.bese.fiveam :monom :polynomial))
[2637]47
48(in-package :5am-poly)
49
[2638]50(def-suite poly-suite
[3226]51 :description "Polynomial package suite")
[2637]52
[2638]53(in-suite poly-suite)
[2637]54
55;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
56;;
57;; POLY class tests
58;;
59;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
60
[2932]61(def-fixture poly-add-context ()
[3266]62 (let ((p (make-instance 'poly))
[2677]63 (q (make-instance 'poly :order nil))
[2648]64 (p+q (make-instance 'poly))
[2688]65 (p-q (make-instance 'poly))
66 (p-uminus (make-instance 'poly)))
[2671]67 ;; Populate the polynomials; the lists of (exponents . coefficient) pairs
[2678]68 ;; must be in increasing order in Q, but Q is unordered (:ORDER NIL)
69 ;; so it will be automatically sorted.
[2670]70 (dolist (x '( ((2) . 22) ((4) . 44) ((5) . 55) ((8) . 88) ((9) . 99) ))
[3635]71 (poly-insert-term p (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2679]72 (dolist (x '( ((9) . 90) ((0) . 11) ((2) . 20) ((3) . 33) ((4) . -44) ((7) . 77) ((8) . 88) ))
[3635]73 (poly-insert-term q (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2737]74 ;; P+Q
[2734]75 (dolist (x '(((0) . 11) ((2) . 42) ((3) . 33) ((5) . 55) ((7) . 77) ((8) . 176) ((9) . 189) ))
[3635]76 (poly-insert-term p+q (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2737]77 ;; P-Q
[2670]78 (dolist (x '(((0) . -11) ((2) . 2) ((3) . -33) ((4) . 88) ((5) . 55) ((7) . -77) ((9) . 9)))
[3635]79 (poly-insert-term p-q (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2737]80 ;; -P
[3494]81 (dolist (x '( ((2) . -22) ((4) . -44) ((5) . -55) ((8) . -88) ((9) . -99)))
[3635]82 (poly-insert-term p-uminus (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2664]83 ;;(print p) (print q) (print p+q) (print p-q)
[2637]84 (&body)))
85
[2931]86(test poly-add
[2637]87 "Polynomial addition"
[3637]88 (with-fixture poly-add-context () (is (universal-equalp (add-to p q) p+q)))
[3638]89 (with-fixture poly-add-context () (is (universal-equalp (add p q) p+q)))
[3637]90 (with-fixture poly-add-context () (is (universal-equalp (subtract-from p q) p-q)))
[3638]91 (with-fixture poly-add-context () (is (universal-equalp (subtract p q) p-q)))
[3637]92 (with-fixture poly-add-context () (is (universal-equalp (unary-minus p) p-uminus)))
[2652]93 )
[2637]94
[2934]95(def-fixture poly-multiply-context ()
[3266]96 (let ((p (make-instance 'poly))
[2934]97 (q (make-instance 'poly :order nil))
98 (p*q (make-instance 'poly)))
99 ;; Populate the polynomials; the lists of (exponents . coefficient) pairs
100 ;; must be in increasing order in Q, but Q is unordered (:ORDER NIL)
101 ;; so it will be automatically sorted.
102 (dolist (x '( ((0) . 1) ((1) . 2) ))
[3636]103 (poly-insert-term p (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2934]104 (dolist (x '( ((0) . 1) ((1) . 3) ))
[3636]105 (poly-insert-term q (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2934]106 ;; P*Q
107 (dolist (x '( ((0) . 1) ((1) . 5) ((2) . 6)))
[3636]108 (poly-insert-term p*q (make-instance 'term :exponents (car x) :coeff (cdr x))))
[2934]109 (&body)))
110
111
[2935]112(test poly-multiply
113 "Polynomial multiplication"
[3638]114 (with-fixture poly-multiply-context () (is (universal-equalp (multiply p q) p*q)))
[2935]115 )
116
[3097]117(test poly-standard-extension
118 "Standard extension"
[3266]119 (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
[3098]120 (q (alist->poly '( ((0) . 1) ((2) . 3))))
[3097]121 (plist (list p q))
122 (p-ext (alist->poly '( ((1 0 0) . 1) ((1 0 1) . 2))))
123 (q-ext (alist->poly '( ((0 1 0) . 1) ((0 1 2) . 3))))
[3098]124 (plist-st-ext (list p-ext q-ext)))
[3637]125 (is (universal-equalp (standard-extension plist) plist-st-ext))))
[2935]126
[3102]127(test poly-standard-extension-1
128 "Standard extension 1"
[3266]129 (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
[3102]130 (q (alist->poly '( ((0) . 1) ((2) . 3))))
131 (plist (list p q))
132 (p-ext (alist->poly '( ((0 0 0) . -1) ((1 0 0) . 1) ((1 0 1) . 2))))
133 (q-ext (alist->poly '( ((0 0 0) . -1) ((0 1 0) . 1) ((0 1 2) . 3))))
134 (plist-st-ext (list p-ext q-ext)))
[3637]135 (is (universal-equalp (standard-extension-1 plist) plist-st-ext))))
[3102]136
[3111]137(test poly-standard-sum
138 "Standard sum"
[3266]139 (let* ((p (alist->poly '( ((0) . 1) ((1) . 2))))
[3111]140 (q (alist->poly '( ((0) . 1) ((2) . 3))))
141 (plist (list p q))
[3114]142 (std-sum (alist->poly '(((0 0 0) . -1) ((0 1 0) . 1) ((0 1 2) . 3)
143 ((1 0 0) . 1) ((1 0 1) . 2)))))
[3637]144 (is (universal-equalp (standard-sum plist) std-sum))))
[3111]145
[2638]146(run! 'poly-suite)
[2637]147(format t "All tests done!~%")
148
149
Note: See TracBrowser for help on using the repository browser.