Does anyone have a racket implementation of discrimination trees or some other <https://en.wikipedia.org/wiki/Term_indexing|term indexing> technique?

Maybe I can get away with the trie implementation in immutable hashes

What does datalog do?

I don’t see any mention of a particular data structure for term indexing, but it seems to be using immutable hashes in places—but the code isn’t documented so it’s a little difficult to say for sure.

[Datalog is probably not meant to be particularly optimized]

neither discrimination trees or any other listed on the term indexing page appear in https://xlinux.nist.gov/dads/

These are specific algorithms for logic

racket’s immutable hash won’t do it either, I’ll need to implement it, it seems :confused:

Is there a workaround to get this kind of finalization to work in 7.8CS ?

I haven’t yet investigated (still working on other changes), but offhand, it doesn’t look promising.

Thanks for taking a look! Should I open an issue for this?

was this an issue with the unsafe-provide that’s already there in plot (in which case I made a mistake when I added them) or something new you’re doing?

Yes, that would be good.

https://github.com/racket/racket/issues/3352

is there a version of (empty-scene) in 2htdp image that doesn’t create a black outline? i cant seem to find the parameters to disable it

ahh kk, think i just create a rectangle instead

how does one get the zen of lisp?