Changeset 8 in CGBLisp


Ignore:
Timestamp:
Jan 26, 2009, 10:23:33 PM (15 years ago)
Author:
Marek Rychlik
Message:

Moving sources into trunk

Files:
1 deleted
24 edited
5 moved

Legend:

Unmodified
Added
Removed

  • src/cgb.asd

    r3 r8  
    1414
    1515;;Use the grobner package within colored-poly package
    16 (pushnew :colored-poly-use-grobner *features*)
     16;;(pushnew :colored-poly-use-grobner *features*)
    1717
    1818;;colored-poly package

  • src/coefficient-ring.lisp

    r1 r8  
    3535(in-package "COEFFICIENT-RING")
    3636
    37 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    38 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     37(proclaim '(optimize (speed 0) (debug 3)))
    3938
    4039(defstruct ring

  • src/colored-poly.lisp

    r1 r8  
    2424(in-package "COLORED-POLY")
    2525             
    26 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    27 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     26(proclaim '(optimize (speed 0) (debug 3)))
    2827
    2928#+debug(defvar *colored-poly-debug* nil "If true debugging output is on.")

  • src/division.lisp

    r1 r8  
    1515(in-package  "DIVISION")
    1616
    17 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    18 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     17(proclaim '(optimize (speed 0) (debug 3)))
    1918
    2019(defun divide (f fl &optional

  • src/dynamics.lisp

    r1 r8  
    2828(in-package "DYNAMICS")
    2929
    30 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    31 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     30(proclaim '(optimize (speed 0) (debug 3)))
    3231
    3332(defun poly-scalar-composition (f G &optional (order #'lex>))

  • src/example.lisp

    r1 r8  
    1717    "INFIX" "COMMON-LISP"))
    1818
    19 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    20 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     19(proclaim '(optimize (speed 0) (debug 3)))
    2120
    2221(defun example (symbol &optional (stream t))

  • src/grobner.lisp

    r1 r8  
    5555(in-package "GROBNER")
    5656
    57 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    58 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     57(proclaim '(optimize (speed 0) (debug 3)))
    5958
    6059#+debug

  • src/infix.lisp

    r1 r8  
    277277(pushnew :infix *features*)
    278278
    279 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    280 #-debug(proclaim '(optimize (speed 3) (debug 0)))
    281 
    282 (eval-when (compile load eval)
     279(proclaim '(optimize (speed 0) (debug 3)))
     280
     281(eval-when (:compile-toplevel :load-toplevel :execute)
    283282  (defparameter *version* "1.3  28-JUN-96")
    284283  (defparameter *print-infix-copyright* t
    … …  
    544543  (gethash token *token-infix-operator-table*))
    545544
    546 (eval-when (compile load eval)
     545(eval-when (:compile-toplevel :load-toplevel :execute)
    547546  (defmacro define-token-operator (operator-name &key
    548547                                                 (prefix nil prefix-p)
    … …  
    572571
    573572;;; Readtable definitions for characters, so that the right token is returned.
    574 (eval-when (compile load eval)
     573(eval-when (:compile-toplevel :load-toplevel :execute)
    575574  (defmacro define-character-tokenization (char function)
    576575    `(set-macro-character ,char ,function nil *infix-readtable*)))

  • src/modular-poly.lisp

    r1 r8  
    1717(in-package "MODULAR-POLY")
    1818
    19 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    20 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     19(proclaim '(optimize (speed 0) (debug 3)))
    2120
    2221(defun modular-trace (plist modulus)

  • src/modular.lisp

    r1 r8  
    1717(in-package "MODULAR")
    1818
    19 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    20 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     19(proclaim '(optimize (speed 0) (debug 3)))
    2120
    2221(defun modular-inverse (x p)

  • src/monom.lisp

    r1 r8  
    1717(in-package "MONOM")
    1818
    19 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    20 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     19(proclaim '(optimize (speed 0) (debug 3)))
    2120
    2221;;----------------------------------------------------------------

  • src/order.lisp

    r1 r8  
    3535(in-package "ORDER")
    3636
    37 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    38 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     37(proclaim '(optimize (speed 0) (debug 3)))
    3938
    4039;; pure lexicographic

  • src/parse.lisp

    r1 r8  
    1919(in-package "PARSE")
    2020
    21 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    22 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     21(proclaim '(optimize (speed 0) (debug 3)))
    2322
    2423;; The function PARSE yields the representations as above.  The two functions

  • src/poly-gcd.lisp

    r1 r8  
    1616(in-package "POLY-GCD")
    1717
    18 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    19 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     18(proclaim '(optimize (speed 0) (debug 3)))
    2019
    2120;; This package calculates GCD of polynomials over integers.

  • src/poly-with-sugar.lisp

    r1 r8  
    3333(in-package "POLY-WITH-SUGAR")
    3434
    35 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    36 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     35(proclaim '(optimize (speed 0) (debug 3)))
    3736
    3837;;----------------------------------------------------------------

  • src/poly.lisp

    r1 r8  
    1818(in-package "POLY")
    1919
    20 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    21 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     20(proclaim '(optimize (speed 0) (debug 3)))
    2221
    2322;;----------------------------------------------------------------

  • src/printer.lisp

    r1 r8  
    1515(in-package "PRINTER")
    1616
    17 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    18 #-debug(proclaim '(optimize (speed 3) (safety 0)))
     17(proclaim '(optimize (speed 0) (debug 3)))
    1918
    2019(defun poly-print (plist vars &optional (stream t))

  • src/prover.lisp

    r1 r8  
    1919(in-package "PROVER")
    2020
    21 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    22 #-debug(proclaim '(optimize (speed 3) (safety 0)))
     21(proclaim '(optimize (speed 0) (debug 3)))
    2322
    2423(defvar *prover-order* #'grevlex>

  • src/rat.lisp

    r1 r8  
    2828(in-package "RAT")
    2929
    30 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    31 #-debug(proclaim '(optimize (speed 3) (safety 0)))
     30(proclaim '(optimize (speed 0) (debug 3)))
    3231
    3332(defun num (p) (car p))                 ;numerator

  • src/ratpoly.lisp

    r1 r8  
    3434(in-package "RATPOLY")
    3535
    36 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    37 #-debug(proclaim '(optimize (speed 3) (safety 0)))
     36(proclaim '(optimize (speed 0) (debug 3)))
    3837
    3938;; Arithmetic on polynomials in one variable

  • src/string-grobner.lisp

    r1 r8  
    3030(in-package "STRING-GROBNER")
    3131
    32 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    33 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     32(proclaim '(optimize (speed 0) (debug 3)))
    3433
    3534(defun string-normal-form (f fl vars

  • src/svpoly.lisp

    r1 r8  
    1414(in-package "SVPOLY")
    1515
    16 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    17 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     16(proclaim '(optimize (speed 0) (debug 3)))
    1817
    1918(defstruct (svpoly (:constructor make-svpoly-raw))

  • src/term.lisp

    r1 r8  
    1616(in-package "TERM")
    1717
    18 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    19 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     18(proclaim '(optimize (speed 0) (debug 3)))
    2019
    2120;;----------------------------------------------------------------

  • src/xgcd.lisp

    r1 r8  
    1515(in-package "XGCD")
    1616
    17 #+debug(proclaim '(optimize (speed 0) (debug 3)))
    18 #-debug(proclaim '(optimize (speed 3) (debug 0)))
     17(proclaim '(optimize (speed 0) (debug 3)))
    1918
    2019(defun xgcd (X Y)
Note: See TracChangeset for help on using the changeset viewer.