Index

A

• arrays
  • used, for simulating call stack / Simulating a call stack using arrays, How to do it...
• autocomplete system
  • designing, trie used / Designing an autocomplete system using a trie, How to do it...

B

• B-trees
  • about / Introduction
  • used, for designing key-value store / Designing an efficient key-value store using B-trees, How to do it...
  • URL / Designing an efficient key-value store using B-trees
• ball-catcher game / Designing an HTML5 game, How to do it…
• branching
  • about / Resolving cost and profit optimization problems
• byte array
  • compressing / Efficiently compressing a byte array, How to do it...

C

• call stack
  • about / Simulating a call stack using arrays
  • simulating, arrays used / Simulating a call stack using arrays, How to do it...
• checkers board
  • designing / Playing a round of checkers, How to do it…
• concat node
  • about / Devising an undo-capable data structure using a rope
• concurrency
  • and parallelism, URL / Introduction
• content based recommenders
  • about / Designing a live recommendation engine
• context-free grammar (CFG)
  • about / How to do it...
• context-free grammars (CFG)
  • about / How to do it...
• continuation passing style
  • used, for building unification engine / Introduction, Building a little unification engine with the continuation-passing style, How to do it...
• core.async
  • about / Introduction
• costs and profits optimization problems
  • resolving / Introduction, Resolving cost and profit optimization problems, How to do it...

D

• Dijkstra algorithm
  • about / Finding optimal paths in a graph
• doubly linked XOR-list
  • building / Building a doubly linked XOR list, How to do it…
• dropping channel
  • about / Introduction

F

• fractals
  • drawing, Pascal's triangle used / Using Pascal's triangle to draw fractals, How to do it...
• functions
  • about / Introduction

G

• Go language
  • URL / Introduction
• graph
  • optimal path, searching / Introduction, Finding optimal paths in a graph, How to do it...

H

• Hindley-Milner
  • about / Designing a type inferencer
  • URL / Designing a type inferencer
• HTML5 game
  • designing / Introduction, Designing an HTML5 game, How to do it…

I

• Instaparse
  • URL / How to do it..., How to do it...
  • about / How to do it..., How to do it...
• inverse document frequency (IDF)
  • about / Summarizing texts by extracting the most representative sentences

K

• key-value store
  • designing, B-trees used / Designing an efficient key-value store using B-trees, How to do it...

L

• LexRank algorithm
  • about / Introduction
  • URL / Summarizing texts by extracting the most representative sentences
• linear programs
  • about / Resolving cost and profit optimization problems
• linked-list elements access
  • speeding-up / Speeding up access to linked list elements, How to do it…
• live recommendation engine
  • designing / Introduction, Designing a live recommendation engine, How to do it...
• logic programming
  • about / Introduction

M

• miniKanren
  • URL / Introduction
• multithreading
  • simulating, time-sharing used / Simulating multithreading using time-sharing, How to do it...

O

• objective function
  • about / Resolving cost and profit optimization problems
• online taxi-booking engine
  • designing / Introduction, Designing an online taxi-booking engine, How to do it…
• optimal path, graph
  • searching / Introduction, Finding optimal paths in a graph, How to do it...

P

• parsing theory
  • URL / Building a simple shift-reduce parser
• Pascal's triangle
  • used, for drawing fractals / Using Pascal's triangle to draw fractals, How to do it...

R

• recommendation engine
  • about / Introduction
• recursive descent parser
  • building, trampoline used / Introduction, Building a recursive descent parser using trampoline, How to do it…
• relational programming
  • about / Introduction
• reusable mini-firewall
  • implementing, transducers used / Introduction, Implementing a reusable mini-firewall using transducers, How to do it…
• rope
  • about / Introduction
  • used, for devising undo capable data structure / Devising an undo-capable data structure using a rope, How to do it...
  • reference link / Devising an undo-capable data structure using a rope
  • concat operation / Devising an undo-capable data structure using a rope
  • concat operation, URL / Devising an undo-capable data structure using a rope
  • splitting operation, URL / Devising an undo-capable data structure using a rope
  • splitting operation / Devising an undo-capable data structure using a rope
  • index, obtaining / Devising an undo-capable data structure using a rope
  • index, deleting / Devising an undo-capable data structure using a rope

S

• scheme
  • URL / Building a little unification engine with the continuation-passing style
• search efficient splay tree
  • building / Building self-balancing, search-efficient splay trees, How to do it...
• self-balancing splay tree
  • building / Building self-balancing, search-efficient splay trees, How to do it...
• shift-reduce parser
  • about / Building a simple shift-reduce parser
  • shifting action / Building a simple shift-reduce parser
  • reducing action / Building a simple shift-reduce parser
  • building / Building a simple shift-reduce parser, How to do it…
• short node
  • about / Devising an undo-capable data structure using a rope
• Sierpinski triangle
  • about / Using Pascal's triangle to draw fractals
• skew binary random access list
  • implementing / Implementing a skew binary random access list, How to do it…
• social website data
  • querying / Querying a social website's data, How to do it…
• splay trees
  • about / Building self-balancing, search-efficient splay trees
  • zig step / Building self-balancing, search-efficient splay trees
  • zig step, URL / Building self-balancing, search-efficient splay trees
  • zig-zig step / Building self-balancing, search-efficient splay trees
  • zig-zig step, URL / Building self-balancing, search-efficient splay trees
  • zig-zag step / Building self-balancing, search-efficient splay trees
  • zig-zag step, URL / Building self-balancing, search-efficient splay trees

T

• term frequency (TF)
  • about / Summarizing texts by extracting the most representative sentences
• term frequency inverse document frequency (TF-IDF)
  • about / Summarizing texts by extracting the most representative sentences
• text summarization
  • performing / Introduction, Summarizing texts by extracting the most representative sentences, How to do it...
• time-sharing
  • used, for simulating multithreading / Simulating multithreading using time-sharing, How to do it...
• tiny web crawler
  • building / Introduction, Building a tiny web crawler, How to do it…
• trampoline
  • used, for building recursive descent parser / Introduction, Building a recursive descent parser using trampoline, How to do it…
• transducers
  • used, for implementing reusable mini-firewall / Introduction, Implementing a reusable mini-firewall using transducers, How to do it…
• trie
  • about / Introduction
  • used, for designing autocomplete system / Designing an autocomplete system using a trie, How to do it...
  • reference link / Designing an autocomplete system using a trie
• type inferencer
  • designing / Designing a type inferencer, How to do it…

U

• undo capable data structure
  • devising, rope used / Devising an undo-capable data structure using a rope, How to do it...
• unification
  • URL / Building a little unification engine with the continuation-passing style
• unification engine
  • building, continuation passing style used / Introduction, Building a little unification engine with the continuation-passing style, How to do it...