Perl 6 - the future is here, just unevenly distributed

IRC log for #rosettacode, 2015-04-19

| Channels | #rosettacode index | Today | | Search | Google Search | Plain-Text | summary

All times shown according to UTC.

Time Nick Message
00:16 bb010g joined #rosettacode
09:28 TimToady joined #rosettacode
12:44 Vampire0 joined #rosettacode
12:45 Vampire0 Hi
12:59 Vampire0 I have a remark about one of the Wiki pages
13:02 Vampire0 The Groovy Code on http://rosettacode.org/wiki/Combinations can be much simplified, no custom recursion method is needed, as Groovy has it all shipped. The three examples can easily be done like the following, including a sorting that might not be necessary, according to the use-case, in the examples on the Wiki page sorting is not done for everything:
13:02 Vampire0 [ 'Crosby', 'Stills', 'Nash', 'Young' ].subsequences().groupBy { it.size() }.sort().each { size, combinations -> println "Choose $size"; combinations.sort { it.join ' ' }.each { println it }; println() }
13:02 Vampire0 (0..4).subsequences().groupBy { it.size() }.findAll { it.key <= 3 }.sort().each { size, combinations -> println "Choose $size"; combinations.sort().each { println it }; println() }
13:02 Vampire0 (1..5).subsequences().groupBy { it.size() }.findAll { it.key <= 3 }.sort().each { size, combinations -> println "Choose $size"; combinations.sort().each { println it }; println() }
13:02 fedaykin "Combinations - Rosetta Code"
15:46 Rainb joined #rosettacode
18:30 saikrishna joined #rosettacode
19:17 bb010g joined #rosettacode
20:37 Vampire0_ joined #rosettacode

| Channels | #rosettacode index | Today | | Search | Google Search | Plain-Text | summary