
1
Offers deque implementations with features like element popping, peeking, and pushing. Supports non-destructive iteration and provides various deque types with utility methods.
0
Offers a heap implementation supporting min/max heaps, custom item types, and configurable parameters like capacity and scaling, ensuring efficient data organization and retrieval.
0
Pure FIFO queue implementation supports creation from varargs, collections, and custom configurations. Features include appending, retrieving, iterating, and array operations like `copyToArray` and `flushToArray`.
0
Implements a versatile stack data structure with various initialization methods, allowing element addition, removal, and both destructive and non-destructive iteration.
0
Implements arbitrary-precision arithmetic with a BigInt type, mirroring Java's BigInteger. Supports construction from various types and includes operations like addition, subtraction, bitwise manipulation, and more.
0
Defines a `Closeable` interface for implementing resource management and cleanup operations, ensuring efficient handling of resources with a simple override method for closing.
0
Defines basic interfaces for low-level input and output byte streams, intended to be implemented in platform-specific code, facilitating streamlined data processing.
0
Streamlines library development by providing a boilerplate-free repository template, facilitating easy setup and integration for multi-platform projects.
0
Offers UByte constants for the ASCII character set, aiding in low-level parser implementation with functionalities for checking whitespace, tabs, and hexadecimal digits.