List of Listings

Chapter 1. Clojure philosophy

Listing 1.1. Function that solves math equations, evaluated right to left

Listing 1.2. Function that solves math equations, evaluated left to right

Listing 1.3. Function that changes evaluation order depending on operation weights

Listing 1.4. Polymorphic Concatenatable protocol

Listing 1.5. Simple chessboard representation in Clojure

Listing 1.6. Querying the squares of a chessboard

Listing 1.7. Using block-level encapsulation

Listing 1.8. Local encapsulation

Chapter 4. On scalars

Listing 4.1. Using a keyword as a function directive

Chapter 5. Collection types

Listing 5.1. Function for finding the neighbors of a spot on a 2D matrix

Listing 5.2. First cut of the position function

Listing 5.3. Final version of pos

Chapter 6. Being lazy and set in your ways

Listing 6.1. Short-circuiting if expression

Listing 6.2. Using lazy-seq to avoid stack overflows

Listing 6.3. Infinite sequences fostering declarative solutions

Listing 6.4. Lazy, tail-recursive, incremental quicksort

Chapter 7. Functional programming

Listing 7.1. Function to recursively convert units of measure

Listing 7.2. Using mutually recursive functions to implement a finite state machine

Listing 7.3. Function to estimate the straight-line remaining path cost

Listing 7.4. Function to calculate the cost of the path traversed so far

Listing 7.5. Function to calculate the estimated total cost of the path

Listing 7.6. Function to retrieve the minimum value based on a criteria function