Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 113 for roundUp (0.03 sec)

  1. src/test/java/jcifs/smb1/util/HexdumpTest.java

            assertEquals("0A", Hexdump.toHexString(data3, 0, 2)); // 2 chars = 1 byte
            assertEquals("0A0", Hexdump.toHexString(data3, 0, 3)); // 3 chars = 1.5 bytes (rounds up to 2)
            assertEquals("0A0B", Hexdump.toHexString(data3, 0, 4)); // 4 chars = 2 bytes
            assertEquals("0A0B0", Hexdump.toHexString(data3, 0, 5)); // 5 chars = 2.5 bytes (rounds up to 3)
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  2. src/test/java/jcifs/spnego/NegTokenTargTest.java

    import org.junit.jupiter.api.Test;
    
    /**
     * Unit tests for {@link NegTokenTarg}. The class has no external
     * collaborators so tests are mostly focused on round‑trip
     * serialisation and invalid input handling.
     */
    class NegTokenTargTest {
    
        @Test
        @DisplayName("happy path – full token round‑trip")
        void testRoundTripFull() throws IOException {
            // Arrange – create a fully populated token
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 3.6K bytes
    - Viewed (0)
  3. src/test/java/org/codelibs/core/misc/Base64UtilTest.java

         */
        public void testDecode_Null() throws Exception {
            final byte[] result = Base64Util.decode(null);
            assertNull("Null should return null", result);
        }
    
        /**
         * Test encode/decode round trip with various data
         *
         * @throws Exception
         */
        public void testEncodeDecode_RoundTrip() throws Exception {
            // Test with ASCII text
            final String text = "Hello, World!";
    Registered: Sat Dec 20 08:55:33 UTC 2025
    - Last Modified: Sat Nov 22 11:21:59 UTC 2025
    - 6K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/math/DoubleUtils.java

        }
    
        /*
         * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding
         * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or
         * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the
         * top SIGNIFICAND_BITS + 1.
         *
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  5. src/test/java/jcifs/util/StringsTest.java

                assertTrue(result.length > 0, "Result should not be empty");
    
                // Verify round-trip conversion
                String roundTrip = new String(result, StandardCharsets.UTF_16LE);
                assertEquals(UNICODE_STRING, roundTrip, "Round-trip conversion should preserve Unicode");
            }
    
            @Test
            @DisplayName("getASCIIBytes should encode string as ASCII")
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 18.6K bytes
    - Viewed (0)
  6. src/main/webapp/WEB-INF/view/searchResults.jsp

    										href="/search?q=${f:u(q)}&ex_q=label%3a${f:u(countEntry.key)}&sdh=${f:u(fe:sdh(sh))}${fe:pagingQuery(null)}${fe:facetQuery()}${fe:geoQuery()}">
    											${f:h(fe:label(countEntry.key))} 
    											<span class="badge rounded-pill text-bg-secondary float-end">${f:h(countEntry.value)}</span>
    									</la:link></li>
    							</c:if>
    						</c:forEach>
    					</ul>
    				</c:if>
    			</c:forEach>
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Thu Nov 13 05:54:52 UTC 2025
    - 9.2K bytes
    - Viewed (0)
  7. src/test/java/jcifs/spnego/NegTokenInitTest.java

            assertArrayEquals(mechs, parsed.getMechanisms(), "Mechanism OIDs should round-trip");
            assertEquals(flags, parsed.getContextFlags(), "Flags should round-trip");
            assertArrayEquals(mechToken, parsed.getMechanismToken(), "Mechanism token should round-trip");
            assertArrayEquals(mic, parsed.getMechanismListMIC(), "MIC should round-trip");
    
            assertTrue(parsed.getContextFlag(NegTokenInit.DELEGATION));
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 21K bytes
    - Viewed (0)
  8. src/test/java/jcifs/smb1/dcerpc/ndr/NdrHyperTest.java

     * The buffer is created with enough capacity for a 64‑bit value.
     */
    @ExtendWith(MockitoExtension.class)
    public class NdrHyperTest {
    
        /**
         * Tests a simple round‑trip encode → decode retains the original value.
         */
        @Test
        @DisplayName("Basic round‑trip for a fixed value")
        public void testEncodeRoundTrip() throws NdrException {
            final long original = 0x1122334455667788L;
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 4.3K bytes
    - Viewed (0)
  9. guava/src/com/google/common/math/BigIntegerMath.java

      public static boolean isPowerOfTwo(BigInteger x) {
        checkNotNull(x);
        return x.signum() > 0 && x.getLowestSetBit() == x.bitLength() - 1;
      }
    
      /**
       * Returns the base-2 logarithm of {@code x}, rounded according to the specified rounding mode.
       *
       * @throws IllegalArgumentException if {@code x <= 0}
       * @throws ArithmeticException if {@code mode} is {@link RoundingMode#UNNECESSARY} and {@code x}
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  10. guava/src/com/google/common/math/DoubleUtils.java

        }
    
        /*
         * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding
         * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or
         * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the
         * top SIGNIFICAND_BITS + 1.
         *
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 5.1K bytes
    - Viewed (0)
Back to top