### Question:
BitUtil { public static long ceilDiv(long dividend, long divisor) { return 1L + (-1L + dividend) / divisor; } private  BitUtil(); static boolean isPowerOfTwo(final int value); static boolean isPowerOfTwo(final long value); static int previousPowerOfTwo(int v); static long previousPowerOfTwo(long v); static int nearbyPowerOfTwo(int x); static long nearbyPowerOfTwo(long x); static int nextHighestPowerOfTwo(int v); static long nextHighestPowerOfTwo(long v); static long align(long value, int alignment); static long ceilDiv(long dividend, long divisor); static int ceilDiv(int dividend, int divisor);  }### Answer:
@Test void ceilDivRoundsTowardsPositiveInfinity() { assertEquals(0L, ceilDiv(0L, 1L)); assertEquals(1L, ceilDiv(1L, 1L)); assertEquals(1L, ceilDiv(1L, 2L)); assertEquals(1L, ceilDiv(1L, 3L)); assertEquals(1L, ceilDiv(1L, Long.MAX_VALUE)); assertEquals(42L, ceilDiv(42L, 1L)); assertEquals(21L, ceilDiv(42L, 2L)); assertEquals(14L, ceilDiv(42L, 3L)); assertEquals(11L, ceilDiv(42L, 4L)); assertEquals(9L, ceilDiv(42L, 5L)); assertEquals(7L, ceilDiv(42L, 6L)); assertEquals(1L, ceilDiv(Long.MAX_VALUE - 1L, Long.MAX_VALUE)); assertEquals(1L, ceilDiv(Long.MAX_VALUE, Long.MAX_VALUE)); }
@Test void ceilDivForIntsRoundsTowardsPositiveInfinity() { assertEquals(0, ceilDiv(0, 1)); assertEquals(1, ceilDiv(1, 1)); assertEquals(1, ceilDiv(1, 2)); assertEquals(1, ceilDiv(1, 3)); assertEquals(1, ceilDiv(1, Integer.MAX_VALUE)); assertEquals(42, ceilDiv(42, 1)); assertEquals(21, ceilDiv(42, 2)); assertEquals(14, ceilDiv(42, 3)); assertEquals(11, ceilDiv(42, 4)); assertEquals(9, ceilDiv(42, 5)); assertEquals(7, ceilDiv(42, 6)); assertEquals(1, ceilDiv(Integer.MAX_VALUE - 1, Integer.MAX_VALUE)); assertEquals(1, ceilDiv(Integer.MAX_VALUE, Integer.MAX_VALUE)); }