You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@commons.apache.org by "Efremov, Rodion" <ro...@helsinki.fi> on 2025/12/03 14:50:56 UTC
[COLLECTIONS] Add fast List/Deque implementation that outperforms TreeList?
Hello!
I have a List/Deque implementation [1] that have run ~7 times faster than TreeList on a benchmark. Also, it implements entirely the List/Deque/Cloneable/Serializable interfaces. My MSc thesis [2] discusses it in great detail.
What do you think? Can it make into Commons Collections?
References:
[1] https://github.com/coderodde/indexedLinkedList/
[2] https://coderodde.github.io/msc-thesis.pdf
VS: [COLLECTIONS] Add fast List/Deque implementation that outperforms TreeList?
Posted by "Efremov, Rodion" <ro...@helsinki.fi>.
Hello Gary,
Sounds fair. I will work on JMH on my winter vacation which should start in a couple of weeks.
Best regards,
rodde
________________________________
Lähettäjä: Gary D. Gregory <gg...@apache.org>
Lähetetty: perjantai 5. joulukuuta 2025 15.09
Vastaanottaja: dev@commons.apache.org <de...@commons.apache.org>
Aihe: Re: [COLLECTIONS] Add fast List/Deque implementation that outperforms TreeList?
BTW, for JMH examples, see the Commons IO component.
Gary
On 2025/12/05 12:10:13 Gary Gregory wrote:
> Hello,
>
> You'll want to create a PR on GitHub with a JMH benchmark that
> compares your implementation to the existing one.
>
> Thank you,
> Gary
>
> On Wed, Dec 3, 2025 at 9:52 AM Efremov, Rodion
> <ro...@helsinki.fi> wrote:
> >
> > Hello!
> >
> > I have a List/Deque implementation [1] that have run ~7 times faster than TreeList on a benchmark. Also, it implements entirely the List/Deque/Cloneable/Serializable interfaces. My MSc thesis [2] discusses it in great detail.
> >
> > What do you think? Can it make into Commons Collections?
> >
> > References:
> > [1] https://github.com/coderodde/indexedLinkedList/
> > [2] https://coderodde.github.io/msc-thesis.pdf
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
> For additional commands, e-mail: dev-help@commons.apache.org
>
>
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org
Re: [COLLECTIONS] Add fast List/Deque implementation that outperforms TreeList?
Posted by "Gary D. Gregory" <gg...@apache.org>.
BTW, for JMH examples, see the Commons IO component.
Gary
On 2025/12/05 12:10:13 Gary Gregory wrote:
> Hello,
>
> You'll want to create a PR on GitHub with a JMH benchmark that
> compares your implementation to the existing one.
>
> Thank you,
> Gary
>
> On Wed, Dec 3, 2025 at 9:52 AM Efremov, Rodion
> <ro...@helsinki.fi> wrote:
> >
> > Hello!
> >
> > I have a List/Deque implementation [1] that have run ~7 times faster than TreeList on a benchmark. Also, it implements entirely the List/Deque/Cloneable/Serializable interfaces. My MSc thesis [2] discusses it in great detail.
> >
> > What do you think? Can it make into Commons Collections?
> >
> > References:
> > [1] https://github.com/coderodde/indexedLinkedList/
> > [2] https://coderodde.github.io/msc-thesis.pdf
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
> For additional commands, e-mail: dev-help@commons.apache.org
>
>
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org
Re: [COLLECTIONS] Add fast List/Deque implementation that outperforms TreeList?
Posted by "Gary D. Gregory" <gg...@apache.org>.
BTW, for JMH examples, see the Commons IO component.
Gary
On 2025/12/05 12:10:13 Gary Gregory wrote:
> Hello,
>
> You'll want to create a PR on GitHub with a JMH benchmark that
> compares your implementation to the existing one.
>
> Thank you,
> Gary
>
> On Wed, Dec 3, 2025 at 9:52 AM Efremov, Rodion
> <ro...@helsinki.fi> wrote:
> >
> > Hello!
> >
> > I have a List/Deque implementation [1] that have run ~7 times faster than TreeList on a benchmark. Also, it implements entirely the List/Deque/Cloneable/Serializable interfaces. My MSc thesis [2] discusses it in great detail.
> >
> > What do you think? Can it make into Commons Collections?
> >
> > References:
> > [1] https://github.com/coderodde/indexedLinkedList/
> > [2] https://coderodde.github.io/msc-thesis.pdf
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
> For additional commands, e-mail: dev-help@commons.apache.org
>
>
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org
Re: [COLLECTIONS] Add fast List/Deque implementation that outperforms TreeList?
Posted by Gary Gregory <ga...@gmail.com>.
Hello,
You'll want to create a PR on GitHub with a JMH benchmark that
compares your implementation to the existing one.
Thank you,
Gary
On Wed, Dec 3, 2025 at 9:52 AM Efremov, Rodion
<ro...@helsinki.fi> wrote:
>
> Hello!
>
> I have a List/Deque implementation [1] that have run ~7 times faster than TreeList on a benchmark. Also, it implements entirely the List/Deque/Cloneable/Serializable interfaces. My MSc thesis [2] discusses it in great detail.
>
> What do you think? Can it make into Commons Collections?
>
> References:
> [1] https://github.com/coderodde/indexedLinkedList/
> [2] https://coderodde.github.io/msc-thesis.pdf
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org