Removed the digit manipulation functions.

See the library cl-numerics.

number-theory.lisp

@@ -124,49 +124,3 @@ prime (we use MILLER-RABIN for the test here)."
 ;;; Define some common name interfaces
 (defwrapper factor factor-trial-division)
 (defwrapper coprime-factor coprime-factor-trial-division)
-
-
-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-;;;; Dealing with digits ;;;;
-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
-
-
-(with-compilation-unit (:override nil)
-  (defun n-digits (n)
-    (funcall
-      (alambda (n count)
-        (cond ((= n 0) count)
-              (t (self (floor n 10) (1+ count))) ))
-      n 0 ))
-  (defun get-digit (n m)
-    (cond ((= m 0) (mod n 10))
-          (t (get-digit (floor n 10) (1- m))) ))
-  (defun digits<-number (n)
-    (declare (type integer n))
-    (funcall
-      (alambda (n m ret)
-        (cond ((= m 1) (cons (mod n 10) ret))
-              (t (self (floor n 10) (1- m) (cons (mod n 10) ret))) ))
-      n (n-digits n) nil ))
-  (defun number<-digits (digits)
-    (declare (type list digits))
-    (funcall
-      (alambda (digits pow tot)
-        (cond ((null digits) tot)
-              (t (self (cdr digits) (1+ pow)
-                       (+ tot (* (car digits) (expt 10 pow))) ))))
-      (reverse digits) 0 0) ) )
-
-;;; Examples
-
-;; (n-digits 321)
-;; (n-digits (floor 1d100))
-;; (n-digits (expt 2 32)) ; 2^32 ~= 4e9
-
-;; (mapcar #'(lambda (n) (get-digit 12345 n)) '(0 1 2 3 4))
-
-;; (digits<-number 12345)
-;; (number<-digits (digits<-number 54321))
-
-;;
-

package.lisp

@@ -96,7 +96,6 @@
            ;;; Number-theory
            #:*-mod #:expt-mod
            #:miller-rabin #:gen-prime
-           #:n-digits #:get-digit #:digits<-number #:number<-digits
            #:prime?
            #:factor-trial-division #:coprime-factor-trial-division
            #:factor #:coprime-factor