15 auto digest =
h.Get();
16 os << digest[0] <<
"-" << digest[1] <<
"-" << digest[2] <<
"-" << digest[3];
27 std::set<ROOT::Internal::RConcurrentHashColl::HashValue> fSet;
69 auto ret =
fHashSet->fSet.insert(hash);
bool Insert(char *buf, int len) const
If the hash is there, return false. Otherwise, insert the hash and return true;.
std::unique_ptr< RHashSet > fHashSet
static HashValue Hash(char *buf, int len)
Return the hash object corresponding to the buffer.
std::unique_ptr< ROOT::TRWSpinLock > fRWLock
bool Find(const HashValue &hash) const
Return true if the hash is already in already there.
std::ostream & operator<<(std::ostream &os, const RConcurrentHashColl::HashValue &h)
void Sha256(const unsigned char *data, int len, ULong64_t *fDigest)
Namespace for new ROOT classes and functions.
std::unique_ptr< T > make_unique(Args &&... args)