LSSTApplications  18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
LSSTDataManagementBasePackage
Public Member Functions | List of all members
std::hash< lsst::jointcal::CcdImageKey > Struct Template Reference

Hash a ccdImage by its visit and ccd IDs. More...

#include <CcdImage.h>

Public Member Functions

size_t operator() (lsst::jointcal::CcdImageKey const &key) const
 

Detailed Description

template<>
struct std::hash< lsst::jointcal::CcdImageKey >

Hash a ccdImage by its visit and ccd IDs.

ccdId and visitId are both 32-bit ints, hash() returns a size_t, so put the ccdId in the most-significant-bit, and the visitId in the least for a simple, unique, hash per ccdImage.

Definition at line 244 of file CcdImage.h.

Member Function Documentation

◆ operator()()

size_t std::hash< lsst::jointcal::CcdImageKey >::operator() ( lsst::jointcal::CcdImageKey const &  key) const
inline

Definition at line 245 of file CcdImage.h.

245  {
246  return hash<size_t>()(static_cast<size_t>(key.visit) | (static_cast<size_t>(key.ccd) << 32));
247  }
Key< U > key
Definition: Schema.cc:281

The documentation for this struct was generated from the following file: