Persistent Data Structure

Purely Functional Implementation in Java (Persistent Data Structure)

The library includes immutable collections, like stack, queue, deque, vector/array, and priority queue

Features

• Efficient operation in real time
• Efficient memory management

Example

See more detail at wiki page.

• Stack
• Queue:
  • Implementation option: Realtime (Default), Prev-Evaluation
• Deque (Double-Ended Queue):
  • Implementation option: Realtime (Default), Prev-Evaluation
• Array (Vector, List)
  • Implementation option: Balanced Tree (Default), Braun Tree
• Priority Queue
  • Implementation option: Braun Tree

Implementation Note

Coming soon

Related Repository

• mikea/concrete
• functionaljava/functionaljava

Reference Reading

Partial resouce uploaded in folder /reference

• REAL-TIME QUEUE OPERATIONS IN PURE LISP, Robert HOOD and Robert MEVILL, 1981
• REAL-TIME DEQUES, MULTIHEAD TURING MACHINES and PURELY FUNCTIONAL PROGRAMMING, Tyng-Runey Chuang and Benjamin Goldberg, 1993
• SIMPLE AND EFFICIENT PURELY FUNCTIONAL QUEUES AND DEQUES, Chris Okasaki, 1995
• LEAF TREES, Kaldewaij, A., & Dielissen, V. J., 1996