-
- Crypt
- Symmetric
- [ ] Crypt.Cipher.ChaCha20 #74
- [ ] Crypt.Cipher.Camellia #23
- MAC
- [ ] Crypt.MAC.Poly1305 #74
- Password
- [ ] Crypt.Password.scrypt #72
- […
-
I've been looking at your code and noticed some improvements that can be made:
Replacing all divisions of factors of 2 by Shift Right operations.
Replacing all modulus operators of factors of 2 by b…
-
I haven't done much work on sorting lately, but figured to share some findings.
I looked into unstable sorting networks this week and haven't been able to reproduce the suggested performance gain. …
-
I created a file, `URLs.txt`, and tried to sort it with Schmekeriada and with ClickHouse using 4 threads for comparison.
The comparison ended up as follows:
```
milovidov@milovidov-desktop:~/wor…
-
I was trying to sort a 10 million element IntArrayList with a custom IntComparator - can it be that the sort method sortThis may be recursively implemented or something as I get a stack overflow?!
…
-
First off, sorry again to have jumped to conclusions on Hacker News. As a programming language guy I'm in the market for a stable sort and Fluxsort seems to have the fundamentals down!
I wanted to …
-
It probably an issue with my port, but in the main loop of `cross_merge`, what stops for example the entire right block being copied to the destination and then the tail pointer of the right block bei…
-
Recently I stumbled upon an utter need for stable sorting. Currently we use `sort( self: list, order: enum = $ascend, part = 0 ) => list` and `sort( self: list, part = 0 )[X: @T, Y: @T => int] => list…
-
Just a general question about the code here. Why is `QUAD_CACHE` only applied for gcc? Wouldn't you want to limit to fit in cache with clang as well? Does some sort of llvm optimization manage to work…
-
For integer arrays with a non-tiny range of values, we currently use a stable sort. It may be faster to use a radix sort instead.
**Reporter**: [Antoine Pitrou](https://issues.apache.org/jira/brows…