<div dir="ltr">On Tue, Jun 18, 2013 at 3:21 PM, Dan Liebgold <span dir="ltr"><<a href="mailto:dan.liebgold@gmail.com" target="_blank">dan.liebgold@gmail.com</a>></span> wrote:<br><div class="gmail_extra"><div class="gmail_quote">
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">According to the docs, hash->list returns a list in an unspecified order. Can anyone tell me a little about how hash->list might return two different orders give the same hash table? Possibly across different invocations of Racket?<br clear="all">
<div><br></div><div>Thanks,</div><span class="HOEnZb"><font color="#888888">-- <br>Dan Liebgold [<a href="mailto:dan.liebgold@gmail.com" target="_blank">dan.liebgold@gmail.com</a>]
</font></span></div></blockquote><br></div>Different invocations of Racket could do it; for instance, eq-hash-code assigns hash codes sequentially to objects on demand, so if objects were hashed in a different order nondeterministically, they would be put in a table in a different order. Adding or removing elements via mutation might also cause a table to be resized, and that might shuffle around the existing/remaining elements and cause them to be in a different order.<br>
<br></div><div class="gmail_extra">--Carl<br></div></div>