Below you will find pages that utilize the taxonomy term “C”
A few days go I played a bit with a naive implementation of Bloom
filters in Python. I wanted to time
them against just checking whether a field is in a set/collection. I found
something slightly puzzling: it looked like the in worked too fast for
smaller lists. And I wondered: maybe small lists are special internally, and
allow for really fast lookups? Maybe they have some internal index? This raised
the question: how does in find stuff in sequences?
A LISP random triangle generator. Also wrote a C version.