Le mardi 13 septembre 2016 16:30:39 UTC+2, Robby Findler a écrit : > http://www.cs.indiana.edu/~dyb/pubs/equal.pdf
Thanks a lot for the reference, I was looking for that. If I understand well, equal? first tries a fast algorithm which does not take cycles into account, and after a certain level of recursion, it switches to a slower algorithm which checks for the presence of cycles (and it then alternates between these two algorithms, so long as there are no cycles). I'm therefore guessing the default value for k₀ must be about 25 for Racket's implementation. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
