Limin Fu

> 师兄好，我是2000级复旦生科的。wyhash是小弟开发的。 ^_^ 你好，不错:thumbsup:

> Well, this can be (and shall be IMHO) easily ensured in the serialization/deserialization routines from the Dao standard library before/after sending/receiving it over network. It is not about sending...

> I must be still overlooking something You indeed overlooked something: for-in iteration over hash map😄.

> So what is the hidden secret I'm missing? Ok, maybe you are unaware that Dao hash map is an unordered associative array. If a hash map has multiple keys,...

> Oh yeah, thanks for explanation. I must say I didn't see anywhere in Dao doc, that hash maps are ordered and that they're even deterministically iterable and that the...

Just checked, Lua and the game engine I am using uses endianness-neutral hash functions for hash map. I haven't look into other languages, I think many of them are also...

> deterministic ordering leads to your insecure hashmaps. secure hashmaps need to be fully indeterministic, randomly ordered and randomly seeded. Any language which provide ordered iterations are either slow or...

> this is how slicing works in most other languages supporting it Not necessarily. See: https://en.wikipedia.org/wiki/Array_slicing. > It is less intuitive if you've never seen slicing before, but more natural...

> but currently slicing in Dao virtually always takes form of x[n : m - 1] It depends on how you understand slicing, for me: it is a pair of...

> The actual code doesn't depend on understanding: its expr1[expr2 : expr3 - 1] in roughly 95% of cases. Here you are assuming `expr3` will most often produce the index...