From: Raymond Toy <toy@rt...>  20031118 17:35:25

>>>>> "Christophe" == Christophe Rhodes <csr21@...> writes: Christophe> Alexey Dejneka <adejneka@...> writes: >> +<note><para> As of &SBCL; 0.8.5 "good" functions >> +are <function>+</>, <function></>; <function>logand</>, <function>logior</>, >> +<function>logxor</>, <function>lognot</> and their combinations; >> +and <function>ash</> with the positive second argument. Christophe> ... which reminds me... * is probably also a good function that would Christophe> warrant a modular implementation at some point, no? Is there an Christophe> algorithm out there that uses * mod 2^32, or are all the cryptoid Christophe> algorithms doing arithmetic mod prime? Some random number generators use that. But maybe that's not important. Of course, my fixedpoint DSP work wants that all the time. Well, usually mod 2^40. Ray 