pedigree: added _but_root & _but_two_oldest loops

... after having learned a bit of Perl, knocked my head against
Perl references and arrays of hashes, tried to use some nice
functionnal programming constructs - no success - to make things
more generic... I'm back to the roots, with this simple code :)

Signed-off-by: intrigeri <intrigeri@boum.org>

diff --git a/IkiWiki/Plugin/pedigree.pm b/IkiWiki/Plugin/pedigree.pm
index b051a6da2f29bf59ab63d935e866042f8edb580f..3d1e3764d9f8fd110e0a9d06044e8c90c8864409 100644 (file)
--- a/IkiWiki/Plugin/pedigree.pm
+++ b/IkiWiki/Plugin/pedigree.pm
@@ -26,7 +26,7 @@ sub pedigree ($) { #{{{
                push @ret, {
                            url => urlto($path, $page),
                            page => $title,
                push @ret, {
                            url => urlto($path, $page),
                            page => $title,

-                           level => $i,
+                           absdepth => $i,

                            is_root => ($i eq 0),
                            is_second_ancestor => ($i eq 1),
                            is_grand_mother => ($i eq ($pagedepth - 2)),
                            is_root => ($i eq 0),
                            is_second_ancestor => ($i eq 1),
                            is_grand_mother => ($i eq ($pagedepth - 2)),


@@ -39,14 +39,45 @@ sub pedigree ($) { #{{{
        return @ret;
 } #}}}
 
        return @ret;
 } #}}}
 

+sub forget_oldest ($@) { #{{{
+       my $offset=shift;
+       my @pedigree=@_;
+       my @ret;
+       my $parent;
+       unless ($offset ge scalar(@pedigree)) {
+               for (my $i=0; $i < $offset; $i++) {
+                       shift @pedigree;
+               }
+               while (@pedigree) {
+                       # Doing so does not modify the original @pedigree, we've
+                       # got our own copy of its "content" (i.e. a pile of
+                       # references to hashes)...
+                       $parent=shift @pedigree;
+                       # ... but we have no copy of the referenced hashes, so we
+                       # actually are modifying them in-place, but we don't care
+                       # here since reldepth has to be computed everytime anyway.
+                       $parent->{reldepth}=($parent->{absdepth} - $offset);
+                       push @ret, $parent;
+               }
+       }
+       return @ret;
+} #}}}
+

 sub pagetemplate (@) { #{{{
        my %params=@_;
         my $page=$params{page};
         my $template=$params{template};
 
 sub pagetemplate (@) { #{{{
        my %params=@_;
         my $page=$params{page};
         my $template=$params{template};
 

-       if ($template->query(name => "pedigree")) {
-               $template->param(pedigree => [pedigree($page)]);
-       }
+       if ($template->query(name => "pedigree")
+           or $template->query(name => "pedigree_but_root")
+           or $template->query(name => "pedigree_but_two_oldest")
+          )
+         {
+                 my @pedigree=pedigree($page);
+                 $template->param(pedigree => \@pedigree);
+                 $template->param(pedigree_but_root => [forget_oldest(1, @pedigree)]);
+                 $template->param(pedigree_but_two_oldest => [forget_oldest(2, @pedigree)]);
+         }

 
 } # }}}
 
 
 } # }}}