finally done with sketching the persistence backbone structure for the Continuum
results:
-50 million items
-maximum depth of 10 on a buffer limit of also 10 (max items/node)
-0 orphans
-the whole insertion method is only 65 lines of code
this total satisfaction
ok goys, lets continue
NOW THE THING WITH ALL WEB DEV is the total dependent on back-end servers to reach for all longs sequences of data
so to be able to escape that web dev needs a primitive to do the back-end job inside the client and that implies dependable persistent sorted arrays
so i've been building a trie structure (not a tree) that enables O(n) positional access for stored arrays that works with arrays of unlimited lengths (disk size is the limit)
**positional access: is arr[number]
process is streamed on https://www.twitch.tv/plebincommand
View quoted note →
View quoted note →