Samuel Tardieu 41d804ddbd Pack primes numbers by slices of 30 ... In any given 30 successive integers greater than 5, there are at most 8 prime numbers. Use this to tightly pack the result of the Eratostene sieve. This lets us store more prime numbers than before in less space.		2009-06-24 13:15:12 +02:00
..
bits	unbits word in math.bits vocab	2009-06-01 22:39:02 -05:00
bitwise	win32 support for window-controls	2009-06-18 11:41:34 -05:00
blas	remove 1-, 1+, use iota somewhere	2009-05-05 23:32:23 -05:00
combinatorics	math.combinatorics: fix unit test and help lint	2009-05-08 18:00:53 -05:00
complex	Update documentation for stricter vocabulary search path semantics	2009-05-16 00:29:21 -05:00
constants	add 2pi constant	2009-05-06 12:38:14 -05:00
functions	give range models a step parameter; use it on sliders so the thumb can step by any interval	2009-06-18 20:57:02 -05:00
intervals	Code cleanups	2009-05-07 12:33:31 -05:00
libm	…
matrices	fix load error	2009-06-12 02:43:05 -05:00
partial-dispatch	…
points	…
polynomials	rename peek -> last and update all usages	2009-05-25 16:38:33 -05:00
primes	Pack primes numbers by slices of 30	2009-06-24 13:15:12 +02:00
quaternions	…
ranges	remove whitespace	2009-05-25 21:25:56 -05:00
ratios	…
rectangles	Eliminate prettyprinter dependency from UI	2009-05-09 20:24:17 -05:00
statistics	add a mode word	2009-05-24 15:45:25 -05:00
vectors	homogeneous coordinates coated in nurbsauce	2009-05-21 20:55:44 -05:00