| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <20081030174300.GA1773@ucw.cz> Date: Thu, 30 Oct 2008 18:43:00 +0100 From: Pavel Machek <pavel@...e.cz> To: J?rn Engel <joern@...fs.org> Cc: linux-kernel@...r.kernel.org Subject: Re: [RFC] B+Tree library Hi! > Main disadvantage of btrees is that they are complicated, come in a > gazillion subtly different variant that differ mainly in the balance > between read efficiency and write efficiency. Comparing btrees against > anything is a bit like comparing apples and random fruits. :-))))) + * Disks have fulfilled the prerequite for a long time. More recently DRAM prerequisite? +#define MAX(a, b) ((a) > (b) ? (a) : (b)) We already have that in the headers somewhere. -- (english) http://www.livejournal.com/~pavelmachek (cesky, pictures) http://atrey.karlin.mff.cuni.cz/~pavel/picture/horses/blog.html -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists