GitHub - ghollisjr/prime-utils: Prime number utilities for Common Lisp

ghollisjr / prime-utils Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Prime number utilities for Common Lisp

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
.gitignore		.gitignore
README.txt		README.txt
package.lisp		package.lisp
prime-utils.asd		prime-utils.asd
prime-utils.lisp		prime-utils.lisp

Repository files navigation

Basic prime number utilities.

API summary:

* primes*: Generator for prime numbers.
* primes-sieve: Primes sieve algorithm.  High memory use, fast speed.
* prime-factorization: Find prime factors of argument using
  primes-sieve.  Can supply list of prime numbers to avoid re-sieving.

Internal example functions:
* primes-up-to*: Example of using primes* generator, but slower than
  primes-sieve.

* primes-up-to: Imperative version of primes-up-to*.  Useful for
  benchmarking generator overhead.