Unofficial version, in Java, of Hashids v1.0.2, by Ivan Akimov.
There's already a Java version of Hashids, but my version is faster and lighter. I made some benchmarking with JBenchX, you can see the results below, using a method like this one, running for(int i = 0; i <= x; i++), encoding and decoding i:
@Bench
public void benchmark(@ForEachInt({100,1000,10000,100000}) int x){
for(int i = 0; i <= x; i++){
this.decode(this.encode(i));
}
}
-
Benchmarks:
-
1. where x = 100: (101 elements)
-
2. where x = 1000: (1001 elements)
-
3. where x = 10000: (10001 elements)
-
4. where x = 100000: (100001 elements)
-
