like bytewise, except as strings.
codec for js values (including arrays) that preserves lexiographic sort order when encoded. (the order is compatible with bytewise and thus indexeddb and couchdb, but the encoded format is different)
for building indexes on top of leveldb, bytewise is great! it lets you structure you keys and reason about how they will be ordered in a very simple and reliable way.
But bytewise is too slow! it's slow enough to have quite visible effects on a bulk load on a reasonable sized database with a couple of indexes. (i.e. 100k secure-scuttlebutt messages with indexes, measured by bench-ssb)
Expect breaking changes to encoded format. We are still making breaking changes if necessary to improve performance.
(although, codec api is fully stable and will not change)
run a simple benchmark for one second, encoding & decoding ops in one second.
# name, ops, multiplier bytewise encode 35661 charwise encode 131366 x3.6 bytewise decode 107571 charwise decode 144557 x1.3
It was easy to make charwise faster than bytewise when it was only a partial implementation, but once correct escaping and nested arrays where added it got slow.
But then @PaulBlanche had the genious idea of encoding items in an array with their depth inside the array. This supports deeply nested arrays or shallowly nested arrays with only one pass escaping the items. This made encoding much faster again!