Boost logo

Boost :

From: Paul A. Bristow (boost_at_[hidden])
Date: 2003-04-03 15:54:44

I believe this conjecture is correct, but I am still eagerly awaiting 7.1 :-)

This is quite interesting (though it needs Industrial Strengthening of course),
and could usefully generate the higher moments and other statistical thingys

And it makes me wonder if one could use a container like a circular buffer. I
can think of applications where one would like new data to pour in continuously
and to look back for mean (weighted Kalmanesque?), perhaps only a limited
distance. Using a vector or valarray would imply it would grow for ever and run
out of space eventually. (I think someone else suggested something of this
Is the STL queue suitable?


Paul A Bristow, Prizet Farmhouse, Kendal, Cumbria, LA8 8AB UK
+44 1539 561830 Mobile +44 7714 33 02 04
Mobile mailto:pabristow_at_[hidden]

> -----Original Message-----
> From: boost-bounces_at_[hidden]
> [mailto:boost-bounces_at_[hidden]]On Behalf Of Reece Dunn
> Sent: Thursday, April 03, 2003 3:33 PM
> To: boost_at_[hidden]
> Subject: Re: [boost] Statistics code example
> MSVC 7 does not handle partial template specialization, so it will not
> compile (you'll need to remove the above specialization). It should work for
> MSVC 7.1 final beta, but I do not have a copy of it to verify.
> The solution would be to wrap the above in a guard statement similar to:
> template<typename T>
> struct Stat_t< std::complex<T> > {
> typedef typename std::complex<T>::value_type value_t;
> };
> #endif

Boost list run by bdawes at, gregod at, cpdaniel at, john at