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
quotingGood evening goys, this us my little hobby project
nevent1q…vcpw
THE Continuum
Its a plain JS array that happens to persist to later sessions
constraints: NONE, it just continues to work
PREAMBLE:
why an array? cause obj's === gay, ever heard of a tool called "Sticky Notes"?!!
its a great tool that helps your app becoming faster and lighter while letting maintainers more ability to materialize all structs within the app, real talk you can just only use arrays/tuples for everything and record indices usages/types via TS and the glorious "Sticky Notes"
nevent1q…z2j7