< btcdrak>
wumpus: warren: I think it's time we made a bitcoin-core-dev specific mailing list.
< btcdrak>
We need something low volume we can use to communicate with eachother. it can be moderated with known contributors whitelisted and have strict topic rules to prevent getting hijacked.
< btcdrak>
there are a number of instances where posts would be better suited there as opposed to bitcoin-dev.
< btcdrak>
warren: could you talk to the LF about it please? Hopefully there wont be as much red-tape as last time with the -discuss list.
< jonasschnelli>
sipa: you probably know that: how can I compare (<, >) of buffers with variable lengths to distribute them in a red/black tree structure? Is the only way hashing the buffers?
< jonasschnelli>
Or >/< buffer.length, if length equal, byte-per-byte compare (F > 0)?
< sipa>
i'd suggest the latter
< sipa>
what are the buffers?
< sipa>
could an attacker control their contents?
< sipa>
actually, for a red-black tree that is not really an issue
< jonasschnelli>
sipa: Thanks... yes. The later seems to work...
< jonasschnelli>
the buffers are holding "keys"
< jonasschnelli>
I do simple map implementation in C