Date: Thu, 23 May 2002 22:11:41 -0500 (CDT) From: Mike Silbersack <silby@silby.com> To: Alan Cox <alc@cs.rice.edu> Cc: cvs-committers@FreeBSD.org, <cvs-all@FreeBSD.org> Subject: Re: cvs commit: src/sys/vm vm_map.c vm_map.h Message-ID: <20020523221001.X18281-100000@patrocles.silby.com> In-Reply-To: <20020524023327.GB17481@cs.rice.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
On Thu, 23 May 2002, Alan Cox wrote: > P.S. I hope this motivates others on this list to look at splay trees. > They are extemely easy to work with and to implement. (Notice that vm_map.c > only grew by 24 lines.) Hm, they look pretty neat from what I've been able to gather. It looks like they would be a great replacement for hash tables in many cases. What are the practical downsides? I'm surprised that I haven't heard of them before. Mike "Silby" Silbersack To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe cvs-all" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20020523221001.X18281-100000>