A utility class that writes to a temporary file and atomically renames it to the target path, ensuring no partial writes are visible. It also tracks open file handles to detect resource leaks, making it a robust, self-contained component for safe file I/O in any Java application.

Implements consistent hashing with virtual nodes for load distribution. It is a generic, well-tested data structure that can be extracted and reused in any project requiring distributed key-to-node mapping with minimal remapping on topology changes.

A generic algorithm for detecting cycles in directed graphs using topological sort. It is self-contained, parameterized by node type, and can be reused in any Java project that needs to validate acyclic dependencies (e.g., plugin dependency resolution, build pipeline ordering).

A clean, efficient implementation of the Levenshtein distance algorithm for measuring string similarity. It is a standalone utility with no internal dependencies, suitable for reuse in any application requiring fuzzy matching or spell-checking.

Implements Tarjan's algorithm for finding strongly connected components in a directed graph. It is a generic, well-documented data structure that can be extracted and used in any Java project needing graph analysis, such as dependency resolution or deadlock detection.