code: function (m, n) {
        n %= 64
        if (n === 32) {
          return [m[1], m[0]]
        } else if (n < 32) {
          return [(m[0] << n) | (m[1] >>> (32 - n)), (m[1] << n) | (m[0] >>> (32 - n))]
        } else {
          n -= 32
          return [(m[1] << n) | (m[0] >>> (32 - n)), (m[0] << n) | (m[1] >>> (32 - n))]
        }
      }
docs: Given a 64bit int (as an array of two 32bit ints) and an int representing a number of bit positions, returns the 64bit int (as an array of two 32bit ints) rotated left by that number of positions.