X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Fmath%2Fhistogram.c;h=7b875d4089ad211d39a636f34fa8e8108a2098de;hb=a33f03639c36962d97202b3dfc24ae66b315085b;hp=c50e9980df71d6349263b36817259bafce892b5b;hpb=164d1274fcb70c54897f2a03fc7c27152ed4821a;p=pspp-builds.git diff --git a/src/math/histogram.c b/src/math/histogram.c index c50e9980..7b875d40 100644 --- a/src/math/histogram.c +++ b/src/math/histogram.c @@ -1,20 +1,18 @@ -/* PSPP - computes sample statistics. +/* PSPP - a program for statistical analysis. Copyright (C) 2004 Free Software Foundation, Inc. - This program is free software; you can redistribute it and/or - modify it under the terms of the GNU General Public License as - published by the Free Software Foundation; either version 2 of the - License, or (at your option) any later version. + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. - This program 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. + This program 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, USA. */ + along with this program. If not, see . */ #include #include @@ -36,12 +34,12 @@ histogram_create(double bins, double x_min, double x_max) bin_width = chart_rounded_tick((x_max - x_min)/ bins); bin_width_2 = bin_width / 2.0; - - n = ceil( x_max / (bin_width_2) ) ; + + n = ceil( x_max / (bin_width_2) ) ; if ( ! (n % 2 ) ) n++; upper_limit = n * bin_width_2; - n = floor( x_min / (bin_width_2) ) ; + n = floor( x_min / (bin_width_2) ) ; if ( ! (n % 2 ) ) n--; lower_limit = n * bin_width_2;