Clipper
|
00001 00004 //C Copyright (C) 2000-2006 Kevin Cowtan and University of York 00005 //L 00006 //L This library is free software and is distributed under the terms 00007 //L and conditions of version 2.1 of the GNU Lesser General Public 00008 //L Licence (LGPL) with the following additional clause: 00009 //L 00010 //L `You may also combine or link a "work that uses the Library" to 00011 //L produce a work containing portions of the Library, and distribute 00012 //L that work under terms of your choice, provided that you give 00013 //L prominent notice with each copy of the work that the specified 00014 //L version of the Library is used in it, and that you include or 00015 //L provide public access to the complete corresponding 00016 //L machine-readable source code for the Library including whatever 00017 //L changes were used in the work. (i.e. If you make changes to the 00018 //L Library you must distribute those, but you do not need to 00019 //L distribute source or object code to those portions of the work 00020 //L not covered by this licence.)' 00021 //L 00022 //L Note that this clause grants an additional right and does not impose 00023 //L any additional restriction, and so does not affect compatibility 00024 //L with the GNU General Public Licence (GPL). If you wish to negotiate 00025 //L other terms, please contact the maintainer. 00026 //L 00027 //L You can redistribute it and/or modify the library under the terms of 00028 //L the GNU Lesser General Public License as published by the Free Software 00029 //L Foundation; either version 2.1 of the License, or (at your option) any 00030 //L later version. 00031 //L 00032 //L This library is distributed in the hope that it will be useful, but 00033 //L WITHOUT ANY WARRANTY; without even the implied warranty of 00034 //L MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00035 //L Lesser General Public License for more details. 00036 //L 00037 //L You should have received a copy of the CCP4 licence and/or GNU 00038 //L Lesser General Public License along with this library; if not, write 00039 //L to the CCP4 Secretary, Daresbury Laboratory, Warrington WA4 4AD, UK. 00040 //L The GNU Lesser General Public can also be obtained by writing to the 00041 //L Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, 00042 //L MA 02111-1307 USA 00043 00044 00045 #ifndef CLIPPER_STATS 00046 #define CLIPPER_STATS 00047 00048 00049 #include "clipper_types.h" 00050 00051 00052 namespace clipper 00053 { 00054 00056 template<class T = ftype> class Range 00057 { 00058 public: 00060 inline Range() { lmin = 999999999; lmax = -999999999; } 00062 inline Range( const T& min, const T& max ) { lmin = min; lmax = max; } 00063 inline const T& min() const { return lmin; } 00064 inline const T& max() const { return lmax; } 00065 inline T range() const { return lmax-lmin; } 00066 00067 inline void include( const T& datum ) 00068 { lmin = (datum<lmin)?datum:lmin; lmax = (datum>lmax)?datum:lmax; } 00070 inline bool contains( const T& datum ) const 00071 { return ( datum >= lmin && datum <= lmax ); } 00073 inline T truncate( const T& datum ) const 00074 { return Util::bound( lmin, datum, lmax ); } 00075 private: 00076 T lmin, lmax; 00077 }; 00078 00080 class Range_sampling : public Range<ftype> 00081 { 00082 public: 00084 inline Range_sampling() : n_(0) {} 00086 inline Range_sampling( const int& n ) : n_(n) {} 00088 inline Range_sampling( const Range<ftype>& range, const int& n ) : 00089 Range<ftype>( range ), n_(n) {} 00091 inline ftype indexf( const ftype& x ) const 00092 { return ftype(size())*(x-min())/range(); } 00094 inline ftype x( const ftype& i ) const 00095 { return range()*i/ftype(size())+min(); } 00097 inline int index( const ftype& x ) const { return Util::intf( indexf(x) ); } 00099 inline int index_bounded( const ftype& x ) const 00100 { return Util::bound( 0, Util::intf( indexf(x) ), size()-1 ); } 00102 inline ftype x( const int& i ) const { return x( ftype(i)+0.5 ); } 00104 inline ftype x_min( const int& i ) const { return x( ftype(i) ); } 00106 inline ftype x_max( const int& i ) const { return x( ftype(i)+1.0 ); } 00108 inline int size() const { return n_; } 00109 private: 00110 int n_; 00111 }; 00112 00114 00117 class Histogram : public Range_sampling 00118 { 00119 public: 00121 Histogram() {} 00123 Histogram( const Range<ftype>& range, const int& n ) : 00124 Range_sampling( range, n ), data( n, 0.0 ) {} 00126 void accumulate( const ftype& x ) 00127 { if ( contains(x) ) data[ index_bounded(x) ] += 1.0; } 00129 void accumulate( const ftype& x, const ftype& w ) 00130 { if ( contains(x) ) data[ index_bounded(x) ] += w; } 00132 ftype sum() const; 00134 inline const ftype& y( const int& i ) const { return data[i]; } 00136 ftype y( const ftype& x ) const; 00138 const Histogram& operator += ( const Histogram& h ); 00139 // inherited functions listed for documentation purposes 00140 //-- inline ftype x( const int& i ) const; 00141 //-- inline ftype x_min( const int& i ) const; 00142 //-- inline ftype x_max( const int& i ) const; 00143 //-- inline int size() const; 00144 private: 00145 std::vector<ftype> data; 00146 }; 00147 00148 00150 00163 class Generic_ordinal 00164 { 00165 public: 00167 Generic_ordinal() {} 00169 Generic_ordinal( const Range<ftype>& range, const int& n ) 00170 { init( range, n ); } 00172 void init( const Range<ftype>& range, const int num_ranges = 1000 ); 00174 void init( const std::vector<ftype>& values, const int num_ranges = 1000 ); 00176 ftype ordinal( const ftype& value ) const; 00177 00179 void accumulate( const ftype& value ); 00181 void accumulate( const ftype& value, const ftype& weight ); 00183 void prep_ordinal(); 00185 void invert(); 00186 00188 void init( const int num_ranges = 1000 ); 00190 void add_pass_1( const ftype& value ); 00192 void add_pass_2( const ftype& value ); 00193 protected: 00194 ftype nranges; 00195 Range<ftype> range_; 00196 std::vector<ftype> hist; 00197 }; 00198 00199 00200 00201 } // namespace clipper 00202 00203 #endif