Same way to write self referential structs - use index types into the whatever arena you are using. Indexes are usually 32 bit so they are a bit faster than pointers.
If you are building one off trees such as for parsing and ast transforms, bumpalo is your friend.
In your case, you can look into generational arenas and slabs which are useful for graphs.
Continuous profiling for Linux. It uses ebpf to sample running programs and unwinds the stack, then uploads to server so you know why it look 10 seconds to process that customer’s request last Christmas. :)
Currently supports x86-64 and ARM64
Contact: feel free to join the discord on the website
RawStr Notes solved a personal pain point with all the cloud-based notebook currently. Hopefully this could be of use to other software developers. Please let me know what you think. Thanks!
You are correct. It is indeed possible to use dynamic programming. For more info check out [0]. OP’s project probably takes too long on nontrivial merges in its current state.
That is IDE's job because images can just be embedded in markdown comments... Version controlling non-text comments seems to be an unsolved problem though.
Don’t dim screen on iPhone during conversation.
The tutor should terminate the lesson when its goals are achieved and do a warm handoff.
Overall it’s quite good.