This week I have been working a lot with a relatively large dataset on a Spark shell. It was a graph with 1 billion nodes and 2 billion edges that I wanted to analyse with GraphFrames (the successor of GraphX on Spark).
Even though I have been a long time user of oh-my-zsh on zsh (moved from plain bash to zsh like 10 years ago), I have been minimal on my use of its theme capabilities. I have used the default theme forever: robbyrussell. But recently I was showing my friend @craftycoder the tweaks I have on my system (fzf, autojump, etc) and he showed me this theme, agnoster.
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).