Timeline for Optimise CPU-intensive list combining function
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 30, 2015 at 22:37 | vote | accept | Aron | ||
| Mar 5, 2014 at 3:11 | answer | added | Michael E2 | timeline score: 3 | |
| Mar 5, 2014 at 3:02 | comment | added | ciao | Deleted my answer, pending possible duplicate status, and clarification of what and why you're doing this: as rm-rf says, there may well be a much smarter way to do this. | |
| Mar 5, 2014 at 2:39 | comment | added | rm -rf♦ | Duplicate: Memory efficient generation and selection of tuples | |
| Mar 5, 2014 at 2:37 | comment | added | rm -rf♦ | Hmm... looks like there'll be a combinatorial explosion (even more so since you allow repetition). Why do you want to do this? Perhaps there's a better way to get to the result than brute-forcing... | |
| Mar 5, 2014 at 2:32 | history | asked | Aron | CC BY-SA 3.0 |