---

LbldData.h

Go to the documentation of this file.

// $Id: LbldData.h,v 1.1.1.1 1999/12/28 01:36:02 burnett Exp $
// Original author: Bill Atwood
// Modified by T. Burnett

#ifndef __LbldData_H
#define __LbldData_H 1
#ifdef _MSC_VER
#pragma warning(disable:4786)
#endif

#include <iostream>
#include <map>
#include <string>
#include <vector>

//   LbldData
//   A Labelled Data Array class based on D. Britton's RecoArray
//
// Comments
//   Define the LbldData class.  This is designed to hold data as
//   an array  of floats. with an associated label 
//
//   There are methods for adding and retrieving data:
//   addData(...) methods takes one argument in addition
//   to the actual (float) data.
//   The FASTEST WAY to add data is to use the following:
//   addData(int entry, float data);
//                                --> array[entry] = data
//   but there is also a method where the "int entry" is replaced
//   with "char* data_name" .  This method is slower than the above
//   because the correct integer has to be found by looping over
//   a contents list .
//   All the addData methods return an integer which is -1 on error
//   or the  the entry number. Thus the first
//   time data is added one can use one of the slower methods and
//   "remember" the returned integer so subsequent calls can use the
//   more efficient methods.
//   getData(...) methods also come in a variety of colours. Again,
//   the calls can take integers (for fastest access) or names and
//   owners for slower access. The error return is FLT_MAX.
//
//   A modernization allows access by the operator[](string), since it now
//   has public inheritance form map<string, float>. Also added is an 
//   float operator[](iterator entry) to return the float associated with the 
//   iterator, or a reference to allow setting the value
class LbldData  : public std::vector<std::pair<std::string,float> >
{
public:
    
    LbldData ();
     
    ~LbldData ();
    
    iterator addElement (const char* c);
    // create a new element, return iterator for it
    
    void addData (iterator entry, float x);
    // set the value of the entry
    
    iterator addData (char* c, float x);
    // set value (and add if not already in the list
    
    //  get Data  Methods (see comments)
    float getData (iterator entry)const;
    
    float getData (const char* name)const;
    
    // operators that are equivalent to, but more convenient than the above
    float operator[](iterator entry)const{return getData(entry);}
    float operator[](const char* name)const{return getData(name);}

    // this allows data[entry]=x;
    float& operator[](iterator entry){return (*entry).second;}

    int dataCount () const { return size(); }
    
    //  returns iterator of the entry or end() if not found
    const_iterator checkEntry (const char* c) const;
    
    
    //  sets all data to zero. Doesn't delete array
    void clear ();
    
    value_type& operator[](int i)const{ return *(m_iteratorlist[i]);}
    // so data[i].first or data[i].second can be used to access the 
    // name and value (resp.), with i in order of definition.
    
    //  print all
    void printOn (std::ostream& out );
    
private:
    std::vector<iterator> m_iteratorlist;
    // separate list of pointers, in order of definition.
  
};


inline std::ostream& operator<<(std::ostream& out, LbldData& x) {
    x.printOn(out); 
    return out;
}

#endif

---