IndexedReal.hpp

Go to the documentation of this file.

/*==========================================================================
 *
 * Original source copyright (c) 2000, Carnegie Mellon University.  
 * See copyright.cmu for details.
 * Modifications copyright (c) 2002, University of Massachusetts.
 * See copyright.umass for details.
 *
 *==========================================================================
 */


#ifndef _INDEXEDREAL_HPP
#define _INDEXEDREAL_HPP

#include "common_headers.hpp"
#include <algorithm>

namespace lemur 
{
  namespace api 
  {
    

    // CLASSES: IndexedReal, IndexedRealVector (C. Zhai, 12/1/2000)
    // Normalize and LogToPosterior (added dmf, 09/2002)

    struct IndexedReal {
      int ind;
      double val;
    };

    class IndexedRealVector : public vector<IndexedReal> {
    public:
  
      IndexedRealVector() : vector<IndexedReal>() {}
      IndexedRealVector(int size) : vector<IndexedReal>(size) {}
      virtual ~IndexedRealVector() {}
      virtual iterator FindByIndex(int index);

      // return true iff the entry already exists.
      virtual bool IncreaseValueFor(int index, double value);

      virtual void PushValue(int index, double value);

      virtual void Sort(bool descending = true);

      virtual void NormalizeValues();

      virtual void LogToPosterior();


    private:


      class IndexedRealAscending {
      public:
        bool operator()(const IndexedReal & a, const IndexedReal & b) {
          if (a.val != b.val)
            return a.val < b.val;  // based on the real value
          return a.ind < b.ind;
        }
      };

      class IndexedRealDescending { 
      public: 
        bool operator()(const IndexedReal & a, const IndexedReal & b) {
          if (a.val != b.val)
            return a.val > b.val;  // based on the real value
          return a.ind > b.ind;
        }
      };

      static IndexedRealAscending ascendOrder;
      static IndexedRealDescending descendOrder;

    };
  }
}
#endif //_INDEXEDREAL_HPP

---