- Added solutions by Colin Crain.

16 files changed, 1393 insertions, 1053 deletions

diff --git a/challenge-080/colin-crain/perl/ch-1.pl b/challenge-080/colin-crain/perl/ch-1.pl
new file mode 100644
index 0000000000..71838d77ac
--- /dev/null
+++ b/challenge-080/colin-crain/perl/ch-1.pl
@@ -0,0 +1,46 @@
+#! /opt/local/bin/perl
+#
+#       tiny_numbers_on_the_hillside.pl
+#
+#         TASK #1 › Smallest Positive Number Bits
+#         Submitted by: Mohammad S Anwar
+#         You are given unsorted list of integers @N.
+# 
+#         Write a script to find out the smallest positive number missing.
+# 
+#         Example 1:
+#             Input: @N = (5, 2, -2, 0)
+#             Output: 1
+#         Example 2:
+#             Input: @N = (1, 8, -1)
+#             Output: 2
+#         Example 3:
+#             Input: @N = (2, 0, -1)
+#             Output: 1
+#
+#         method:
+#             Map the array into a hash. Start counting up from 1, checking
+#             existence. Hashes are fast lookups. Even if all N from 1 to the
+#             last is contained in the set, eventually the array will be
+#             exhausted and the next natural number will be output. 
+#             
+#       2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+
+## ## ## ## ## MAIN:
+
+my @input = @ARGV ? @ARGV : (5, 2, -2, 0, 16, 1, 6, 3, -18, 1, 0, 4);
+say "input : (", (join ', ', @input), ")";
+
+my %lookup = map { $_ => 1 } @input;
+my $num;
+
+while ( ++$num ) {  ## @input is finite so this will end eventually
+    say "output:  $num" and exit if ! exists $lookup{$num};
+}
diff --git a/challenge-080/colin-crain/perl/ch-2.pl b/challenge-080/colin-crain/perl/ch-2.pl
new file mode 100644
index 0000000000..a08a5da1dd
--- /dev/null
+++ b/challenge-080/colin-crain/perl/ch-2.pl
@@ -0,0 +1,158 @@
+#! /opt/local/bin/perl
+#
+#       dinner_for_dictators.pl
+
+#       visual aid: https://en.wikipedia.org/wiki/File:Dinner_of_the_Dictators_wiki.jpg
+#
+#         TASK #2 › Count Candies
+#         Submitted by: Mohammad S Anwar
+#         You are given rankings of $N candidates.
+# 
+#         Write a script to find out the total candies needed for all
+#         candidates. You are asked to follow the rules below:
+# 
+#         a) You must given at least one candy to each candidate.
+#         b) Candidate with higher ranking get more candies than their mmediate neighbors on either side.
+
+#         Example 1:
+#         Input: $N = (1, 2, 2)
+#         Explanation:
+#         Applying rule #a, each candidate will get one candy. So total candies
+#         needed so far 3. Now applying rule #b, the first candidate do not get
+#         any more candy as its rank is lower than it's neighbours. The second
+#         candidate gets one more candy as it's ranking is higher than it's
+#         neighbour. Finally the third candidate do not get any extra candy as
+#         it's ranking is not higher than neighbour. Therefore total candies
+#         required is 4.
+# 
+#         Output: 4
+
+#         Example 2:
+#         Input: $N = (1, 4, 3, 2)
+#         Explanation:
+#         Applying rule #a, each candidate will get one candy. So total candies
+#         needed so far 4. Now applying rule #b, the first candidate do not get
+#         any more candy as its rank is lower than it's neighbours. The second
+#         candidate gets two more candy as it's ranking is higher than it's both
+#         neighbour. The third candidate gets one more candy as it's ranking is
+#         higher than it's neighbour. Finally the fourth candidate do not get
+#         any extra candy as it's ranking is not higher than neighbour.
+#         Therefore total candies required is 7.
+# 
+#         Output: 7
+# 
+#    ----------------------------------------------------------------------------
+
+#         rephrasing for dramatic effect:
+#             "You are tasked with providing candied treats for a dinner, at the
+#             place settings along a long table on a dais facing a large hall.
+#             The diners are to be a gathering of dictators and very powerful
+#             men, seated in a line facing the room. Because they are by nature
+#             petulant and insecure, each man requires an offering of candy as a
+#             token of respect, in an amount that he deems worthy of his
+#             position amongst his peers. Every man of higher stature than his
+#             neighbors to either side must always have more candies than them,
+#             lest he be percieved as weak. There are no exceptions, and failure
+#             to properly dispense the correct amounts will result in
+#             imprisonment at best. For obscure reasons of protocol and
+#             diplomacy, there is no apparent ordering to the table seating, so
+#             you must rely on ratings asigned to the individual seat positions
+#             to know how to fill the candy bowls. As the government hosting the
+#             feast has only been able to procure a limited amount of candies
+#             for you to distribute, you will have no choice but to dispense the
+#             minumum number possible to fulfill your obligations, hoping you
+#             will have enough to supply the whole table. May the odds be
+#             forever in your favor."
+
+#         method:
+#             It took me a while to figure out what was realy being asked here.
+#             I spent some time constructing an additive method, making multiple
+#             passes across the data and augmenting values for each setting as
+#             required until no more adjustment was necessary, but found the
+#             result lacking; it seemed to work but was somehow missing the
+#             point. But it got me looking at the relationship between the
+#             solutions and the source arrays.
+# 
+#             Then it occured to me that what we were doing was minimizing the
+#             data, while maintaining the relative relationships between
+#             adjacent elememts. Those larger than their neighbor will remain
+#             greater, those less, less. But the whole list will have those
+#             differences minimized and pushed as far as possible towards 1, the
+#             base value.
+# 
+#             It's somewhat akin  to normalizing and compressing a signal, but
+#             not quite. Here both the compression and rezeroing are extremely
+#             local events, making the adjustments discontinuous. For instance,
+#             any element less than both its neighbors will be reduced all the
+#             way to 1, reestablishing the lower boundary again.
+# 
+#             Taking this to mind, the process is very simple: starting with the
+#             original array, the value of each element is reduced according to
+#             the rule that if it is larger than its neighbors, the new value is
+#             one more than the larger neighbor's output, and if smaller than
+#             both, then 1.
+# 
+#             The part that makes this work, though, is the order of selection.
+#             By moving the smallest elements first, the baseline positions are
+#             established, then the elements that need to be one more than this
+#             are placed, then one more than that. To do this we will need a
+#             list of the indexes of the original array, resorted according to
+#             the array values, lowest to highest. Working through this, in the
+#             end every element will only need to be valued once in the output
+#             array.
+# 
+
+
+
+#
+#       2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+
+## ## ## ## ## MAIN:
+
+
+my @input  = scalar @ARGV   ? @ARGV 
+                            : (1, 9, 5, 2, 6, 8, 9, 10, 2, 5, 1);
+
+my @output;
+
+normalize(\@input, \@output);
+
+say "input:  @input";
+say "output: @output";
+
+## ## ## ## ## SUBS:
+
+sub normalize {
+## starting from the smallest value, if the given index value is
+## larger than either of its neighbors, then it is
+## revalued in the output to be the larger of its neighbors' output plus one. If it is
+## smaller than both it is 1.
+    my ($in, $out) = @_;
+
+    my @order = sort { $in->[$a] <=> $in->[$b] } keys $in->@*;  
+    for my $i (@order) {
+        my $min = 1;
+        for (1,-1) {
+            next if ( $i + $_ < 0 or not defined $in->[$i+$_]) ;
+            if ($in->[$i] > $in->[$i+$_]) {
+                $min = max($out->[$i+$_] + 1, $min);
+            }
+        }
+        $out->[$i] = $min;    
+    }
+}
+
+sub max {
+    my $max = "-inf";
+    for (@_) {
+        $max = $_ if $max < $_;
+    }
+    return $max;
+}
\ No newline at end of file
diff --git a/challenge-080/colin-crain/raku/ch-1.raku b/challenge-080/colin-crain/raku/ch-1.raku
new file mode 100644
index 0000000000..99259bbd35
--- /dev/null
+++ b/challenge-080/colin-crain/raku/ch-1.raku
@@ -0,0 +1,37 @@
+#!/usr/bin/env raku
+# 
+#
+#       tiny_numbers_on_the_hillside.raku
+#
+#         TASK #1 › Smallest Positive Number Bits
+#         Submitted by: Mohammad S Anwar
+#         You are given unsorted list of integers @N.
+# 
+#         Write a script to find out the smallest positive number missing.
+# 
+#         Example 1:
+#             Input: @N = (5, 2, -2, 0)
+#             Output: 1
+#         Example 2:
+#             Input: @N = (1, 8, -1)
+#             Output: 2
+#         Example 3:
+#             Input: @N = (2, 0, -1)
+#             Output: 1
+#
+#
+#
+#       2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN (*@input) ;
+@input.elems == 0 and @input = 5, 2, -2, 0, 16, 1, 6, 3, -18, 1, 0, 4;
+my %lookup = @input.Bag;
+
+say "input : ", @input;
+%lookup{$_}:exists or say "output:  $_" and exit for (1..*);
+
+
+
diff --git a/challenge-080/colin-crain/raku/ch-2.raku b/challenge-080/colin-crain/raku/ch-2.raku
new file mode 100644
index 0000000000..a4f14214db
--- /dev/null
+++ b/challenge-080/colin-crain/raku/ch-2.raku
@@ -0,0 +1,91 @@
+#!/usr/bin/env raku
+# 
+#
+#       dinner-for-dictators.raku
+#
+#       visual aid: https://en.wikipedia.org/wiki/File:Dinner_of_the_Dictators_wiki.jpg
+#
+#         TASK #2 › Count Candies
+#         Submitted by: Mohammad S Anwar
+#         You are given rankings of $N candidates.
+# 
+#         Write a script to find out the total candies needed for all
+#         candidates. You are asked to follow the rules below:
+# 
+#         a) You must given at least one candy to each candidate.
+#         b) Candidate with higher ranking get more candies than their mmediate neighbors on either side.
+
+#         Example:
+#         Input: $N = (1, 4, 3, 2)
+#         Explanation:
+#         Applying rule #a, each candidate will get one candy. So total candies
+#         needed so far 4. Now applying rule #b, the first candidate do not get
+#         any more candy as its rank is lower than it's neighbours. The second
+#         candidate gets two more candy as it's ranking is higher than it's both
+#         neighbour. The third candidate gets one more candy as it's ranking is
+#         higher than it's neighbour. Finally the fourth candidate do not get
+#         any extra candy as it's ranking is not higher than neighbour.
+#         Therefore total candies required is 7.
+# 
+#         Output: 7
+# 
+#    ----------------------------------------------------------------------------
+
+#         rephrasing for dramatic effect:
+# 
+#             "You are tasked with providing candied treats for a dinner, at the
+#             place settings along a long table on a dais facing a large hall.
+#             The diners are to be a gathering of dictators and very powerful
+#             men, seated in a line facing the room. Because they are by nature
+#             petulant and insecure, each man requires an offering of candy as a
+#             token of respect, in an amount that he deems worthy of his
+#             position amongst his peers. Every man of higher stature than his
+#             neighbors to either side must always have more candies than them,
+#             lest he be perceived as weak. There are no exceptions, and failure
+#             to properly dispense the correct amounts will result in
+#             imprisonment at best. For obscure reasons of protocol and
+#             diplomacy, there is no apparent ordering to the table seating, so
+#             you must rely on ratings asigned to the individual seat positions
+#             to know how to fill the candy bowls. As the government hosting the
+#             feast has only been able to procure a limited amount of candies
+#             for you to distribute, you will have no choice but to dispense the
+#             minumum number possible to fulfill your obligations, hoping you
+#             will have enough to supply the whole table. And may the odds be
+#             ever in your favor."
+# 
+#           Note: added smallest values criteria to task
+#
+#       2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN (*@input) ;
+@input.elems == 0 and @input = 1, 100, 5, 2, 6, 8, 9, 10, 2, 5, 1;
+my @output;
+
+normalize(@input, @output);
+
+say "input:  ", @input;
+say "output: ", @output;
+
+sub normalize (@input, @output) {
+## starting from the smallest value, if the given index value is larger than
+## either of its neighbors, then it is valued in the output to be the larger of
+## its (smaller) neighbors' output plus one. If it is smaller than both it is 1.
+
+    my @order = @input.keys.sort:{ @input[$_] } ; ## order idx by value
+say @order;
+    for @order -> $i {
+        my $min = 1;
+        for 1, -1 -> $Δ {
+            given $i + $Δ {
+                next unless $_ ~~ any @input.keys;          ## ignore out of bounds
+                if @input[$i] > @input[$_] {
+                    $min = (@output[$_] + 1, $min).max;     ## just above max of smaller values
+                }
+            }
+        }
+        @output[$i] = $min;    
+    }
+}
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index 38d837a6d4..9dc58aff15 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -1,247 +1,15 @@
 {
-   "series" : [
-      {
-         "data" : [
-            {
-               "drilldown" : "Abigail",
-               "name" : "Abigail",
-               "y" : 2
-            },
-            {
-               "drilldown" : "Adam Russell",
-               "y" : 3,
-               "name" : "Adam Russell"
-            },
-            {
-               "y" : 2,
-               "name" : "Alexander Pankoff",
-               "drilldown" : "Alexander Pankoff"
-            },
-            {
-               "name" : "Andinus",
-               "y" : 4,
-               "drilldown" : "Andinus"
-            },
-            {
-               "y" : 2,
-               "name" : "Andrew Shitov",
-               "drilldown" : "Andrew Shitov"
-            },
-            {
-               "name" : "Anton Fedotov",
-               "y" : 1,
-               "drilldown" : "Anton Fedotov"
-            },
-            {
-               "y" : 5,
-               "name" : "Arne Sommer",
-               "drilldown" : "Arne Sommer"
-            },
-            {
-               "drilldown" : "Athanasius",
-               "y" : 4,
-               "name" : "Athanasius"
-            },
-            {
-               "drilldown" : "Bob Lied",
-               "y" : 2,
-               "name" : "Bob Lied"
-            },
-            {
-               "y" : 2,
-               "name" : "Cheok-Yin Fung",
-               "drilldown" : "Cheok-Yin Fung"
-            },
-            {
-               "drilldown" : "Colin Crain",
-               "y" : 1,
-               "name" : "Colin Crain"
-            },
-            {
-               "y" : 2,
-               "name" : "Cristina Heredia",
-               "drilldown" : "Cristina Heredia"
-            },
-            {
-               "name" : "Dave Cross",
-               "y" : 2,
-               "drilldown" : "Dave Cross"
-            },
-            {
-               "drilldown" : "Dave Jacoby",
-               "y" : 3,
-               "name" : "Dave Jacoby"
-            },
-            {
-               "y" : 2,
-               "name" : "Duncan C. White",
-               "drilldown" : "Duncan C. White"
-            },
-            {
-               "drilldown" : "E. Choroba",
-               "name" : "E. Choroba",
-               "y" : 2
-            },
-            {
-               "y" : 4,
-               "name" : "Flavio Poletti",
-               "drilldown" : "Flavio Poletti"
-            },
-            {
-               "drilldown" : "James Smith",
-               "name" : "James Smith",
-               "y" : 2
-            },
-            {
-               "drilldown" : "Jan Krnavek",
-               "y" : 2,
-               "name" : "Jan Krnavek"
-            },
-            {
-               "drilldown" : "Jorg Sommrey",
-               "name" : "Jorg Sommrey",
-               "y" : 2
-            },
-            {
-               "y" : 4,
-               "name" : "Julio de Castro",
-               "drilldown" : "Julio de Castro"
-            },
-            {
-               "y" : 4,
-               "name" : "Kang-min Liu",
-               "drilldown" : "Kang-min Liu"
-            },
-            {
-               "drilldown" : "Laurent Rosenfeld",
-               "name" : "Laurent Rosenfeld",
-               "y" : 5
-            },
-            {
-               "drilldown" : "Lubos Kolouch",
-               "y" : 2,
-               "name" : "Lubos Kolouch"
-            },
-            {
-               "drilldown" : "Mark Anderson",
-               "name" : "Mark Anderson",
-               "y" : 2
-            },
-            {
-               "y" : 2,
-               "name" : "Markus Holzer",
-               "drilldown" : "Markus Holzer"
-            },
-            {
-               "name" : "Mohammad S Anwar",
-               "y" : 5,
-               "drilldown" : "Mohammad S Anwar"
-            },
-            {
-               "drilldown" : "Myoungjin Jeon",
-               "y" : 6,
-               "name" : "Myoungjin Jeon"
-            },
-            {
-               "drilldown" : "Niels van Dijke",
-               "name" : "Niels van Dijke",
-               "y" : 2
-            },
-            {
-               "drilldown" : "Nuno Vieira",
-               "y" : 2,
-               "name" : "Nuno Vieira"
-            },
-            {
-               "drilldown" : "Roger Bell_West",
-               "name" : "Roger Bell_West",
-               "y" : 5
-            },
-            {
-               "drilldown" : "Shawn Wagner",
-               "name" : "Shawn Wagner",
-               "y" : 2
-            },
-            {
-               "drilldown" : "Simon Green",
-               "y" : 3,
-               "name" : "Simon Green"
-            },
-            {
-               "y" : 2,
-               "name" : "Simon Proctor",
-               "drilldown" : "Simon Proctor"
-            },
-            {
-               "name" : "Steven Wilson",
-               "y" : 2,
-               "drilldown" : "Steven Wilson"
-            },
-            {
-               "name" : "Ted Leahy",
-               "y" : 2,
-               "drilldown" : "Ted Leahy"
-            },
-            {
-               "drilldown" : "Ulrich Rieke",
-               "y" : 4,
-               "name" : "Ulrich Rieke"
-            },
-            {
-               "name" : "Vinod Kumar K",
-               "y" : 2,
-               "drilldown" : "Vinod Kumar K"
-            },
-            {
-               "drilldown" : "Walt Mankowski",
-               "y" : 3,
-               "name" : "Walt Mankowski"
-            },
-            {
-               "y" : 2,
-               "name" : "Wanderdoc",
-               "drilldown" : "Wanderdoc"
-            }
-         ],
-         "name" : "Perl Weekly Challenge - 080",
-         "colorByPoint" : 1
-      }
-   ],
-   "subtitle" : {
-      "text" : "[Champions: 40] Last updated at 2020-10-04 22:39:13 GMT"
-   },
-   "legend" : {
-      "enabled" : 0
-   },
-   "chart" : {
-      "type" : "column"
-   },
-   "xAxis" : {
-      "type" : "category"
-   },
-   "title" : {
-      "text" : "Perl Weekly Challenge - 080"
-   },
-   "plotOptions" : {
-      "series" : {
-         "dataLabels" : {
-            "enabled" : 1,
-            "format" : "{point.y}"
-         },
-         "borderWidth" : 0
-      }
-   },
    "drilldown" : {
       "series" : [
          {
-            "name" : "Abigail",
             "id" : "Abigail",
             "data" : [
                [
                   "Perl",
                   2
                ]
-            ]
+            ],
+            "name" : "Abigail"
          },
          {
             "data" : [
@@ -254,21 +22,21 @@
                   1
                ]
             ],
-            "id" : "Adam Russell",
-            "name" : "Adam Russell"
+            "name" : "Adam Russell",
+            "id" : "Adam Russell"
          },
          {
+            "id" : "Alexander Pankoff",
+            "name" : "Alexander Pankoff",
             "data" : [
                [
                   "Perl",
                   2
                ]
-            ],
-            "id" : "Alexander Pankoff",
-            "name" : "Alexander Pankoff"
+            ]
          },
          {
-            "name" : "Andinus",
+            "id" : "Andinus",
             "data" : [
                [
                   "Perl",
@@ -279,30 +47,30 @@
                   2
                ]
             ],
-            "id" : "Andinus"
+            "name" : "Andinus"
          },
          {
+            "name" : "Andrew Shitov",
             "data" : [
                [
                   "Raku",
                   2
                ]
             ],
-            "id" : "Andrew Shitov",
-            "name" : "Andrew Shitov"
+            "id" : "Andrew Shitov"
          },
          {
+            "id" : "Anton Fedotov",
             "name" : "Anton Fedotov",
             "data" : [
                [
                   "Perl",
                   1
                ]
-            ],
-            "id" : "Anton Fedotov"
+            ]
          },
          {
-            "name" : "Arne Sommer",
+            "id" : "Arne Sommer",
             "data" : [
                [
                   "Perl",
@@ -317,9 +85,10 @@
                   1
                ]
             ],
-            "id" : "Arne Sommer"
+            "name" : "Arne Sommer"
          },
          {
+            "id" : "Athanasius",
             "name" : "Athanasius",
             "data" : [
                [
@@ -330,22 +99,21 @@
                   "Raku",
                   2
                ]
-            ],
-            "id" : "Athanasius"
+            ]
          },
          {
-            "name" : "Bob Lied",
             "id" : "Bob Lied",
             "data" : [
                [
                   "Perl",
                   2
                ]
-            ]
+            ],
+            "name" : "Bob Lied"
          },
          {
-            "name" : "Cheok-Yin Fung",
             "id" : "Cheok-Yin Fung",
+            "name" : "Cheok-Yin Fung",
             "data" : [
                [
                   "Perl",
@@ -354,37 +122,46 @@
             ]
          },
          {
-            "name" : "Colin Crain",
             "data" : [
                [
+                  "Perl",
+                  2
+               ],
+               [
+                  "Raku",
+                  2
+               ],
+               [
                   "Blog",
                   1
                ]
             ],
+            "name" : "Colin Crain",
             "id" : "Colin Crain"
          },
          {
-            "name" : "Cristina Heredia",
             "id" : "Cristina Heredia",
             "data" : [
                [
                   "Perl",
                   2
                ]
-            ]
+            ],
+            "name" : "Cristina Heredia"
          },
          {
-            "name" : "Dave Cross",
             "data" : [
                [
                   "Perl",
                   2
                ]
             ],
+            "name" : "Dave Cross",
             "id" : "Dave Cross"
          },
          {
             "id" : "Dave Jacoby",
+            "name" : "Dave Jacoby",
             "data" : [
                [
                   "Perl",
@@ -394,22 +171,21 @@
                   "Blog",
                   1
                ]
-            ],
-            "name" : "Dave Jacoby"
+            ]
          },
          {
+            "name" : "Duncan C. White",
             "data" : [
                [
                   "Perl",
                   2
                ]
             ],
-            "id" : "Duncan C. White",
-            "name" : "Duncan C. White"
+            "id" : "Duncan C. White"
          },
          {
-            "name" : "E. Choroba",
             "id" : "E. Choroba",
+            "name" : "E. Choroba",
             "data" : [
                [
                   "Perl",
@@ -419,7 +195,6 @@
          },
          {
             "name" : "Flavio Poletti",
-            "id" : "Flavio Poletti",
             "data" : [
                [
                   "Perl",
@@ -429,27 +204,28 @@
                   "Blog",
                   2
                ]
-            ]
+            ],
+            "id" : "Flavio Poletti"
          },
          {
+            "id" : "James Smith",
+            "name" : "James Smith",
             "data" : [
                [
                   "Perl",
                   2
                ]
-            ],
-            "id" : "James Smith",
-            "name" : "James Smith"
+            ]
          },
          {
-            "id" : "Jan Krnavek",
+            "name" : "Jan Krnavek",
             "data" : [
                [
                   "Raku",
                   2
                ]
             ],
-            "name" : "Jan Krnavek"
+            "id" : "Jan Krnavek"
          },
          {
             "id" : "Jorg Sommrey",
@@ -463,6 +239,7 @@
          },
          {
             "id" : "Julio de Castro",
+            "name" : "Julio de Castro",
             "data" : [
                [
                   "Perl",
@@ -472,11 +249,9 @@
                   "Raku",
                   2
                ]
-            ],
-            "name" : "Julio de Castro"
+            ]
          },
          {
-            "name" : "Kang-min Liu",
             "data" : [
                [
                   "Perl",
@@ -487,10 +262,10 @@
                   2
                ]
             ],
+            "name" : "Kang-min Liu",
             "id" : "Kang-min Liu"
          },
          {
-            "id" : "Laurent Rosenfeld",
             "data" : [
                [
                   "Perl",
@@ -505,16 +280,17 @@
                   1
                ]
             ],
-            "name" : "Laurent Rosenfeld"
+            "name" : "Laurent Rosenfeld",
+            "id" : "Laurent Rosenfeld"
          },
          {
+            "id" : "Lubos Kolouch",
             "data" : [
                [
                   "Perl",
                   2
                ]
             ],
-            "id" : "Lubos Kolouch",
             "name" : "Lubos Kolouch"
          },
          {
@@ -524,21 +300,20 @@
                   2
                ]
             ],
-            "id" : "Mark Anderson",
-            "name" : "Mark Anderson"
+            "name" : "Mark Anderson",
+            "id" : "Mark Anderson"
          },
          {
-            "name" : "Markus Holzer",
+            "id" : "Markus Holzer",
             "data" : [
                [
                   "Raku",
                   2
                ]
             ],
-            "id" : "Markus Holzer"
+            "name" : "Markus Holzer"
          },
          {
-            "name" : "Mohammad S Anwar",
             "data" : [
                [
                   "Perl",
@@ -553,10 +328,10 @@
                   1
                ]
             ],
+            "name" : "Mohammad S Anwar",
             "id" : "Mohammad S Anwar"
          },
          {
-            "name" : "Myoungjin Jeon",
             "data" : [
                [
                   "Perl",
@@ -571,30 +346,30 @@
                   2
                ]
             ],
+            "name" : "Myoungjin Jeon",
             "id" : "Myoungjin Jeon"
          },
          {
-            "id" : "Niels van Dijke",
+            "name" : "Niels van Dijke",
             "data" : [
                [
                   "Perl",
                   2
                ]
             ],
-            "name" : "Niels van Dijke"
+            "id" : "Niels van Dijke"
          },
          {
+            "id" : "Nuno Vieira",
             "name" : "Nuno Vieira",
             "data" : [
                [
                   "Perl",
                   2
                ]
-            ],
-            "id" : "Nuno Vieira"
+            ]
          },
          {
-            "name" : "Roger Bell_West",
             "id" : "Roger Bell_West",
             "data" : [
                [
@@ -609,11 +384,12 @@
                   "Blog",
                   1
                ]
-            ]
+            ],
+            "name" : "Roger Bell_West"
          },
          {
-            "name" : "Shawn Wagner",
             "id" : "Shawn Wagner",
+            "name" : "Shawn Wagner",
             "data" : [
                [
                   "Perl",
@@ -622,6 +398,8 @@