This is part two of a three part series examining the different ways Postgres can fetch rows from a table.
Usually a sequential scan winds up being pretty slow. A sequential scan needs to read the entire table in order … Read the rest
Postgres Sequential Scans
This is part one of a three part series on the main ways Postgres has of fetching rows from a table.
Of the three main ways Postgres has fetching rows from a table, a sequential scan is the most basic. … Read the rest
Building Fizzbuzz in Fractran from the Bottom Up
In this post, I am going to show you how to write Fizzbuzz in the programming language Fractran. If you dont know, Fractran is an esoteric programming language. That means it is extraordinary difficult to write any program in Fractran. … Read the rest
How to Generate Self-Referential Programs
In this post, I am going to show you how to write programs that are self-referential. By self-referential, I mean programs which are able to obtain their own source code without any external input. In other words, they won’t just … Read the rest
Loops in Lisp Part 4: Series
This is part four of Loops in Lisp. Follow one of the following links for part one – goto, two – loop, or three – iterate).
One of the many advantages of programming in a functional style … Read the rest
Loops in Lisp Part 3: Iterate
This is part 3 of Loops in Lisp. For part 1 on how you can build any kind of looping construct you want out of just goto and macros, click here. For part 2 on Loop, click here.… Read the rest
Loops in Lisp Part 2: Loop
This is part 2 of Loops in Lisp. Click here to view the previous post on how you can build any iteration abstraction you want out of just goto and macros.
The loop macro is probably the most well known … Read the rest
Loops in Lisp Part 1: Goto
At its core, Common Lisp provides two primitives for performing iteration. The first of those primitives is recursion. Recursion is an amazing technique, but in this post I am going to focus on the other primitive goto.
Goto is extremely … Read the rest
Defmemo
In my last post I talked about memoization i.e. caching the results of a function. Memoization is a fairly common technique for optimization. It is common enough to warrant writing a macro that makes it easy to define memoized functions. … Read the rest
Or=
This post makes use of places. If you are unfamiliar with places, see my post Getting Places.
There are many cases where caching the results of a function (also called memoization), make a function much more efficient. For example … Read the rest