Bouncy GPG 2.2.0 released
bouncy-gpg 2.2.0, now with key generation
After more than one year of (slow..) development I am happy to announce the release of bouncy-gpg 2.2.0.
Random Ramblings about Life, the Universe, and Everything
This & That
coding
Testing the compatibility of gpg and bouncy-gpg
For bouncy-gpg I needed to assert compatibility with gnupg. This means a lot of shelling out gpg.
Driving an external program from java and parsing its output is seldom needed. When it is needed, in often means: no stable API (changes in command output), configuration files, sporadic errors, and orchestrating parallel execution. To test the compatibility with gpg I needed to drive the GnuPG executable.
LeetCode #746 : Min cost climbing stairs
60 ms, faster than 44.27%
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
LeetCode #931. Minimum Falling Path Sum
132 ms, faster than 38.27%
Given a square array of integers A, we want the minimum sum of a falling path through A.
LeetCode #8 : String to Integer (atoi)
Solution in python3: 28 ms, faster than 93.82% (plus python profiling)
This problem is quite simple and does not allow for many algorithmic improvements. In fact it would be difficult to come up with a non-optimal (bigger than \(O(n)\)) solution. This makes this problem a good candidate for benchmarking.