[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20090117175308.GB1409@ucw.cz>
Date: Sat, 17 Jan 2009 18:53:08 +0100
From: Pavel Machek <pavel@...e.cz>
To: Johannes Berg <johannes@...solutions.net>
Cc: Andrew Morton <akpm@...ux-foundation.org>,
Linux Kernel list <linux-kernel@...r.kernel.org>,
J?rn Engel <joern@...fs.org>
Subject: Re: [PATCH] add b+tree library
Hi!
> --- /dev/null 1970-01-01 00:00:00.000000000 +0000
> +++ wireless-testing/lib/btree.c 2009-01-10 11:41:47.000000000 +0100
> @@ -0,0 +1,797 @@
> +/*
> + * lib/btree.c - Simple In-memory B+Tree
> + *
> + * As should be obvious for Linux kernel code, license is GPLv2
> + *
> + * Copyright (c) 2007-2008 Joern Engel <joern@...fs.org>
> + * Bits and pieces stolen from Peter Zijlstra's code, which is
> + * Copyright 2007, Red Hat Inc. Peter Zijlstra <pzijlstr@...hat.com>
> + * GPLv2
> + *
> + * see http://programming.kicks-ass.net/kernel-patches/vma_lookup/btree.patch
> + *
> + * A relatively simple B+Tree implementation. I have written it as a learning
> + * excercise to understand how B+Trees work. Turned out to be useful as well.
> + *
> + * B+Trees can be used similar to Linux radix trees (which don't have anything
> + * in common with textbook radix trees, beware). Prerequisite for them working
> + * well is that access to a random tree node is much faster than a large number
> + * of operations within each node.
should be 'much slower'?
Because otherwise I don't get it.
--
(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