49
What did you invent? (sopuli.xyz)
submitted 1 year ago by to c/asklemmy@lemmy.ml
52 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] 19 points 1 year ago (5 children)

A new data structure in computer programming. I got the idea from cell chemistry, and figured computers today can handle slow and inefficient, instead of fast and clever. Turns out it’s also great for networking.

  • permalink
  • fedilink
  • source
  • hideshow 5 child comments
    •
  • [–] 9 points 1 year ago (3 children)

    👀 explain more!

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 3 child comments
    •
  • [–] 6 points 1 year ago (2 children)

    It’s a personal project I’ve been working on.

    Basically the data is moved around by things very slowly. It’s easy to integrate them into different systems. It’s like a very slow communication layer on top of everything else.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 5 points 1 year ago (1 child)

    Any chance there is a repo for it? 🤩

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 1 child comment
    •
  • [–] 4 points 1 year ago

    Thanks 😊. Several, but still in development.

    I’ve been working on this for some now; I’ll be talking about this more when I finish all the api.

    the open-api inbound calls and db have been done for months. But it’s not a complete implementation in the code. However the spec was done a couple years ago and it has not changed, which means I’m probably going to keep that one.

    I’m working on a testing platform where people can log in and try the library. I’m using that to test and finish.

    Once I have actually finished, it will be public under the apache2 license. I’ll save this comment and let you know in a new community I will make in .ml for it

  • permalink
  • fedilink
  • source
  • parent
  • [–] 4 points 1 year ago

    I actually do think I’ve invented a data structure for interleaving multiple streams in a single file in a really efficient way. I can’t find something that looks like it, and it seems obviously faster and more logical than anything else I’ve seen. It’s the level below B-trees so not optimised for least amount of lookups within a record table, nor would it be efficient for adding records in a middle of the stream, but for treating data streams like files (append, shrink) I do think it’s significantly more efficient than what else I can find. One of these days I really should submit a paper and see what reviewers say.

  • permalink
  • fedilink
  • source
  • parent