Hello, question:
Why is the equality predicate not stable?

Please look at the attached code. This was a quick throw-together from
my recollection of an implementation of disjoint sets I did several
years ago (I didn't even start looking for the code yet), but a quick
test showed that it has stable equality and no need for find, _provided_
that the values being passed to ubox are orderable. (It should be
possible to trivially modify it to not require this, but this is my
recollection, as stated.)

(I did not yet look at the sample implementation, apologies.)

-elf

On Sun, 6 Jan 2019, Arthur A. Gleckler wrote:

> Date: Sun, 6 Jan 2019 20:25:42
> From: Arthur A. Gleckler <xxxxxx@speechcode.com>
> To: xxxxxx@srfi.schemers.org
> Subject: Last call for comments on SRFI 161: Unifiable Boxes
>
> Marc Nieper-Wißkirchen, author of SRFI 161, Unifiable Boxes, has asked me
> to announce "last call" for this SRFI.  He believes that it is ready for
> finalization, but would like to give reviewers one last chance to submit
> corrections and feedback before we finalize it.
>
>  https://srfi.schemers.org/srfi-161
>
> In particular, I appeal to anyone reading this to try the sample
> implementation, run the tests, and send feedback about your results.
>
> If you're interested in this SRFI, please give your feedback via the SRFI
> 161 mailing list before 2019/1/14.  After that, assuming that no major
> revisions are required, we will declare it final.
>
> Regards,
>
>
> SRFI Editor
>