std attempt like 4 idk

[crazymonkyyy]

I think the logic should go basic datastructures, file io, sreaching ranges then and only then functional programming

Skiping io confused my searching algorithms attempts, io has the most requirements on how data structures work( given that c libs have strong and wrong opinions)
once you have all the data, then you can be clever combining it in the functional style I like but usually had to fill my arrays manually

[adamdruppe]

this is part of what im so slowly doing with arsd.core lol

[crazymonkyyy]

I didnt see your file io using a datastructure api
propagating commas: "basic datastructures then and only then file io then and only then sreaching ranges then and only then functional programming"

[crazymonkyyy]

hot take, allocators are bad basic array prototypes

[adamdruppe]

basic datastructures = arrays, assoc arrays, linked lists......... all built into the language. done lol

[crazymonkyyy]

you need some glue to improve flexiblity

struct que(T,int N=-1){
  static if(N==-1){
    T[] data;
  } else {
    T[N] data;
  }
  ...

and suddenly your datastructure is optionally nogc or gc managed

idk im fuzzy on how all the kinds of io work, maybe I need to try web whatevers to see what they do for a bit