Timeline for Java 8 String Unique Permutations in Parallel
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2016 at 17:49 | vote | accept | bosco1 | ||
| Feb 17, 2016 at 17:49 | comment | added | bosco1 | I've updated the above code on dzone with a type of code with no limitations of memory but since it will take too long to compute in days. I'll accept your code as a solution :) Thanks for it. | |
| Feb 17, 2016 at 12:37 | comment | added | Tunaki | @bosco1 No algorithm will be able to make that work when you have billion and billions of permutations. What do you want to achieve? | |
| Feb 17, 2016 at 12:29 | comment | added | bosco1 |
For Combinations of 27=10888869450418352160768000000 for ABCDEFGHIJKLMNOPQRSTUVWXYZ[ it went out of memory. Trying out something more at the moment.
|
|
| Feb 16, 2016 at 12:02 | comment | added | Tunaki |
@bosco1 That's more of a design problem: if you want to generate all the permutations of a very large list, it's bound to take time and memory. But, note a Stream is lazy in that even if there are billions of permutation and you're interested in a few of them, you can limit the result. And as I said, you chose what the end-container will be: perhaps you don't need to store them. For example, you could then post-process the stream with other map, reduce operations without storing all the elements in a list.
|
|
| Feb 16, 2016 at 11:01 | comment | added | bosco1 | The limitation to this the stream will take memory. If the list is large where to store? | |
| Feb 15, 2016 at 16:31 | vote | accept | bosco1 | ||
| Feb 16, 2016 at 11:00 | |||||
| Feb 15, 2016 at 16:12 | history | edited | Tunaki | CC BY-SA 3.0 |
added 122 characters in body
|
| Feb 15, 2016 at 16:04 | history | edited | Tunaki | CC BY-SA 3.0 |
added 123 characters in body
|
| Feb 15, 2016 at 15:59 | history | answered | Tunaki | CC BY-SA 3.0 |