Re: [collections] Add a list/deque faster than TreeList?

2022-06-11 Thread Matt Juntunen
Hello, I agree that this looks interesting. I personally would like to see the following before weighing in on whether or not to include it in commons: 1. A list of use cases where this data structure would be potentially more performant or useful than existing data structures. 2. A set of

Re: [collections] Add a list/deque faster than TreeList?

2022-06-11 Thread Matt Sicker
About thread safety, I was mostly interested in yes or no, though the details are neat. We have annotations for that so that users know which classes are applicable to different situations. Guava seems to be more of a giant toolbox than an easily embedded library like things at Commons, so I

Re: [collections] Add a list/deque faster than TreeList?

2022-06-11 Thread Rodion Efremov
Hi Matt and community, About thread safety: I keep an int counting modifications (called modCount). Now, spliterator/iterator/sublist check that modCount == expectedModCount, and if that is not the case, throws ConcurrentModificationException. Basically, it resembles the fail-fast behavior of

Re: [collections] Add a list/deque faster than TreeList?

2022-06-11 Thread Matt Sicker
Looks pretty interesting. I’ll be honest that my own data structure expertise revolves around immutable persistent patterns rather than mutable ones, but your class makes perfect sense as a mutable one. Do you have any notes on thread safety? While it’s neat that you’re submitting to the JDK

RE: [collections] Add a list/deque faster than TreeList?

2022-06-11 Thread Rob Spoor
I'd like to point out that rodde has also asked this project to be included in OpenJDK: https://mail.openjdk.java.net/pipermail/core-libs-dev/2022-June/091412.html On 2022/06/10 19:29:43 Rodion Efremov wrote: Hi, I have this List/Deque data structure: