Hi, On Tue, 5 Jul 2011, Richard Sandiford wrote:
> FWIW, the reason I asked was because I'm using a splay tree in a patch > that I hope to send soon. The libiberty structures are a bit heavyweight, > with the hooks stored alongside the root pointer, and with each node > being a separate structure from the key and value. Since all I needed > was a find-or-insert operation, find-and-insert only? Then a hashtable most probably is better anyway. Ciao, Michael.
