Timeline for Partitioning with varying partition size
Current License: CC BY-SA 4.0
21 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2021 at 9:01 | answer | added | Whelp | timeline score: 2 | |
| Nov 3, 2019 at 21:44 | history | edited | Mr.Wizard | edited tags | |
| Nov 7, 2018 at 11:56 | history | edited | Szabolcs | CC BY-SA 4.0 | added 129 characters in body |
| Oct 4, 2017 at 1:05 | answer | added | Carl Woll | timeline score: 26 | |
| Aug 9, 2016 at 15:24 | answer | added | masterxilo | timeline score: 15 | |
| Jul 11, 2013 at 8:09 | answer | added | Kuba | timeline score: 7 | |
| May 14, 2013 at 13:03 | answer | added | Simon Woods | timeline score: 13 | |
| Jul 2, 2012 at 15:22 | vote | accept | sjdh | ||
| Jul 2, 2012 at 15:01 | answer | added | Mr.Wizard | timeline score: 41 | |
| Jun 30, 2012 at 8:15 | vote | accept | sjdh | ||
| Jul 2, 2012 at 15:22 | |||||
| Jun 27, 2012 at 13:36 | history | tweeted | twitter.com/#!/StackMma/status/217974742496456704 | ||
| Jun 27, 2012 at 10:29 | comment | added | Leonid Shifrin | @Mr.Wizard But, if we convert test to packed array with Developer`ToPackedArray, then the internal function is a little faster. I would generally mention in your answer that for packed arrays, your function creates a ragged list where however all sublists remain packed (because Part does not unpack). This allows for much faster execution and vastly more efficient storage as well, even though the resulting array is ragged. | |
| Jun 27, 2012 at 10:08 | comment | added | Leonid Shifrin | @Mr.Wizard dynP is about 40-50 % faster on my test: test = Flatten[Range /@ Range[5000]];, and then dynP[test, Range[5000]], and similarly for the internal function. | |
| Jun 27, 2012 at 10:02 | comment | added | Mr.Wizard | @Leonid I'm claiming "great minds think alike" for this one. :-) Since you're testing, how does Internal`PartitionRagged compare to dynP? | |
| Jun 27, 2012 at 9:56 | comment | added | Leonid Shifrin | @Mr.Wizard Yes, I can. But then, have a look at the listSplit function in my third post here :-) | |
| Jun 27, 2012 at 9:53 | comment | added | Mr.Wizard | @Leonid that's not a discussion it's a solution. :-) (However, I believe I tested it before and it came up slower than dynP/dynamicPartition -- can you confirm for v8?) | |
| Jun 27, 2012 at 9:45 | answer | added | István Zachar | timeline score: 10 | |
| Jun 27, 2012 at 9:39 | comment | added | Leonid Shifrin | This discussion may also be relevant. | |
| Jun 27, 2012 at 9:19 | answer | added | Mr.Wizard | timeline score: 59 | |
| Jun 27, 2012 at 9:12 | comment | added | Heike | This question might be useful | |
| Jun 27, 2012 at 8:55 | history | asked | sjdh | CC BY-SA 3.0 |