Date: Fri, 30 Apr 2004 19:46:15 -0700 From: David Schultz <das@FreeBSD.ORG> To: "Dag-Erling =?us-ascii:iso-8859-1?Q?Sm=F8rgrav?=" <des@des.no> Cc: cvs-all@FreeBSD.ORG Subject: Re: cvs commit: src/usr.bin/du du.c Message-ID: <20040501024615.GC65015@VARK.homeunix.com> In-Reply-To: <xzpfzal81nj.fsf@dwp.des.no> References: <200404301817.i3UIHprY005219@repoman.freebsd.org> <xzpfzal81nj.fsf@dwp.des.no>
next in thread | previous in thread | raw e-mail | index | archive | help
On Sat, May 01, 2004, Dag-Erling Smrgrav wrote: > Tim Kientzle <kientzle@FreeBSD.org> writes: > > Log: > > Speed up hardlink detection by using a self-sizing hash > > table rather than the old linear list search. > > You know, this would be a lot easier with a plain old red-black tree. ...especially if we had a good red-black tree implementation in a library (hint, hint). At one of my former employers, virtually nobody used AVL trees until one day when someone committed a generic AVL tree implementation. Within a few weeks after that, people had found dozens of optimizations that involved replacing linked lists with AVL trees.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20040501024615.GC65015>