aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMohammad S Anwar <mohammad.anwar@yahoo.com>2020-12-28 00:28:25 +0000
committerMohammad S Anwar <mohammad.anwar@yahoo.com>2020-12-28 00:28:25 +0000
commitbe57cd48cb2f0ef93e29359f1d00bc2f225ec115 (patch)
tree9bc8b7b004c0259f8ff236cea43f2a245a00d94f
parent4c94778ad4409120c57cd216d9fed3e025c97d67 (diff)
downloadperlweeklychallenge-club-be57cd48cb2f0ef93e29359f1d00bc2f225ec115.tar.gz
perlweeklychallenge-club-be57cd48cb2f0ef93e29359f1d00bc2f225ec115.tar.bz2
perlweeklychallenge-club-be57cd48cb2f0ef93e29359f1d00bc2f225ec115.zip
- Added solutions by Colin Crain.
Diffstat
-rw-r--r--challenge-092/colin-crain/blog.txt1
-rw-r--r--challenge-092/colin-crain/perl/ch-1.pl152
-rw-r--r--challenge-092/colin-crain/perl/ch-2.pl144
-rw-r--r--challenge-092/colin-crain/raku/ch-1.raku58
-rw-r--r--stats/pwc-current.json579
-rw-r--r--stats/pwc-language-breakdown-summary.json70
-rw-r--r--stats/pwc-language-breakdown.json1330
-rw-r--r--stats/pwc-leaders.json390
-rw-r--r--stats/pwc-summary-1-30.json48
-rw-r--r--stats/pwc-summary-121-150.json108
-rw-r--r--stats/pwc-summary-151-180.json40
-rw-r--r--stats/pwc-summary-181-210.json102
-rw-r--r--stats/pwc-summary-211-240.json58
-rw-r--r--stats/pwc-summary-31-60.json114
-rw-r--r--stats/pwc-summary-61-90.json112
-rw-r--r--stats/pwc-summary-91-120.json32
-rw-r--r--stats/pwc-summary.json482
17 files changed, 2099 insertions, 1721 deletions
diff --git a/challenge-092/colin-crain/blog.txt b/challenge-092/colin-crain/blog.txt
new file mode 100644
index 0000000000..a66f21edfc
--- /dev/null
+++ b/challenge-092/colin-crain/blog.txt
@@ -0,0 +1 @@
+https://colincrain.com/2020/12/27/my-lava-lamp-pulsates-in-harmony-with-the-string-section/
diff --git a/challenge-092/colin-crain/perl/ch-1.pl b/challenge-092/colin-crain/perl/ch-1.pl
new file mode 100644
index 0000000000..2d890bf27b
--- /dev/null
+++ b/challenge-092/colin-crain/perl/ch-1.pl
@@ -0,0 +1,152 @@
+#! /opt/local/bin/perl
+#
+# harmonic_string_section.pl
+#
+# TASK #1 › Isomorphic Strings
+# Submitted by: Mohammad S Anwar
+# You are given two strings $A and $B.
+#
+# Write a script to check if the given strings are
+# Isomorphic. Print 1 if they are otherwise 0.
+#
+# Example 1:
+# Input: $A = "abc"; $B = "xyz"
+# Output: 1
+# Example 2:
+# Input: $A = "abb"; $B = "xyy"
+# Output: 1
+# Example 3:
+# Input: $A = "sum"; $B = "add"
+# Output: 0
+
+# method:
+
+# From the link provided: "Two strings are isomorphic if one-to-one
+# mapping is possible for every character of the first string to
+# every character of the second string." They then provide an
+# example of isomorphism, with the two strings “ACAB” and “XCXY”.
+#
+# Being acutely aware, at this point, of how the ambiguities arising
+# from written speech can confound seemingly innoculous definitions,
+# I immediately set to consider exactly what was being asked of us.
+#
+# Specifically, what do we mean by a "one-to-one" mapping?
+#
+# Generally, this means there exists a function that for every
+# character in string A, outputs one and only one character from
+# string B. Such a fucntion is known as an *injective* function.
+#
+# But there is a second qualifier buried in the wording: "*every*
+# character of the second string". We can take this to mean that
+# there are no characters in string B that are not mapped to by some
+# character in string A. Such a function is called "surjective".
+#
+# The two terms are not exclusiove: a function that is both
+# injective and surjective is known as "bijective". This is what is
+# being referred to; the relationship is also known as "one-to-one
+# onto".
+#
+# Or so it seems. Although not stated, the positions of the
+# characters within the strings are important to the correspondence.
+# For example, what of the two strings "abb" and "yyx"? If "a" maps to
+# "x" and "b" maps to "y" these would seems to fit the definition. A
+# little sleuthing suggests it does not, however, and so the
+# definition should be amended to "if at each position in the first
+# string an injective mapping can be made to the character in the
+# corresponding position in the second string".
+#
+# The terms "injection", "surjection" and "bijection" apply to sets,
+# and we are adressing ordered sets here. The language can still be
+# used, but requires qualification.
+#
+# We're almost done, but not quite.
+#
+# When we speak of a function that maps A → B, what of B → A? Is it
+# the same function? A bijective function is known as "invertable",
+# that is the one-t0-one correspondence goes both ways, but the
+# function to invert is not likely to be the same mapping, except in
+# trivial cases such f(x) = x ∀ x. The inverted function will be
+# related, but the output of the first function, when fed to the
+# second, will return the original input to the first. If we were to
+# give the original input to the scond function, the output would
+# not be immediately predictable.
+#
+#
+# So with definitions out of the way, how do we do this?
+#
+# We need to walk the first string position by position. If the
+# character has not been seen yet, we add it to a hash that points
+# to the the corresponding letter in string B. If that letter has
+# already been seen in that string, then it has been allocated to
+# another and this love affair is over. If the letter in A has been
+# seen, it is validated be pointing to the same letter that it was
+# before. If not, again we fail.
+#
+# Working across we assume success unless we fail by one of the two
+# methods. If we get to the end, the required mapping exists and the
+# two strings are isometric.
+#
+# We don't need to store the values for the invert function hash —
+# we don't need to actually use the function. The logic demands that
+# to establish a new key-value pair for the forward mapping both
+# values need to be heretofore unseen, so a simple check for
+# existence of the invert hash key is all we need from it.
+#
+
+
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+
+sub check_iso {
+ my ($str_A, $str_B) = @_;
+ return 0 if length $str_A != length $str_B;
+
+ my (%forward, %invert);
+ for (0..length $str_A) {
+ my $char_A = substr $str_A, $_, 1;
+ my $char_B = substr $str_B, $_, 1;
+
+ ## key already in invert
+ return 0 if exists $invert{$char_B} and not exists $forward{$char_A};
+
+ ## key in forward matches char B
+ if (exists $forward{$char_A} ) {
+ return 0 if $forward{$char_A} ne $char_B;
+ }
+ else { ## make new key
+ $forward{$char_A} = $char_B;
+ $invert{$char_B} = undef;
+ }
+ }
+ return 1;
+}
+
+
+use Test::More;
+
+
+is check_iso( qw ( abc xyz ) ), 1, 'ex 1';
+is check_iso( qw ( abb xyy ) ), 1, 'ex 2';
+is check_iso( qw ( sum add ) ), 0, 'ex 3, many to one';
+
+is check_iso( qw ( abc bca ) ), 1, 'rearrangement';
+is check_iso( qw ( abb xxy ) ), 0, 'positions matter';
+is check_iso( qw ( abc abc ) ), 1, 'equality';
+is check_iso( qw ( abb xyx ) ), 0, 'one to many';
+
+
+
+
+
+
+done_testing();
+
+
+
diff --git a/challenge-092/colin-crain/perl/ch-2.pl b/challenge-092/colin-crain/perl/ch-2.pl
new file mode 100644
index 0000000000..6cc19858d5
--- /dev/null
+++ b/challenge-092/colin-crain/perl/ch-2.pl
@@ -0,0 +1,144 @@
+#! /opt/local/bin/perl
+#
+# lava_lamp.pl
+#
+# TASK #2 › Insert Interval
+# Submitted by: Mohammad S Anwar
+# You are given a set of sorted non-overlapping intervals and a new interval.
+#
+# Write a script to merge the new interval to the given set of intervals.
+#
+# Example 1:
+# Input $S = (1,4), (8,10); $N = (2,6)
+# Output: (1,6), (8,10)
+# Example 2:
+# Input $S = (1,2), (3,7), (8,10); $N = (5,8)
+# Output: (1,2), (3,10)
+# Example 3:
+# Input $S = (1,5), (7,9); $N = (10,11)
+# Output: (1,5), (7,9), (10,11)
+#
+# method:
+# we will need a way to abstract our intervals, and notice whether
+# a given interval intersects with another.
+#
+# This is like the who left the light on? task.
+#
+# We start knowing that the intervals do not intersect.
+#
+# 1. sort the intervals by lower bound and secondarily by upper,
+# after adding the new interval to the list.
+# 2. working from index 0, check to see whether the upper bound is
+# greater than the lower bound of the next iterval. If it is, we have found the
+# index right before our interloper. We join
+# those two intervals. The lower bound will be the lower of the
+# first, the upper the greater of the two upper values. The added
+# interval will be assimilated and cease to exist.
+# 3. As the upper bound of the assimilated interval's relationship to
+# the existing intervals is unknown, we need to continue until the
+# upper bound of the current interval is less than the lower of the
+# next interval. Only then can we can stop.
+# 4. Or it it's the last interval, we should also stop then, lest we
+# loop forever.
+#
+# To join an interval with the one following, we slice out the element
+# at $idx + 1, remembering it's values. As we know the lower value of the
+# current interval is less than or equal to that of the next, so it is left
+# as-is. The upper value of the current interval is set to the greater of
+# the two upper values, current and next. The next interval has been spliced
+# and removed from the list.
+#
+#
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+
+## ## ## ## ## MAIN:
+
+
+sub main {
+ my ($S, $N) = @_;
+ say '';
+
+ say "input: ", sprint_intervals( $S );
+ say "new: ", sprint_intervals( [$N] );
+
+ my $idx = insert_and_find_merge($S, $N);
+
+ while (1) {
+ if (defined $S->[$idx+1] and $S->[$idx][1] >= $S->[$idx+1][0]) {
+ merge($S, $idx);
+ }
+
+ last if $idx == $S->@* - 1;
+ last if $S->[$idx][1] < $S->[$idx+1][0];
+ }
+
+ say "merged: ", sprint_intervals( $S );
+
+ return sprint_intervals( $S ); ## for testing purposes
+}
+
+sub insert_and_find_merge {
+## insert new interval into interval list
+## return index of interval to merge with next
+## this will either be the insert point or one before
+ my ($list, $new) = @_;
+ my $idx = 0;
+ my $merge;
+ while ($idx < $list->@*) {
+ last if $list->[$idx][0] >= $new->[0];
+ $idx++;
+ }
+ splice $list->@*, $idx, 0, $new;
+
+ return 0 if $idx == 0;
+ return $idx-1 if $list->[$idx-1][1] >= $new->[0];
+ return $idx;
+}
+
+sub merge {
+## given list ref and index, merges index and index + 1
+ my ($list, $idx) = @_;
+ $list->[$idx][1] = $list->[$idx][1] > $list->[$idx+1][1] ? $list->[$idx][1]
+ : $list->[$idx+1][1];
+ splice $list->@*, $idx+1, 1;
+}
+
+sub sprint_intervals {
+## return formatted string
+ my $list = shift;
+ return (join ' ', map { "($_->[0],$_->[1])" } $list->@*) ;
+}
+
+
+
+use Test::More;
+
+is main( [[1,4], [8,10]], [2,6] ), "(1,6) (8,10)", 'ex 1 - merge first';
+is main( [[1,2], [3,7], [8,10]], [5,8] ), "(1,2) (3,10)", 'ex 2 - merge to last';
+is main( [[1,5], [7,9]], [10,11] ), "(1,5) (7,9) (10,11)", 'ex 3 - no merge';
+is main( [[4,5], [7,8], [10,12]], [1,2] ), "(1,2) (4,5) (7,8) (10,12)", 'add to front - no merge';
+is main( [[1,2], [4,5], [10,12]], [7,8] ), "(1,2) (4,5) (7,8) (10,12)", 'add to middle - no merge';
+is main( [[1,2], [4,5], [7,8]], [10,12] ), "(1,2) (4,5) (7,8) (10,12)", 'add to end - no merge';
+is main( [[4,5], [7,8], [10,12]], [1,12] ), "(1,12)", 'add to front - all merge';
+is main( [[4,5], [7,8], [10,12]], [5,15] ), "(4,15)", 'add to mid - all merge';
+is main( [[4,5], [7,8], [10,12]], [5,9] ), "(4,9) (10,12)", 'add to mid - head merge';
+is main( [[4,5], [6,8]], [8,12]), "(4,5) (6,12)", 'add to end - tail merge';
+
+
+
+
+
+# is main( ), "";
+
+
+
+done_testing();
+
diff --git a/challenge-092/colin-crain/raku/ch-1.raku b/challenge-092/colin-crain/raku/ch-1.raku
new file mode 100644
index 0000000000..1a72e80a5e
--- /dev/null
+++ b/challenge-092/colin-crain/raku/ch-1.raku
@@ -0,0 +1,58 @@
+#!/usr/bin/env perl6
+#
+#
+# harmonic_string_section.raku
+#
+# TASK #1 › Isomorphic Strings
+# Submitted by: Mohammad S Anwar
+# You are given two strings $A and $B.
+#
+# Write a script to check if the given strings are
+# Isomorphic. Print 1 if they are otherwise 0.
+#
+# Example 1:
+# Input: $A = "abc"; $B = "xyz"
+# Output: 1
+# Example 2:
+# Input: $A = "abb"; $B = "xyy"
+# Output: 1
+# Example 3:
+# Input: $A = "sum"; $B = "add"
+# Output: 0
+#
+#
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN (Str $A = 'xxy', Str $B = 'aab') ;
+
+
+say 0 and exit if $A.chars != $B.chars;
+
+my %forward;
+my %invert = SetHash.new;
+
+for 0..$A.chars {
+ my $ch-A = $A.substr($_,1);
+ my $ch-B = $B.substr($_,1);
+
+ say 0 and exit if $ch-B ∈ %invert and not %forward{$ch-A}:exists;
+
+ if %forward{$ch-A}:exists {
+ say 0 and exit if %forward{$ch-A} ne $ch-B;
+ }
+ else {
+ %forward{$ch-A} = $ch-B;
+# %invert.set($ch-B); ## needs 2020.2 ? not sure how to use this
+ %invert{$ch-B} = Nil;
+ }
+}
+
+say 1;
+
+
+
+
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index 841c5bf807..f8fc18922c 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -1,18 +1,205 @@
{
- "xAxis" : {
- "type" : "category"
+ "series" : [
+ {
+ "data" : [
+ {
+ "name" : "Aaron Smith",
+ "drilldown" : "Aaron Smith",
+ "y" : 3
+ },
+ {
+ "drilldown" : "Abigail",
+ "y" : 4,
+ "name" : "Abigail"
+ },
+ {
+ "name" : "Alexander Karelas",
+ "drilldown" : "Alexander Karelas",
+ "y" : 2
+ },
+ {
+ "name" : "Alexander Pankoff",
+ "y" : 2,
+ "drilldown" : "Alexander Pankoff"
+ },
+ {
+ "name" : "Andrew Shitov",
+ "drilldown" : "Andrew Shitov",
+ "y" : 2
+ },
+ {
+ "name" : "Arne Sommer",
+ "y" : 4,
+ "drilldown" : "Arne Sommer"
+ },
+ {
+ "name" : "Athanasius",
+ "y" : 3,
+ "drilldown" : "Athanasius"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Cheok-Yin Fung",
+ "name" : "Cheok-Yin Fung"
+ },
+ {
+ "drilldown" : "Colin Crain",
+ "y" : 4,
+ "name" : "Colin Crain"
+ },
+ {
+ "name" : "Cristina Heredia",
+ "drilldown" : "Cristina Heredia",
+ "y" : 1
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Dave Jacoby",
+ "name" : "Dave Jacoby"
+ },
+ {
+ "name" : "Duncan C. White",
+ "drilldown" : "Duncan C. White",
+ "y" : 2
+ },
+ {
+ "name" : "E. Choroba",
+ "y" : 2,
+ "drilldown" : "E. Choroba"
+ },
+ {
+ "name" : "Flavio Poletti",
+ "y" : 4,
+ "drilldown" : "Flavio Poletti"
+ },
+ {
+ "drilldown" : "James Smith",
+ "y" : 3,
+ "name" : "James Smith"
+ },
+ {
+ "name" : "Jan Krnavek",
+ "drilldown" : "Jan Krnavek",
+ "y" : 2
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Joel Crosswhite",
+ "name" : "Joel Crosswhite"
+ },
+ {
+ "name" : "Jorg Sommrey",
+ "y" : 2,
+ "drilldown" : "Jorg Sommrey"
+ },
+ {
+ "name" : "Julio de Castro",
+ "drilldown" : "Julio de Castro",
+ "y" : 2
+ },
+ {
+ "y" : 4,
+ "drilldown" : "Kang-min Liu",
+ "name" : "Kang-min Liu"
+ },
+ {
+ "y" : 5,
+ "drilldown" : "Laurent Rosenfeld",
+ "name" : "Laurent Rosenfeld"
+ },
+ {
+ "y" : 1,
+ "drilldown" : "Lubos Kolouch",
+ "name" : "Lubos Kolouch"
+ },
+ {
+ "name" : "Mark Anderson",
+ "drilldown" : "Mark Anderson",
+ "y" : 2
+ },
+ {
+ "name" : "Mimosinnet",
+ "drilldown" : "Mimosinnet",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Niels van Dijke",
+ "y" : 2,
+ "name" : "Niels van Dijke"
+ },
+ {
+ "name" : "Nuno Vieira",
+ "y" : 2,
+ "drilldown" : "Nuno Vieira"
+ },
+ {
+ "name" : "Paulo Custodio",
+ "drilldown" : "Paulo Custodio",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Pete Houston",
+ "y" : 2,
+ "name" : "Pete Houston"
+ },
+ {
+ "drilldown" : "Philip Hood",
+ "y" : 2,
+ "name" : "Philip Hood"
+ },
+ {
+ "name" : "Phillip Hartfield Sr",
+ "y" : 1,
+ "drilldown" : "Phillip Hartfield Sr"
+ },
+ {
+ "name" : "Roger Bell_West",
+ "drilldown" : "Roger Bell_West",
+ "y" : 5
+ },
+ {
+ "y" : 3,
+ "drilldown" : "Simon Green",
+ "name" : "Simon Green"
+ },
+ {
+ "name" : "Stuart Little",
+ "drilldown" : "Stuart Little",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Ulrich Rieke",
+ "y" : 4,
+ "name" : "Ulrich Rieke"
+ },
+ {
+ "drilldown" : "W. Luis Mochan",
+ "y" : 3,
+ "name" : "W. Luis Mochan"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Wanderdoc",
+ "name" : "Wanderdoc"
+ }
+ ],
+ "colorByPoint" : 1,
+ "name" : "Perl Weekly Challenge - 092"
+ }
+ ],
+ "legend" : {
+ "enabled" : 0
},
- "subtitle" : {
- "text" : "[Champions: 35] Last updated at 2020-12-27 23:57:40 GMT"
+ "title" : {
+ "text" : "Perl Weekly Challenge - 092"
},
- "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/>"
+ "chart" : {
+ "type" : "column"
},
"drilldown" : {
"series" : [
{
+ "id" : "Aaron Smith",
"data" : [
[
"Raku",
@@ -23,11 +210,9 @@
1
]
],
- "id" : "Aaron Smith",
"name" : "Aaron Smith"
},
{
- "id" : "Abigail",
"name" : "Abigail",
"data" : [
[
@@ -38,31 +223,30 @@
"Blog",
2
]
- ]
+ ],
+ "id" : "Abigail"
},
{
+ "name" : "Alexander Karelas",
+ "id" : "Alexander Karelas",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Alexander Karelas",
- "name" : "Alexander Karelas"
+ ]
},
{
+ "id" : "Alexander Pankoff",
"data" : [
[
"Perl",
2
]
],
- "name" : "Alexander Pankoff",
- "id" : "Alexander Pankoff"
+ "name" : "Alexander Pankoff"
},
{
- "name" : "Andrew Shitov",
- "id" : "Andrew Shitov",
"data" : [
[
"Raku",
@@ -72,11 +256,12 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Andrew Shitov",
+ "name" : "Andrew Shitov"
},
{
"name" : "Arne Sommer",
- "id" : "Arne Sommer",
"data" : [
[
"Perl",
@@ -90,9 +275,12 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Arne Sommer"
},
{
+ "name" : "Athanasius",
+ "id" : "Athanasius",
"data" : [
[
"Perl",
@@ -102,53 +290,59 @@
"Raku",
1
]
- ],
- "name" : "Athanasius",
- "id" : "Athanasius"
+ ]
},
{
+ "id" : "Cheok-Yin Fung",
"data" : [
[
"Perl",
2
]
],
- "id" : "Cheok-Yin Fung",
"name" : "Cheok-Yin Fung"
},
{
+ "id" : "Colin Crain",
"data" : [
[
"Perl",
+ 2
+ ],
+ [
+ "Raku",
+ 1
+ ],
+ [
+ "Blog",
1
]
],
- "name" : "Cristina Heredia",
- "id" : "Cristina Heredia"
+ "name" : "Colin Crain"
},
{
+ "id" : "Cristina Heredia",
"data" : [
[
"Perl",
- 2
+ 1
]
],
- "name" : "Dave Jacoby",
- "id" : "Dave Jacoby"
+ "name" : "Cristina Heredia"
},
{
+ "id" : "Dave Jacoby",
"data" : [
[
"Perl",
2
]
],
- "id" : "Duncan C. White",
- "name" : "Duncan C. White"
+ "name" : "Dave Jacoby"
},
{
- "id" : "E. Choroba",
- "name" : "E. Choroba",
+ "name" : "Duncan C. White",
+ "id" : "Duncan C. White",
"data" : [
[
"Perl",
@@ -161,18 +355,27 @@
[
"Perl",
2
+ ]
+ ],
+ "id" : "E. Choroba",
+ "name" : "E. Choroba"
+ },
+ {
+ "id" : "Flavio Poletti",
+ "data" : [
+ [
+ "Perl",
+ 2
],
[
"Blog",
2
]
],
- "name" : "Flavio Poletti",
- "id" : "Flavio Poletti"
+ "name" : "Flavio Poletti"
},
{
"id" : "James Smith",
- "name" : "James Smith",
"data" : [
[
"Perl",
@@ -182,7 +385,8 @@
"Blog",
1
]
- ]
+ ],
+ "name" : "James Smith"
},
{
"data" : [
@@ -191,18 +395,18 @@
2
]
],
- "name" : "Jan Krnavek",
- "id" : "Jan Krnavek"
+ "id" : "Jan Krnavek",
+ "name" : "Jan Krnavek"
},
{
- "id" : "Joel Crosswhite",
- "name" : "Joel Crosswhite",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Joel Crosswhite",
+ "name" : "Joel Crosswhite"
},
{
"name" : "Jorg Sommrey",
@@ -215,16 +419,18 @@
]
},
{
- "name" : "Julio de Castro",
- "id" : "Julio de Castro",
"data" : [
[
"Raku",
2
]
- ]
+ ],
+ "id" : "Julio de Castro",
+ "name" : "Julio de Castro"
},
{
+ "name" : "Kang-min Liu",
+ "id" : "Kang-min Liu",
"data" : [
[
"Raku",
@@ -234,11 +440,11 @@
"Blog",
2
]
- ],
- "name" : "Kang-min Liu",
- "id" : "Kang-min Liu"
+ ]
},
{
+ "name" : "Laurent Rosenfeld",
+ "id" : "Laurent Rosenfeld",
"data" : [
[
"Perl",
@@ -252,69 +458,67 @@
"Blog",
1
]
- ],
- "name" : "Laurent Rosenfeld",
- "id" : "Laurent Rosenfeld"
+ ]
},
{
- "name" : "Lubos Kolouch",
"id" : "Lubos Kolouch",
"data" : [
[
"Perl",
1
]
- ]
+ ],
+ "name" : "Lubos Kolouch"
},
{
+ "name" : "Mark Anderson",
+ "id" : "Mark Anderson",
"data" : [
[
"Raku",
2
]
- ],
- "id" : "Mark Anderson",
- "name" : "Mark Anderson"
+ ]
},
{
+ "name" : "Mimosinnet",
+ "id" : "Mimosinnet",
"data" : [
[
"Raku",
2
]
- ],
- "name" : "Mimosinnet",
- "id" : "Mimosinnet"
+ ]
},
{
+ "name" : "Niels van Dijke",
"data" : [
[
"Perl",
2
]
],
- "id" : "Niels van Dijke",
- "name" : "Niels van Dijke"
+ "id" : "Niels van Dijke"
},
{
+ "name" : "Nuno Vieira",
"data" : [
[
"Perl",
2
]
],
- "name" : "Nuno Vieira",
"id" : "Nuno Vieira"
},
{
+ "name" : "Paulo Custodio",
+ "id" : "Paulo Custodio",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "Paulo Custodio",
- "id" : "Paulo Custodio"
+ ]
},
{
"name" : "Pete Houston",
@@ -333,20 +537,21 @@
2
]
],
- "name" : "Philip Hood",
- "id" : "Philip Hood"
+ "id" : "Philip Hood",
+ "name" : "Philip Hood"
},
{
+ "id" : "Phillip Hartfield Sr",
"data" : [
[
"Perl",
1
]
],
- "name" : "Phillip Hartfield Sr",
- "id" : "Phillip Hartfield Sr"
+ "name" : "Phillip Hartfield Sr"
},
{
+ "id" : "Roger Bell_West",
"data" : [
[
"Perl",
@@ -361,12 +566,10 @@
1
]
],
- "name" : "Roger Bell_West",
- "id" : "Roger Bell_West"
+ "name" : "Roger Bell_West"
},
{
"id" : "Simon Green",
- "name" : "Simon Green",
"data" : [
[
"Perl",
@@ -376,7 +579,8 @@
"Blog",
1
]
- ]