// ================================================
// MyAnalysis class Implementation
// ================================================
//
//
// Namespace Atlast
//

// Utilities
#include <cmath> 
#include "AtlfastCode/Phi.h"

// This is part of the STL and allows you to use
// generic sort algorithms (amongst other things)
#include <algorithm>
#include "AtlfastCode/FunctionObjects.h"

// Athena/Gaudi includes
#include "GaudiKernel/AlgFactory.h"
#include "GaudiKernel/DataSvc.h"


// This algorithm includes
#include "AtlfastCode/MyAnalysis.h"



//-------------------------------
// Athena magic lines.
// These are so that it can make instances of this algorithm
// You never need to know why or how !!!
//-------------------------------

static const AlgFactory<Atlfast::MyAnalysis> s_factory ;
const IAlgFactory& MyAnalysisFactory = s_factory ;

namespace Atlfast {




//--------------------------------
// Constructors and destructors
//--------------------------------

MyAnalysis::MyAnalysis 
  ( const std::string& name, ISvcLocator* pSvcLocator ) 
    : Algorithm( name, pSvcLocator )
{
    //do nothing

}

// Destructor
MyAnalysis::~MyAnalysis() {
} 


//---------------------------------
// initialise() 
//---------------------------------

StatusCode MyAnalysis::initialize()
{


  // We must here instantiate items which can only be made after
  // any job options have been set

   return StatusCode::SUCCESS ;
}


//---------------------------------
// finalise() 
//---------------------------------

StatusCode MyAnalysis::finalize()
{
   return StatusCode::SUCCESS ;
}


//----------------------------------------------
// execute() method called once per event
//----------------------------------------------
//


StatusCode MyAnalysis::execute( )
{
    return StatusCode::SUCCESS ;

}



} // end of namespace bracket