Functional Data Structures in Java

This course examines purely functional data structures implemented in Java 8, focusing on persistence, amortized performance, and how lazy evaluation affects efficiency. It compares these structures with built-in JDK data structures.

Syllabus

Intro
REVOLUTIONARY DEVELOPER TOOLS
WHAT DOES FUNCTIONAL MEAN?
MUTABLE DATA STRUCTURES
PERSISTENT DATA STRUCTURES
HOW TO PREPEND A LIST
HOW TO APPEND TO A LIST
ALGORITHMIC COMPLEXITY
AMORTIZED COMPLEXITY
BANKER'S METHOD
HOW TO BUILD A QUEUE
HOW TO TAIL A QUEUE
HOW TO PEEK
HOW TO DEQUEUE
ISN'T REVERSE EXPENSIVE?
HOW TO BUILD A MAP
UPDATING THE MAP
NORMAL TREES
BENCHMARKS
RESULTS (SAFE HARBOR)
Purely functional Data Structures