Index: /trunk/MagicSoft/Mars/mbase/BaseLinkDef.h =================================================================== --- /trunk/MagicSoft/Mars/mbase/BaseLinkDef.h (revision 9254) +++ /trunk/MagicSoft/Mars/mbase/BaseLinkDef.h (revision 9255) @@ -76,4 +76,5 @@ #pragma link C++ class MArrayI; +#pragma link C++ class MLut+; #pragma link C++ class MObjLookup+; Index: /trunk/MagicSoft/Mars/mbase/MLut.cc =================================================================== --- /trunk/MagicSoft/Mars/mbase/MLut.cc (revision 9255) +++ /trunk/MagicSoft/Mars/mbase/MLut.cc (revision 9255) @@ -0,0 +1,293 @@ +/* ======================================================================== *\ +! +! * +! * This file is part of CheObs, the Modular Analysis and Reconstruction +! * Software. It is distributed to you in the hope that it can be a useful +! * and timesaving tool in analysing Data of imaging Cerenkov telescopes. +! * It is distributed WITHOUT ANY WARRANTY. +! * +! * Permission to use, copy, modify and distribute this software and its +! * documentation for any purpose is hereby granted without fee, +! * provided that the above copyright notice appears in all copies and +! * that both that copyright notice and this permission notice appear +! * in supporting documentation. It is provided "as is" without express +! * or implied warranty. +! * +! +! +! Author(s): Thomas Bretz, 1/2009 +! +! Copyright: CheObs Software Development, 2000-2009 +! +! +\* ======================================================================== */ + +////////////////////////////////////////////////////////////////////////////// +// +// MLut +// +// This is a simple and easy-to-use implementation of a look-up table with +// rows of different lengths. +// +////////////////////////////////////////////////////////////////////////////// +#include "MLut.h" + +#include +#include + +#include "MLog.h" +#include "MLogManip.h" + +#include "MArrayI.h" + +ClassImp(MLut); + +using namespace std; + +// -------------------------------------------------------------------------- +// +// Get the i-th entry in the routing table. Note, that i is not +// range checked, but for any valid i a valid MArrayI is returned. +// +const MArrayI &MLut::GetRow(UInt_t i) const +{ + return *static_cast(UncheckedAt(i)); +} + +// -------------------------------------------------------------------------- +// +// Return the inverse lut of the current lut. The user is responsible +// of deleting the allocated and returned MLut. +// +// For an example see Inverse() +// +MLut *MLut::GetInverse(Bool_t uniq) const +{ + MLut *lut = new MLut; + lut->SetInverse(*this, uniq); + return lut; +} + +// -------------------------------------------------------------------------- +// +// Set this to the inverse lut of the given argument. +// +// For an example see Inverse() +// +void MLut::SetInverse(const MLut &lut, Bool_t uniq) +{ + if (&lut==this) + { + Invert(uniq); + return; + } + + // Delete the current lut + Delete(); + + // Add as many MArrayI as needed + for (Int_t i=0; i<=lut.fMaxIndex; i++) + Add(new MArrayI); + + // Get the number of rows in the given lut + const UInt_t num = lut.GetEntriesFast(); + + // Loop over all rows + for (UInt_t y=0; y(UncheckedAt(arr[x])); + if (uniq) + row.AddUniq(y); + else + row.Add(y); + } + } + + // Reset the statistics + fMaxEntries = 0; + fMinEntries = 0; + + // Loop over all new MArrayI + for (Int_t i=0; i<=lut.fMaxIndex; i++) + { + // Get i-th row + MArrayI &row = *static_cast(UncheckedAt(i)); + + // Sort the i-th row ascending + row.ReSort(); + + // Get the number of entries in the row + UInt_t n = row.GetSize(); + + // For convinience (to avoid empty lines in a file) + // add -1 to empty rows + if (n==0) + { + row.Add(-1); + n=1; + } + + // Get the new min and max + if (nfMaxEntries) + fMaxEntries = n; + } + + // set the new highest index in the table + fMaxIndex = num-1; +} + +// -------------------------------------------------------------------------- +// +// Inverts the current lut, for example +// +// 0: -- +// 0: 1 2 ---\ 1: 0 +// 1: 2 3 ---/ 2: 0 1 +// 3: 1 +// +void MLut::Invert(Bool_t uniq) +{ + MLut *lut = GetInverse(uniq); + + Delete(); + + for (Int_t i=0; i<=fMaxIndex; i++) + Add(lut->Remove(lut->UncheckedAt(i))); + + fMaxEntries = lut->fMaxEntries; + fMinEntries = lut->fMinEntries; + fMaxIndex = lut->fMaxIndex; + + delete lut; +} + +// -------------------------------------------------------------------------- +// +// Read a lut from a stream. +// +// The row in the lut is just identical to the line in the stream. +// The entries in one line must be seperated by a whitespace. +// The lines can have a different number of entries. +// +Int_t MLut::ReadStream(istream &fin) +{ + Delete(); + + fMaxIndex = -1; + fMaxEntries = 0; + fMinEntries = 0; + + while (1) + { + TString line; + line.ReadLine(fin); + if (!fin) + break; + + // Split line by whitespaces + TObjArray *tokens = line.Tokenize(' '); + + // Get number of entries in this row + const UInt_t n = tokens->GetEntries(); + + // Calculate minimum and maximum numbers of entries per row + if (nfMaxEntries) + fMaxEntries = n; + + // create new entry for this row and add it to the array + MArrayI &idx = *new MArrayI(n); + Add(&idx); + + // loop over all entries in this row + for (UInt_t i=0; iGetName()); + + // Calculate maximum existing index + if (idx[i]>fMaxIndex) + fMaxIndex = idx[i]; + } + + // delete allocated TObjArray + delete tokens; + } + + return GetEntries(); +} + +// -------------------------------------------------------------------------- +// +// Write a lut to a stream. +// +Int_t MLut::WriteStream(ostream &out) +{ + const Int_t n = GetEntriesFast(); + for (int y=0; yExpandPathName(expname); + + ifstream fin(expname); + if (!fin) + { + gLog << err << "Cannot open file " << expname << ": "; + gLog << (errno!=0?strerror(errno):"Insufficient memory for decompression") << endl; + return -1; + } + return ReadStream(fin); +} + +// -------------------------------------------------------------------------- +// +// Write a lut to a file +// +Int_t MLut::WriteFile(const char *fname) +{ + TString expname(fname); + gSystem->ExpandPathName(expname); + + ofstream fout(expname); + if (!fout) + { + gLog << err << "Cannot open file " << expname << ": "; + gLog << (errno!=0?strerror(errno):"Insufficient memory for decompression") << endl; + return -1; + } + + return WriteStream(fout); +} Index: /trunk/MagicSoft/Mars/mbase/MLut.h =================================================================== --- /trunk/MagicSoft/Mars/mbase/MLut.h (revision 9255) +++ /trunk/MagicSoft/Mars/mbase/MLut.h (revision 9255) @@ -0,0 +1,48 @@ +#ifndef MARS_MLut +#define MARS_MLut + +#ifndef ROOT_TObjArray +#include +#endif + +#include + +class MArrayI; + +class MLut : public TObjArray +{ +private: + UInt_t fMinEntries; + UInt_t fMaxEntries; + + Int_t fMaxIndex; + + MLut *GetInverse(Bool_t uniq=kTRUE) const; + +public: + MLut() : fMinEntries(0), fMaxEntries(0) { SetOwner(); } + + // MLut Getter + const MArrayI &GetRow(UInt_t i) const; + + UInt_t GetMaxEntries() const { return fMaxEntries; } + Int_t GetMaxIndex() const { return fMaxIndex; } + + Bool_t HasConstantLength() const { return fMinEntries==fMaxEntries; } + Bool_t IsEmpty() const { return fMaxEntries==0; } + + // MLut convertions + void SetInverse(const MLut &lut, Bool_t uniq=kTRUE); + void Invert(Bool_t uniq=kTRUE); + + // MLut I/O + Int_t ReadStream(istream &in); + Int_t WriteStream(ostream &out); + + Int_t ReadFile(const char *fname); + Int_t WriteFile(const char *fname); + + ClassDef(MLut, 1) // A simple and fast easy-to-use look-up-table +}; + +#endif Index: /trunk/MagicSoft/Mars/mbase/Makefile =================================================================== --- /trunk/MagicSoft/Mars/mbase/Makefile (revision 9254) +++ /trunk/MagicSoft/Mars/mbase/Makefile (revision 9255) @@ -44,14 +44,15 @@ MProgressBar.cc \ MSearch.cc \ - MGMenu.cc \ - MGMap.cc \ MIter.cc \ MDirIter.cc \ MReadSocket.cc \ MGGroupFrame.cc \ + MGMenu.cc \ + MGMap.cc \ MGList.cc \ MGTask.cc \ MStatusArray.cc \ MStatusDisplay.cc \ + MLut.cc \ MArray.cc \ MArrayB.cc \