Date: Tue, 23 Sep 1997 00:51:04 -0600 From: "Justin T. Gibbs" <gibbs@plutotech.com> To: John-Mark Gurney <gurney_j@resnet.uoregon.edu> Cc: Nate Williams <nate@mt.sri.com>, "Justin T. Gibbs" <gibbs@plutotech.com>, current@FreeBSD.ORG Subject: Re: cvs commit: src/sys/conf files src/sys/dev/vx if_vx.c if_vxreg.h src/sys/i386/apm apm.c src/sys/i386/conf GENERIC files.i386 src/sys/i386/eisa 3c5x9.c aha1742.c aic7770.c bt74x.c eisaconf.c eisaconf.h if_fea.c if_vx_eisa.c src/sys/i386/i386 autoconf. Message-ID: <199709230651.AAA13934@pluto.plutotech.com> In-Reply-To: Your message of "Mon, 22 Sep 1997 23:39:30 PDT." <19970922233930.12159@hydrogen.nike.efn.org>
next in thread | previous in thread | raw e-mail | index | archive | help
>> I'll stop for now, since this is as much a learning experience for me as >> anything, and I don't want to wear out my welcome. :) :) > >now... I want to know why something more effecient isn't used.. something >like a Fibonacci heap... this will provide amortized constant time for >insert and minimum (find what is min)... then for actually deleting a >key (performed once for each key when either expired or removed) it >performs in O(lgn) time... I considered using a standard heap, but heaps are expensive/difficult to grow on demand as it requires reallocating an array. I'm not familiar with Fibonacci heaps though and perhaps this isn't a problem with them. >-- > John-Mark Gurney Modem/FAX: +1 541 683 6954 > Cu Networking > > Live in Peace, destroy Micro$oft, support free software, run FreeBSD -- Justin T. Gibbs =========================================== FreeBSD: Turning PCs into workstations ===========================================
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199709230651.AAA13934>