19 if (lhs->time() == rhs->time()) {
20 if (lhs->pos().x() == lhs->pos().x()) {
21 return lhs.get() < rhs.get();
23 return lhs->pos().x() < lhs->pos().x();
25 return lhs->time() < rhs->time();
31 if (lhs->time() == rhs->time()) {
32 if (lhs->pos().x() == lhs->pos().x()) {
33 return lhs.get() > rhs.get();
35 return lhs->pos().x() > lhs->pos().x();
37 return lhs->time() > rhs->time();
std::shared_ptr< const IDepo > pointer
IDepo::vector depo_chain(IDepo::pointer recent)
std::vector< pointer > vector
bool descending_time(const WireCell::IDepo::pointer &lhs, const WireCell::IDepo::pointer &rhs)
Compare two IDepo::pointers for by time, descending. x is used to break tie.
bool ascending_time(const WireCell::IDepo::pointer &lhs, const WireCell::IDepo::pointer &rhs)
Compare two IDepo::pointer by time (ascending). x is used to break tie.