for (int i = 0; i < ARRAY_SIZE; i++) {
      positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue();
      nonzero[i] = randomNonZeroBigInteger(Long.SIZE - 2).longValue();
      longs[i] = RANDOM_SOURCE.nextLong();
    }
  }

  @Benchmark
  int log2(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += LongMath.log2(positive[j], mode);
    }

                if (logger.isDebugEnabled()) {
                    logger.debug("Failed to select a job by {}", id, e);
                }
                lastException = e;
                ThreadUtil.sleep(RandomUtils.nextLong(500, 5000));
            }
        }
        logger.warn("Failed to select a job by {}", id, lastException);
        return OptionalEntity.empty();
    }

  public void testDivideRemainderEuclideanProperty() {
    // Use a seed so that the test is deterministic:
    Random r = new Random(0L);
    for (int i = 0; i < 1000000; i++) {
      long dividend = r.nextLong();
      long divisor = r.nextLong();
      // Test that the Euclidean property is preserved:
      assertThat(
              dividend
                  - (divisor * UnsignedLongs.divide(dividend, divisor)

    PrimitiveIterator.OfLong longIterator =
        (PrimitiveIterator.OfLong) ImmutableLongArray.of(1, 2, 3).asList().iterator();
    assertThat(longIterator.nextLong()).isEqualTo(1);
    assertThat(longIterator.nextLong()).isEqualTo(2);
    assertThat(longIterator.nextLong()).isEqualTo(3);
    assertThat(longIterator.hasNext()).isFalse();
  }

  public void testCopyOf_array_empty() {
    /*

            int cardinality = cardinalityFactor * topNSize;
            BytesRef[] dict = new BytesRef[cardinality];
            for (int i = 0; i < dict.length; i++) {
                dict[i] = new BytesRef(Long.toString(rand.nextLong()));
            }
            for (int i = 0; i < numShards; i++) {
                aggsList.add(InternalAggregations.from(Collections.singletonList(newTerms(rand, dict, true))));
            }
        }

          sink.putInt(value);
        }
      }
    },
    PUT_LONG() {
      @Override
      void performAction(Random random, Iterable<? extends PrimitiveSink> sinks) {
        long value = random.nextLong();
        for (PrimitiveSink sink : sinks) {
          sink.putLong(value);
        }
      }
    },
    PUT_FLOAT() {
      @Override

                }

                final long minSleep = retryInterval + retryCount * 1000L;
                final long maxSleep = retryInterval + retryCount * 2000L;
                ThreadUtil.sleep(RandomUtils.nextLong(minSleep, maxSleep));
                retryCount++;
            }
        }
    }

    /**
     * Destroys the client and closes connections.
     */
    @PreDestroy
    public void destroy() {

        // Generate unique session ID for key management
        this.sessionId = String.format("smb-enc-%d-%d", System.currentTimeMillis(), secureRandom.nextLong());

        if (keyManager != null) {
            // Store keys securely
            String encKeyId = sessionId + "-enc";
            String decKeyId = sessionId + "-dec";

  }

  public void testByteArrayRoundTrips() {
    Random r = new Random(5);
    byte[] b = new byte[Longs.BYTES];

    for (int i = 0; i < 1000; i++) {
      long num = r.nextLong();
      assertThat(Longs.fromByteArray(Longs.toByteArray(num))).isEqualTo(num);

      r.nextBytes(b);
      long value = Longs.fromByteArray(b);

    Random rand = new Random(1);
    for (int bits = 10; bits < 63; bits++) {
      for (int i = 0; i < 2000; i++) {
        // A random long between 0 and Long.MAX_VALUE, inclusive.
        long l = rand.nextLong() & ((1L << bits) - 1);
        assertEquals(BigInteger.valueOf(l).isProbablePrime(100), LongMath.isPrime(l));
      }
    }
  }

  @GwtIncompatible // isPrime is GWT-incompatible