Java data structures for primitive and/or Object items
-
Updated
Nov 20, 2026 - Java
Java data structures for primitive and/or Object items
A implementation of a Java-like Set data structure for PHP. A Set allows storage of any value without duplicates which can be iterated in insertion order.
Java 25 helpers for collections: lists that stay unique or sorted, sets that keep their order or an index, factories and utilities for lists, sets, maps and arrays, sorted and indexed Properties, iterators over arrays. Coverage and mutation thresholds enforced in CI, mutation tested with PIT, reproducible builds on Maven Central.
Like HashSet but retaining INSERTION order and without `Hash` requirement on the Element type.
Integer-keyed hash map that preserves insertion order: compact dictionary design, Fibonacci hashing, 64-bit keys and values on every build, and lookups several times faster than PureBasic's built-in Map.
Google Apps Script that turns rows of insertion order data in a Google Sheet into formatted one-page PDFs saved to Drive.
To associate your repository with the insertion-order topic, visit your repo's landing page and select "manage topics."