Namespaces | Functions
CellHit.cxx File Reference
#include "RecoBase/CellHit.h"
#include <algorithm>
#include <iomanip>
#include <iostream>

Go to the source code of this file.

Namespaces

 rb
 Perform a "2 point" Hough transform on a collection of hits.
 

Functions

std::ostream & rb::operator<< (std::ostream &o, const CellHit &c)
 
bool rb::CompareByPlane (const art::Ptr< rb::CellHit > &a, const art::Ptr< rb::CellHit > &b)
 Helper for SortByPlane. Is a on a lower number plane than b? More...
 
bool rb::CompareByTime (const art::Ptr< rb::CellHit > &a, const art::Ptr< rb::CellHit > &b)
 Helper for SortByTime. Is a earlier than b? More...
 
bool rb::CompareByCell (const art::Ptr< rb::CellHit > &a, const art::Ptr< rb::CellHit > &b)
 Helper for SortByCell. Is a on a lower cell number than b? More...
 
bool rb::CompareByPlaneAndCell (const art::Ptr< rb::CellHit > &a, const art::Ptr< rb::CellHit > &b)
 
void rb::SortByPlane (std::vector< art::Ptr< rb::CellHit > > &c)
 Sort c in plane order (low to high). More...
 
void rb::SortByPlane (art::PtrVector< rb::CellHit > &c)
 Sort c in plane order (low to high). More...
 
void rb::SortByTime (std::vector< art::Ptr< rb::CellHit > > &c)
 Sort c in time order (earliest to latest). More...
 
void rb::SortByTime (art::PtrVector< rb::CellHit > &c)
 Sort c in time order (earliest to latest). More...
 
void rb::SortByCell (std::vector< art::Ptr< rb::CellHit > > &c)
 Sort c in cell order (low to high) More...
 
void rb::SortByCell (art::PtrVector< rb::CellHit > &c)
 Sort c in cell order (low to high) More...
 
void rb::SortByPlaneAndCell (std::vector< art::Ptr< rb::CellHit > > &c)
 
void rb::SortByPlaneAndCell (art::PtrVector< rb::CellHit > &c)