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?
I ran into this problem with sbt dependency resolution around 7 weeks ago. I
was in a hurry, so I commented out the offending import (since it was not in the
subproject I was working on, so was not needed for the run I was in) sent my
commit to the heavens and CircleCI was happy.
Down into some net rabbit hole, I stumbled upon a review of Work Clean. I chuckled: a productivity book, philosophizing about how cook’s approach to preparation (mise en place) would fix all our problems? Bring it on, I have a long commute.
I had always wanted to play with Processing (after leafing through The
Processing
Handbook and
Visualizing
Data
some years ago). My general dislike for Java or the JVM made me just play a
short amount of time with processing.js something around 2011 (there was a
native processing.js application for iOS, I used it for a while on my iPad and
iPod Touch).
A few months ago I stumbled into the problem of Akka logging, specifically
ClassNotFoundException when using akka.event.slf4j.Slf4jLoggingFilter, just by
following the details of the Logging - SL4J section of Akka
documentation.
Almost two months ago (time sure flies) I attended for the second time the conference Scala eXchange, one of the largest Scala conferences in the world, and which happens to be 1 tube stop from the office you can find me from time to time in London.