cheme
cheme
Switched to "In Progress", as I will also integrate proposed changes from https://github.com/w3f/PPPs/pull/5 (prefix range query, restart and possibly ordering of keys).
Will open a new one with things for https://github.com/w3f/PPPs/pull/5
Please don't review yet (will change design a bit to be closest to https://github.com/paritytech/polkadot-sdk/issues/30)
> So this applies to all appendable storage structus? yes all storage item containing a value. But as I did comment a bit in the code, using a same key...
I think I did align with https://github.com/paritytech/polkadot-sdk/issues/30 , should be reviewable (requires more test, especially since most test access on every transaction change and thus render the data).
> If this works out, then we maybe dont need paritytech/substrate#14120 I really think storing big value is a mistake so at some point paged list really make sense. (ability...
For events we should use transient storage (only write root of an event trie in state and still index data in an external db), but this is probably not here...
I went through a bit of fuzzing and fix a few issue, think this would be good to review now.
Hi, thanks for looking and updating, I am currently trying to implement a generic library for implementing some "distributed table" (not only hash table), and I use for peer and...
I can reopen (I got the button). I was just thinking of the work to review in comparison to the benefits.