[racket] ordering for hash tables?

If I have two hash tables, both with the same set of keys, but with different values for those keys, then can I count on the order being the same for both hash-tables?

I noticed this: https://github.com/plt/racket/commit/abe1233734b3a8d46f96707cc3a2517340cb28a3 saying:
make hash-table order invertible at build time
For detecting and debugging accidental dependencies on hash-table
order, it might be helpful to invert the order at the lowest level. 
Does this mean I shouldn’t count on the order being the same?  How does this work?

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20150221/9d66ca36/attachment.html>