/usr/share/perl5/Chart/Mountain.pm is in libchart-perl 2.4.5-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 | ## @file
# Implementation of Chart::Mountain
#
# written by david bonner
# dbonner@cs.bu.edu
#
# maintained by
# @author Chart Group at Geodetic Fundamental Station Wettzell (Chart@fs.wettzell.de)
# @date 2012-03-22
# @version 2.4.5
#
# Updated for
# compatibility with
# changes to Chart::Base
# by peter clark
# ninjaz@webexpress.com
#
# Copyright 1998, 1999 by James F. Miner.
# All rights reserved.
# This program is free software; you can redistribute it
# and/or modify it under the same terms as Perl itself.
#
## @class Chart::Mountain
# @brief Mountain class derived class for Chart to implement mountain type of plots
#
# Some Mountain chart details:
#
# The effective y data value for a given x point and dataset
# is the sum of the actual y data values of that dataset and
# all datasets "below" it (i.e., with higher dataset indexes).
#
# If the y data value in any dataset is undef or negative for
# a given x, then all datasets are treated as missing for that x.
#
# The y minimum is always forced to zero.
#
# To avoid a dataset area "cutting into" the area of the dataset below
# it, the y pixel for each dataset point will never be below the y pixel for
# the same point in the dataset below the dataset.
# This probably should have a custom legend method, because each
# dataset is identified by the fill color (and optional pattern)
# of its area, not just a line color. So the legend shou a square
# of the color and pattern for each dataset.
package Chart::Mountain;
use Chart::Base '2.4.5';
use GD;
use Carp;
use strict;
@Chart::Mountain::ISA = qw ( Chart::Base );
$Chart::Mountain::VERSION = '2.4.5';
#===================#
# private methods #
#===================#
## @fn private array _find_y_range()
# Find minimum and maximum value of y data sets.
#
# @return ( min, max, flag_all_integers )
sub _find_y_range
{
my $self = shift;
# This finds the maximum point-sum over all x points,
# where the point-sum is the sum of the dataset values at that point.
# If the y value in any dataset is undef for a given x, then all datasets
# are treated as missing for that x.
my $data = $self->{'dataref'};
my $max = undef;
for my $i ( 0 .. $#{ $data->[0] } )
{
my $y_sum = $data->[1]->[$i];
if ( defined $y_sum && $y_sum >= 0 )
{
for my $dataset ( @$data[ 2 .. $#$data ] )
{ # order not important
my $datum = $dataset->[$i];
if ( defined $datum && $datum >= 0 )
{
$y_sum += $datum;
}
else
{ # undef or negative, treat all at same x as missing.
$y_sum = undef;
last;
}
}
}
if ( defined $y_sum )
{
$max = $y_sum unless defined $max && $y_sum <= $max;
}
}
( 0, $max );
}
## @fn private _draw_data
# draw the data
sub _draw_data
{
my $self = shift;
my $data = $self->{'dataref'};
my @patterns = @{ $self->{'patterns'} || [] };
# Calculate array of x pixel positions (@x).
my $x_step =
( $self->{'curr_x_max'} - $self->{'curr_x_min'} ) / ( $self->{'num_datapoints'} > 0 ? $self->{'num_datapoints'} : 1 );
my $x_min = $self->{'curr_x_min'} + $x_step / 2;
my $x_max = $self->{'curr_x_max'} - $x_step / 2;
my @x = map { $_ * $x_step + $x_min } 0 .. $self->{'num_datapoints'} - 1;
my ( $t_x_min, $t_x_max, $t_y_min, $t_y_max, $abs_x_max, $abs_y_max );
my $repair_top_flag = 0;
# Calculate array of y pixel positions for upper boundary each dataset (@y).
my $map =
( $self->{'max_val'} )
? ( $self->{'curr_y_max'} - $self->{'curr_y_min'} ) / $self->{'max_val'}
: ( $self->{'curr_y_max'} - $self->{'curr_y_min'} ) / 10;
my $y_max = $self->{'curr_y_max'}; # max pixel point (lower y values)
my @y;
for my $j ( 0 .. $#{ $data->[0] } )
{
my $sum = 0;
for my $i ( reverse 1 .. $#{$data} )
{ # bottom to top of chart
my $datum = $data->[$i][$j];
#set the repair flag, if the datum is out of the borders of the chart
if ( defined $datum && $datum > $self->{'max_val'} ) { $repair_top_flag = 1; }
if ( defined $datum && $datum >= 0 )
{
$sum += $datum;
$y[ $i - 1 ][$j] = $y_max - $map * $sum;
}
else
{ # missing value, force all to undefined
foreach my $k ( 1 .. $#{$data} ) { $y[ $k - 1 ][$j] = undef }
last;
}
}
}
# Find first and last x where y is defined in the bottom dataset.
my $x_begin = 0;
my $x_end = $self->{'num_datapoints'} - 1;
while ( $x_begin <= $x_end && !defined $y[-1]->[$x_begin] ) { $x_begin++ }
while ( $x_begin <= $x_end && !defined $y[-1]->[$x_end] ) { $x_end-- }
if ( $x_begin > $x_end ) { croak "Internal error: x_begin > x_end ($x_begin > $x_end)"; }
# For each dataset, generate a polygon for the dataset's area of the chart,
# and fill the polygon with the dataset's color/pattern.
my $poly = GD::Polygon->new;
$poly->addPt( $x[$x_end], $y_max ); # right end of x axis
$poly->addPt( $x[$x_begin], $y_max ); # left end of x axis (right-to-left)
for my $dataset ( reverse 0 .. @y - 1 )
{
my $y_ref = $y[$dataset];
# Append points for this dataset to polygon, direction depends on $dataset % 2.
my $last_vertex_count = $poly->length;
if ( ( @y - 1 - $dataset ) % 2 )
{ # right-to-left
for ( reverse $x_begin .. $x_end )
{
$poly->addPt( $x[$_], $y_ref->[$_] ) if defined $y_ref->[$_];
}
}
else
{ # left-to-right
for ( $x_begin .. $x_end )
{
$poly->addPt( $x[$_], $y_ref->[$_] ) if defined $y_ref->[$_];
}
}
# draw the polygon
my $color = $self->_color_role_to_index( 'dataset' . $dataset );
if ( $patterns[$dataset] )
{
$self->{'gd_obj'}->filledPolygon( $poly, $color ) if $patterns[$dataset]->transparent >= 0;
$self->{'gd_obj'}->setTile( $patterns[$dataset] );
$self->{'gd_obj'}->filledPolygon( $poly, gdTiled );
}
else
{
$self->{'gd_obj'}->filledPolygon( $poly, $color );
}
# delete previous dataset's points from the polygon, update $last_vertex_count.
unless ( $dataset == 0 )
{ # don't bother do delete points after last area
while ($last_vertex_count) { $poly->deletePt(0); $last_vertex_count-- }
}
}
# Enclose the plots
$self->{'gd_obj'}->rectangle( $self->{'curr_x_min'}, $self->{'curr_y_min'}, $self->{'curr_x_max'}, $self->{'curr_y_max'},
$self->_color_role_to_index('misc') );
#get the width and the heigth of the complete picture
( $abs_x_max, $abs_y_max ) = $self->{'gd_obj'}->getBounds();
#repair the chart, if the lines are out of the borders of the chart
if ($repair_top_flag)
{
#overwrite the ugly mistakes
$self->{'gd_obj'}->filledRectangle(
$self->{'curr_x_min'}, 0, $self->{'curr_x_max'},
$self->{'curr_y_min'} - 1,
$self->_color_role_to_index('background')
);
#save the actual x and y values
$t_x_min = $self->{'curr_x_min'};
$t_x_max = $self->{'curr_x_max'};
$t_y_min = $self->{'curr_y_min'};
$t_y_max = $self->{'curr_y_max'};
#get back to the point, where everything began
$self->{'curr_x_min'} = 0;
$self->{'curr_y_min'} = 0;
$self->{'curr_x_max'} = $abs_x_max;
$self->{'curr_y_max'} = $abs_y_max;
#draw the title again
if ( $self->{'title'} )
{
$self->_draw_title();
}
#draw the sub title again
if ( $self->{'sub_title'} )
{
$self->_draw_sub_title();
}
#draw the top legend again
if ( $self->{'legend'} =~ /^top$/i )
{
$self->_draw_top_legend();
}
#reset the actual values
$self->{'curr_x_min'} = $t_x_min;
$self->{'curr_x_max'} = $t_x_max;
$self->{'curr_y_min'} = $t_y_min;
$self->{'curr_y_max'} = $t_y_max;
}
}
###############################################################
### Fix a bug in GD::Polygon.
### A patch has been submitted to Lincoln Stein.
require GD;
unless ( defined &GD::Polygon::deletePt )
{
*GD::Polygon::deletePt = sub {
my ( $self, $index ) = @_;
unless ( ( $index >= 0 ) && ( $index < @{ $self->{'points'} } ) )
{
warn "Attempt to set an undefined polygon vertex";
return undef;
}
my ($vertex) = splice( @{ $self->{'points'} }, $index, 1 );
$self->{'length'}--;
return @$vertex;
}
}
###############################################################
1;
|