Timeline for Robust function for manipulation of nested lists
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2013 at 13:42 | vote | accept | geordie | ||
| Aug 28, 2013 at 13:11 | comment | added | Kuba |
@geordie That's great you like it. Thanks for good question that inspired me to play with Intersection :)
|
|
| Aug 28, 2013 at 13:09 | comment | added | geordie | I really like your edit. Thanks for the detailed explanations! | |
| Aug 22, 2013 at 10:05 | history | edited | Kuba | CC BY-SA 3.0 |
new method
|
| Aug 22, 2013 at 9:46 | comment | added | Kuba | @geordie I've added couple of things about your approach. | |
| Aug 22, 2013 at 9:45 | history | edited | Kuba | CC BY-SA 3.0 |
added 924 characters in body
|
| Aug 22, 2013 at 7:32 | comment | added | Kuba |
@PinguinDirk It looks like second halfs of our ideas are quite similar. I used Map more because I feel comfortable with using it, also I do not have experience with sorting performance so this is brute force :) I will not be surprised if it is not optimal.
|
|
| Aug 22, 2013 at 7:28 | comment | added | Pinguin Dirk | I guess yours might be faster - I tried to stick closer to the OPs plan (maybe I wasn't so successful after all) :). Nice one! | |
| Aug 22, 2013 at 7:25 | history | edited | Kuba | CC BY-SA 3.0 |
added 394 characters in body
|
| Aug 22, 2013 at 7:17 | history | answered | Kuba | CC BY-SA 3.0 |