aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMohammad S Anwar <mohammad.anwar@yahoo.com>2021-05-30 22:54:54 +0100
committerMohammad S Anwar <mohammad.anwar@yahoo.com>2021-05-30 22:54:54 +0100
commit2cb2ee4c9620cfd800092e29423ab09779793ced (patch)
tree9289a90f64f00fbfa5b6150513fac028d973690d
parent453dddf26de8063a2f23c01aaaaf0076db27c267 (diff)
downloadperlweeklychallenge-club-2cb2ee4c9620cfd800092e29423ab09779793ced.tar.gz
perlweeklychallenge-club-2cb2ee4c9620cfd800092e29423ab09779793ced.tar.bz2
perlweeklychallenge-club-2cb2ee4c9620cfd800092e29423ab09779793ced.zip
- Added solutions by Colin Crain.
Diffstat
-rw-r--r--challenge-114/colin-crain/perl/ch-1.pl116
-rw-r--r--challenge-114/colin-crain/perl/ch-2.pl182
-rw-r--r--challenge-114/colin-crain/raku/ch-1.raku38
-rw-r--r--challenge-114/colin-crain/raku/ch-2.raku67
-rw-r--r--stats/pwc-current.json270
-rw-r--r--stats/pwc-language-breakdown-summary.json62
-rw-r--r--stats/pwc-language-breakdown.json1568
-rw-r--r--stats/pwc-leaders.json766
-rw-r--r--stats/pwc-summary-1-30.json56
-rw-r--r--stats/pwc-summary-121-150.json34
-rw-r--r--stats/pwc-summary-151-180.json110
-rw-r--r--stats/pwc-summary-181-210.json90
-rw-r--r--stats/pwc-summary-211-240.json66
-rw-r--r--stats/pwc-summary-31-60.json114
-rw-r--r--stats/pwc-summary-61-90.json32
-rw-r--r--stats/pwc-summary-91-120.json94
-rw-r--r--stats/pwc-summary.json36
17 files changed, 2056 insertions, 1645 deletions
diff --git a/challenge-114/colin-crain/perl/ch-1.pl b/challenge-114/colin-crain/perl/ch-1.pl
new file mode 100644
index 0000000000..df6ae6f1d0
--- /dev/null
+++ b/challenge-114/colin-crain/perl/ch-1.pl
@@ -0,0 +1,116 @@
+#!/users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# your-next-pal.pl
+#
+# next palindrome number
+# submitted by: mohammad s anwar
+# you are given a positive integer $n.
+#
+# write a script to find out the next palindrome number higher than the
+# given integer $n.
+#
+# example
+#
+# input: $n = 1234
+# output: 1331
+#
+# input: $n = 999
+# output: 1001
+#
+# method:
+# on first look. i thought this would be more comlicated than it was.
+# i even went over to pwc 095 and fetched my palindrome regex. armed
+# and ready, another look revealed i might not be needing it after
+# all.
+#
+# a palindromic number is constructed from a rigid set of rules, with
+# the least significant digits exactly mirroring the most. a central
+# pivot digit, if present, can be said to mirror and map to itself. if
+# we follow the rules in construction then there's no need to validate
+# it as we will already know it will conform.
+#
+# to construct the next number in a an ordered sequence of numbers, we
+# need to start with the least significant digits, lest we skip over
+# one of these values and find ourselves out-of-order.
+#
+# in a palindrome, however, the idea of which is the least significant
+# digit itself gets altered. The tail of the number is fixed by the
+# forward half, and any alterations to one requires a matching change
+# in the other.
+
+# The smallest value, therefore, becomes immutably tied to the value
+# of the largest, and to find the next number in the sequence we
+# need to effect the smallest change possible, the smallest
+# increment.
+#
+# The least significant change to increment, should we
+# require this, is the central pivot digit, if present, or failing
+# that the two central digits, which must be increased together.
+# These are the smallest digits that will change between adjacent
+# palindromic numbers.
+#
+# The first course of action, it seems, is to conform our base number
+# to palindrome status. We can do this by constructing a palindrome
+# by taking the front half of the number, mirroring a matching
+# tail and gluing them
+# together.
+
+# if this number is greater than the base value then that is already the
+# next larger palindrome and we are done. Any decrease in the
+# central pivot, or any higher valued digit position, will produce a
+# value smaller than the base. If the palindrom ewe produce is is
+# not, however, larger than the base we need a palindrome that is.
+# Now the same logic applies to increasing the pivot value: the base
+# must be lower in value than the new palindrome as one of the
+# central digits will be smaller and all digits composing the number
+# above that will be same.
+
+# We will produce two routines, one to produce the simple palindrome
+# from the base, and one to produce the next palindrome. One will be
+# called and if necessary the second will follow.
+#
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+my $number = shift // 34987;
+$number += 0; ## numification is important
+
+say "Input: ", $number;
+say "Output: ", get_next_palindrome($number);
+
+sub get_next_palindrome ($num) {
+ my $base = make_p($num);
+ if ($base < $num) {
+ return make_inc_p($num);
+ }
+ return $base;
+}
+
+sub make_p ($num) {
+ my $len = length $num;
+ my $head = substr $num, 0, $len - int($len/2);
+ my $tail = reverse substr $head, 0, $len/2;
+ return $head . $tail;
+}
+
+sub make_inc_p ($num) {
+ my $len = length $num;
+ my $head = substr $num, 0, $len - int($len/2);
+ $head++;
+ my $tail = reverse substr $head, 0, $len/2;
+ return $head . $tail;
+}
+
+sub is_palin ($num) {
+## from PWC 095, neat but ultimately not used
+ return $num =~ m/^(.*).?(??{reverse($1)})$/;
+}
diff --git a/challenge-114/colin-crain/perl/ch-2.pl b/challenge-114/colin-crain/perl/ch-2.pl
new file mode 100644
index 0000000000..185abd5706
--- /dev/null
+++ b/challenge-114/colin-crain/perl/ch-2.pl
@@ -0,0 +1,182 @@
+#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# the-weight-of-ham.pl
+#
+# Higher Integer Set Bits
+# Submitted by: Mohammad S Anwar
+# You are given a positive integer $N.
+#
+# Write a script to find the next higher integer having the same number
+# of 1 bits in binary representation as $N.
+#
+# Example
+#
+# Input: $N = 3
+# Output: 5
+#
+# Binary representation of $N is 011. There are two 1 bits. So
+# the next higher integer is 5 having the same the number of 1
+# bits i.e. 101.
+#
+# Input: $N = 12
+# Output: 17
+#
+# Binary representation of $N is 1100. There are two 1 bits. So
+# the next higher integer is 17 having the same number of 1 bits
+# i.e. 10001.
+#
+# method:
+# We could brute force this, by creating a popcount() function and
+# incrementing until we circle around again. This sounds boring for
+# large numbers but I reserve the right to fall back on it.
+#
+# Mathematically, the number of 1s in a binary representation, or
+# population count, is known as the Hamming weight, or perhaps more
+# accurately a select case of the Hamming weight for binary numbers.
+# The Hamming weight counts the non-zero values, so the weight for
+# the number 43210 is 4, as 4 of the 5 digits are not zero.
+#
+# When we talk about "weight" here, or "Hamming weight" let it be
+# understood that we're always talking about binary strings, not a
+# more general case.
+#
+# The first thing we do is compare a bunch of binary numbers grouped
+# by their weight. Theres a pattern there, but exactly what that
+# pattern is is elusive, shall we say.
+#
+# Our first observation is that when we add one to a number, the
+# weight will increase if the number is even, which we don't want.
+# If the number is odd the last bit will carry and the number will
+# then become even. The carrying may or may not trigger a cascading
+# effect. Generally this reduces the weight, or leaves it the same.
+#
+# If the weight is reduced, we can always add 1 to it until the
+# weight arrives again at the desired value.
+#
+# So if we add 1 to any number it will either increase the weight or
+# trigger a carry which will either lower the weight or keep it the
+# same. This is true every time we increment the number. A single
+# bit carried forward into a 0 keeps the weight the same. We've
+# taken away a single 1 but also have added a 1 for a neutral
+# result. The only way to lower a weight is to trigger a cascade of
+# carries that flip a series of bits together, such as when we roll
+# over into a power of 2: 01111 + 1 = 10000
+#
+# Its not much but it's a start. Our plan is to jump ahead over any
+# values with larger weights, straight to a cascading event and then
+# if necessary build the weight up again. We want to avoid ever
+# increasing the weight when we are at weight already.
+#
+# When we add 1 to a number, we add to the least significant digit.
+# If that's a 1, then the number is odd and we're good, but if it's
+# a 0 the weight will ncrease, which is bad. So what if we add the 1
+# to the least significant 1 instead? This will trigger a carry and
+# the weight will remain the same or lower. If it is the same that
+# will be the next number with the same weight and if it is lower we
+# can build it up again.
+#
+# This plan indeed works. We construct a function to yield the
+# 0-based least significant set bit, and if we add 2 to this power
+# then this triggers a carry.
+#
+# The result of this function is a number equal to or less than the
+# next number with the same Hamming weight, often skipping over a
+# range of values. We're homing in on it now. As we've carried the
+# least significant set bit, the number will now end in a sequence
+# of 0s, one more than before. We now need to add as many 1s to that
+# space as required to get the weight correct. Again we could
+# increment the number and that would eventually work. But if we
+# take the difference between the Hamming weight of the new carried
+# value and our target weight we get the quantity of 1s neccessary
+# to equalize the two. We can then construct a new value from binary
+# 1s and add that to make up the difference.
+#
+# The smallest value containinga set number of 1s is a string of 1s
+# of the required length, and the way to construct this number is to
+# raise 2 to the required 1s and then subtract 1:
+#
+# 2^4 - 1 = 1111
+#
+# This corrects the weight difference. Our function to find the next
+# number with the same number of 1s in its binary representation is
+# to first trigger a carry in the lowest significant set bit and
+# then add a number composed of enough 1s to make up any difference.
+
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+use List::Util qw(sum);
+
+for (1..32) {
+ say sprintf "%-8d %-d", $_, next_hamming_weight($_);
+}
+
+
+
+sub next_hamming_weight( $num ) {
+ my $ham = hamming( $num );
+ my $trip = trip_carry($num);
+ my $next = $trip + ones( $ham - hamming($trip) );
+ return $next;
+}
+
+sub hamming ($num) {
+## given number, returns count of 1s in binary representation
+ my $bin = sprintf "%b", $num;
+ my $bits = sum (split //, $bin);
+ return $bits;
+}
+
+sub trip_carry ($num) {
+## given a number, trip the carry on the lowest significant set bit
+## 10101000 -> 10110000
+ my $ls = lowsig($num);
+ my $trip = 2**$ls;
+ return $num + $trip;
+}
+
+sub lowsig ($num) {
+# returns lowest significant set bit position, 0-based
+ return 0 if ! $num;
+ my $pos = 0;
+ while ( !( $num & 1) ) {
+ $num >>= 1;
+ $pos++;
+ }
+ return $pos;
+}
+
+sub ones ($count) {
+## returns decimal value of binary string composed from $count x 1s
+## ->(3) = 0b111 = 7
+ return 2**$count - 1;
+}
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+# use Test::More;
+#
+# is
+#
+# done_testing();
diff --git a/challenge-114/colin-crain/raku/ch-1.raku b/challenge-114/colin-crain/raku/ch-1.raku
new file mode 100644
index 0000000000..628a4c7e53
--- /dev/null
+++ b/challenge-114/colin-crain/raku/ch-1.raku
@@ -0,0 +1,38 @@
+#!/usr/bin/env perl6
+#
+#
+# your-next-pal.raku
+#
+# next palindrome number
+# submitted by: mohammad s anwar
+# you are given a positive integer $n.
+#
+# write a script to find out the next palindrome number higher than the
+# given integer $n.
+#
+# example
+#
+# input: $n = 1234
+# output: 1331
+#
+# input: $n = 999
+# output: 1001
+#
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN ($num = 20001) ;
+
+say next-p( $num );
+
+sub next-p ($n) {
+ my $half = $n.substr( 0, ceiling($n.chars/2) );
+ $n.substr( *-floor($n.chars/2) ) > $half.substr(0, floor($n.chars/2)).flip
+ && $half++;
+ $half ~ $half.substr(0, floor($n.chars/2)).flip;
+}
+
+
diff --git a/challenge-114/colin-crain/raku/ch-2.raku b/challenge-114/colin-crain/raku/ch-2.raku
new file mode 100644
index 0000000000..c7612d7c74
--- /dev/null
+++ b/challenge-114/colin-crain/raku/ch-2.raku
@@ -0,0 +1,67 @@
+#!/usr/bin/env perl6
+#
+#
+# the-weight-of-ham.raku
+#
+# Higher Integer Set Bits
+# Submitted by: Mohammad S Anwar
+# You are given a positive integer $N.
+#
+# Write a script to find the next higher integer having the same number
+# of 1 bits in binary representation as $N.
+#
+# Example
+#
+# Input: $N = 3
+# Output: 5
+#
+# Binary representation of $N is 011. There are two 1 bits. So
+# the next higher integer is 5 having the same the number of 1
+# bits i.e. 101.
+#
+# Input: $N = 12
+# Output: 17
+#
+# Binary representation of $N is 1100. There are two 1 bits. So
+# the next higher integer is 17 having the same number of 1 bits
+# i.e. 10001.
+#
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN ( Int $num where $num > 1 = 127) ;
+
+say next_hamming_weight( $num );
+
+sub next_hamming_weight( $num ) {
+ my $trip = trip_carry($num);
+ return $trip + ones( hamming($num) - hamming($trip) );
+
+ sub ones ($count) { 2**$count - 1 }
+ sub hamming ($num) { $num.base(2)
+ .comb
+ .sum }
+}
+
+sub trip_carry ($num) {
+## given a number, trip the carry on the lowest significant set bit
+## 10101000 -> 10110000
+ my $ls = lowsig($num);
+ my $trip = 2**$ls;
+ return $num + $trip;
+
+ sub lowsig ($num is copy, $pos is copy = 0 ) {
+ # returns lowest significant set bit position, 0-based
+ until $num +& 1 {
+ $num +>= 1;
+ $pos++;
+ }
+ $pos;
+ }
+}
+
+
+
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index b21d6bf3bf..e4fdac8d60 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -2,9 +2,15 @@
"xAxis" : {
"type" : "category"
},
+ "yAxis" : {
+ "title" : {
+ "text" : "Total Solutions"
+ }
+ },
"drilldown" : {
"series" : [
{
+ "name" : "Aaron Smith",
"data" : [
[
"Raku",
@@ -15,11 +21,9 @@
1
]
],
- "id" : "Aaron Smith",
- "name" : "Aaron Smith"
+ "id" : "Aaron Smith"
},
{
- "name" : "Abigail",
"id" : "Abigail",
"data" : [
[
@@ -30,10 +34,10 @@
"Blog",
2
]
- ]
+ ],
+ "name" : "Abigail"
},
{
- "id" : "Adam Russell",
"name" : "Adam Russell",
"data" : [
[
@@ -44,9 +48,11 @@
"Blog",
2
]
- ]
+ ],
+ "id" : "Adam Russell"
},
{
+ "id" : "Arne Sommer",
"data" : [
[
"Perl",
@@ -61,11 +67,9 @@
1
]
],
- "id" : "Arne Sommer",
"name" : "Arne Sommer"
},
{
- "name" : "Athanasius",
"id" : "Athanasius",
"data" : [
[
@@ -76,27 +80,28 @@
"Raku",
2
]
- ]
+ ],
+ "name" : "Athanasius"
},
{
- "name" : "Ben Davies",
- "id" : "Ben Davies",
"data" : [
[
"Raku",
2
]
- ]
+ ],
+ "name" : "Ben Davies",
+ "id" : "Ben Davies"
},
{
- "id" : "Cheok-Yin Fung",
"name" : "Cheok-Yin Fung",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Cheok-Yin Fung"
},
{
"data" : [
@@ -113,10 +118,18 @@
"id" : "Christian Jaeger"
},
{
- "name" : "Colin Crain",
"id" : "Colin Crain",
+ "name" : "Colin Crain",
"data" : [
[
+ "Perl",
+ 2
+ ],
+ [
+ "Raku",
+ 2
+ ],
+ [
"Blog",
1
]
@@ -133,6 +146,7 @@
]
},
{
+ "id" : "Dave Jacoby",
"data" : [
[
"Perl",
@@ -143,42 +157,40 @@
1
]
],
- "id" : "Dave Jacoby",
"name" : "Dave Jacoby"
},
{
- "id" : "Duncan C. White",
"name" : "Duncan C. White",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Duncan C. White"
},
{
+ "name" : "E. Choroba",
"data" : [
[
"Perl",
2
]
],
- "id" : "E. Choroba",
- "name" : "E. Choroba"
+ "id" : "E. Choroba"
},
{
- "id" : "Feng Chang",
"name" : "Feng Chang",
"data" : [
[
"Raku",
2
]
- ]
+ ],
+ "id" : "Feng Chang"
},
{
"id" : "Flavio Poletti",
- "name" : "Flavio Poletti",
"data" : [
[
"Perl",
@@ -192,11 +204,12 @@
"Blog",
2
]
- ]
+ ],
+ "name" : "Flavio Poletti"
},
{
- "name" : "James Smith",
"id" : "James Smith",
+ "name" : "James Smith",
"data" : [
[
"Perl",
@@ -209,24 +222,24 @@
]
},
{
+ "name" : "Jan Krnavek",
"data" : [
[
"Raku",
2
]
],
- "name" : "Jan Krnavek",
"id" : "Jan Krnavek"
},
{
- "id" : "Joan Mimosinnet",
"name" : "Joan Mimosinnet",
"data" : [
[
"Raku",
2
]
- ]
+ ],
+ "id" : "Joan Mimosinnet"
},
{
"id" : "Jorg Sommrey",
@@ -239,16 +252,17 @@
]
},
{
- "id" : "Lance Wicks",
"name" : "Lance Wicks",
"data" : [
[
"Perl",
1
]
- ]
+ ],
+ "id" : "Lance Wicks"
},
{
+ "id" : "Laurent Rosenfeld",
"data" : [
[
"Perl",
@@ -263,10 +277,10 @@
1
]
],
- "name" : "Laurent Rosenfeld",
- "id" : "Laurent Rosenfeld"
+ "name" : "Laurent Rosenfeld"
},
{
+ "id" : "Luca Ferrari",
"data" : [
[
"Raku",
@@ -277,18 +291,17 @@
2
]
],
- "id" : "Luca Ferrari",
"name" : "Luca Ferrari"
},
{
- "id" : "Mark Anderson",
"name" : "Mark Anderson",
"data" : [
[
"Raku",
2
]
- ]
+ ],
+ "id" : "Mark Anderson"
},
{
"data" : [
@@ -311,17 +324,16 @@
"id" : "Niels van Dijke"
},
{
+ "id" : "Pete Houston",
"data" : [
[
"Perl",
2
]
],
- "name" : "Pete Houston",
- "id" : "Pete Houston"
+ "name" : "Pete Houston"
},
{
- "id" : "Roger Bell_West",
"name" : "Roger Bell_West",
"data" : [
[
@@ -336,9 +348,11 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Roger Bell_West"
},
{
+ "name" : "Simon Green",
"data" : [
[
"Perl",
@@ -349,7 +363,6 @@
1
]
],
- "name" : "Simon Green",
"id" : "Simon Green"
},
{
@@ -363,6 +376,7 @@
"id" : "Simon Proctor"
},
{
+ "id" : "Stuart Little",
"data" : [
[
"Perl",
@@ -373,10 +387,11 @@
2
]
],
- "id" : "Stuart Little",
"name" : "Stuart Little"
},
{
+ "id" : "Ulrich Rieke",
+ "name" : "Ulrich Rieke",
"data" : [
[
"Perl",
@@ -386,11 +401,10 @@
"Raku",
2
]
- ],
- "id" : "Ulrich Rieke",
- "name" : "Ulrich Rieke"
+ ]
},
{
+ "id" : "W. Luis Mochan",
"data" : [
[
"Perl",
@@ -401,138 +415,113 @@
1
]
],
- "id" : "W. Luis Mochan",
"name" : "W. Luis Mochan"
},
{
- "name" : "Wanderdoc",
- "id" : "Wanderdoc",
"data" : [
[
"Perl",
1
]
- ]
+ ],
+ "name" : "Wanderdoc",
+ "id" : "Wanderdoc"
}
]
},
- "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/>"
- },
- "subtitle" : {
- "text" : "[Champions: 33] Last updated at 2021-05-30 21:40:09 GMT"
- },
- "plotOptions" : {
- "series" : {
- "dataLabels" : {
- "format" : "{point.y}",
- "enabled" : 1
- },
- "borderWidth" : 0
- }
- },
"legend" : {
"enabled" : 0
},
- "chart" : {
- "type" : "column"
- },
- "title" : {
- "text" : "Perl Weekly Challenge - 114"
- },
- "yAxis" : {
- "title" : {
- "text" : "Total Solutions"
- }
+ "subtitle" : {
+ "text" : "[Champions: 33] Last updated at 2021-05-30 21:54:36 GMT"
},
"series" : [
{
+ "name" : "Perl Weekly Challenge - 114",
"data" : [
{
- "name" : "Aaron Smith",
"y" : 3,
- "drilldown" : "Aaron Smith"
+ "drilldown" : "Aaron Smith",
+ "name" : "Aaron Smith"
},
{
- "drilldown" : "Abigail",
"y" : 4,
- "name" : "Abigail"
+ "name" : "Abigail",
+ "drilldown" : "Abigail"
},
{
- "drilldown" : "Adam Russell",
"y" : 4,
- "name" : "Adam Russell"
+ "name" : "Adam Russell",
+ "drilldown" : "Adam Russell"
},
{
+ "drilldown" : "Arne Sommer",
"name" : "Arne Sommer",
- "y" : 5,
- "drilldown" : "Arne Sommer"
+ "y" : 5
},
{
+ "name" : "Athanasius",
"drilldown" : "Athanasius",
- "y" : 4,
- "name" : "Athanasius"
+ "y" : 4
},
{
- "name" : "Ben Davies",
+ "y" : 2,
"drilldown" : "Ben Davies",
- "y" : 2
+ "name" : "Ben Davies"
},
{
"name" : "Cheok-Yin Fung",
- "y" : 2,
- "drilldown" : "Cheok-Yin Fung"
+ "drilldown" : "Cheok-Yin Fung",
+ "y" : 2
},
{
- "drilldown" : "Christian Jaeger",
"y" : 2,
- "name" : "Christian Jaeger"
+ "name" : "Christian Jaeger",
+ "drilldown" : "Christian Jaeger"
},
{
- "name" : "Colin Crain",
- "y" : 1,
- "drilldown" : "Colin Crain"
+ "y" : 5,
+ "drilldown" : "Colin Crain",
+ "name" : "Colin Crain"
},
{
- "name" : "Dave Cross",
"drilldown" : "Dave Cross",
+ "name" : "Dave Cross",
"y" : 2
},
{
"drilldown" : "Dave Jacoby",
- "y" : 3,
- "name" : "Dave Jacoby"
+ "name" : "Dave Jacoby",
+ "y" : 3
},
{
- "y" : 2,
"drilldown" : "Duncan C. White",
- "name" : "Duncan C. White"
+ "name" : "Duncan C. White",
+ "y" : 2
},
{
"name" : "E. Choroba",
- "y" : 2,
- "drilldown" : "E. Choroba"
+ "drilldown" : "E. Choroba",
+ "y" : 2
},
{
- "name" : "Feng Chang",
"drilldown" : "Feng Chang",
+ "name" : "Feng Chang",
"y" : 2
},
{
- "name" : "Flavio Poletti",
"drilldown" : "Flavio Poletti",
+ "name" : "Flavio Poletti",
"y" : 6
},
{
- "y" : 3,
"drilldown" : "James Smith",
- "name" : "James Smith"
+ "name" : "James Smith",
+ "y" : 3
},
{
- "name" : "Jan Krnavek",
"drilldown" : "Jan Krnavek",
+ "name" : "Jan Krnavek",
"y" : 2
},
{
@@ -546,39 +535,39 @@
"name" : "Jorg Sommrey"
},
{
+ "y" : 1,
"name" : "Lance Wicks",
- "drilldown" : "Lance Wicks",
- "y" : 1
+ "drilldown" : "Lance Wicks"
},
{
- "drilldown" : "Laurent Rosenfeld",
"y" : 5,
- "name" : "Laurent Rosenfeld"
+ "name" : "Laurent Rosenfeld",
+ "drilldown" : "Laurent Rosenfeld"
},
{
- "name" : "Luca Ferrari",
"y" : 4,
- "drilldown" : "Luca Ferrari"
+ "drilldown" : "Luca Ferrari",</