qualify std uint

Author: ferdymercury

math/mathcore/inc/Math/LFSR.h

@@ -54,20 +54,20 @@ namespace ROOT::Math::LFSR {
  * https://en.wikipedia.org/wiki/Pseudorandom_binary_sequence
  */
 template <size_t k, size_t nTaps>
-bool NextLFSR(std::bitset<k> &lfsr, std::array<uint16_t, nTaps> taps, bool left = true)
+bool NextLFSR(std::bitset<k> &lfsr, std::array<std::uint16_t, nTaps> taps, bool left = true)
 {
    static_assert(k <= 32, "For the moment, only supported until k == 32.");
    static_assert(k > 0, "Non-zero degree is needed for the LFSR.");
    static_assert(nTaps > 0, "At least one tap is needed for the LFSR.");
    static_assert(nTaps <= k, "Cannot use more taps than polynomial order");
-   for (uint16_t j = 0; j < nTaps; ++j) {
+   for (std::uint16_t j = 0; j < nTaps; ++j) {
       assert(static_cast<size_t>(taps[j] - 1) <= k && static_cast<size_t>(taps[j] - 1) > 0 &&
              "Tap value is out of range [1,k]");
    }
 
    // First, calculate the XOR (^) of all selected bits (marked by the taps)
    bool newBit = lfsr[taps[0] - 1]; // the exponent E of the polynomial correspond to index E - 1 in the bitset
-   for (uint16_t j = 1; j < nTaps; ++j) {
+   for (std::uint16_t j = 1; j < nTaps; ++j) {
       newBit ^= lfsr[taps[j] - 1];
    }
 
@@ -104,7 +104,7 @@ bool NextLFSR(std::bitset<k> &lfsr, std::array<uint16_t, nTaps> taps, bool left
  * https://en.wikipedia.org/wiki/Pseudorandom_binary_sequence
  */
 template <size_t k, size_t nTaps, typename Output = unsigned char>
-std::vector<Output> GenerateSequence(std::bitset<k> start, std::array<uint16_t, nTaps> taps, bool left = true,
+std::vector<Output> GenerateSequence(std::bitset<k> start, std::array<std::uint16_t, nTaps> taps, bool left = true,
                                             bool wrapping = false, bool oppositeBit = false)
 {
    std::vector<Output> result; // Store result here
@@ -126,12 +126,12 @@ std::vector<Output> GenerateSequence(std::bitset<k> start, std::array<uint16_t,
    }
 
    // Calculate maximum period and pre-allocate space in result
-   const uint32_t maxPeriod = pow(2, k) - 1;
+   const std::uint32_t maxPeriod = pow(2, k) - 1;
    result.reserve(maxPeriod);
 
    std::set<uint32_t> lfsrHistory; // a placeholder to store the history of all different values of the LFSR
    std::bitset<k> lfsr(start);     // a variable storing the current value of the LFSR
-   uint32_t i = 0;                 // a loop counter
+   std::uint32_t i = 0;            // a loop counter
    if (oppositeBit)                // if oppositeBit enabled, first value is already started with the seed
       result.emplace_back(left ? lfsr[k - 1] : lfsr[0]);