Thomas B

> I am a bit confused as to how Diesel simultaneously guarantees I realize my previous messages may have been lacking explanation to be understandable by anyone who isn't quite...

When doing in an end of game review we all got stuck in the end of game review, where reloading would get us on the error page and we couldn't...

> It might end up being faster to just keep the keys around and doing a hash table lookup every time the value is needed. It seems that this would...

> each returned value must be checked against every other returned value That seems reasonable on the const size version because those are unlikely to ever be very large, but...

Ah of course! ^^ Then I guess if n is too large just sorting the pointers and checking for no consecutive dupes works in `O(n* log(n))`. The problems becomes similar...

> Unlikely, since you still need to take into account the sort itself The sort itself is `O(n* log(n))` where n is the number of queried entries. > Currently the...

> Well, as you can see from your own example, you first need to sort, and then go through the array again, looking for the equal pointers I'm not sure...

> Why not consider... I'm afraid I don't understand what you have in mind. Perhaps that would be easier with a code sample?

Since this repository is not maintained anymore, the main one seems to now be the fork at https://github.com/rustls/webpki. In case you want to follow (or upvote it 🙄), this PR...

Same issue on NixOS. Would be nice if there was a way to get more logs than just this error message. Maybe related: https://github.com/ValveSoftware/Source-1-Games/issues/2825