[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <000001dae86b$04955090$0dbff1b0$@wewakecorp.com>
Date: Wed, 7 Aug 2024 10:42:09 +0900
From: <lsahn@...akecorp.com>
To: "'JaeJoon Jung'" <rgbi3307@...il.com>
Cc: "'Linus Torvalds'" <torvalds@...ux-foundation.org>,
"'Sasha Levin'" <levinsasha928@...il.com>,
"'Liam R . Howlett'" <Liam.Howlett@...cle.com>,
"'Matthew Wilcox'" <willy@...radead.org>,
<linux-kernel@...r.kernel.org>,
<linux-mm@...ck.org>,
<maple-tree@...ts.infradead.org>,
<linux-fsdevel@...r.kernel.org>
Subject: RE: [PATCH v2 1/2] lib/htree: Add locking interface to new Hash Tree
> -----Original Message-----
> From: owner-linux-mm@...ck.org <owner-linux-mm@...ck.org> On Behalf Of
> JaeJoon Jung
> Sent: Wednesday, August 7, 2024 9:22 AM
> To: Greg Kroah-Hartman <gregkh@...uxfoundation.org>
> Cc: Linus Torvalds <torvalds@...ux-foundation.org>; Sasha Levin
> <levinsasha928@...il.com>; Liam R . Howlett <Liam.Howlett@...cle.com>;
> Matthew Wilcox <willy@...radead.org>; linux-kernel@...r.kernel.org; linux-
> mm@...ck.org; maple-tree@...ts.infradead.org; linux-
> fsdevel@...r.kernel.org
> Subject: Re: [PATCH v2 1/2] lib/htree: Add locking interface to new Hash
> Tree
...
> The Hash Tree I implemented manages the Tree with the characteristic
> of a hash that is accessed in O(1).
> Even if the tree gets deeper, the search time does not increase.
> There is no rotation cost because the tree is kept balanced by hash key.
How does it keep balancing?
Powered by blists - more mailing lists