This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: [rfa] libiberty: splay tree performance improvement

From: Richard Henderson <rth at redhat dot com>
To: "Frank Ch. Eigler" <fche at redhat dot com>
Cc: gcc-patches at gcc dot gnu dot org
Date: Mon, 28 Jun 2004 14:56:09 -0700
Subject: Re: [rfa] libiberty: splay tree performance improvement
References: <20040628200754.GA10938@redhat.com> <20040628214342.GC12211@redhat.com> <20040628214940.GG10148@redhat.com>

On Mon, Jun 28, 2004 at 05:49:40PM -0400, Frank Ch. Eigler wrote:
> The opaque key value is already copied among nodes within the tree,
> plus there are stability requirements on the comparison functions,
> so the key objects cannot be that transient.

That's for keys stored in the tree.  Keys presented via lookup
needn't be stable.


r~

Follow-Ups:
- Re: [rfa] libiberty: splay tree performance improvement
  - From: Frank Ch. Eigler

References:
- [rfa] libiberty: splay tree performance improvement
  - From: Frank Ch. Eigler
- Re: [rfa] libiberty: splay tree performance improvement
  - From: Richard Henderson
- Re: [rfa] libiberty: splay tree performance improvement
  - From: Frank Ch. Eigler

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]