janet VS immer

You might be looking for: https://janet-lang.org/

It comes with a build tool `jpm` which installs dependencies globally by default, but you can have it be installed in your project folder as well.

I like Clojure, but I never had any good opportunities to use it other than for a few small hobby projects. It is unfortunate that it is so huge with tons of dependencies and no simpler native implementation. I started looking at various LISPs and Schemes to find something lighter to use instead and ended up settling for Janet that I think is Clojure-like enough to be comfortable to use, but in a small native binary with no dependencies and can be embedded in other native programs. I am sure for big, real, projects that Clojure makes more sense, but for my hobby projects and scripts I do not think I will install it again. I am still happy for the things I learned from learning Clojure. It was a real eye-opener for an old OO-programmer.

https://janet-lang.org/

One might also check out Janet for quick scripting tasks.

https://janet-lang.org

Thanks!

I thought about another multiplatform, homoiconic, highly compact language: https://janet-lang.org/ (takes 803 kb on my machine).

It has no types though.

Racket is great, and if you like it you might find Rash interesting:

https://rash-lang.org/

Janet and Gerbil Scheme are also worth a look:

https://janet-lang.org/

https://cons.io/

Point here is that, for instance Janet language does not have cons / pair type but tuple (and so is lispoid, not lisp), but clearly this is sufficient for macros & hence seamless language construction: all you need is to be a lispoid although being a lisp gives another useful feature.

If this project interests you but is a bit more minimal than you need, the Janet language is a slightly-less but still pretty lightweight embeddable Lisp with a strong library and community: https://janet-lang.org/

I've been working on an editor (not text) in C++ and pretty early got into undo/redo. I went down the route of doIt/undoIt for commands but that quickly got old. There was both the extra work needed to implement undo separately for every operation, but also the nagging feeling that the undo operation for some operation wasn't implemented correctly.

In the end, I switched to representing the entire document state using persistent data structures (using the immer library). This vastly simplified things and implementing undo/redo becomes absolutely trivial when using persistent data structures. It's probably not something that is suitable for all domains, but worth checking out.

https://github.com/arximboldi/immer

How does this compare to https://github.com/arximboldi/immer (other than the C/C++ difference)?

Also, it's my understanding that, in practice, persistent data structures require a garbage collector in order to handle deallocation when used in a general-purpose way. How does your implementation handle that?

You might be interested in ewig and immer by Juan Pedro Bolivar Puente:

https://github.com/arximboldi/ewig

https://github.com/arximboldi/immer

See the author instantly opening a ~1GB text file with async loading, paging through, copying/pasting, and undoing/redoing in their prototype “ewig” text editor about 27 minutes into their talk here:

https://m.youtube.com/watch?v=sPhpelUfu8Q

It’s backed by a “vector of vectors” data structure called a relaxed radix balanced tree:

https://infoscience.epfl.ch/record/169879/files/RMTrees.pdf

That original paper has seen lots of attention and attempts at performance improvements, such as:

https://hypirion.com/musings/thesis

https://github.com/hyPiRion/c-rrb

You’re absolutely right, however people have been putting in the “extra efforts” required for efficiency. Check out immer if you’re interested.

The C++ immer library: https://github.com/arximboldi/immer

For C++ check this one out - https://github.com/arximboldi/immer

Yeah I agree that I should link that wikipedia page in the docs, I'll do that as soon as I get a chance. immer (https://github.com/arximboldi/immer) also links that page in its docs, for the exact same reason I'm sure. Interestingly, there is a lot of overlap between persistent data structures in the functional programming sense and persistent data structures in the persisted-to-disk sense because persistent data structures in the FP sense are one of the best ways to guarantee atomic updates and safe failure recovery in a persisted-to-disk system! Btrfs and ZFS, as well as many databases, are at their core basically just copy-on-write B+ trees.

I’ve never tried it, but I love the idea of implementing editor scene state using immutable data structures like https://github.com/arximboldi/immer With that, every edit would append a new node to a list of scene states. Undo/redo becomes iterating your view of the scene up and down through that list. Can’t screw up an undo function if there’s never any work to do :P

I have! I think it's related to the C++ immer library which I used several years ago in Vortex. It's kinda like the previous generation of ValueScript. 🍻