HNHacker News
TopNewBestAskShowJobs

probablyfine

119 karma · joined April 14, 2015

submissionscomments
probablyfine··on High in the Cascades, a lone fire lookout still keeps watch
You play as a fire lookout in the "walking simulator" Firewatch (https://www.firewatchgame.com/)
probablyfine··on Byte-Monkey: Fault injection for the JVM
Pausing within a synchronized block to exaggerate slowdown sounds really interesting - and would provide a great opportunity to learn about how locking works "under the hood" :)
probablyfine··on Byte-Monkey: Fault injection for the JVM
Author here - the project did originally just have fault and latency modes, and the last one came out of discussions with a colleague about other failures that might be interesting.

I'm looking for more failure modes to add, so if you can think of any more send them my way!

probablyfine··on Show HN: A fast append-only data store for Java 8
No, that's likely a leftover from refactoring. Good spot.
probablyfine··on Show HN: A fast append-only data store for Java 8
I've used it as the backing for a time-series database and to store deltas for a state-machine - in both situations I wanted something that understood "POJOs" and didn't require a lot of setup.

Even in the case of multiple non-unique entries, if the stored objects are not meant to be mutable, the API exposes .reverse() to find the most recent.

probablyfine··on Show HN: A fast append-only data store for Java 8
Hi, glad you like it.

1. Under the hood it partitions the log into sections to avoid Java's MappedByteBuffer size-limit. I've not tried to deliberately push the file-size limit yet, but it's something to add to the benchmarks when I publish them (soon!)

2. It doesn't support primitive arrays as of 1.4, but this is something that I have considered in future versions. Pull requests are definitely welcome.

3. I've not tested these failure cases yet.