Timeline for Merge function performing too slowly; what can be done about it?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 28, 2019 at 9:45 | comment | added | Mr.Wizard | I added a benchmark. If I didn't mess up your method it appears they perform similarly in version 10.1. | |
| Dec 26, 2019 at 12:09 | comment | added | kirma | @Mr.Wizard That works too, but the logic of it is different from my solution. Also, efficiency on really large lists is probably lower(?). | |
| Dec 26, 2019 at 8:03 | comment | added | Mr.Wizard | I think this can be written Fold[Merge[fn]@*List, Partition[listOfAssoc, UpTo@64]] | |
| Dec 25, 2019 at 15:27 | vote | accept | George | ||
| Dec 25, 2019 at 5:01 | comment | added | kirma | @QuantumDot I think it shouldn't be this bad. (It isn't obvious without thousands of associations, anyway!) Maybe the assumption the implementor has had is that the amount of associations is low, and this makes it an "irrelevant" question. | |
| Dec 25, 2019 at 4:43 | comment | added | QuantumDot | Does it count as a bug that Merge[Total] performs worse performance than expected? | |
| Dec 24, 2019 at 21:22 | history | edited | kirma | CC BY-SA 4.0 | added 1 character in body |
| Dec 24, 2019 at 21:14 | history | answered | kirma | CC BY-SA 4.0 |