casacore-dev 2.2.0-2 / usr / include / casacore / tables / Tables / ConcatScalarColumn.tcc

//# ConcatScalarColumn.cc: A typed scalar column in a concatenated table
//# Copyright (C) 2008
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library is distributed in the hope that it will be useful, but WITHOUT
//# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
//# FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//#        Internet email: aips2-request@nrao.edu.
//#        Postal address: AIPS++ Project Office
//#                        National Radio Astronomy Observatory
//#                        520 Edgemont Road
//#                        Charlottesville, VA 22903-2475 USA
//#
//# $Id$

#ifndef TABLES_CONCATSCALARCOLUMN_TCC
#define TABLES_CONCATSCALARCOLUMN_TCC

#include <casacore/tables/Tables/ConcatScalarColumn.h>
#include <casacore/tables/Tables/ConcatTable.h>
#include <casacore/tables/Tables/ScalarColumn.h>
#include <casacore/casa/Arrays/Vector.h>
#include <casacore/casa/Utilities/GenSort.h>


namespace casacore { //# NAMESPACE CASACORE - BEGIN

  template<typename T>
  ConcatScalarColumn<T>::ConcatScalarColumn (const BaseColumnDesc* bcdp,
					     ConcatTable* reftab)
    : ConcatColumn (bcdp, reftab)
  {}

  template<typename T>
  ConcatScalarColumn<T>::~ConcatScalarColumn()
  {}

  template<typename T>
  void ConcatScalarColumn<T>::getScalarColumn (void* dataPtr) const
  {
    Vector<T>& vec = *static_cast<Vector<T>*>(dataPtr);
    uInt st = 0;
    for (uInt i=0; i<refColPtr_p.nelements(); ++i) {
      uInt nr = refColPtr_p[i]->nrow();
      Vector<T> part = vec(Slice(st, nr));
      refColPtr_p[i]->getScalarColumn (&part);
      st += nr;
    }
    // Set the column cache to the first table.
    ///setColumnCache (0, refColPtr_p[0]->columnCache());
  }

  template<typename T>
  void ConcatScalarColumn<T>::getScalarColumnCells (const RefRows& rownrs,
						    void* dataPtr) const
  {
    Vector<T>& vec = *static_cast<Vector<T>*>(dataPtr);
    // Get the rownrs as a vector and sort it.
    // In this way the data will be read in sequential order.
    Vector<uInt> rows = rownrs.convert();
    Vector<uInt> inx;
    GenSortIndirect<uInt>::sort (inx, rows);
    const ConcatRows& ccRows = refTabPtr_p->rows();
    uInt tabRownr;
    uInt tableNr=0;
    // Map each row to rownr and tablenr.
    // Note this is pretty fast because it is done in row order.
    for (uInt i=0; i<inx.nelements(); ++i) {
      uInt row = inx[i];
      ccRows.mapRownr (tableNr, tabRownr, rows[row]);
      refColPtr_p[tableNr]->get (tabRownr, &(vec[row]));
    }
    // Set the column cache to the last table used.
    ///setColumnCache (tableNr, refColPtr_p[tableNr]->columnCache());
  }

  template<typename T>
  void ConcatScalarColumn<T>::putScalarColumn (const void* dataPtr)
  {
    Vector<T> vec (*static_cast<const Vector<T>*>(dataPtr));
    uInt st = 0;
    for (uInt i=0; i<refColPtr_p.nelements(); ++i) {
      uInt nr = refColPtr_p[i]->nrow();
      Vector<T> part = vec(Slice(st, nr));
      refColPtr_p[i]->putScalarColumn (&part);
      st += nr;
    }
    // Set the column cache to the first table.
    ///setColumnCache (0, refColPtr_p[0]->columnCache());
  }

  template<typename T>
  void ConcatScalarColumn<T>::putScalarColumnCells (const RefRows& rownrs,
						    const void* dataPtr)
  {
    const Vector<T>& vec = *static_cast<const Vector<T>*>(dataPtr);
    // Get the rownrs as a vector and sort it.
    // In this way the data will be read in sequential order.
    Vector<uInt> rows = rownrs.convert();
    Vector<uInt> inx;
    GenSortIndirect<uInt>::sort (inx, rows);
    const ConcatRows& ccRows = refTabPtr_p->rows();
    uInt tabRownr;
    uInt tableNr=0;
    // Map each row to rownr and tablenr.
    // Note this is pretty fast because it is done in row order.
    for (uInt i=0; i<inx.nelements(); ++i) {
      uInt row = inx[i];
      ccRows.mapRownr (tableNr, tabRownr, rows[row]);
      refColPtr_p[tableNr]->put (tabRownr, &(vec[row]));
    }
    // Set the column cache to the last table used.
    ///setColumnCache (tableNr, refColPtr_p[tableNr]->columnCache());
  }


  template<class T>
  void ConcatScalarColumn<T>::makeSortKey (Sort& sortobj,
                                           CountedPtr<BaseCompare>& cmpObj,
					   Int order,
					   const void*& dataSave)
  {
    //# Get the data as a column.
    //# Save the pointer to the vector for deletion by freeSortKey().
    dataSave = 0;
    ScalarColumn<T> col(refTabPtr_p->asTable(),
                        this->columnDesc().name());
    Vector<T>* vecPtr = new Vector<T>;
    col.getColumn (*vecPtr);
    dataSave = vecPtr;
    fillSortKey (vecPtr, sortobj, cmpObj, order);
  }

  template<class T>
  void ConcatScalarColumn<T>::makeRefSortKey (Sort& sortobj,
                                              CountedPtr<BaseCompare>& cmpObj,
					      Int order,
					      const Vector<uInt>& rownrs,
					      const void*& dataSave)
  {
    //# Get the data as a column.
    dataSave = 0;
    ScalarColumn<T> col(refTabPtr_p->asTable(),
                        this->columnDesc().name());
    Vector<T>* vecPtr = new Vector<T>;
    col.getColumnCells (RefRows(rownrs), *vecPtr);
    dataSave = vecPtr;
    fillSortKey (vecPtr, sortobj, cmpObj, order);
  }

  template<class T>
  void ConcatScalarColumn<T>::fillSortKey (const Vector<T>* vecPtr,
					   Sort& sortobj,
                                           CountedPtr<BaseCompare>& cmpObj,
					   Int order)
  {
    //# Pass the real vector storage as the sort data.
    //# Use the compare object if given, otherwise pass data type.
    //# Throw an exception if no compare function is given for
    //# an unknown data type.
    Bool deleteIt;
    const T* datap = vecPtr->getStorage (deleteIt);
    if (cmpObj.null()) {
      cmpObj = new ObjCompare<T>();
    }
    sortobj.sortKey (datap, cmpObj, sizeof(T),
		     order == Sort::Descending  ?  Sort::Descending
		     : Sort::Ascending);
    vecPtr->freeStorage (datap, deleteIt);
  }

  template<class T>
  void ConcatScalarColumn<T>::freeSortKey (const void*& dataSave)
  {
    if (dataSave != 0) {
      delete (Vector<T>*)dataSave;
    }
    dataSave = 0;
  }

} //# NAMESPACE CASACORE - END

#endif