Adding Perl Support to Google App Engine

I was asked the other day to help setup a website for our elementary school's PTA. I thought for a while about the various free services available vs. virtual hosting and finally wound up going with Google Apps.

You might be wondering what this has to do with Perl. Well one of my quirks, is that I tend to alternate between adding perl or linux to my google searches whenever I want to find a decent dialog on a topic. Guess what turns up with a search on: google + apps + perl?

Apparently about 9 months ago, Stephen Adkins, Dean Arnold, Brad Fitzpatrick, Artur Bergman, Chia-liang Kao, Yuval Kogman, Jonathon Rockway, and others were working on a Perl App Engine implementation for Google App Engine. It looks like it stalled.

But maybe with your help, and a show of support, we can get them to pick it up again. On the "Open Issues" list for Google App Engine, the top 3 requests are adding support for PHP, Ruby, and Perl. You can express your preference for Perl support by going to the "Open Issues" list, finding issue #34, and selecting the star beside it.

At the time I'm writing, Perl is about 300 votes behind Ruby and about 1,000 behind PHP.

Update: As of Sat. May, 23rd at 10:19 EST, Perl has almost closed the gap with Ruby by half. The current votes are:
  • PHP: 2055
  • Ruby: 1558
  • Perl: 1396

Comments

  1. UnknownMay 21, 2009 at 11:03 PM

    I'm with you! Voted for #34
    When I voted (May 22nd), the numbers were:
    PHP: 2051
    Ruby: 1554
    Perl: 1256

    ReplyDelete
  2. UnknownMay 22, 2009 at 12:46 AM

    Sure, everyone should feel free to go ahead and vote. But PLEASE do not leave a comment unless you really have something to say.

    ReplyDelete
  3. AnonymousJune 1, 2009 at 4:34 AM

    As of 2009-06-01, Perl beats Ruby (1683 vs. 1577).

    ReplyDelete

Post a Comment

Popular posts from this blog

Raku: Advent of Code 2020 - Day Twelve

Below are my Raku solutions to Day Twelve puzzles for the 2020 Advent of Code. No effort was put into making things cleverly concise.  #!/usr/bin/env raku use v6.d ; my $face = 'E' ; my $c = <E S W N> ; # compass my %c = ( E => 0 , S => 1 , W => 2 , N => 3 ); # reverse lookup my ( $x , $y ) = ( 0 , 0 ); # ship location 'input' . IO . lines . map ({ my ( $direction , $qty ) = ( ~. substr ( 0 , 1 ) , +. substr ( 1 )); $direction = $face if $direction eq 'F' ; given $direction { when 'N' { $y += $qty } when 'S' { $y -= $qty } when 'E' { $x += $qty } when 'W' { $x -= $qty } when 'L' { my $i = %c { $face }; $i -= $qty div 90 ; $i = $i mod 4 ; $face = $c [ $i ]; } when 'R' { my $i = %c { $face }; $i += $qty div 90 ; $i = $i mod 4 ; $face = $c [ $i ]; } } }); say "Part One: { abs ( $x ) + abs ( $y )} " ...
Read more

Raku: Advent of Code 2020 - Day Thirteen

Raku solutions to Day Thirteen of the 2020 Advent of Code. Today's puzzle involved bus routes. Part One requires you to figure out which route id will arrive closest to a timestamp. The answer to Part Two involves identifying when an alignment of departure times across route ids will occur. #!/usr/bin/env raku use v6.d ; my ( $depart , $line ) = 'input' . IO . slurp . split ( " \n " ); $depart .= Int ; say "Part One: " ~ [*] $line . split ( ',' ) . grep ( none 'x' ) ». Int . map ({ $_ , $_ - ( $depart ) mod $_ }) . min ({ . [ 1 ] }) . flat ; # index of @l is the offset from factor my @l = $line . split ( ',' ); my ( $r , $factor ) = ( 0 , @l [ 0 ] . Int ); for 1 ..^ @l -> $i { next if @l [ $i ] eq 'x' ; $r = ( $r , { $_ + $factor } ... -> $a { ( $a + $i ) mod @l [ $i ] . Int == 0 }) . tail ; $factor *= @l [ $i ]; } say "Part Two: $r " ; Part One Given the sample inpu...
Read more

Raku: Advent of Code 2020 - Day Ten

Today's Advent of Code 2020 puzzle involves getting power (measured in jolts) to Santa's computing device from an outlet that provides 0 jolts. Santa's has some very special joltage adapters which act as step-up transformers. Each adapter can increase the joltage by up to 3 jolts. The input for the puzzle is a list of numbers representing the maximum joltage of each of Santa's adapters. And Santa's computing device has its own final adapter which is 3 jolts higher than the highest adapter in the bag. Below are Raku solutions to Day Ten's puzzle. I had a lot of fun getting Part One down to a minimal (obfuscated) 66 character short form solution: say lines ». Int . sort .& {(( |@ $_ ,. max + 3 ) Z- ( 0 ,|@ $_ )) . Bag .& { . { 1 } *. { 3 }}} Other than some typical boilerplate, the full length solution which follows isn't much longer. Though it is formatted a bit better for comprehension. Part Two and its challenge to calculate the count of all ...
Read more