[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <20250407200250.1671534-1-andrewjballance@gmail.com>
Date: Mon, 7 Apr 2025 15:02:50 -0500
From: Andrew Ballance <andrewjballance@...il.com>
To: liam.howlett@...cle.com
Cc: a.hindborg@...nel.org,
akpm@...ux-foundation.org,
alex.gaynor@...il.com,
aliceryhl@...gle.com,
andrewjballance@...il.com,
benno.lossin@...ton.me,
bjorn3_gh@...tonmail.com,
boqun.feng@...il.com,
brauner@...nel.org,
dakr@...nel.org,
dingxiangfei2009@...il.com,
gary@...yguo.net,
gregkh@...uxfoundation.org,
linux-kernel@...r.kernel.org,
linux-mm@...ck.org,
maple-tree@...ts.infradead.org,
ojeda@...nel.org,
rust-for-linux@...r.kernel.org,
tmgross@...ch.edu,
wedsonaf@...il.com
Subject: Re: [RFC PATCH 2/2] rust: add maple tree abstractions
On Mon, Apr 07, 2025 at 09:59:21AM -0400, Liam R. Howlett wrote:
> * Andrew Ballance <andrewjballance@...il.com> [250405 02:03]:
> > maple trees are sparse array like data structure that maps
> > non-overlapping ranges to pointers.
>
> Why do you think the maple tree is a spare array like data structure?
>
I called the maple tree "sparse array like" because indexes that have
no entry map to null and there can be gaps between ranges. I did not
mean to imply that a maple tree was literally a sparse array.
Would you like me to reword this?
Powered by blists - more mailing lists