source: trunk/src/Cubes/cubes_extended.cc @ 326

// -----------------------------------------------------------------------
// cubes_extended.cc: Extra member functions for the Cube class, that
//                    depend on extra classes.
// -----------------------------------------------------------------------
// Copyright (C) 2006, Matthew Whiting, ATNF
//
// This program is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2 of the License, or (at your
// option) any later version.
//
// Duchamp 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 General Public License
// for more details.
//
// You should have received a copy of the GNU General Public License
// along with Duchamp; if not, write to the Free Software Foundation,
// Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA
//
// Correspondence concerning Duchamp may be directed to:
//    Internet email: Matthew.Whiting [at] atnf.csiro.au
//    Postal address: Dr. Matthew Whiting
//                    Australia Telescope National Facility, CSIRO
//                    PO Box 76
//                    Epping NSW 1710
//                    AUSTRALIA
// -----------------------------------------------------------------------
#include <unistd.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>

#include <wcs.h>

#include <duchamp.hh>
#include <param.hh>
#include <fitsHeader.hh>
#include <Cubes/cubes.hh>
#include <Detection/detection.hh>
#include <Detection/columns.hh>
#include <Utils/utils.hh>
#include <Utils/mycpgplot.hh>
#include <Utils/Statistics.hh>
using namespace Column;
using namespace mycpgplot;
using namespace Statistics;

void Cube::sortDetections()
{
  /** 
   *  A front end to the sort-by functions.
   *  If there is a good WCS, the detection list is sorted by velocity.
   *  Otherwise, it is sorted by increasing z-pixel value.
   *  The ID numbers are then re-calculated.
   */
  
  if(this->head.isWCS()) SortByVel(*this->objectList);
  else SortByZ(*this->objectList);
  for(int i=0; i<this->objectList->size();i++) 
    this->objectList->at(i).setID(i+1);

}
//--------------------------------------------------------------------

void Cube::readSavedArrays()
{
  /**
   *  This function reads in reconstructed and/or smoothed arrays that have 
   *   been saved on disk in FITS files. 
   *  To do this it calls the functions Cube::readReconCube() and 
   *   Cube::readSmoothCube().
   *  The Param set is consulted to determine which of these arrays are needed.
   */

  // If the reconstructed array is to be read in from disk
  if( this->par.getFlagReconExists() && this->par.getFlagATrous() ){
    std::cout << "Reading reconstructed array: "<<std::endl;
    if( this->readReconCube() == FAILURE){
      std::stringstream errmsg;
      errmsg <<"Could not read in existing reconstructed array.\n"
             <<"Will perform reconstruction using assigned parameters.\n";
      duchampWarning("Duchamp", errmsg.str());
      this->par.setFlagReconExists(false);
    }
    else std::cout << "Reconstructed array available.\n";
  }

  if( this->par.getFlagSmoothExists() && this->par.getFlagSmooth() ){
    std::cout << "Reading smoothed array: "<<std::endl;
    if( this->readSmoothCube() == FAILURE){
      std::stringstream errmsg;
      errmsg <<"Could not read in existing smoothed array.\n"
             <<"Will smooth the cube using assigned parameters.\n";
      duchampWarning("Duchamp", errmsg.str());
      this->par.setFlagSmoothExists(false);
    }
    else std::cout << "Smoothed array available.\n";
  }
    
}

//--------------------------------------------------------------------