while (merged.hasNext()) {
          C next = merged.next();
          boolean duplicate = lastValue != null && comparator.compare(next, lastValue) == 0;

          // Keep looping till we find a non-duplicate value.
          if (!duplicate) {
            lastValue = next;
            return lastValue;
          }
        }

        lastValue = null; // clear reference to unused data

        src[5] = 'F';
        src[6] = 'D'; // S
        // T=0x54: upper nibble 0x5->F(0x46), lower nibble 0x4->E(0x45)
        src[7] = 'F';
        src[8] = 'E'; // T

        // Fill padding with encoded spaces (0x20)
        for (int i = 9; i < 31; i += 2) {
            src[i] = 'C';
            src[i + 1] = 'A';
        }

        // Encode type 0x20
        src[31] = 'C';

fi

## Make sure transition rule not replicated to siteb
tranDays=$(./mc ilm rule list siteb/bucket --json | jq '.config.Rules[0].Transition.Days')
if [ "${tranDays}" != "null" ]; then
	echo "BUG: Transition rules as well copied to siteb"
	exit 1
fi

## Check replication of rules prefix and tags
prefix=$(./mc ilm rule list siteb/bucket --json | jq '.config.Rules[0].Filter.And.Prefix' | sed 's/"//g')

        children[childIndex] = child
      }
      node = child
    }

    val shift = 8 - accumulatorBitCount
    val start = (code shl shift) and 0xff
    val end = 1 shl shift
    node.children!!.fill(terminal, start, start + end)
  }

  private class Node {
    /** Null if terminal. */
    val children: Array<Node?>?

    /** Terminal nodes have a symbol. */
    val symbol: Int

    void testReadBytesWireFormatPreservesBuffer() throws SMBProtocolDecodingException {
        byte[] buffer = new byte[1024];
        int bufferIndex = 0;

        // Fill buffer with test data
        for (int i = 0; i < buffer.length; i++) {
            buffer[i] = (byte) (i % 256);
        }

        // Set structure size to 2
        SMBUtil.writeInt2(2, buffer, bufferIndex);

 *
 * <p>In light of the significant enhancements to {@code Comparator} in Java 8, the overwhelming
 * majority of usages of {@code Ordering} can be written using only built-in JDK APIs. This class is
 * intended to "fill the gap" and provide those features of {@code Ordering} not already provided by
 * the JDK.
 *
 * @since 21.0
 * @author Louis Wasserman
 */
@GwtCompatible
public final class Comparators {

        byte[] buffer = new byte[100];
        // Initialize buffer with zeros to avoid random data
        java.util.Arrays.fill(buffer, (byte) 0);

        // Set dataCount to 0 - but decode still runs
        setDataCount(response, 0);

        int bytesRead = response.readDataWireFormat(buffer, 0, 0);

    Integer javaVersion = Ints.tryParse(JAVA_SPECIFICATION_VERSION.value());
    if (javaVersion != null && javaVersion >= 9) {
      return;
    }
    // Obviously this isn't guaranteed in every environment, but it works well enough for now:
    assertTrue(lazyStackTraceIsLazy());
  }

  @J2ktIncompatible
  @GwtIncompatible // lazyStackTrace(Throwable)
  public void testLazyStackTrace() {
    Exception e = new Exception();

            int bytesDecoded = testInfo.decode(buffer, 0, buffer.length);
            assertEquals(8, bytesDecoded);
            assertEquals(testValue, testInfo.getIndexNumber());

            // Test encode as well
            byte[] encodedBuffer = new byte[8];
            int bytesEncoded = testInfo.encode(encodedBuffer, 0);
            assertEquals(8, bytesEncoded);

        assertTrue(length >= 0);
    }

    @Test
    @DisplayName("Test decode operation")
    void testDecode() {
        byte[] buffer = new byte[1024];
        // Fill with basic SMB header structure
        System.arraycopy(new byte[] { (byte) 0xFF, 'S', 'M', 'B' }, 0, buffer, 0, 4);
        buffer[4] = 1; // wordCount
        buffer[7] = 0; // byteCount low