throw new RuntimeException("Even call error");
                    }
                    // Odd calls succeed
                }
            }
        };
        ComponentUtil.register(mockSearchLogHelper, "searchLogHelper");

        // First call (odd) should succeed
        String result1 = aggregateLogJob.execute();
        assertEquals("", result1);

        }

        @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);

    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

        params.put("test", "value");

        assertNull(queryRescorer.evaluate(params)); // First call - odd
        assertNotNull(queryRescorer.evaluate(params)); // Second call - even
        assertNull(queryRescorer.evaluate(params)); // Third call - odd
        assertNotNull(queryRescorer.evaluate(params)); // Fourth call - even
    }

    /**

        }

        @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

        }
    }

    // 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

// Copyright 2022 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
// Loong64 (LoongArch64) instruction set, to minimize its interaction
// with the core of the assembler.

package arch

import (
	"cmd/internal/obj"
	"cmd/internal/obj/loong64"
	"errors"
	"fmt"
)

    }

    @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);

        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)

    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