aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--challenge-082/colin-crain/perl/ch-1.pl86
-rw-r--r--challenge-082/colin-crain/perl/ch-2.pl124
-rw-r--r--challenge-082/colin-crain/raku/ch-1.raku77
-rw-r--r--challenge-082/colin-crain/raku/ch-2.raku75
-rw-r--r--stats/pwc-current.json356
-rw-r--r--stats/pwc-language-breakdown-summary.json70
-rw-r--r--stats/pwc-language-breakdown.json1164
-rw-r--r--stats/pwc-leaders.json708
-rw-r--r--stats/pwc-summary-1-30.json110
-rw-r--r--stats/pwc-summary-121-150.json112
-rw-r--r--stats/pwc-summary-151-180.json46
-rw-r--r--stats/pwc-summary-181-210.json78
-rw-r--r--stats/pwc-summary-31-60.json114
-rw-r--r--stats/pwc-summary-61-90.json52
-rw-r--r--stats/pwc-summary-91-120.json38
-rw-r--r--stats/pwc-summary.json440
16 files changed, 2010 insertions, 1640 deletions
diff --git a/challenge-082/colin-crain/perl/ch-1.pl b/challenge-082/colin-crain/perl/ch-1.pl
new file mode 100644
index 0000000000..3cf9a0516b
--- /dev/null
+++ b/challenge-082/colin-crain/perl/ch-1.pl
@@ -0,0 +1,86 @@
+#! /opt/local/bin/perl
+#
+# factor_hardly_knew_her.pl
+#
+# TASK #1 › Common Factors
+# Submitted by: Niels van Dijke
+# You are given 2 positive numbers $M and $N.
+#
+# Write a script to list all common factors of the given numbers.
+#
+# Example 1:
+# Input:
+# $M = 12
+# $N = 18
+#
+# Output:
+# (1, 2, 3, 6)
+#
+# Explanation:
+# Factors of 12: 1, 2, 3, 4, 6
+# Factors of 18: 1, 2, 3, 6, 9
+#
+# Example 2:
+# Input:
+# $M = 18
+# $N = 23
+#
+# Output:
+# (1)
+#
+# Explanation:
+# Factors of 18: 1, 2, 3, 6, 9
+# Factors of 23: 1
+#
+# method:
+# When a number is said to be a factor of another number, the
+# meaning is that number times another number will equal the third.
+# Reciprocally, both the number tested and the multiplier are both
+# factors of third.
+#
+# As such when factoring, we need only check for numbers up to the
+# square root of our target, if, when we find a pair of numbers that
+# fit, we log both to out result list.
+#
+# Once we have the factors for one of our numbers, the best way to
+# determine the common elements between two arrays (when we don't
+# care about duplicates) is to use a hash. The factors of the first
+# input number are hashed and the the sorted list of factors for the
+# second number are filtered for presence in the hash before being
+# output.
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+
+## ## ## ## ## MAIN:
+
+my $M = shift || 1440;
+my $N = shift || 1530;
+
+my %lookup = map { $_ => undef } factor($M);
+my @out = grep { exists $lookup{$_} } sort {$a-$b} factor($N);
+
+say "input :\n\tN = $N\n\tM = $M";
+say "output: ( @out )";
+
+
+## ## ## ## ## SUBS:
+
+sub factor {
+ my $num = shift;
+ my @out;
+ my $sq = int sqrt $num;
+ for (1..$sq) {
+ if ($num % $_ == 0) {
+ push @out, $_;
+ push @out, $num / $_ unless $_**2 == $num;
+ }
+ }
+ return @out;
+} \ No newline at end of file
diff --git a/challenge-082/colin-crain/perl/ch-2.pl b/challenge-082/colin-crain/perl/ch-2.pl
new file mode 100644
index 0000000000..8c07680219
--- /dev/null
+++ b/challenge-082/colin-crain/perl/ch-2.pl
@@ -0,0 +1,124 @@
+#! /opt/local/bin/perl
+#
+# ab_interneg.pl
+#
+# TASK #2 › Interleave String
+# Submitted by: Mohammad S Anwar
+# You are given 3 strings; $A, $B and $C.
+#
+# Write a script to check if $C is created by interleave $A and $B.
+#
+# Print 1 if check is success otherwise 0.
+#
+# Example 1:
+# Input:
+# $A = "XY"
+# $B = "X"
+# $C = "XXY"
+#
+# Output: 1
+# EXPLANATION
+# "X" (from $B) + "XY" (from $A) = $C
+#
+# Example 2:
+# Input:
+# $A = "XXY"
+# $B = "XXZ"
+# $C = "XXXXZY"
+#
+# Output: 1
+# EXPLANATION
+# "XX" (from $A) + "XXZ" (from $B) + "Y" (from $A) = $C
+#
+# Example 3:
+# Input:
+# $A = "YX"
+# $B = "X"
+# $C = "XXY"
+#
+# Output: 0
+#
+# METHOD:
+# This is a really interesting problem. At first look it has
+# presents a very complex solution space, but because all of the
+# strings maintain their ordering throughout the actual decision
+# making never gets beyond binary choices. The key to cracking
+# it is to entertain a complete idea of what "interleaving" is.
+#
+# Interleaving is the process of taking two strings and, from
+# the beginnings of both, selecting and gathering partitions of
+# first one string and then the other, assembling a constructed
+# third string from the two until all characters from both
+# inputs are utilized.
+#
+# Ok, but what does that mean to us?
+#
+# If we start with the two strings, we are given the choice to
+# take the first letter from either string to begin our common
+# concatenation. After that character is added, we are given the
+# choice of continuing to add the next letter from our string or
+# switch and add the first letter from the other string. When a
+# letter is selected, the position to be added next from that
+# string is advanced; if one string becomes exhausted, the
+# assembly continues with the last part of the remaining string.
+# The process continues until there are no more options for
+# characters to be added.
+#
+# Practically, we can physically remove letters from the strings
+# as we use them, which lightens the bookkeeping load. This
+# includes the target string we're validating; when a character
+# is chosen that letter is removed from the remaining string
+# left to match. We don't need to keep a record of the string
+# we're assembling, because if we run out of letters between our
+# two input strings and the target simultaniously we've matched
+# our last letter. The interleaving is has been successful, and
+# we already know what the result looks like.
+#
+
+#
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+no warnings 'recursion';
+
+## ## ## ## ## MAIN:
+
+my $VERBOSE = 1;
+
+my ($A, $B, $C) = @_;
+
+## let's not bother with command line input this time, shall we?
+$A = "AXXZ";
+$B = "XXYZ";
+$C = "AXXYXZXZ";
+say 0 and exit if length($A)+length($B)!=length($C);
+
+say interleave($A, $B, $C);
+
+## ## ## ## ## SUBS:
+
+sub interleave {
+ my ($A, $B, $C) = @_;
+ say "A $A \nB $B \nC $C\n" if $VERBOSE;
+
+ return 1 unless ( $A or $B or $C ); ## we've used all our letters
+
+ for ($A,$B) {
+ if (substr($_, 0, 1) eq substr($C, 0, 1) ) {
+ my $taken = substr $_, 1;
+ my $other = $_ eq $A ? $B : $A;
+ my $target = substr $C, 1;
+ say "took ", substr($_, 0, 1), " target now $target\n" if $VERBOSE;
+ return 1 if interleave($taken, $other, $target);
+ }
+ }
+ say "backtracking..." if $VERBOSE;
+
+ return 0;
+} \ No newline at end of file
diff --git a/challenge-082/colin-crain/raku/ch-1.raku b/challenge-082/colin-crain/raku/ch-1.raku
new file mode 100644
index 0000000000..d6ab95481f
--- /dev/null
+++ b/challenge-082/colin-crain/raku/ch-1.raku
@@ -0,0 +1,77 @@
+#!/usr/bin/env perl6
+#
+#
+# factor_hardly_knew_her.raku
+#
+# TASK #1 › Common Factors
+# Submitted by: Niels van Dijke
+# You are given 2 positive numbers $M and $N.
+#
+# Write a script to list all common factors of the given numbers.
+#
+# Example 1:
+# Input:
+# $M = 12
+# $N = 18
+#
+# Output:
+# (1, 2, 3, 6)
+#
+# Explanation:
+# Factors of 12: 1, 2, 3, 4, 6
+# Factors of 18: 1, 2, 3, 6, 9
+#
+# Example 2:
+# Input:
+# $M = 18
+# $N = 23
+#
+# Output:
+# (1)
+#
+# Explanation:
+# Factors of 18: 1, 2, 3, 6, 9
+# Factors of 23: 1
+#
+# method:
+# When a number is said to be a factor of another number, the
+# meaning is that number times another number will equal the third.
+# Reciprocally, both the number tested and the multiplier are both
+# factors of third.
+#
+# As such when factoring, we need only check for numbers up to the
+# square root of our target, if, when we find a pair of numbers that
+# fit, we log both to out result list.
+#
+# Once we have the factors for one of our numbers, the best way to
+# determine the common elements between two arrays (when we don't
+# care about duplicates) is to use a hash. The factors of the first
+# input number are hashed and the the sorted list of factors for the
+# second number are filtered for presence in the hash before being
+# output.
+#
+#
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN (Int $M = 18, Int $N = 36) ;
+
+my %bag = bag factor($M);
+my @out = factor($N).unique
+ .sort
+ .grep: {%bag{$_}:exists};
+
+say "input :\n\tM = $M\n\tN = $N";
+say "output : ", @out;
+
+sub factor (Int $num) {
+ gather {
+ for (1..$num.sqrt.Int).grep({$num %% $_}) {
+ take $_;
+ take $num div $_;
+ }
+ }
+}
diff --git a/challenge-082/colin-crain/raku/ch-2.raku b/challenge-082/colin-crain/raku/ch-2.raku
new file mode 100644
index 0000000000..cac6a3f7bf
--- /dev/null
+++ b/challenge-082/colin-crain/raku/ch-2.raku
@@ -0,0 +1,75 @@
+#!/usr/bin/env perl6
+#
+#
+# ab_interneg.raku
+#
+# TASK #2 › Interleave String
+# Submitted by: Mohammad S Anwar
+# You are given 3 strings; $A, $B and $C.
+#
+# Write a script to check if $C is created by interleave $A and $B.
+#
+# Print 1 if check is success otherwise 0.
+#
+# Example 1:
+# Input:
+# $A = "XY"
+# $B = "X"
+# $C = "XXY"
+#
+# Output: 1
+# EXPLANATION
+# "X" (from $B) + "XY" (from $A) = $C
+#
+# Example 2:
+# Input:
+# $A = "XXY"
+# $B = "XXZ"
+# $C = "XXXXZY"
+#
+# Output: 1
+# EXPLANATION
+# "XX" (from $A) + "XXZ" (from $B) + "Y" (from $A) = $C
+#
+# Example 3:
+# Input:
+# $A = "YX"
+# $B = "X"
+# $C = "XXY"
+#
+# Output: 0
+#
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN (Str $A = "AXXZ", Str $B = "XXYZ", Str $C = "AXXYXZXZ") ;
+
+my $VERBOSE = True; ## visually examine progress
+
+say 0 and exit if $A.chars + $B.chars != $C.chars;
+
+say "\noutput: ", interleave($A, $B, $C);
+
+
+## ## ## ## ## SUBS:
+
+sub interleave (Str $A, Str $B, Str $C) {
+
+ say "\nA $A \nB $B \nC $C" if $VERBOSE;
+
+ return 1 unless any( $A, $B, $C ); ## we've used all our letters
+
+ for $A,$B {
+ when $_.starts-with: $C.substr(0, 1) {
+ my $taken = $_.substr(1);
+ my $other = $_ eq $A ?? $B !! $A;
+ my $target = $C.substr(1);
+ say "took " ~ $_.substr(0, 1) ~ " target now $target" if $VERBOSE;
+ return 1 if interleave($taken, $other, $target);
+ }
+ }
+ return 0;
+}
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index 1ffa5becbd..37ec97482b 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -1,25 +1,43 @@
{
- "tooltip" : {
- "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>",
- "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>",
- "followPointer" : 1
+ "yAxis" : {
+ "title" : {
+ "text" : "Total Solutions"
+ }
+ },
+ "title" : {
+ "text" : "Perl Weekly Challenge - 082"
},
"legend" : {
"enabled" : 0
},
+ "tooltip" : {
+ "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>",
+ "followPointer" : 1,
+ "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>"
+ },
+ "plotOptions" : {
+ "series" : {
+ "borderWidth" : 0,
+ "dataLabels" : {
+ "format" : "{point.y}",
+ "enabled" : 1
+ }
+ }
+ },
+ "xAxis" : {
+ "type" : "category"
+ },
"series" : [
{
- "name" : "Perl Weekly Challenge - 082",
- "colorByPoint" : 1,
"data" : [
{
- "name" : "Abigail",
"y" : 4,
- "drilldown" : "Abigail"
+ "drilldown" : "Abigail",
+ "name" : "Abigail"
},
{
- "name" : "Adam Russell",
"drilldown" : "Adam Russell",
+ "name" : "Adam Russell",
"y" : 3
},
{
@@ -28,109 +46,109 @@
"y" : 2
},
{
+ "name" : "Andinus",
"drilldown" : "Andinus",
- "y" : 2,
- "name" : "Andinus"
+ "y" : 2
},
{
- "name" : "Andrew Shitov",
"y" : 2,
+ "name" : "Andrew Shitov",
"drilldown" : "Andrew Shitov"
},
{
- "name" : "Arne Sommer",
"y" : 3,
+ "name" : "Arne Sommer",
"drilldown" : "Arne Sommer"
},
{
- "y" : 4,
+ "name" : "Athanasius",
"drilldown" : "Athanasius",
- "name" : "Athanasius"
+ "y" : 4
},
{
"y" : 2,
- "drilldown" : "Bob Lied",
- "name" : "Bob Lied"
+ "name" : "Bob Lied",
+ "drilldown" : "Bob Lied"
},
{
- "name" : "Cheok-Yin Fung",
"y" : 2,
- "drilldown" : "Cheok-Yin Fung"
+ "drilldown" : "Cheok-Yin Fung",
+ "name" : "Cheok-Yin Fung"
},
{
+ "y" : 5,
"name" : "Colin Crain",
- "drilldown" : "Colin Crain",
- "y" : 1
+ "drilldown" : "Colin Crain"
},
{
"name" : "Cristina Heredia",
- "y" : 1,
- "drilldown" : "Cristina Heredia"
+ "drilldown" : "Cristina Heredia",
+ "y" : 1
},
{
- "name" : "Dave Cross",
+ "y" : 2,
"drilldown" : "Dave Cross",
- "y" : 2
+ "name" : "Dave Cross"
},
{
- "y" : 3,
"drilldown" : "Dave Jacoby",
- "name" : "Dave Jacoby"
+ "name" : "Dave Jacoby",
+ "y" : 3
},
{
"drilldown" : "Dieter Dobbelaere",
- "y" : 2,
- "name" : "Dieter Dobbelaere"
+ "name" : "Dieter Dobbelaere",
+ "y" : 2
},
{
"name" : "Duncan C. White",
- "y" : 2,
- "drilldown" : "Duncan C. White"
+ "drilldown" : "Duncan C. White",
+ "y" : 2
},
{
- "name" : "E. Choroba",
+ "y" : 2,
"drilldown" : "E. Choroba",
- "y" : 2
+ "name" : "E. Choroba"
},
{
"name" : "Feng Chang",
- "y" : 2,
- "drilldown" : "Feng Chang"
+ "drilldown" : "Feng Chang",
+ "y" : 2
},
{
"drilldown" : "Flavio Poletti",
- "y" : 5,
- "name" : "Flavio Poletti"
+ "name" : "Flavio Poletti",
+ "y" : 5
},
{
+ "drilldown" : "Jaldhar H. Vyas",
"name" : "Jaldhar H. Vyas",
- "y" : 5,
- "drilldown" : "Jaldhar H. Vyas"
+ "y" : 5
},
{
+ "name" : "Jan Krnavek",
"drilldown" : "Jan Krnavek",
- "y" : 2,
- "name" : "Jan Krnavek"
+ "y" : 2
},
{
+ "y" : 2,
"name" : "Jorg Sommrey",
- "drilldown" : "Jorg Sommrey",
- "y" : 2
+ "drilldown" : "Jorg Sommrey"
},
{
+ "drilldown" : "Jose Luis",
"name" : "Jose Luis",
- "y" : 2,
- "drilldown" : "Jose Luis"
+ "y" : 2
},
{
"y" : 4,
- "drilldown" : "Julio de Castro",
- "name" : "Julio de Castro"
+ "name" : "Julio de Castro",
+ "drilldown" : "Julio de Castro"
},
{
- "y" : 4,
"drilldown" : "Kang-min Liu",
- "name" : "Kang-min Liu"
+ "name" : "Kang-min Liu",
+ "y" : 4
},
{
"name" : "Lars Thegler",
@@ -138,107 +156,105 @@
"y" : 2
},
{
- "drilldown" : "Laurent Rosenfeld",
"y" : 3,
- "name" : "Laurent Rosenfeld"
+ "name" : "Laurent Rosenfeld",
+ "drilldown" : "Laurent Rosenfeld"
},
{
- "drilldown" : "Lubos Kolouch",
"y" : 2,
- "name" : "Lubos Kolouch"
+ "name" : "Lubos Kolouch",
+ "drilldown" : "Lubos Kolouch"
},
{
+ "drilldown" : "Mark Anderson",
"name" : "Mark Anderson",
- "y" : 2,
- "drilldown" : "Mark Anderson"
+ "y" : 2
},
{
- "name" : "Markus Holzer",
"drilldown" : "Markus Holzer",
+ "name" : "Markus Holzer",
"y" : 2
},
{
- "drilldown" : "Myoungjin Jeon",
"y" : 6,
- "name" : "Myoungjin Jeon"
+ "name" : "Myoungjin Jeon",
+ "drilldown" : "Myoungjin Jeon"
},
{
- "y" : 2,
+ "name" : "Niels van Dijke",
"drilldown" : "Niels van Dijke",
- "name" : "Niels van Dijke"
+ "y" : 2
},
{
"name" : "Nuno Vieira",
- "y" : 2,
- "drilldown" : "Nuno Vieira"
+ "drilldown" : "Nuno Vieira",
+ "y" : 2
},
{
+ "name" : "Pete Houston",
"drilldown" : "Pete Houston",
- "y" : 2,
- "name" : "Pete Houston"
+ "y" : 2
},
{
- "y" : 2,
+ "name" : "Philip Hood",
"drilldown" : "Philip Hood",
- "name" : "Philip Hood"
+ "y" : 2
},
{
- "name" : "Roger Bell_West",
+ "y" : 5,
"drilldown" : "Roger Bell_West",
- "y" : 5
+ "name" : "Roger Bell_West"
},
{
- "name" : "Simon Green",
"drilldown" : "Simon Green",
+ "name" : "Simon Green",
"y" : 3
},
{
"y" : 2,
- "drilldown" : "Simon Proctor",
- "name" : "Simon Proctor"
+ "name" : "Simon Proctor",
+ "drilldown" : "Simon Proctor"
},
{
- "drilldown" : "Steven Wilson",
"y" : 1,
+ "drilldown" : "Steven Wilson",
"name" : "Steven Wilson"
},
{
- "drilldown" : "Ulrich Rieke",
"y" : 4,
- "name" : "Ulrich Rieke"
+ "name" : "Ulrich Rieke",
+ "drilldown" : "Ulrich Rieke"
},
{
- "drilldown" : "Vinod Kumar K",
"y" : 1,
+ "drilldown" : "Vinod Kumar K",
"name" : "Vinod Kumar K"
},
{
"name" : "Walt Mankowski",
- "y" : 3,
- "drilldown" : "Walt Mankowski"
+ "drilldown" : "Walt Mankowski",
+ "y" : 3
},
{
"y" : 1,
- "drilldown" : "Wanderdoc",
- "name" : "Wanderdoc"
+ "name" : "Wanderdoc",
+ "drilldown" : "Wanderdoc"
}
- ]
+ ],
+ "colorByPoint" : 1,
+ "name" : "Perl Weekly Challenge - 082"
}
],
- "yAxis" : {
- "title" : {
- "text" : "Total Solutions"
- }
+ "subtitle" : {
+ "text" : "[Champions: 42] Last updated at 2020-10-19 00:19:00 GMT"
},
"chart" : {
"type" : "column"
},
- "xAxis" : {
- "type" : "category"
- },
"drilldown" : {
"series" : [
{
+ "id" : "Abigail",
"data" : [
[
"Perl",
@@ -249,11 +265,9 @@
2
]
],
- "name" : "Abigail",
- "id" : "Abigail"
+ "name" : "Abigail"
},
{
- "id" : "Adam Russell",
"data" : [
[
"Perl",
@@ -264,20 +278,21 @@
1
]
],
+ "id" : "Adam Russell",
"name" : "Adam Russell"
},
{
+ "id" : "Alexander Pankoff",
"data" : [
[
"Perl",
2
]
],
- "name" : "Alexander Pankoff",
- "id" : "Alexander Pankoff"
+ "name" : "Alexander Pankoff"
},
{
- "id" : "Andinus",
+ "name" : "Andinus",
"data" : [
[
"Perl",
@@ -288,20 +303,20 @@
1
]
],
- "name" : "Andinus"
+ "id" : "Andinus"
},
{
- "id" : "Andrew Shitov",
"data" : [
[
"Raku",
2
]
],
+ "id" : "Andrew Shitov",
"name" : "Andrew Shitov"
},
{
- "name" : "Arne Sommer",
+ "id" : "Arne Sommer",
"data" : [
[
"Raku",
@@ -312,11 +327,10 @@
1
]
],
- "id" : "Arne Sommer"
+ "name" : "Arne Sommer"
},
{
"id" : "Athanasius",
- "name" : "Athanasius",
"data" : [
[
"Perl",
@@ -326,37 +340,46 @@
"Raku",
2
]
- ]
+ ],
+ "name" : "Athanasius"
},
{
"name" : "Bob Lied",
+ "id" : "Bob Lied",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Bob Lied"
+ ]
},
{
"name" : "Cheok-Yin Fung",
+ "id" : "Cheok-Yin Fung",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Cheok-Yin Fung"
+ ]
},
{
+ "name" : "Colin Crain",
"id" : "Colin Crain",
"data" : [
[
+ "Perl",
+ 2
+ ],
+ [
+ "Raku",
+ 2
+ ],
+ [
"Blog",
1
]
- ],
- "name" : "Colin Crain"
+ ]
},
{
"name" : "Cristina Heredia",
@@ -369,17 +392,16 @@
"id" : "Cristina Heredia"
},
{
- "id" : "Dave Cross",
+ "name" : "Dave Cross",
"data" : [
[
"Perl",
2
]
],
- "name" : "Dave Cross"
+ "id" : "Dave Cross"
},
{
- "name" : "Dave Jacoby",
"data" : [
[
"Perl",
@@ -390,17 +412,18 @@
1
]
],
- "id" : "Dave Jacoby"
+ "id" : "Dave Jacoby",
+ "name" : "Dave Jacoby"
},
{
"name" : "Dieter Dobbelaere",
+ "id" : "Dieter Dobbelaere",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Dieter Dobbelaere"
+ ]
},
{
"data" : [
@@ -409,22 +432,22 @@
2
]
],
- "name" : "Duncan C. White",
- "id" : "Duncan C. White"
+ "id" : "Duncan C. White",
+ "name" : "Duncan C. White"
},
{
+ "name" : "E. Choroba",
+ "id" : "E. Choroba",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "E. Choroba",
- "id" : "E. Choroba"
+ ]
},
{
- "id" : "Feng Chang",
"name" : "Feng Chang",
+ "id" : "Feng Chang",
"data" : [
[
"Raku",
@@ -433,8 +456,8 @@
]
},
{
- "id" : "Flavio Poletti",
"name" : "Flavio Poletti",
+ "id" : "Flavio Poletti",
"data" : [
[
"Perl",
@@ -447,7 +470,7 @@
]
},
{
- "name" : "Jaldhar H. Vyas",
+ "id" : "Jaldhar H. Vyas",
"data" : [
[
"Perl",
@@ -462,37 +485,37 @@
1
]
],
- "id" : "Jaldhar H. Vyas"
+ "name" : "Jaldhar H. Vyas"
},
{
- "id" : "Jan Krnavek",
"data" : [
[
"Raku",
2
]
],
+ "id" : "Jan Krnavek",
"name" : "Jan Krnavek"
},
{
- "id" : "Jorg Sommrey",
+ "name" : "Jorg Sommrey",
"data" : [
[
"Perl",
2
]
],
- "name" : "Jorg Sommrey"
+ "id" : "Jorg Sommrey"
},
{
+ "name" : "Jose Luis",
+ "id" : "Jose Luis",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "Jose Luis",
- "id" : "Jose Luis"
+ ]
},
{
"name" : "Julio de Castro",
@@ -529,11 +552,11 @@
2
]
],
- "name" : "Lars Thegler",
- "id" : "Lars Thegler"
+ "id" : "Lars Thegler",
+ "name" : "Lars Thegler"
},
{
- "id" : "Laurent Rosenfeld",
+ "name" : "Laurent Rosenfeld",
"data" : [
[
"Perl",
@@ -548,11 +571,11 @@
1
]
],
- "name" : "Laurent Rosenfeld"
+ "id" : "Laurent Rosenfeld"
},
{
- "id" : "Lubos Kolouch",
"name" : "Lubos Kolouch",
+ "id" : "Lubos Kolouch",
"data" : [
[
"Perl",
@@ -561,8 +584,8 @@
]
},
{
- "id" : "Mark Anderson",
"name" : "Mark Anderson",
+ "id" : "Mark Anderson",
"data" : [
[
"Raku",
@@ -571,16 +594,17 @@
]
},
{
+ "name" : "Markus Holzer",
"id" : "Markus Holzer",
"data" : [
[
"Raku",
2
]
- ],
-