min_max.h

Go to the documentation of this file.

/* Author(s):     Francois Mauger <mauger@lpccaen.in2p3.fr>
 * Creation date: 2009-10-02
 * Last modified: 2014-11-18
 *
 * Description:
 *
 *   An algorithm that computes the min and max values from
 *   a list of numbers.
 *
 */

#ifndef MYGSL_MIN_MAX_H
#define MYGSL_MIN_MAX_H 1


// Third Party:
// - Bayeux/datatools
#include <datatools/i_tree_dump.h>

namespace mygsl {

  class min_max : public datatools::i_tree_dumpable
  {
  public:

    bool is_valid() const;

    double get_min() const;

    double get_max() const;

    double get_median() const;

    double get_width() const;

    double get_half_width() const;

    int get_min_index() const;

    int get_max_index() const;

    int get_counter() const;

    min_max();

    void reset();

    void add(double value_);

    virtual void tree_dump(std::ostream & out_ = std::clog,
                           const std::string & title_  = "",
                           const std::string & indent_ = "",
                           bool inherit_ = false) const;

  private:

    int    _counter_;   
    double _min_;       
    int    _min_index_; 
    double _max_;       
    int    _max_index_; 

  };

} // end of namespace mygsl

#endif // MYGSL_MIN_MAX_H

/* Local Variables: */
/* mode: c++        */
/* coding: utf-8    */
/* End:             */