Update pot and add v6 requirements

Author: Salve J. Nilsen

best-of-rosettacode/100-doors.pl

@@ -1,17 +1,35 @@
-# http://rosettacode.org/wiki/100_doors#Perl_6
+=begin pod
 
-# Problem: You have 100 doors in a row that are all initially closed. You make
-# 100 passes by the doors. The first time through, you visit every door and
-# toggle the door (if the door is closed, you open it; if it is open, you close
-# it). The second time you only visit every 2nd door (door #2, #4, #6, ...).
-# The third time, every 3rd door (door #3, #6, #9, ...), etc, until you only
-# visit the 100th door.
+=head1 Problem
+
+You have 100 doors in a row that are all initially closed. You make 100 passes
+by the doors. The first time through, you visit every door and toggle the door
+(if the door is closed, you open it; if it is open, you close it). The second
+time you only visit every 2nd door (door #2, #4, #6, ...).  The third time,
+every 3rd door (door #3, #6, #9, ...), etc, until you only visit the 100th
+door.
+
+=head1 Question
+
+What state are the doors in after the last pass? Which are open,
+which are closed?
+
+=head1 More
+
+L<http://rosettacode.org/wiki/100_doors#Perl_6>
+
+=end pod
 
-# Question: What state are the doors in after the last pass? Which are open,
-# which are closed?
 
 say "Door $_ is open" for 1..10 X** 2;
 
-# More about X** - http://perlcabal.org/syn/S03.html#Cross_operators
 
-# vim: expandtab shiftwidth=4 ft=perl6:
+=begin pod
+
+=head1 Features used
+
+C<X**> - http://perlcabal.org/syn/S03.html#Cross_operators
+
+=end pod
+
+# vim: expandtab shiftwidth=2 ft=perl6:

best-of-rosettacode/copy-a-string.pl

@@ -0,0 +1,38 @@
+=begin pod
+
+=head1 Description
+
+This task is about copying a string. Where it is relevant, distinguish
+between copying the contents of a string versus making an additional
+reference to an existing string.
+
+=head2 More
+
+http://rosettacode.org/wiki/Copy_a_string#Perl_6
+
+=end pod
+
+use v6;
+
+# There is no special handling needed to copy a string.
+{
+  my $original = 'Hello.';
+  my $copy = $original;
+  say $copy;            # prints "Hello."
+  $copy = 'Goodbye.';
+  say $copy;            # prints "Goodbye."
+  say $original;        # prints "Hello."
+}
+
+# You can also bind a new variable to an existing one so that each refers
+# to, and can modify the same string. 
+{
+  my $original = 'Hello.';
+  my $bound := $original;
+  say $bound;           # prints "Hello."
+  $bound = 'Goodbye.';
+  say $bound;           # prints "Goodbye."
+  say $original;        # prints "Goodbye."
+}
+
+# vim: expandtab shiftwidth=2 ft=perl6:

best-of-rosettacode/create-a-two-dimensional-array-at-runtime.pl

@@ -0,0 +1,29 @@
+=begin pod
+
+=head1 Create a two-dimensional array at runtime
+
+Get two integers from the user, then create a two-dimensional array where the
+two dimensions have the sizes given by those numbers, and which can be accessed
+in the most natural way possible. Write some element of that array, and then
+output that element. Finally destroy the array if not done by the language
+itself. 
+
+=head1 Rosettacode URL
+
+http://rosettacode.org/wiki/Create_a_two-dimensional_array_at_runtime#Perl_6
+
+=end pod
+
+=cut
+
+
+my ($major,$minor) = prompt("Dimensions? ").comb(/\d+/);
+
+my @array := [ for ^$major { [ for ^$minor {'@'} ] } ];
+
+@array[ pick 1, ^$major ][ pick 1, ^$minor ] = ' ';
+
+.say for @array;
+
+
+# vim: expandtab shiftwidth=2 ft=perl6:

best-of-rosettacode/hailstone-sequence.pl

@@ -1,25 +1,45 @@
-#=head1 Description
-#    The Hailstone sequence of numbers can be generated from a starting positive integer, n by:
-#    If n is 1 then the sequence ends.
-#    If n is even then the next n of the sequence = n/2
-#    If n is odd then the next n of the sequence = (3 * n) + 1
-#    The (unproven), Collatz conjecture is that the hailstone sequence for any starting number always terminates.
-#    Task Description:
-#    Create a routine to generate the hailstone sequence for a number.
-#    Use the routine to show that the hailstone sequence for the number 27 has 112 elements starting with 27, 82, 41, 124 and ending with 8, 4, 2, 1
-#    Show the number less than 100,000 which has the longest hailstone sequence together with that sequences length.
-#    (But don't show the actual sequence)!
-
-#=head1 Code
-    sub hailstone($n) { $n, { $_ %% 2 ?? $_ div 2 !! $_ * 3 + 1 } ... 1 }
-     
-    my @h = hailstone(27);
-    say "Length of hailstone(27) = {+@h}";
-    say ~@h;
-    
-	my $m = 0 => 0;
-    $m max= +hailstone($_) => $_ for 1..99_999;
-    say "Max length $m.key() was found for hailstone($m.value()) for numbers < 100_000";
-
-#=head2 More
-#    http://rosettacode.org/wiki/Hailstone_sequence#Perl_6
+=begin pod
+
+=head1 Description
+
+The Hailstone sequence of numbers can be generated from a starting positive
+integer, n by:
+
+* If n is 1 then the sequence ends.
+* If n is even then the next n of the sequence = n/2
+* If n is odd then the next n of the sequence = (3 * n) + 1
+
+The (unproven), Collatz conjecture is that the hailstone sequence for any
+starting number always terminates.
+
+=head1 Task
+
+Create a routine to generate the hailstone sequence for a number.
+
+Use the routine to show that the hailstone sequence for the number 27 has 112
+elements starting with 27, 82, 41, 124 and ending with 8, 4, 2, 1
+
+Show the number less than 100,000 which has the longest hailstone sequence
+together with that sequences length.
+
+(But don't show the actual sequence)!
+
+=head1 More
+
+U<http://rosettacode.org/wiki/Hailstone_sequence#Perl_6>
+
+=end pod
+
+use v6;
+
+sub hailstone($n) { $n, { $_ %% 2 ?? $_ div 2 !! $_ * 3 + 1 } ... 1 }
+ 
+my @h = hailstone(27);
+say "Length of hailstone(27) = {+@h}";
+say ~@h;
+  
+my $m max= +hailstone($_) => $_ for 1..99_999;
+say "Max length $m.key() was found for hailstone($m.value()) for numbers < 100_000";
+
+
+# vim: expandtab shiftwidth=2 ft=perl6:

best-of-rosettacode/hailstone-sequence.pl.niecza

@@ -11,6 +11,8 @@
 #
 # http://rosettacode.org/wiki/Prime_decomposition#Perl_6
 
+use v6;
+
 constant @primes = 2, 3, 5, -> $n is copy {
     repeat { $n += 2 } until $n %% none @primes ... { $_ * $_ >= $n }
     $n;