Custom Query (1030 matches)

Collisions on small consecutive numbers mean hash-tables will be slower than expected, and systematic such collisions probably count as a performance bug.

(EQUAL (SXHASH 12) (SXHASH 13))
;;=> T

gz says it looks like 2n and 2n+1 can have same SXHASH, and gb points at CCL::STRIP-TAG-TO-FIXNUM.

On 32-bit platforms, we see:

? (open #p"/dev/null" :direction :probe :element-type '(unsigned-byte 33))
> Error: Not an ivector subtag: 170
> While executing: SUBTAG-BYTES, in process listener(1).

The 170 is subtag-simple-vector. Maybe SUBTAG-BYTES should just punt somehow if it gets a non-ivector subtag? Maybe return NIL and deal with that in OPTIMAL-BUFFER-SIZE?

(From the test suite.)

From r15343, perhaps?

ChromeKote:ccl svspire$ ./dx86cl64 -n Welcome to Clozure Common Lisp Version 1.8-r15290M (DarwinX8664)! ? (set-syntax-from-char #\u+feff #\space) T ?

ChromeKote:ccl svspire$ ./dx86cl64 -n Welcome to Clozure Common Lisp Version 1.9-dev-r15382M-trunk (DarwinX8664)! ? (set-syntax-from-char #\u+feff #\space)

Error: Array index 254 out of bounds for #<SIMPLE-VECTOR 1> . While executing: (SETF CCL::SPARSE-VECTOR-REF), in process listener(1). Type :POP to abort, :R for a list of available restarts. Type :? for other options.

1 >