RichDAQDefinitions - Prefer std::min

Rich/RichUtils/include/RichUtils/RichDAQDefinitions.h

@@ -30,6 +30,7 @@
 #include "Kernel/RichSmartIDHashFuncs.h"
 
 // STL
+#include <algorithm>
 #include <cassert>
 #include <cstdint>
 #include <map>
@@ -207,7 +208,7 @@ namespace Rich::DAQ {
     /// Operator == that takes into account the correct number of bits
     inline bool operator==( const EventID& id ) const noexcept {
       // Compute which how many bits the words should in common, so we only compare these
-      const auto lowBits = ( this->activeBits() < id.activeBits() ? this->activeBits() : id.activeBits() );
+      const auto lowBits = std::min( this->activeBits(), id.activeBits() );
       const auto mask    = ( ( 1 << lowBits ) - 1 );
       // compare the bits and return
       return ( ( this->data() & mask ) == ( id.data() & mask ) );
@@ -260,7 +261,7 @@ namespace Rich::DAQ {
     /// Operator == that takes into account the correct number of bits
     inline bool operator==( const BXID& id ) const noexcept {
       // Compute which how many bits the words should in common, so we only compare these
-      const auto lowBits = ( this->activeBits() < id.activeBits() ? this->activeBits() : id.activeBits() );
+      const auto lowBits = std::min( this->activeBits(), id.activeBits() );
       const auto mask    = ( ( 1 << lowBits ) - 1 );
       // compare the bits and return
       return ( ( this->data() & mask ) == ( id.data() & mask ) );