One of the things I frequently do while writing code (especially in Jupyter notebooks) is pipe-lining several functions, without needing intermediate values. I don’t want to use the same identifier, as I want the code to be called many times without the side effects. # not OK: # df may…

Currying is the process of taking a function that accepts N arguments and turning it into a function that accepts N-K (N minus K) arguments, missing K arguments are fixed in the resulting function. It’s named after Haskell Curry. Basic example: Scala has a separate syntax to ease currying…

I used to think that variable names must be as long as possible to be expressive as much as possible. I’m beginning to realize that this thought has a flaw in it: more length does not always mean more meaning. And also I used to stick to a naming convention…

Recently I needed something like Clojure’s “for” in Python while trying to implement grid search for hyper parameter optimization. I couldn’t find something similar and I wanted to implement myself. Basically I wanted something like below, but of course with varying number of loops: If we build a graph using those lists, the desired output is all the possible ways down to the bottom. Here is a simple graph (or tree) node implementation:

Suppose that you’re writing a configuration file, and you need some kind of computation in it. If you were to use a scripting language, it would be fairly straightforward: just use a source file as configuration file and import. …

As I’m currently learning Clojure, trying to convert Processing examples into Clojure code, I thought that it would be nice to leverage Clojure’s REPL (Read-Eval-Print-Loop) to interact with the running app. Dynamically changing the runtime behavior — especially in such interactive programs — is a big plus. By the way… …