[Graph] On activity of Sandbox Graph

Hello all. Have attached the patch containing bidirectional Dijkstra SSSP algo + tests at org.apache.commons.graph.shortestpath (issue SANDBOX-457) in hope someone will review it. The benchmark is telling: applyingDijkstra(): time.warmup: 0.30, time.bench: 1.09

Re: [Graph] the future of commons-graph and modularization

Simone Tripodi kirjoitti 26.05.2013 18:35: Hi all, mates, after a long while I haven't touched commons-graph, I had the opportunity to get influenced by some activities at my paid work that made me think twice on what as been already done in that component, and would like to bring new

Re: [MATH] What is the derivative of 0^x

Hi! IMHO, 0^x should equal 0. But note please, that 0^0 is not define, so it should be NaN --- TIA, Rodion Ajo Fod писал 23.08.2013 05:17 PM: Seems like the DerivativeCompiler returns NaN. IMHO it should return 0. Is this worthy of an issue? Thanks, -Ajo

Re: [DISCUSS] Math TLP...

Don't you can conclude that matter, shut the f*** up, and enjoy the last days of summer? ;) --- TIA, Rodion James Carman писал 29.08.2013 05:46 PM: To be clear, I don't really care one way or the other. I just thought it was probably good to have a formal discussion on the matter. I'm also

[MATH] Missing Gauss-Jordan -elimination algorithm?

Hello, all! I have a couple of matrices, to which I would like to apply the Gauss-Jordan -elimination (i.e., I need the reduced row-echelon form of aforementioned), yet I cannot find from 3.2 anything relevant. A couple of noob questions follow.. (1) Is there already implemented algorithms

[COLLECTIONS] Preparing to solve issue 479 (Order statistic tree).

I have partially implemented ordered statistic tree [1], which I would like to contribute (right after I refactor it). If I submit a patch, how long does it take to get some attention from the committers? -- TIA, Rodion [1] Counted AVLTree at http://mureakuha.com/koodikirjasto/1253

[graph] Breadth-Fist Search library to commons graph?

Hello, might it be funky to have a few esoteric BFS-algorithms from [1]? :^) -- TIA, Rodion [1] https://github.com/coderodde/bfsbuddy - To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands,

[graph] is now ****** up :(

Hello, y'all! I did a checkout of commons graph, and guess what? There is no crucial BaseLabeledVertex.java in the entire repo. Did anyone of you tampered with the [graph] recently, because i would be infinitely happy, if some of you committers would fix the issue. I want to contribute more

[Collections] A better TreeList?

Hello, y'all! My buggy experiments show that it makes sense to produce a TreeList-like structure, that doesn't use an entire AVLNode for storing each god damned element, but rather stores, say, 128 elements in a node. In such a way, you can talk about a structure that takes the best from

[COLLECTIONS] Introducing OrderStatisticTree

Hello, y'all and Merry Xmas! I am mailing you as to notify about a new patch patching the order-statistic tree in Commons Collections, which is contained in COLLECTIONS-479.patch. May I expect it to be reviewed any time soon? -- TIA, Rodion

[collections] An order statistic tree (COLLECTIONS-479)

I have revived some discussion at https://issues.apache.org/jira/browse/COLLECTIONS-479 (https://issues.apache.org/jira/browse/COLLECTIONS-479) Basically, what interfaces an order statistic tree should implement? What comes to the structure, will a counted AVL-tree do? Best, rodde

[collections] An order statistic tree

Hello, all. I would like to announce that I have a java.util.Set implementation that is an order statistic tree (all non-bulk operations + select + rank in O(log n) time) [1]. However, it seems like the team on behalf of the order statistic tree issue is rather idle [2], hence the message.

[collections] Faster, indexed doubly-linked list data structure

Hello, I have implemented a heuristic, indexed doubly-linked list data structure [1][2] implementing java.util.List and java.util.Deque interfaces that has superior performance compared to java.util.LinkedList and java.util.ArrayList, and comparable performance to TreeList while having smaller

Re: [collections] JMH results for IndexedLinkedList

lpful. > > Regards, > Matt J > > On Thu, Jun 30, 2022 at 11:34 AM Gilles Sadowski > wrote: > > > > Hello. > > > > Le jeu. 30 juin 2022 à 07:54, Rodion Efremov a > écrit : > > > > > > Hi Matt and community, > > > > > >

Re: [collections] JMH results for IndexedLinkedList

my own. I'll let > you know what I find. > > Regards, > Matt J > > On Mon, Jul 4, 2022 at 4:53 AM Rodion Efremov wrote: > > > > Hi Matt and community, > > > > I have compiled the benchmark result data into 3 tables [1] (three > > different load s

Re: [collections] JMH results for IndexedLinkedList

/... > > > > I know Matt is active in other Apache mailing lists, and that he works on > > multiple Apache components. Besides also having $work, personal life, > etc., > > of course. So please be patient :) > > > > Cheers > > -Bruno > > > >

Re: [collections] JMH results for IndexedLinkedList

Hi Gilles, Would it be sufficient to include .txt files for the tables and the .ods file provided by Matt? Best regards, rodde ma 11.7.2022 klo 10.33 Gilles Sadowski kirjoitti: > Hi. > > Le lun. 11 juil. 2022 à 07:23, Rodion Efremov a > écrit : > > > > Hello Matt

Re: [collections] JMH results for IndexedLinkedList

gt; > Le lun. 11 juil. 2022 à 09:51, Rodion Efremov a > > écrit : > > > > > > Hi Gilles, > > > > > > Would it be sufficient to include .txt files for the tables and the > .ods > > > file provided by Matt? > > > > It would be mor

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

Hi, I have this List/Deque data structure: https://github.com/coderodde/IndexedLinkedList In a versatile benchmark, it outperforms the O(log n) TreeList easily by the factor of 2. (Also, it requires less memory than TreeList.) What do you think? Does it deserve to be included in collections?

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

hat sort of > process is fairly long term, so I’d imagine that Collections would be a > great place for it. If you’re trying to donate this to multiple projects, > then Eclipse also has a collections library that might like it, and Guava > might like it, too. > > — > Matt Sick

[collections] JMH results for IndexedLinkedList

Hi, Data structure: IndexedLinkedList Benchmark: IndexedLinkedListBenchmark Benchmark output: https://github.com/coderodde/indexedLinkedList/#benchmark-output >From the benchmark output,

[collections] Benchmark all 6 lists

Hello, I have benchmarked 1. ArrayList 2. LinkedList 3. IndexedLinkedList 4. NodeCachingLinkedList 5. CursorableLinkedList 6. TreeList IndexedLinkedList outperforms all other lists except ArrayList. See: https://issues.apache.org/jira/plugins/servlet/mobile#issue/COLLECTIONS-797 Best regards,

Re: [collections] JMH results for IndexedLinkedList

thm? I > can't recall. > > Regards, > Matt J > > On Tue, Jul 12, 2022 at 2:06 AM Rodion Efremov > wrote: > > > > Hello, > > > > I have added the benchmark data (both my and Matt's) to the JIRA issue. > > Please see the https://issues.apache.org/jir

[collections] An AVL-tree based sorted set implementing get by index and indexOf by key

Hello, I have an order statistic tree implemented [1]. I am aware of a red/black BST version of the sama ADT [2]. However, [1] implements the Set interface; [2] implements none. What do you think about it? Best regards, rodde [1] https://github.com/coderodde/OrderStatisticTree [2]

Re: [collections] JMH results for IndexedLinkedList

utor License Agreement [1] on file with the ASF. I think that > covers it. If I'm forgetting something, someone please chime in. > > Regards, > Matt J > > [1] https://www.apache.org/licenses/contributor-agreements.html#clas > > On Tue, Jul 12, 2022 at 4:08 PM Ro

Re: [collections] JMH results for IndexedLinkedList

Hi community, I have created a PR: https://github.com/apache/commons-collections/pull/321 Also, I signed the ASF ICLA and sent it to secret...@apache.org Best regards, rodde On Wed, Jul 13, 2022 at 6:18 AM Rodion Efremov wrote: > Hi Matt and community, > > Answering the first ques

Re: [collections] An AVL-tree based sorted set implementing get by index and indexOf by key

13.7.2022 klo 15.12 Gary Gregory kirjoitti: > Hi Rodde, > > Why would a user use this implementation instead of a > ConcurrentSkipListSet or a TreeSet? > > IMO, we need to consider users first, IOW, what is the use case? > > Gary > > On Wed, Jul 13, 2022 at 1

Re: [collections] JMH results for IndexedLinkedList

a ping here on the dev list > if you don't hear back from me (or someone else) within a week. > > Regards, > Matt J > > On Tue, Jun 21, 2022 at 7:22 AM Rodion Efremov > wrote: > > > > Hi, > > > > Data structure: IndexedLinkedList > >

Re: [collections] Benchmark all 6 lists

Hello community, I hereby decided to mail the list since my last message did not produce any response. Question: should I give up on the process of inclusion of my IndexedLinkedList to the [collections]? Best regards, rodde la 16.7.2022 klo 6.17 Rodion Efremov kirjoitti: > Hello, > &g

[collections]

Good day, I would like to propose a Deque/List that is implemented as a doubly linked list with a sublinear index speeding up single-element operations to (likely) O(sqrt(n)). It passes a benchmark faster than TreeList by the factor of around 5. The data structure is hosted in GitHub:

Re: [collections]

> know. > > > > > https://www.reddit.com/r/learnprogramming/comments/10hwrmy/why_arent_linked_lists_more_popular/ > > > > > > > > On Tue, Apr 9, 2024 at 9:01 AM Rodion Efremov > wrote: > > > > > > Good day, > > > > > > I would like to pro