This commit was manufactured by cvs2svn to create tag 'FreeBSD-release/1.0'.
[unix-history] / gnu / lib / libg++ / libg++ / SmplHist.cc
// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
written by Dirk Grunwald (grunwald@cs.uiuc.edu)
This file is part of the GNU C++ Library. This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version. This library 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 Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifdef __GNUG__
#pragma implementation
#endif
#include <stream.h>
#include <SmplHist.h>
#include <math.h>
#ifndef HUGE_VAL
#ifdef HUGE
#define HUGE_VAL HUGE
#else
#include <float.h>
#define HUGE_VAL DBL_MAX
#endif
#endif
const int SampleHistogramMinimum = -2;
const int SampleHistogramMaximum = -1;
SampleHistogram::SampleHistogram(double low, double high, double width)
{
if (high < low) {
double t = high;
high = low;
low = t;
}
if (width == -1) {
width = (high - low) / 10;
}
howManyBuckets = int((high - low) / width) + 2;
bucketCount = new int[howManyBuckets];
bucketLimit = new double[howManyBuckets];
double lim = low;
for (int i = 0; i < howManyBuckets; i++) {
bucketCount[i] = 0;
bucketLimit[i] = lim;
lim += width;
}
bucketLimit[howManyBuckets-1] = HUGE_VAL; /* from math.h */
}
SampleHistogram::~SampleHistogram()
{
if (howManyBuckets > 0) {
delete bucketCount;
delete bucketLimit;
}
}
void
SampleHistogram::operator+=(double value)
{
int i;
for (i = 0; i < howManyBuckets; i++) {
if (value < bucketLimit[i]) break;
}
bucketCount[i]++;
this->SampleStatistic::operator+=(value);
}
int
SampleHistogram::similarSamples(double d)
{
int i;
for (i = 0; i < howManyBuckets; i++) {
if (d < bucketLimit[i]) return(bucketCount[i]);
}
return(0);
}
void
SampleHistogram::printBuckets(ostream& s)
{
for(int i = 0; i < howManyBuckets; i++) {
if (bucketLimit[i] >= HUGE_VAL) {
s << "< max : " << bucketCount[i] << "\n";
} else {
s << "< " << bucketLimit[i] << " : " << bucketCount[i] << "\n";
}
}
}
void
SampleHistogram::reset()
{
this->SampleStatistic::reset();
if (howManyBuckets > 0) {
for (register int i = 0; i < howManyBuckets; i++) {
bucketCount[i] = 0;
}
}
}