%# BEGIN BPS TAGGED BLOCK {{{
%#
%# COPYRIGHT:
%#
%# This software is Copyright (c) 1996-2011 Best Practical Solutions, LLC
%#                                          <sales@bestpractical.com>
%#
%# (Except where explicitly superseded by other copyright notices)
%#
%#
%# LICENSE:
%#
%# This work is made available to you under the terms of Version 2 of
%# the GNU General Public License. A copy of that license should have
%# been provided with this software, but in any event can be snarfed
%# from www.gnu.org.
%#
%# This work is distributed in the hope that it will be useful, but
%# WITHOUT ANY WARRANTY; without even the implied warranty of
%# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
%# General Public License for more details.
%#
%# You should have received a copy of the GNU General Public License
%# along with this program; if not, write to the Free Software
%# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
%# 02110-1301 or visit their web page on the internet at
%# http://www.gnu.org/licenses/old-licenses/gpl-2.0.html.
%#
%#
%# CONTRIBUTION SUBMISSION POLICY:
%#
%# (The following paragraph is not intended to limit the rights granted
%# to you to modify and distribute this software under the terms of
%# the GNU General Public License and is only of importance to you if
%# you choose to contribute your changes and enhancements to the
%# community by submitting them to Best Practical Solutions, LLC.)
%#
%# By intentionally submitting any modifications, corrections or
%# derivatives to this work, or any other work intended for use with
%# Request Tracker, to Best Practical Solutions, LLC, you confirm that
%# you are the copyright holder for those contributions and you grant
%# Best Practical Solutions,  LLC a nonexclusive, worldwide, irrevocable,
%# royalty-free, perpetual, license to use, copy, create derivative
%# works based on those contributions, and sublicense and distribute
%# those contributions and any derivatives thereof.
%#
%# END BPS TAGGED BLOCK }}}
<%ARGS>
$BaseURL => undef
$Rows => undef
$TotalFound => undef
$CurrentPage => undef
$Pages => undef
$URLParams => undef
</%ARGS>

<%INIT>
$m->out(qq{<div class="paging">});
if ($Pages == 1) {
  $m->out(loc('Page 1 of 1'));
}
else{
$m->out(loc('Page') . ' ');
my $prev = $m->comp(
		    '/Elements/QueryString',
		    %$URLParams,
		    Page    => ( $CurrentPage - 1 )
		   );
my $next = $m->comp(
		    '/Elements/QueryString',
		    %$URLParams,
		    Page    => ( $CurrentPage + 1 )
		   );
my %show;
$show{1} = 1;
$show{$_} = 1 for (($CurrentPage - 2)..($CurrentPage + 2));
$show{$Pages} = 1;
my $dots;

for my $number ( 1 .. $Pages ) {
    if ( $show{$number} ) {
        $dots = undef;
        my $qs =
          $m->comp( '/Elements/QueryString', %$URLParams, Page => $number );
	$m->out(qq{<span class="pagenum">});
        if ( $number == $CurrentPage ) {
            $m->out(qq{<span class="currentpage">$number</span> });
        }
        else {
            $m->out(qq{<a href="$BaseURL$qs">$number</a> });
        }
    }
    elsif ( not $dots ) {
        $dots = 1;
        $m->out(qq{<span class="dots">...</span>});
    }
	$m->out(qq{</span>});
}

if ($CurrentPage > 1) {
  $m->out(qq{<a href="$BaseURL$prev" class="nav">}.loc('Previous') . qq{</a>});
}
if (($CurrentPage * $Rows) < $TotalFound) {
  $m->out(qq{<a href="$BaseURL$next" class="nav">}.loc('Next').qq{</a>});
}
}
$m->out(qq{</div>});
</%INIT>
