assertTrue(isPowerOfTwo(FileNotifyInformation.FILE_NOTIFY_CHANGE_FILE_NAME));
            assertTrue(isPowerOfTwo(FileNotifyInformation.FILE_NOTIFY_CHANGE_DIR_NAME));
            assertTrue(isPowerOfTwo(FileNotifyInformation.FILE_NOTIFY_CHANGE_ATTRIBUTES));
            assertTrue(isPowerOfTwo(FileNotifyInformation.FILE_NOTIFY_CHANGE_SIZE));
            assertTrue(isPowerOfTwo(FileNotifyInformation.FILE_NOTIFY_CHANGE_LAST_WRITE));

        assertTrue(isPowerOfTwo(SecurityInfo.OWNER_SECURITY_INFO));
        assertTrue(isPowerOfTwo(SecurityInfo.GROUP_SECURITY_INFO));
        assertTrue(isPowerOfTwo(SecurityInfo.DACL_SECURITY_INFO));
        assertTrue(isPowerOfTwo(SecurityInfo.SACL_SECURITY_INFO));
        assertTrue(isPowerOfTwo(SecurityInfo.LABEL_SECURITY_INFO));
        assertTrue(isPowerOfTwo(SecurityInfo.ATTRIBUTE_SECURITY_INFO));

      if (DoubleMath.isMathematicalInteger(doubles[j])) {
        tmp++;
      }
    }
    return tmp;
  }

  @Benchmark
  int isPowerOfTwo(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      if (DoubleMath.isPowerOfTwo(doubles[j])) {
        tmp++;
      }
    }
    return tmp;
  }

    for (double x : POSITIVE_FINITE_DOUBLE_CANDIDATES) {
      boolean isPowerOfTwo = StrictMath.pow(2.0, DoubleMath.log2(x, FLOOR)) == x;
      try {
        int log2 = DoubleMath.log2(x, UNNECESSARY);
        assertThat(Math.scalb(1.0, log2)).isEqualTo(x);
        assertTrue(isPowerOfTwo);
      } catch (ArithmeticException e) {
        assertFalse(isPowerOfTwo);
      }
    }
  }

      if (DoubleMath.isMathematicalInteger(doubles[j])) {
        tmp++;
      }
    }
    return tmp;
  }

  @Benchmark
  int isPowerOfTwo(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      if (DoubleMath.isPowerOfTwo(doubles[j])) {
        tmp++;
      }
    }
    return tmp;
  }

        checkRoundingUnnecessary(isPowerOfTwo(x));
      // fall through
      case FLOOR:
        increment = false;
        break;
      case CEILING:
        increment = !isPowerOfTwo(x);
        break;
      case DOWN:
        increment = exponent < 0 & !isPowerOfTwo(x);
        break;
      case UP:
        increment = exponent >= 0 & !isPowerOfTwo(x);
        break;
      case HALF_DOWN:

    for (double x : POSITIVE_FINITE_DOUBLE_CANDIDATES) {
      boolean isPowerOfTwo = StrictMath.pow(2.0, DoubleMath.log2(x, FLOOR)) == x;
      try {
        int log2 = DoubleMath.log2(x, UNNECESSARY);
        assertThat(Math.scalb(1.0, log2)).isEqualTo(x);
        assertTrue(isPowerOfTwo);
      } catch (ArithmeticException e) {
        assertFalse(isPowerOfTwo);
      }
    }
  }

            // Verify each is a power of 2
            for (int cap : capabilities) {
                assertTrue(isPowerOfTwo(cap), "Capability 0x" + Integer.toHexString(cap) + " should be a power of 2");
            }

            // Verify no overlapping bits
            for (int i = 0; i < capabilities.length; i++) {

    int logFloor = x.bitLength() - 1;
    switch (mode) {
      case UNNECESSARY:
        checkRoundingUnnecessary(isPowerOfTwo(x)); // fall through
      case DOWN:
      case FLOOR:
        return logFloor;

      case UP:
      case CEILING:
        return isPowerOfTwo(x) ? logFloor : logFloor + 1;

      case HALF_DOWN:
      case HALF_UP:
      case HALF_EVEN:

      assertTrue(BigIntegerMath.isPowerOfTwo(result));
      assertThat(result).isAtLeast(x);
      assertThat(result).isLessThan(x.add(x));
    }
  }

  public void testFloorPowerOfTwo() {
    for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) {
      BigInteger result = BigIntegerMath.floorPowerOfTwo(x);
      assertTrue(BigIntegerMath.isPowerOfTwo(result));
      assertThat(result).isAtMost(x);