The Capsule Hash Trie Collections Library
Java
Latest commit 062f6bd Dec 31, 2016 @msteindorfer msteindorfer committed on GitHub Updating release version numbers in README.

README.md

The Capsule Hash Trie Collections Library

Capsule aims to become a full-fledged (immutable) collections library for Java 8+ (with backport to Java 7) that is solely built around persistent tries.

Capsule was recently extracted from the usethesource/rascal-value project and still has to undergo some incubation before it can ship as a well-rounded collection library. Nevertheless, the code is stable and performance is already solid. Feel free to use it and let us about your experiences!

More extensive tests and performance benchmarks will be added soon. The preliminary API for the immutable interfaces will be reworked as soon as possible as well.

Getting Started

Binary builds of capsule are deployed in the usethesource repository. In case you use Maven for dependency management, you have to add another repository location to your pom.xml file:

<repositories>
    <repository>
        <id>usethesource</id>
        <url>http://nexus.usethesource.io/content/repositories/public/</url>
    </repository>
</repositories>

Furthermore, you have to declare capsule as a dependency. To obtain the latest stable version for Java 8+, insert the following snippet in your pom.xml file:

<dependency>
    <groupId>io.usethesource</groupId>
    <artifactId>capsule</artifactId>
    <version>0.2.2</version>
</dependency>

To obtain the latest stable backport for Java 7 (that lags behind the Java 8+ release), insert the following snippet in your pom.xml file:

<dependency>
    <groupId>io.usethesource</groupId>
    <artifactId>capsule-jdk7</artifactId>
    <version>0.2.1</version>
</dependency>

Snippets for other build tools and dependency management systems may vary slightly.

Background: Efficient Immutable Data Structures on the JVM

The standard libraries of recent Java Virtual Machine languages, such as Clojure or Scala, contain scalable and well-performing immutable collection data structures that are implemented as Hash-Array Mapped Tries (HAMTs). HAMTs already feature efficient lookup, insert, and delete operations, however due to their tree-based nature their memory footprints and the runtime performance of iteration and equality checking lag behind array-based counterparts.

We introduce CHAMP (Compressed Hash-Array Mapped Prefix-tree), an evolutionary improvement over HAMTs. The new design increases the overall performance of immutable sets and maps. Furthermore, its resulting general purpose design increases cache locality and features a canonical representation.

References and Further Readings

Talks

Papers