Catalyst::View::Mason Documentation ne Implementation

I've got an old gentoo Apache mod_perl Mason site which I maintain for work. Mostly it is used for mining data from our less than desirable issue tracking system (Soffront Track) in order to help make realistic guestimates of what we can deliver and when.

It is running on an old quad xeon box that we'd experimented with, and decided not to use in production. Since work is a "Microsoft" shop, it has long been an item on my todo list to move it over to a windows box... but for some reason, I've never really gotten around to it.

However, a couple years back I did do the least amount of work necessary to get it to run in a windows w/ Catalyst::View::Mason environment. I've changed laptops a couple times since then, Perl 5.10.0 was released and Catalyst 5.8.

So last week, I reinstalled the latest version of all of the above on my laptop so I could take my work with me on the go.

I found that I had to add:
__PACKAGE__->config(use_match => 1);

to my ...::View::Mason.pm for backward compatibility.


What was slightly annoying, is that while this was ultimately easy enough to find and fix... it isn't what the README says (http://cpansearch.perl.org/src/FLORA/Catalyst-View-Mason-0.17/README):

"use_match"
        Use "$c->request->match" instead of "$c->action" to determine which
        template to use if "$c->stash->{template}" isn't set. This option is
        deprecated and exists for backward compatibility only.

        Currently defaults to 1, to avoid breaking older code, but new code
        should always set this to 0.

(more later... my plane is boarding...)

Comments

  1. AnonymousJune 8, 2009 at 3:12 AM

    The documentation says what has been the case for more than a year, in which you apparently didn't bother to try new upstream releases.

    As of recently that default was changed, as stated in the changelog. Apparently I forgot to update the documentation accordingly.

    I guess a documentation patch to fix my mistake would've been more useful than ranting on your blog, and would probably have been quicker and helped others as well.

    ReplyDelete
  2. GarrettJune 23, 2009 at 10:10 AM

    You are exactly right. I hadn't updated it in years. I'm not in the practice of updating stuff just because updates exist. I don't look forward to figuring out what's changed and what's broken as a result.

    And you are also right. A documentation patch would have been nice. I'd actually intended to do just that, but my plane was boarding, and I never got around to finishing the post. My apologies.

    However, characterizing the mild writeup of my experience with Catalyst::View::Mason as a rant doesn't do much to encourage me to spend any more time on it... helping you or others. You catch more helpers with honey than vinegar.

    Thank you for your work with Catalyst::View::Mason. It has made migrating from Mason to Catalyst much easier. I appreciate the gift of your time and efforts. If we ever meet at a conference, the first beer is on me.

    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