Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 23 for odd (0.01 sec)

  1. src/test/java/jcifs/internal/dfs/ReferralTest.java

            }
        }
    
        // String Reading Tests
    
        @Test
        public void testOddBufferIndexAlignment() {
            // Create buffer with odd starting position
            ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN);
    
            // Start at position 1 (odd)
            bb.position(1);
            bb.putShort((short) 3); // version
            bb.putShort((short) 34); // size
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 22K bytes
    - Viewed (0)
  2. src/cmd/asm/internal/arch/riscv64.go

    // Copyright 2020 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // This file encapsulates some of the odd characteristics of the RISCV64
    // instruction set, to minimize its interaction with the core of the
    // assembler.
    
    package arch
    
    import (
    	"cmd/internal/obj"
    	"cmd/internal/obj/riscv"
    	"fmt"
    )
    
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Fri Sep 12 08:12:45 UTC 2025
    - 2.8K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/math/BigIntegerMathTest.java

        for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) {
          int halfEven = BigIntegerMath.log2(x, HALF_EVEN);
          // Now figure out what rounding mode we should behave like (it depends if FLOOR was
          // odd/even).
          boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0;
          assertEquals(BigIntegerMath.log2(x, floorWasEven ? HALF_DOWN : HALF_UP), halfEven);
        }
      }
    
      @GwtIncompatible // TODO
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Nov 19 01:35:24 UTC 2025
    - 27.1K bytes
    - Viewed (0)
  4. src/test/java/jcifs/internal/smb1/ServerMessageBlockTest.java

            }
    
            @Test
            @DisplayName("Test write string with odd Unicode alignment")
            void testWriteStringUnicodeAlignment() {
                testBlock.setUseUnicode(true);
                byte[] buffer = new byte[100];
                String testString = "Test";
    
                // Test odd Unicode alignment - headerStart affects alignment
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 36.2K bytes
    - Viewed (0)
  5. src/test/java/jcifs/internal/dfs/DfsReferralResponseBufferTest.java

            }
    
            @Test
            @DisplayName("Should handle odd pathConsumed values")
            void testOddPathConsumedValue() {
                byte[] testBuffer = new byte[8];
                ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN);
                bb.putShort((short) 15); // Odd number
                bb.putShort((short) 0);
                bb.putShort((short) 0);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 15.4K bytes
    - Viewed (0)
  6. src/test/java/jcifs/smb1/util/HexdumpTest.java

            assertEquals("FFFE80", Hexdump.toHexString(data2, 0, 6)); // 6 chars = 3 bytes
            assertEquals("FFFE807F", Hexdump.toHexString(data2, 0, 8)); // 8 chars = 4 bytes
    
            // Test odd size (should handle correctly)
            byte[] data3 = { 0x0A, 0x0B, 0x0C };
            assertEquals("0", Hexdump.toHexString(data3, 0, 1)); // 1 char = 0.5 bytes (rounds up to 1)
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/cache/CacheEvictionTest.java

      public void testEviction_maxWeight_zero() {
        CountingRemovalListener<Integer, Integer> removalListener = countingRemovalListener();
        IdentityLoader<Integer> loader = identityLoader();
    
        // Even numbers are free, odd are too expensive
        Weigher<Integer, Integer> evensOnly =
            new Weigher<Integer, Integer>() {
              @Override
              public int weigh(Integer k, Integer v) {
                return k % 2;
              }
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 15.1K bytes
    - Viewed (0)
  8. src/cmd/asm/internal/arch/arm64.go

    // Copyright 2015 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // This file encapsulates some of the odd characteristics of the ARM64
    // instruction set, to minimize its interaction with the core of the
    // assembler.
    
    package arch
    
    import (
    	"cmd/internal/obj"
    	"cmd/internal/obj/arm64"
    	"errors"
    )
    
    var arm64LS = map[string]uint8{
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Oct 16 00:35:29 UTC 2025
    - 6.3K bytes
    - Viewed (0)
  9. src/test/java/jcifs/smb1/smb1/ServerMessageBlockTest.java

        }
    
        @Test
        void testStringReadWriteUnicodeWithOddAlignment() throws UnsupportedEncodingException {
            smb.useUnicode = true;
            smb.headerStart = 1; // Make the start odd
            String testString = "Aligned Unicode";
            byte[] buffer = new byte[testString.length() * 2 + 2 + 1]; // +1 for alignment
            int len = smb.writeString(testString, buffer, 1);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 9.9K bytes
    - Viewed (0)
  10. guava/src/com/google/common/math/LongMath.java

        int bTwos = Long.numberOfTrailingZeros(b);
        b >>= bTwos; // divide out all 2s
        while (a != b) { // both a, b are odd
          // The key to the binary GCD algorithm is as follows:
          // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
          // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
    
          // We bend over backwards to avoid branching, adapting a technique from
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Nov 03 21:01:09 UTC 2025
    - 46.8K bytes
    - Viewed (0)
Back to top