freenode/#sicl - IRC Chatlog
Search
1:31:13
no-defun-allowed
Another "quirk" of the linear probing hash table is that you can see when it has to probe multiple groups. With groups of 8 and a 0.8 load, there's a 16.7% probability of a group being full (so that GETHASH has to scan a second group), but with smaller groups, the probability decreases.
1:32:08
no-defun-allowed
Oh, smaller load, not groups. I was thinking about my next sentence, which is: This probability also decreases with larger groups, e.g. the 16-element groups which can be searched with 128-bit SIMD instructions.
4:17:44
no-defun-allowed
Is there much of a convention for example code in SICL? I ported the metadata probing code to use a made-up SIMD package, so that if one appears, implementing faster probing is just a matter of substituting function names; but it certainly won't work now, as that package doesn't exist.
4:19:46
no-defun-allowed
It is code that could be used, but won't work without some platform-specific modification. Maybe "example code" is the wrong term.
4:22:20
no-defun-allowed
I currently have a CL:ERROR form with a brief description at the start of the file, so that it won't load, and have named it "simd-metadata-table.example.lisp".
4:24:32
no-defun-allowed
I recall reading other codebases which turned a type .lisp into .example.lisp to denote that it was not meant to be used as is.
4:45:53
jeosol
no-defun-allowed: just saw your pull request on implement a linear-probing hash-table into SICL. Good work