Book Image

Clojure Data Structures and Algorithms Cookbook

By : Rafik Naccache
Book Image

Clojure Data Structures and Algorithms Cookbook

By: Rafik Naccache

Overview of this book

Related Content you might be interested in

Current Title:

Small book image
Clojure Data Structures and Algorithms Cookbook
Rafik Naccache
Aug, 2015 | 216 pages
No titles found
Table of Contents (14 chapters)
Clojure Data Structures and Algorithms Cookbook
Clojure Data Structures and Algorithms Cookbook
Credits
Credits
About the Author
About the Author
About the Reviewers
About the Reviewers
www.PacktPub.com
www.PacktPub.com
Preface
Preface
Free Chapter
1
Revisiting Arrays
Revisiting Arrays
Introduction
Efficiently compressing a byte array
Using Pascal's triangle to draw fractals
Simulating multithreading using time-sharing
Simulating a call stack using arrays
2
Alternative Linked Lists
Alternative Linked Lists
Building a doubly linked XOR list
Speeding up access to linked list elements
Building a simple shift-reduce parser
Implementing a skew binary random access list
3
Walking Down Forests of Data
Walking Down Forests of Data
Introduction
Building self-balancing, search-efficient splay trees
Designing an efficient key-value store using B-trees
Devising an undo-capable data structure using a rope
Designing an autocomplete system using a trie
4
Making Decisions with the Help of Science
Making Decisions with the Help of Science
Introduction
Designing a live recommendation engine
Resolving cost and profit optimization problems
Finding optimal paths in a graph
Summarizing texts by extracting the most representative sentences
5
Programming with Logic
Programming with Logic
Introduction
Querying a social website's data
Designing a type inferencer
Playing a round of checkers
6
Sharing by Communicating
Sharing by Communicating
Introduction
Building a tiny web crawler
Designing an HTML5 game
Designing an online taxi-booking engine
7
Transformations as First-class Citizens
Transformations as First-class Citizens
Introduction
Building a recursive descent parser using trampoline
Implementing a reusable mini-firewall using transducers
Building a little unification engine with the continuation-passing style
Index
Index

Chapter 3. Walking Down Forests of Data

In this chapter, we will focus on trees. We will cover the following recipes:

  • Building self-balancing and search-efficient splay trees

  • Designing an efficient key-value store using B-trees

  • Devising an undo-capable data structure using a rope

  • Designing an autocomplete system using a trie

Previous Section
End of Section 1
Next Section