<br><br><div class="gmail_quote">2010/2/5 Laurent <span dir="ltr"><<a href="mailto:laurent.orseau@gmail.com">laurent.orseau@gmail.com</a>></span><br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
Does something like this sounds interesting and generalizable for infinite sets?<br>Mixing hashes on finite sets for speed and recurrence for infinite sets in the default case (trivial example):<br><br><span style="font-family: courier new,monospace;">(define h (make-hash))</span><br style="font-family: courier new,monospace;">
<br style="font-family: courier new,monospace;"><span style="font-family: courier new,monospace;">(for-each (ë(n)(hash-set! h n #t))</span><br style="font-family: courier new,monospace;"><span style="font-family: courier new,monospace;"> '(0 2 4 6 8)) ; could be a lot larger of course</span><br style="font-family: courier new,monospace;">
<br style="font-family: courier new,monospace;"><span style="font-family: courier new,monospace;">(define (odd? n)</span><br style="font-family: courier new,monospace;"></blockquote><div>[...] <br></div><div><br>This is odd... Is it even possible to make so many mistakes in one day??<br>
<br> </div><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"><span style="font-family: courier new,monospace;"> [...]</span><br style="font-family: courier new,monospace;">
<span style="font-family: courier new,monospace;">> (even? 9876)<br>#t<br>> (even? 9877)<br>#f</span><br></blockquote></div><br>