}
                    if (pair.length == 2) {
                        String sortValue = pair[1].trim();
                        if (StringUtil.isBlank(sortValue) || "score".equals(sortValue)) {
                            sortValue = "score.desc";
                        }
                        return new Pair<>(pair[0].trim(), sortValue);
                    }

    List<E> copy = list.subList(0, size);
    List<E> head = list.subList(0, size - 1);
    List<E> tail = list.subList(1, size);
    assertEquals(list.get(0), copy.get(0));
    assertEquals(list.get(size - 1), copy.get(size - 1));
    assertEquals(list.get(1), tail.get(0));
    assertEquals(list.get(size - 1), tail.get(size - 2));
    assertEquals(list.get(0), head.get(0));
    assertEquals(list.get(size - 2), head.get(size - 2));

    if (head == null) { // empty list
      head = tail = node;
      keyToKeyList.put(key, new KeyList<K, V>(node));
      modCount++;
    } else if (nextSibling == null) { // non-empty list, add to tail
      // requireNonNull is safe because the list is non-empty.
      requireNonNull(tail).next = node;
      node.previous = tail;
      tail = node;
      KeyList<K, V> keyList = keyToKeyList.get(key);

    return builder.buildOrThrow();
  }

  /**
   * Parses a trie node and returns the number of characters consumed.
   *
   * @param stack The prefixes that precede the characters represented by this node. Each entry of
   *     the stack is in reverse order.
   * @param encoded The serialized trie.
   * @param start An index in the encoded serialized trie to begin reading characters from.

        buf.append(LF);
        buf.append(StringEscapeUtils.escapeJson(discloser.getSavedSubject().orElse(StringUtil.EMPTY).trim()));
        buf.append(LF).append("```");
        buf.append(LF).append(StringEscapeUtils.escapeJson(discloser.getSavedPlainText().orElse(StringUtil.EMPTY).trim()));
        buf.append(LF).append("```\"}");
        return buf.toString();
    }

    /**

internal fun Map<String, String>.commonToHeaders(): Headers {
  // Make a defensive copy and clean it up.
  val namesAndValues = arrayOfNulls<String>(size * 2)
  var i = 0
  for ((k, v) in this) {
    val name = k.trim()
    val value = v.trim()
    headersCheckName(name)
    headersCheckValue(value, name)
    namesAndValues[i] = name
    namesAndValues[i + 1] = value
    i += 2
  }

        long initialTime = circuitBreaker.getTimeSinceLastStateChange();
        assertTrue(initialTime >= 0, "Should have initial timestamp");

        // Trip circuit
        circuitBreaker.trip();
        Thread.sleep(100);

        long afterTripTime = circuitBreaker.getTimeSinceLastStateChange();
        assertTrue(afterTripTime >= 100, "Time should have advanced");

            final String[] keyValue = StringUtils.split(values[1], ":", 2);
            if (keyValue.length == 2) {
                list.add(new Pair<>(keyValue[0].trim(), keyValue[1].trim()));
            } else if (keyValue.length == 1) {
                list.add(new Pair<>(keyValue[0].trim(), StringUtil.EMPTY));
            } else {
                logger.warn("Unexpected value: {}", s);
            }
        }));

 */
@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;
        NdrHyper hyper = new NdrHyper(original);

                buf.append("</item>");
            }
        }
        buf.append("</list>");
        // TODO support other type
        // TODO trim(default)
        return "<field name=\"" + XmlUtil.escapeXml(name) + "\">" + buf.toString().trim() + "</field>\n";
    }

    /**
     * Returns the additional data for the response.
     * @param responseData The response data.