diff options
| author | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2024-07-08 14:38:44 +0100 |
|---|---|---|
| committer | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2024-07-08 14:38:44 +0100 |
| commit | 40125a7671e65336f2b00e5dd385015ea62d51f3 (patch) | |
| tree | 2499db6c994ab7b73d5411f115a5a232d881f34d | |
| parent | 4fefb9a739b7cf52eaa21886032dbb869db63c13 (diff) | |
| download | perlweeklychallenge-club-40125a7671e65336f2b00e5dd385015ea62d51f3.tar.gz perlweeklychallenge-club-40125a7671e65336f2b00e5dd385015ea62d51f3.tar.bz2 perlweeklychallenge-club-40125a7671e65336f2b00e5dd385015ea62d51f3.zip | |
- Added solutions by Eric Cheung.
- Added solutions by Ulrich Rieke.
- Added solutions by PokGoPun.
- Added solutions by Niels van Dijke.
- Added solutions by Mark Anderson.
- Added solutions by Feng Chang.
31 files changed, 2924 insertions, 2500 deletions
diff --git a/challenge-277/eric-cheung/python/ch-1.py b/challenge-277/eric-cheung/python/ch-1.py new file mode 100755 index 0000000000..c08ac8a721 --- /dev/null +++ b/challenge-277/eric-cheung/python/ch-1.py @@ -0,0 +1,16 @@ +
+## Example 1
+## arrWords_01 = ["Perl", "is", "my", "friend"]
+## arrWords_02 = ["Perl", "and", "Raku", "are", "friend"]
+
+## Example 2
+## arrWords_01 = ["Perl", "and", "Python", "are", "very", "similar"]
+## arrWords_02 = ["Python", "is", "top", "in", "guest", "languages"]
+
+## Example 3
+arrWords_01 = ["Perl", "is", "imperative", "Lisp", "is", "functional"]
+arrWords_02 = ["Crystal", "is", "similar", "to", "Ruby"]
+
+arrOutput = [strLoop for strLoop in set(arrWords_01 + arrWords_02) if arrWords_01.count(strLoop) == 1 and arrWords_02.count(strLoop) == 1]
+
+print (len(arrOutput))
diff --git a/challenge-277/eric-cheung/python/ch-2.py b/challenge-277/eric-cheung/python/ch-2.py new file mode 100755 index 0000000000..72b8faa3f6 --- /dev/null +++ b/challenge-277/eric-cheung/python/ch-2.py @@ -0,0 +1,16 @@ +
+from itertools import combinations
+
+def IsStrongPair (arrInput):
+ if abs(arrInput[0] - arrInput[1]) > 0 and min(arrInput) > abs(arrInput[0] - arrInput[1]):
+ return True
+ return False
+
+## arrInt = [1, 2, 3, 4, 5] ## Example 1
+arrInt = [5, 7, 1, 7] ## Example 2
+
+arrComb = combinations(arrInt, 2)
+
+arrOutput = [arrLoop for arrLoop in list(set(arrComb)) if IsStrongPair(arrLoop)]
+
+print (len(arrOutput))
diff --git a/challenge-277/perlboy1967/perl/ch1.pl b/challenge-277/perlboy1967/perl/ch-1.pl index 0cfaa4bcb2..0cfaa4bcb2 100755 --- a/challenge-277/perlboy1967/perl/ch1.pl +++ b/challenge-277/perlboy1967/perl/ch-1.pl diff --git a/challenge-277/perlboy1967/perl/ch2.pl b/challenge-277/perlboy1967/perl/ch-2.pl index 1b4ee2cbdb..1b4ee2cbdb 100755 --- a/challenge-277/perlboy1967/perl/ch2.pl +++ b/challenge-277/perlboy1967/perl/ch-2.pl diff --git a/challenge-277/ulrich-rieke/cpp/ch-1.cpp b/challenge-277/ulrich-rieke/cpp/ch-1.cpp new file mode 100755 index 0000000000..df1d66194e --- /dev/null +++ b/challenge-277/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,40 @@ +#include <iostream>
+#include <ranges>
+#include <string>
+#include <vector>
+#include <map>
+#include <algorithm>
+
+std::vector<std::string> split( std::string text , char delim ) {
+ auto parts = text | std::views::split( delim )
+ | std::views::transform( []( auto&& subpart ) {
+ return std::string( subpart.begin( ) ,
+ subpart.end( ) ) ; }) ;
+ std::vector<std::string> words ( parts.begin( ) , parts.end( ) ) ;
+ return words ;
+}
+
+int main( ) {
+ std::cout << "Enter some words , separated by blanks!\n" ;
+ std::string firstLine , secondLine ;
+ std::getline( std::cin , firstLine ) ;
+ std::cout << "Enter some more words , separated by blanks!\n" ;
+ std::getline( std::cin , secondLine ) ;
+ std::vector<std::string> firstWords( split( firstLine , ' ' ) ) ;
+ std::vector<std::string> secondWords( split( secondLine , ' ' ) ) ;
+ std::vector<std::string> common_words ;
+ std::ranges::sort( firstWords ) ; //intersection only on sorted containers!
+ std::ranges::sort( secondWords ) ;
+ std::set_intersection( firstWords.begin( ) , firstWords.end( ) ,
+ secondWords.begin( ) , secondWords.end( ) , std::back_inserter(
+ common_words ) ) ;
+ std::map<std::string , int> firstFreq , secondFreq ;
+ for ( auto s : firstWords )
+ firstFreq[s]++ ;
+ for ( auto s : secondWords )
+ secondFreq[s]++ ;
+ std::cout << std::count_if( common_words.begin( ) , common_words.end( ),
+ [&firstFreq , &secondFreq]( auto s ){ return firstFreq.find( s )
+ ->second == 1 && secondFreq.find( s )->second == 1 ; } ) << '\n' ;
+ return 0 ;
+}
diff --git a/challenge-277/ulrich-rieke/cpp/ch-2.cpp b/challenge-277/ulrich-rieke/cpp/ch-2.cpp new file mode 100755 index 0000000000..ec253a9451 --- /dev/null +++ b/challenge-277/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,37 @@ +#include <iostream>
+#include <iterator>
+#include <vector>
+#include <utility>
+#include <set>
+#include <algorithm>
+#include <cstdlib> // for abs
+#include <limits> // for min
+
+bool condition( const std::pair<int , int> & p ) {
+ int diff = std::abs( p.first - p.second ) ;
+ int mini = std::min( p.first , p.second ) ;
+ return ( 0 < diff && ( diff < mini ) ) ;
+}
+
+int main( ) {
+ std::cout << "Enter some integers, separated by blanks!\n" ;
+ std::cout << "Enter e to end!\n" ;
+ std::vector<int> numbers { std::istream_iterator<int>( std::cin ) ,
+ std::istream_iterator<int>( ) } ;
+ std::vector<std::pair<int , int>> combinations , selected ;
+ int len = numbers.size( ) ;
+ for ( int i = 0 ; i < len - 1 ; i++ ) {
+ for ( int j = i + 1 ; j < len ; j++ ) {
+ combinations.push_back( std::make_pair( numbers[i] ,
+ numbers[j] )) ;
+ }
+ }
+ std::copy_if( combinations.begin( ) , combinations.end( ) ,
+ std::back_inserter( selected ) , condition ) ;
+ //by creating a set from the vector selected that contains the pairs
+ //fulfilling the condition we remove duplicates
+ std::set<std::pair<int , int>> uniques ( selected.begin( ) ,
+ selected.end( ) ) ;
+ std::cout << uniques.size( ) << '\n' ;
+ return 0 ;
+}
diff --git a/challenge-277/ulrich-rieke/haskell/ch-1.hs b/challenge-277/ulrich-rieke/haskell/ch-1.hs new file mode 100755 index 0000000000..47f39cde70 --- /dev/null +++ b/challenge-277/ulrich-rieke/haskell/ch-1.hs @@ -0,0 +1,22 @@ +module Challenge277
+ where
+import Data.List ( intersect )
+
+count :: Eq a => a -> [a] -> Int
+count _ [] = 0
+count d (x:xs)
+ |d == x = 1 + count d xs
+ |otherwise = count d xs
+
+solution :: [String] -> [String] -> Int
+solution firstWords secondWords = length $ filter (\s -> count s firstWords ==
+ 1 && ( count s secondWords == 1 ) ) $ intersect firstWords secondWords
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some words separated by blanks!"
+ firstWords <- getLine
+ putStrLn "Enter some more words separated by blanks!"
+ secondWords <- getLine
+ print $ solution ( words firstWords ) ( words secondWords )
+
diff --git a/challenge-277/ulrich-rieke/haskell/ch-2.hs b/challenge-277/ulrich-rieke/haskell/ch-2.hs new file mode 100755 index 0000000000..05e83c3507 --- /dev/null +++ b/challenge-277/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,24 @@ +module Challenge277_2
+ where
+import Data.List ( nub , ( !! ) )
+
+combinations :: Int -> [a] -> [[a]]
+combinations 0 _ = [[]]
+combinations n xs = [ xs !! i : x | i <- [0..(length xs ) - 1 ] ,
+ x <- combinations (n - 1 ) ( drop ( i + 1 ) xs ) ]
+
+condition :: [Int] -> Bool
+condition list = (0 < difference) && ( difference < mini )
+ where
+ difference = abs ( list !! 0 - list !! 1 )
+ mini = minimum list
+
+solution :: [Int] -> Int
+solution list = length $ filter condition $ nub $ combinations 2 list
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some integers, separated by blanks!"
+ numberline <- getLine
+ print $ solution $ map read $ words numberline
+
diff --git a/challenge-277/ulrich-rieke/perl/ch-1.pl b/challenge-277/ulrich-rieke/perl/ch-1.pl new file mode 100755 index 0000000000..ace730ce20 --- /dev/null +++ b/challenge-277/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,19 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+
+say "Enter some words, separated by blanks!" ;
+my $firstLine = <STDIN> ;
+chomp $firstLine ;
+my @firstWords = split( /\s+/ , $firstLine ) ;
+say "Enter more words , separated by blanks!" ;
+my $secondLine = <STDIN> ;
+chomp $secondLine ;
+my @secondWords = split( /\s+/ , $secondLine ) ;
+my %firstFreqs ;
+my %secondFreqs ;
+map { $firstFreqs{$_}++ } @firstWords ;
+map { $secondFreqs{$_}++ } @secondWords ;
+my @common = grep {exists( $secondFreqs{$_} ) } keys %firstFreqs ;
+say scalar( grep {$firstFreqs{$_} == 1 && $secondFreqs{$_} == 1} @common ) ;
diff --git a/challenge-277/ulrich-rieke/perl/ch-2.pl b/challenge-277/ulrich-rieke/perl/ch-2.pl new file mode 100755 index 0000000000..019fc6c0db --- /dev/null +++ b/challenge-277/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,23 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use Algorithm::Combinatorics qw ( combinations ) ;
+use List::Util qw ( min ) ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+my %valid_pairs ;
+my $iter = combinations( \@numbers , 2 ) ;
+while ( my $c = $iter->next ) {
+ my $diff = abs( $c->[0] - $c->[1] ) ;
+ my $mini = min( @$c ) ;
+ if ( (0 < $diff) && ($diff < $mini) ) {
+#create a string out of the $c-contents so that not the address enters the
+#hash but the values!
+ $valid_pairs{$c->[0] . ',' . $c->[1]}++ ;
+ }
+}
+say scalar ( keys %valid_pairs ) ;
diff --git a/challenge-277/ulrich-rieke/raku/ch-1.raku b/challenge-277/ulrich-rieke/raku/ch-1.raku new file mode 100755 index 0000000000..b76698e0ff --- /dev/null +++ b/challenge-277/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,15 @@ +use v6 ;
+
+say "Enter some words, separated by blanks!" ;
+my $firstLine = $*IN.get ;
+my @firstWords = $firstLine.words ;
+say "Enter more words, separated by blanks!" ;
+my $secondLine = $*IN.get ;
+my @secondWords = $secondLine.words ;
+my $common = @firstWords.Set (&) @secondWords.Set ;
+my %firstFreq ;
+my %secondFreq ;
+@firstWords.map( {%firstFreq{$_}++} ) ;
+@secondWords.map( {%secondFreq{$_}++} ) ;
+say $common.keys.grep( {%firstFreq{$_} == 1 && %secondFreq{$_} == 1 } ).
+elems ;
diff --git a/challenge-277/ulrich-rieke/raku/ch-2.raku b/challenge-277/ulrich-rieke/raku/ch-2.raku new file mode 100755 index 0000000000..3cf5b09546 --- /dev/null +++ b/challenge-277/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,14 @@ +use v6 ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+my @valid_pairs ;
+for @numbers.combinations( 2 ) -> $combi {
+ my $difference = ($combi[0] - $combi[1]).abs ;
+ my $mini = ($combi[0] , $combi[1]).min ;
+ if ( 0 < $difference && $difference < $mini ) {
+ @valid_pairs.push( $combi ) ;
+ }
+}
+say @valid_pairs.unique.elems ;
diff --git a/challenge-277/ulrich-rieke/rust/ch-1.rs b/challenge-277/ulrich-rieke/rust/ch-1.rs new file mode 100755 index 0000000000..0c436107fa --- /dev/null +++ b/challenge-277/ulrich-rieke/rust/ch-1.rs @@ -0,0 +1,41 @@ +use std::io ; +use std::collections::{HashMap , HashSet} ; + +fn main() { + println!("Enter some words, separated by blanks!"); + let mut first_line : String = String::new( ) ; + io::stdin( ).read_line( &mut first_line).unwrap( ) ; + let first_entered : &str = first_line.as_str( ).trim( ) ; + println!("Enter more words , separated by blanks!" ) ; + let mut sec_line : String = String::new( ) ; + io::stdin( ).read_line( &mut sec_line ).unwrap( ) ; + let sec_entered : &str = sec_line.as_str( ).trim( ) ; + let first_words : Vec<&str> = first_entered.split_whitespace( ). + collect( ) ; + let second_words : Vec<&str> = sec_entered.split_whitespace( ). + collect( ) ; + let mut first_freq : HashMap<&str , usize> = HashMap::new( ) ; + let mut second_freq : HashMap<&str , usize> = HashMap::new( ) ; + first_words.iter( ).for_each( | s | { + first_freq.entry( s ).and_modify( |e| *e += 1 ).or_insert( 1 ) ; + } ) ; + second_words.iter( ).for_each( | s | { + second_freq.entry( s ).and_modify( |e| *e += 1 ).or_insert( 1 ) ; + }) ; + let mut first_set : HashSet<&str> = HashSet::new( ) ; + let mut second_set : HashSet<&str> = HashSet::new( ) ; + for w in &first_words { + first_set.insert( w ) ; + } + for w in &second_words { + second_set.insert( w ) ; + } + let mut sum : usize = 0 ; + for e in first_set.intersection( &second_set ) { + if *first_freq.get( e ).unwrap( ) == 1 && + *second_freq.get( e ).unwrap( ) == 1 { + sum += 1 ; + } + } + println!("{}" , sum) ; +} diff --git a/challenge-277/ulrich-rieke/rust/ch-2.rs b/challenge-277/ulrich-rieke/rust/ch-2.rs new file mode 100755 index 0000000000..b7c08bd65b --- /dev/null +++ b/challenge-277/ulrich-rieke/rust/ch-2.rs @@ -0,0 +1,22 @@ +use std::{io , cmp} ; +use itertools::Itertools ; +use std::collections::HashSet ; + +fn main() { + println!("Enter some integers, separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let entered_line : &str = inline.as_str( ).trim( ) ; + let numbers : Vec<i32> = entered_line.split_whitespace( ).map( | s | + s.parse::<i32>( ).unwrap( ) ).collect( ) ; + let mut valid_pairs : HashSet<Vec<i32>> = HashSet::new( ) ; + numbers.into_iter( ).combinations( 2 ).filter( + |vec| { + let abs_diff = (vec[0] - vec[1]).abs( ) ; + let mini = cmp::min( vec[0] , vec[1] ) ; + 0 < abs_diff && abs_diff < mini + } ).for_each( | vec| { + valid_pairs.insert(vec) ; + }) ; + println!("{}" , valid_pairs.len( ) ) ; +} diff --git a/stats/pwc-challenge-276.json b/stats/pwc-challenge-276.json new file mode 100644 index 0000000000..8b0e0b8b99 --- /dev/null +++ b/stats/pwc-challenge-276.json @@ -0,0 +1,707 @@ +{ + "chart" : { + "type" : "column" + }, + "xAxis" : { + "type" : "category" + }, + "series" : [ + { + "data" : [ + { + "drilldown" : "Ali Moradi", + "name" : "Ali Moradi", + "y" : 5 + }, + { + "y" : 3, + "name" : "Andrew Schneider", + "drilldown" : "Andrew Schneider" + }, + { + "name" : "Arne Sommer", + "drilldown" : "Arne Sommer", + "y" : 3 + }, + { + "y" : 4, + "name" : "Athanasius", + "drilldown" : "Athanasius" + }, + { + "y" : 2, + "name" : "BarrOff", + "drilldown" : "BarrOff" + }, + { + "drilldown" : "Bob Lied", + "name" : "Bob Lied", + "y" : 2 + }, + { + "y" : 4, + "name" : "Bruce Gray", + "drilldown" : "Bruce Gray" + }, + { + "y" : 2, + "name" : "Dave Jacoby", + "drilldown" : "Dave Jacoby" + }, + { + "drilldown" : "David Ferrone", + "name" : "David Ferrone", + "y" : 2 + }, + { + "y" : 2, + "name" : "E. Choroba", + "drilldown" : "E. Choroba" + }, + { + "drilldown" : "Feng Chang", + "name" : "Feng Chang", + "y" : 2 + }, + { + "name" : "Jaldhar H. Vyas", + "drilldown" : "Jaldhar H. Vyas", + "y" : 5 + }, + { + "y" : 2, + "name" : "Jan Krnavek", + "drilldown" : "Jan Krnavek" + }, + { + "name" : "Joelle Maslak", + "drilldown" : "Joelle Maslak", + "y" : 4 + }, + { + "drilldown" : "Jorg Sommrey", + "name" : "Jorg Sommrey", + "y" : 3 + }, + { + "drilldown" : "Kai Burgdorf", + "name" : "Kai Burgdorf", + "y" : 2 + }, + { + "drilldown" : "Kjetil Skotheim", + "name" : "Kjetil Skotheim", + "y" : 2 + }, + { + "name" : "Laurent Rosenfeld", + "drilldown" : "Laurent Rosenfeld", + "y" : 6 + }, + { + "y" : 11, + "name" : "Luca Ferrari", + "drilldown" : "Luca Ferrari" + }, + { + "drilldown" : "Mariano Ortega", + "name" : "Mariano Ortega", + "y" : 2 + }, + { + "y" : 2, + "drilldown" : "Mark Anderson", + "name" : "Mark Anderson" + }, + { + "y" : 2, + "name" : "Matthew Neleigh", + "drilldown" : "Matthew Neleigh" + }, + { + "y" : 3, + "drilldown" : "Matthias Muth", + "name" : "Matthias Muth" + }, + { + "y" : 2, + "name" : "Nelo Tovar", + "drilldown" : "Nelo Tovar" + }, + { + "drilldown" : "Niels van Dijke", + "name" : "Niels van Dijke", + "y" : 2 + }, + { + "drilldown" : "Packy Anderson", + "name" : "Packy Anderson", + "y" : 5 + }, + { + "name" : "Peter Campbell Smith", + "drilldown" : "Peter Campbell Smith", + "y" : 3 + }, + { + "y" : 3, + "drilldown" : "Reinier Maliepaard", + "name" : "Reinier Maliepaard" + }, + { + "drilldown" : "Robbie Hatley", + "name" : "Robbie Hatley", + "y" : 3 + }, + { + "y" : 2, + "name" : "Robert Ransbottom", + "drilldown" : "Robert Ransbottom" + }, + { + "y" : 5, + "name" : "Roger Bell_West", + "drilldown" : "Roger Bell_West" + }, + { + "y" : 3, + "drilldown" : "Ryan Thompson", + "name" : "Ryan Thompson" + }, + { + "name" : "Simon Green", + "drilldown" : "Simon Green", + "y" : 3 + }, + { + "name" : "Thomas Kohler", + "drilldown" : "Thomas Kohler", + "y" : 4 + }, + { + "y" : 4, + "name" : "Ulrich Rieke", + "drilldown" : "Ulrich Rieke" + }, + { + "y" : 3, + "name" : "W. Luis Mochan", + "drilldown" : "W. Luis Mochan" + }, + { + "y" : 2, + "drilldown" : "Wanderdoc", + "name" : "Wanderdoc" + } + ], + "colorByPoint" : 1, + "name" : "The Weekly Challenge - 276" + } + ], + "subtitle" : { + "text" : "[Champions: 37] Last updated at 2024-07-08 13:30:43 GMT" + }, + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, + "plotOptions" : { + "series" : { + "dataLabels" : { + "format" : "{point.y}", + "enabled" : 1 + }, + "borderWidth" : 0 + } + }, + "legend" : { + "enabled" : 0 + }, + "drilldown" : { + "series" : [ + { + "name" : "Ali Moradi", + "id" : "Ali Moradi", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ], + [ + "Blog", + 1 + ] + ] + }, + { + "id" : "Andrew Schneider", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Blog", + 1 + ] + ], + "name" : "Andrew Schneider" + }, + { + "data" : [ + [ + "Raku", + 2 + ], + [ + "Blog", + 1 + ] + ], + "id" : "Arne Sommer", + "name" : "Arne Sommer" + }, + { + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "id" : "Athanasius", + "name" : "Athanasius" + }, + { + "name" : "BarrOff", + "id" : "BarrOff", + "data" : [ + [ + "Raku", + 2 + ] + ] + }, + { + "name" : "Bob Lied", + "data" : [ + [ + "Perl", + 2 + ] + ], + "id" : "Bob Lied" + }, + { + "name" : "Bruce Gray", + "id" : "Bruce Gray", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ] + }, + { + "id" : "Dave Jacoby", + "data" : [ + [ + "Perl", + 2 + ] + ], + "name" : "Dave Jacoby" + }, + { + "name" : "David Ferrone", + "data" : [ + [ + "Perl", + 2 + ] + ], + "id" : "David Ferrone" + }, + { + "name" : "E. Choroba", + "id" : "E. Choroba", + "data" : [ + [ + "Perl", + 2 + ] + ] + }, + { + "name" : "Feng Chang", + "data" : [ + [ + "Raku", + 2 + ] + ], + "id" : "Feng Chang" + }, + { + "name" : "Jaldhar H. Vyas", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ], + [ + "Blog", + 1 + ] + ], + "id" : "Jaldhar H. Vyas" + }, + { + "data" : [ + [ + "Raku", + 2 + ] + ], + "id" : "Jan Krnavek", + "name" : "Jan Krnavek" + }, + { + "id" : "Joelle Maslak", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "name" : "Joelle Maslak" + }, + { + "id" : "Jorg Sommrey", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Blog", + 1 + ] + ], + "name" : "Jorg Sommrey" + }, + { + "name" : "Kai Burgdorf", + "id" : "Kai Burgdorf", + "data" : [ + [ + "Perl", + 2 + ] + ] + }, + { + "name" : "Kjetil Skotheim", + "data" : [ + [ + "Perl", + 2 + ] + ], + "id" : "Kjetil Skotheim" + }, + { + "name" : "Laurent Rosenfeld", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ], + [ + "Blog", + 2 + ] + ], + "id" : "Laurent Rosenfeld" + }, + { + "data" : [ + [ + "Raku", + |
