21:13:24pjbNow, perhaps the question to ask is about the syscalls and the data types (or lack thereof) used by the syscalls. But I note that basically, all the original syscalls only used simple int parameters and pointers to byte buffers. So rather language agnostic really. Later it degraded…
21:13:35jasomjackdaniel: yeah, my talk about *random-state* devolved into undefined behavior which devolved into C...
21:13:41p_lpjb: if not a proper F77, then an f2c program
21:33:59pjbYounder: haskell's better at pseudo-coding stuff…
21:36:43YounderWhite_Flame, 1987, that was the year I started studying computer science.
21:40:10Younderpjb I mostly write in Mathematica these days. Anyhow the type-system in Haskell gives me a headache so I couldn't use it for pseudo-code.
0:24:03tsandstrHey guys, anybody working with CL under Gentoo? I'm considering hopping over to Gentoo, and I'm kind of curious about the CL packages in the repos. Would it be best practice to use those official packages? Or use quicklisp? And how do they interact?
0:35:32pjbnirved: and yes, there's also the auto-update problem.
0:35:53tsandstrso, in general, do you think it would make sense to install Lisp applications (eg StumpWM) through portage, while installing libraries that I plan to use through quicklisp?
3:26:32rdap"The Sieve of Eratosthenes stops when the square of the number we are testing is greater than the last number on the grid."
3:27:15pjbebrasca: I don't like lisp-critic too much. I find some advises ill-advisen, some outdated, very few useful. Read it, and use your own ruleset!
3:29:57rdapSo I only need to generate a list of primes up to the square root of the number that was input
3:31:38rdapso, generate a list of integers up to the square root..
3:32:53rdapthen copy to a new list every 2nd from the 2nd, every third from the third, every 5th from the 5th, and so on
3:34:08rdapthen divide the input number by everythin in the list and eliminate everything that doesn't divide by x into an integer
3:35:28rdapthen the list should contain nothing but prime factors
3:39:37pjbrdap: yes. But you can avoid generating list of numbers. Using a bit-vector takes less space.
3:39:52pjbAnd you can make a bit-vector of only the odd numbers, halving the needed bits.
3:40:19rdapah yes, because anything even is a composite of 2
3:41:05pjbor you can just use com.informatimago.common-lisp.arithmetic.primes:compute-primes-to
3:42:11rdapi'm not sure i have that, and i feel like that would be cheating
3:42:37pjbthen compare when you're done with yours.
4:26:50gilberthAnd they don't even compile the regular expression. As in: compiling it to native code eventually. And flex^Wbison cannot do submatch addressing.