Erik Grinaker
Erik Grinaker
By default, toyDB uses an on-disk Raft log for persistence and an in-memory B+tree key-value store for SQL state data. It might be interesting to build an on-disk B+tree key-value...
Iterators are currently rather hacky and inefficient, and e.g. use O(log n) lookups per next() call (B+tree and MVCC) or buffer all results (Raft and SQL engines). Ideally, iterators should...
I suspect it may not be safe to modify a key domain while an iterator exists over it - there's currently no documentation on this, but we should look into...
Tests are showing a data race - probably just an issue with the tests themselves: https://github.com/cosmos/iavl/pull/288/checks?check_run_id=830795228
The recommended way to configure an individual Litter instance is via an `Options` struct literal, e.g: ```go sq := litter.Options { HidePrivateFields: true, HomePackage: "thispack", Separator: " ", } sq.Dump("dumped",...
Consider the example given in the README: ```go type Circular struct { Self *Circular } selfref := Circular{} selfref.Self = &selfref ``` This produces the following output: ```go main.Circular{ Self:...
Fast sync should use the light client for block verification.
This patch adds an initial implementation of DistSender replica circuit breakers. Their primary purpose is to prevent the DistSender getting stuck on non-functional replicas. In particular, the DistSender relies on...