/* $Id: histogram.h,v 1.1 2006-08-09 15:20:54 jonathan Exp $* Jonathan Ledlie, Harvard University.* Copyright 2006.  All rights reserved.*/#ifndef HISTOGRAM_H#define HISTOGRAM_H#include <math.h>#include <iostream>#include <vector>#include <map>#include "error.h"using namespace::std;class Histogram {	friend ostream& operator << (ostream& os, Histogram* h);private:	int size;	double sum;	// TODO some kind of sorted list would be better	vector<double> values;	map<double,int> value2count;	void add (double value, int count, bool doCoerce);	double findBucket (double value);public:	const double bucketWidth;	Histogram (double bw) : bucketWidth(bw) { size = 0; sum = 0;}	void add (Histogram *);	void add (double value, int count) { add (value, count, true); }	void add (double value) { add (value, 1); }	void add (int value) { add ((double)value,1); }	void add (int value, int count) { add ((double)value,count); }	void clear () { value2count.clear(); size = 0; values.clear(); }	double mean ();	double percentile (double pct);};#endif