?HAMA

Navigation

Breadcrumbs

/ / usr / local / lib64 / perl5 / Template / Plugin

Create

Create File | Create Folder | Upload Files | Run Command

Edit File Size: 12.41 KB

//usr/local/lib64/perl5/Template/Plugin/Table.pm

Text Base64

#============================================================= -*-Perl-*-
#
# Template::Plugin::Table
#
# DESCRIPTION
#   Plugin to order a linear data set into a virtual 2-dimensional table
#   from which row and column permutations can be fetched.
#
# AUTHOR
#   Andy Wardley   <abw@wardley.org>
#
# COPYRIGHT
#   Copyright (C) 2000-2022 Andy Wardley.  All Rights Reserved.
#
#   This module is free software; you can redistribute it and/or
#   modify it under the same terms as Perl itself.
#
#============================================================================

package Template::Plugin::Table;

use strict;
use warnings;
use base 'Template::Plugin';
use Scalar::Util 'blessed';

our $VERSION = '3.100';
our $AUTOLOAD;

#------------------------------------------------------------------------
# new($context, \@data, \%args)
#
# This constructor method initialises the object to iterate through
# the data set passed by reference to a list as the first parameter.
# It calculates the shape of the permutation table based on the ROWS
# or COLS parameters specified in the $args hash reference.  The
# OVERLAP parameter may be provided to specify the number of common
# items that should be shared between subsequent columns.
#------------------------------------------------------------------------

sub new {
    my ($class, $context, $data, $params) = @_;
    my ($size, $rows, $cols, $coloff, $overlap, $error);

# if the data item is a reference to a Template::Iterator object,
    # or subclass thereof, we call its get_all() method to extract all
    # the data it contains
    if (blessed($data) && $data->isa('Template::Iterator')) {
        ($data, $error) = $data->get_all();
        return $class->error(
            "iterator failed to provide data for table: ",
            $error
        ) if $error;
    }

return $class->error('invalid table data, expecting a list')
        unless ref $data eq 'ARRAY';

$params ||= { };
    return $class->error('invalid table parameters, expecting a hash')
        unless ref $params eq 'HASH';

# ensure keys are folded to upper case
    @$params{ map { uc } keys %$params } = values %$params;

$size = scalar @$data;
    $overlap = $params->{ OVERLAP } || 0;

# calculate number of columns based on a specified number of rows
    if ($rows = $params->{ ROWS }) {
        if ($size < $rows) {
            $rows = $size;   # pad?
            $cols = 1;
            $coloff = 0;
        }
        else {
            $coloff = $rows - $overlap;
            $cols = int ($size / $coloff)
                + ($size % $coloff > $overlap ? 1 : 0)
            }
    }
    # calculate number of rows based on a specified number of columns
    elsif ($cols = $params->{ COLS }) {
        if ($size < $cols) {
            $cols = $size;
            $rows = 1;
            $coloff = 1;
        }
        else {
            $coloff = int ($size / $cols)
                + ($size % $cols > $overlap ? 1 : 0);
            $rows = $coloff + $overlap;
        }
    }
    else {
        $rows = $size;
        $cols = 1;
        $coloff = 0;
    }

bless {
        _DATA    => $data,
        _SIZE    => $size,
        _NROWS   => $rows,
        _NCOLS   => $cols,
        _COLOFF  => $coloff,
        _OVERLAP => $overlap,
        _PAD     => defined $params->{ PAD } ? $params->{ PAD } : 1,
    }, $class;
}

#------------------------------------------------------------------------
# row($n)
#
# Returns a reference to a list containing the items in the row whose
# number is specified by parameter.  If the row number is undefined,
# it calls rows() to return a list of all rows.
#------------------------------------------------------------------------

sub row {
    my ($self, $row) = @_;
    my ($data, $cols, $offset, $size, $pad)
        = @$self{ qw( _DATA _NCOLS _COLOFF _SIZE _PAD) };
    my @set;

# return all rows if row number not specified
    return $self->rows()
        unless defined $row;

return () if $row >= $self->{ _NROWS } || $row < 0;

my $index = $row;

for (my $c = 0; $c < $cols; $c++) {
        push(
            @set,
            $index < $size
                ? $data->[$index]
                : ($pad ? undef : ())
        );
        $index += $offset;
    }
    return \@set;
}

#------------------------------------------------------------------------
# col($n)
#
# Returns a reference to a list containing the items in the column whose
# number is specified by parameter.  If the column number is undefined,
# it calls cols() to return a list of all columns.
#------------------------------------------------------------------------

sub col {
    my ($self, $col) = @_;
    my ($data, $size) = @$self{ qw( _DATA _SIZE ) };
    my ($start, $end);
    my $blanks = 0;

# return all cols if row number not specified
    return $self->cols()
        unless defined $col;

return () if $col >= $self->{ _NCOLS } || $col < 0;

$start = $self->{ _COLOFF } * $col;
    $end = $start + $self->{ _NROWS } - 1;
    $end = $start if $end < $start;
    if ($end >= $size) {
        $blanks = ($end - $size) + 1;
        $end = $size - 1;
    }
    return () if $start >= $size;
    return [
        @$data[$start..$end],
        $self->{ _PAD }
            ? ((undef) x $blanks)
            : ()
    ];
}

#------------------------------------------------------------------------
# rows()
#
# Returns all rows as a reference to a list of rows.
#------------------------------------------------------------------------

sub rows {
    my $self = shift;
    return [ map { $self->row($_) } (0..$self->{ _NROWS }-1) ];
}

#------------------------------------------------------------------------
# cols()
#
# Returns all rows as a reference to a list of rows.
#------------------------------------------------------------------------

sub cols {
    my $self = shift;
    return [ map { $self->col($_) } (0..$self->{ _NCOLS }-1) ];
}

#------------------------------------------------------------------------
# AUTOLOAD
#
# Provides read access to various internal data members.
#------------------------------------------------------------------------

sub AUTOLOAD {
    my $self = shift;
    my $item = $AUTOLOAD;
    $item =~ s/.*:://;
    return if $item eq 'DESTROY';

if ($item =~ /^(?:data|size|nrows|ncols|overlap|pad)$/) {
        return $self->{ $item };
    }
    else {
        return (undef, "no such table method: $item");
    }
}

__END__

=head1 NAME

Template::Plugin::Table - Plugin to present data in a table

=head1 SYNOPSIS

[% USE table(list, rows=n, cols=n, overlap=n, pad=0) %]

[% FOREACH item IN table.row(n) %]
       [% item %]
    [% END %]

[% FOREACH item IN table.col(n) %]
       [% item %]
    [% END %]

[% FOREACH row IN table.rows %]
       [% FOREACH item IN row %]
          [% item %]
       [% END %]
    [% END %]

[% FOREACH col IN table.cols %]
       [% col.first %] - [% col.last %] ([% col.size %] entries)
    [% END %]

=head1 DESCRIPTION

The C<Table> plugin allows you to format a list of data items into a
virtual table.  When you create a C<Table> plugin via the C<USE> directive,
simply pass a list reference as the first parameter and then specify
a fixed number of rows or columns.

[% USE Table(list, rows=5) %]
    [% USE table(list, cols=5) %]

The C<Table> plugin name can also be specified in lower case as shown
in the second example above.  You can also specify an alternative variable
name for the plugin as per regular Template Toolkit syntax.

[% USE mydata = table(list, rows=5) %]

The plugin then presents a table based view on the data set.  The data
isn't actually reorganised in any way but is available via the C<row()>,
C<col()>, C<rows()> and C<cols()> as if formatted into a simple two dimensional
table of C<n> rows x C<n> columns.

So if we had a sample C<alphabet> list contained the letters 'C<a>' to 'C<z>',
the above C<USE> directives would create plugins that represented the following
views of the alphabet.

[% USE table(alphabet, ... %]

rows=5                  cols=5
    a  f  k  p  u  z        a  g  m  s  y
    b  g  l  q  v           b  h  n  t  z
    c  h  m  r  w           c  i  o  u
    d  i  n  s  x           d  j  p  v
    e  j  o  t  y           e  k  q  w
                            f  l  r  x

We can request a particular row or column using the C<row()> and C<col()>
methods.

[% USE table(alphabet, rows=5) %]
    [% FOREACH item = table.row(0) %]
       # [% item %] set to each of [ a f k p u z ] in turn
    [% END %]

[% FOREACH item = table.col(2) %]
       # [% item %] set to each of [ m n o p q r ] in turn
    [% END %]

Data in rows is returned from left to right, columns from top to
bottom.  The first row/column is 0.  By default, rows or columns that
contain empty values will be padded with the undefined value to fill
it to the same size as all other rows or columns.

For example, the last row (row 4) in the first example would contain the
values C<[ e j o t y undef ]>. The Template Toolkit will safely accept these
undefined values and print a empty string. You can also use the IF directive
to test if the value is set.

[% FOREACH item = table.row(4) %]
      [% IF item %]
         Item: [% item %]
      [% END %]
   [% END %]

You can explicitly disable the C<pad> option when creating the plugin to
returned shortened rows/columns where the data is empty.

[% USE table(alphabet, cols=5, pad=0) %]
   [% FOREACH item = table.col(4) %]
      # [% item %] set to each of 'y z'
   [% END %]

The C<rows()> method returns all rows/columns in the table as a reference
to a list of rows (themselves list references).  The C<row()> methods
when called without any arguments calls C<rows()> to return all rows in
the table.

Ditto for C<cols()> and C<col()>.

[% USE table(alphabet, cols=5) %]
    [% FOREACH row = table.rows %]
       [% FOREACH item = row %]
          [% item %]
       [% END %]
    [% END %]

The Template Toolkit provides the C<first>, C<last> and C<size> virtual
methods that can be called on list references to return the first/last entry
or the number of entries in a list. The following example shows how we might
use this to provide an alphabetical index split into 3 even parts.

[% USE table(alphabet, cols=3, pad=0) %]
    [% FOREACH group = table.col %]
       [ [% group.first %] - [% group.last %] ([% group.size %] letters) ]
    [% END %]

This produces the following output:

[ a - i (9 letters) ]
    [ j - r (9 letters) ]
    [ s - z (8 letters) ]

We can also use the general purpose C<join> virtual method which joins
the items of the list using the connecting string specified.

[% USE table(alphabet, cols=5) %]
    [% FOREACH row = table.rows %]
       [% row.join(' - ') %]
    [% END %]

Data in the table is ordered downwards rather than across but can easily
be transformed on output.  For example, to format our data in 5 columns
with data ordered across rather than down, we specify C<rows=5> to order
the data as such:

a  f  .  .
    b  g  .
    c  h
    d  i
    e  j

and then iterate down through each column (a-e, f-j, etc.) printing
the data across.

a  b  c  d  e
    f  g  h  i  j
    .  .
    .

Example code to do so would be much like the following:

[% USE table(alphabet, rows=3) %]
    [% FOREACH cols = table.cols %]
      [% FOREACH item = cols %]
        [% item %]
      [% END %]
    [% END %]

Output:

a  b  c
    d  e  f
    g  h  i
    j  .  .
    .

In addition to a list reference, the C<Table> plugin constructor may be passed
a reference to a L<Template::Iterator> object or subclass thereof. The
L<Template::Iterator> L<get_all()|Template::Iterator#get_all()> method is
first called on the iterator to return all remaining items. These are then
available via the usual Table interface.

[% USE DBI(dsn,user,pass) -%]

# query() returns an iterator
    [% results = DBI.query('SELECT * FROM alphabet ORDER BY letter') %]

# pass into Table plugin
    [% USE table(results, rows=8 overlap=1 pad=0) -%]

[% FOREACH row = table.cols -%]
       [% row.first.letter %] - [% row.last.letter %]:
          [% row.join(', ') %]
    [% END %]

=head1 AUTHOR

Andy Wardley E<lt>abw@wardley.orgE<gt> L<http://wardley.org/>

=head1 COPYRIGHT

This module is free software; you can redistribute it and/or
modify it under the same terms as Perl itself.

=head1 SEE ALSO

L<Template::Plugin>

=cut

# Local Variables:
# mode: perl
# perl-indent-level: 4
# indent-tabs-mode: nil
# End:
#
# vim: expandtab shiftwidth=4:

Exit & Reset Text mode: syntax highlighting auto-detects file type.

Directory Contents

Dirs: 0 × Files: 20

Sort:

Enable drag-to-move

Name	Size	Perms	Modified	Actions
Assert.pm	3.43 KB	lr--r--r--	2022-07-26 06:42:11	Edit Download recursive recursive
Datafile.pm	4.40 KB	lr--r--r--	2022-07-26 06:42:21	Edit Download recursive recursive
Date.pm	11.22 KB	lr--r--r--	2022-07-26 07:09:42	Edit Download recursive recursive
Directory.pm	10.90 KB	lr--r--r--	2022-07-26 06:43:06	Edit Download recursive recursive
Dumper.pm	3.66 KB	lr--r--r--	2022-07-25 18:57:15	Edit Download recursive recursive
File.pm	10.92 KB	lr--r--r--	2022-07-26 07:10:13	Edit Download recursive recursive
Filter.pm	9.63 KB	lr--r--r--	2022-07-26 06:43:36	Edit Download recursive recursive
Format.pm	1.79 KB	lr--r--r--	2022-07-26 06:43:45	Edit Download recursive recursive
HTML.pm	5.87 KB	lr--r--r--	2022-07-26 06:43:59	Edit Download recursive recursive
Image.pm	11.43 KB	lr--r--r--	2022-07-26 07:10:56	Edit Download recursive recursive
Iterator.pm	1.95 KB	lr--r--r--	2022-07-26 06:44:16	Edit Download recursive recursive
Math.pm	3.99 KB	lr--r--r--	2022-07-26 06:44:36	Edit Download recursive recursive
Pod.pm	1.61 KB	lr--r--r--	2022-07-26 06:44:44	Edit Download recursive recursive
Procedural.pm	3.59 KB	lr--r--r--	2022-07-25 18:57:15	Edit Download recursive recursive
Scalar.pm	3.67 KB	lr--r--r--	2022-07-26 06:45:02	Edit Download recursive recursive
String.pm	17.69 KB	lr--r--r--	2022-07-26 06:45:13	Edit Download recursive recursive
Table.pm	12.41 KB	lr--r--r--	2022-07-26 07:13:22	Edit Download recursive recursive
URL.pm	5.67 KB	lr--r--r--	2022-07-26 07:13:38	Edit Download recursive recursive
View.pm	2.40 KB	lr--r--r--	2022-07-26 06:45:43	Edit Download recursive recursive
Wrap.pm	3.18 KB	lr--r--r--	2022-07-26 06:45:52	Edit Download recursive recursive