News for hackers. Stuff that matters.
Re:The dangers of streaming across versions of glibc: A caut... by oconnor663 on Tuesday January 08, 2019 @11:42AM (#18856889)
> I used the Windows comparison functions to figure out how to compare the keys, in order to handle case insensitive lookup IIRC.

Wouldn't you need to do case normalization before hashing, to make that work?

Re:The dangers of streaming across versions of glibc: A caut... by jandrese on Wednesday January 09, 2019 @02:15AM (#18862911)
Case normalization is it's own minefield in Unicode.

This article discusses some of the challenges: https://stackoverflow.com/questions/6162484/why-does-modern-...

In the first section points 16, 22, and 23 are relevant, in the second section look at points 8, 9, 10, 11, 12, 13, and 40.

Sorting based on Unicode strings is tricky, especially if you want cross platform compatibility. It's better today but there are still a lot of edge cases to consider if you have any hope of getting the same sort twice from "interesting" data.

Re:The dangers of streaming across versions of glibc: A caut... by barrkel on Tuesday January 08, 2019 @11:48AM (#18856966)
That's one way to implement case-insensitive lookup. OTOH, for a programming language symbol table, maybe you want to look up with case sensitivity first, then a second time with case insensitivity so you can emit a warning about the discrepancy (for a case-insensitive language) or an error with suggested spelling correction (for a case-sensitive language) and you don't want to maintain two separate hash tables for every scope.