JNanoID generates compact IDs with just 21 characters. By using a larger alphabet than UUID, JNanoID can generate a greater number of unique IDs, when compared to UUID, with fewer characters (21 ...

This Library contains different implementations of the tree data structures, such as K-ary, binary, expression trees etc. A tree data structure can be defined recursively (locally) as a collection of ...