No I wanted to say that you create a linearisation of the search and apply tourtouse hare on that. One can make that linearisation fast for list traversals but expensive for deep trees. To note here is that if we had one bit to spare for every cons representation we could do use that bit to mark conses as been touched and abort the ordinary equal if we find a mark. For x86-64 we have one such bit available which is cool. My sugestion is to implemen those two versions and we well then not see a performans degradation unless on 32bit platforms with treelike structures
Stefan Den 3 sep 2012 00:08 skrev "Ludovic Courtès" <l...@gnu.org>: > > Hi, > > Stefan Israelsson Tampe <stefan.ita...@gmail.com> skribis: > > > The cycle detection for a tree would probably look something like, > > Tortoise-and-hare would have to be applied to arbitrary data structures, AIUI. > > Ludo’. > >
