Import Debian changes 2c7-1debian/2c7-1

slib (2c7-1) unstable; urgency=low

  * New upstream.
  * Add slibconfig back in.

slib (2c6-2) unstable; urgency=low

  * Remove the slib$(VERSION).info file.  Cut the diff back down to
    size. 

slib (2c6-1) unstable; urgency=low

  * New upstream.
  * Move docs to /usr/share. Up standards version. add /usr/doc symlink.
    Move info files.  Remove undocumented link.

slib (2c5-6) unstable; urgency=low

  * Lowercase two vars in yasyn.scm (Fixes bug #37222)

slib (2c5-5) unstable; urgency=low

  * Fix it so string-index isn't defined (now there is a
    strsrch:string-index) (Fixes #38812)

slib (2c5-4) unstable; urgency=low

  * Don't run slibconfig in postinst.  (Fixes bug #38253, #37733, #37715,
    #37746,  #37809, #37917, #38123, #38462)

slib (2c5-3) unstable; urgency=low

  * Run slibconfig in postinst.  It was commented out there, but I don't
    see any old bug reports on why it was commented out, so let's try
    again. :)  (Fixes bug #37221)

slib (2c5-2) unstable; urgency=low

  * Link mklibcat.scm to mklibcat.  Fixes a problem with using slib with
    guile. 

slib (2c5-1) unstable; urgency=low

  * New upstream.

slib (2c3-4) unstable; urgency=low

  * New maintainer.

1 files changed, 73 insertions, 0 deletions

diff --git a/factor.txi b/factor.txi
new file mode 100644
index 0000000..8277c2b
--- /dev/null
+++ b/factor.txi
@@ -0,0 +1,73 @@
+
+
+
+@defvar prime:prngs
+
+ @var{prime:prngs} is the random-state (@pxref{Random Numbers}) used by these
+ procedures.  If you call these procedures from more than one thread
+ (or from interrupt), @code{random} may complain about reentrant
+ calls.
+@end defvar
+
+
+
+
+
+
+@defun jacobi-symbol p q
+
+ Returns the value (+1, @minus{}1, or 0) of the Jacobi-Symbol of
+ exact non-negative integer @var{p} and exact positive odd integer @var{q}.
+@end defun
+
+
+@defvar prime:trials
+
+ @var{prime:trials} the maxinum number of iterations of Solovay-Strassen that will
+ be done to test a number for primality.
+@end defvar
+
+
+
+
+@defun prime? n
+
+ Returns @code{#f} if @var{n} is composite; @code{#t} if @var{n} is prime.
+ There is a slight chance @code{(expt 2 (- prime:trials))} that a
+ composite will return @code{#t}.
+@end defun
+
+
+
+@defun primes< start count
+
+ Returns a list of the first @var{count} prime numbers less than
+ @var{start}.  If there are fewer than @var{count} prime numbers
+ less than @var{start}, then the returned list will have fewer than
+ @var{start} elements.
+@end defun
+
+
+
+@defun primes> start count
+
+ Returns a list of the first @var{count} prime numbers greater than @var{start}.
+@end defun
+
+
+
+ 
+ 
+
+ 
+
+
+
+
+
+@defun factor k
+
+ Returns a list of the prime factors of @var{k}.  The order of the
+ factors is unspecified.  In order to obtain a sorted list do
+ @code{(sort! (factor @var{k}) <)}.
+@end defun