Custom Query (1630 matches)

So rand() is completely subpar at generating random numbers in two ways:

1. Lower bits are not random. We already work around this in the standard manner by scaling the result of a floating-point division.

2. Nearby seeds don't affect the output much.

Due to # 2, on Mac OS X we may obtain the same initial random number for a minute or more, even though it is seeded with (current-seconds):

while :; do csi -p '(random 1000)'; sleep 5; done
734
734
734
734
734
209
209

We can fix the problem on OS X by using random(3) instead of rand(3), which is present on all BSDs and on Linux.

Internally, Linux uses random() when rand() is called and some BSDs seem to as well. However, there should be no harm anyway in applying the attached patch, which affects linux and bsd.

This error goes away if you use data-structures along with srfi-69.

$ cat > aa.scm <<EOF (use srfi-69) (alist->hash-table '((foo . bar))) EOF

$ csc aa.scm $ ./aa

Error: call of non-procedure: #<unbound value>

Call history: aa.scm:2: alist->hash-table

If the first list argument to map is not actually a list, map will just return (). Version: git fd66e1b (master)

#;1> (map (lambda (x) x) 'foo) () #;2> (map 'foo 'foo) ()