*/
  enum KeyAbsentBehavior {
    /**
     * Return the index of the next lower element in the list, or {@code -1} if there is no such
     * element.
     */
    NEXT_LOWER {
      @Override
      int resultIndex(int higherIndex) {
        return higherIndex - 1;
      }
    },
    /**
     * Return the index of the next higher element in the list, or {@code list.size()} if there is
     * no such element.

        assertEquals(unicodeName, notifications.get(0).getFileName());
    }

    @Test
    @DisplayName("Should handle malformed next entry offset")
    void testMalformedNextEntryOffset() throws Exception {
        // Given - notification with invalid next entry offset
        byte[] buffer = new byte[512];
        int offset = 0;

        setHeaderStart(response, 64);

        // Write structure

) : Cloneable {
  val headersList: List<Header>
    get() {
      val result = mutableListOf<Header>()
      for (inputHeader in headers) {
        val (key, value) = inputHeader.entries.iterator().next()
        result.add(Header(key, value))
      }
      return result
    }

  public override fun clone() = Case(seqno, this.wire, headers)

  }

  private Entry<K, V> getEntryNullReplaces() {
    Iterator<Entry<K, V>> entries = getSampleElements().iterator();
    for (int i = 0; i < getNullLocation(); i++) {
      entries.next();
    }
    return entries.next();
  }

  protected void initMultimapWithNullKey() {
    resetContainer(getSubjectGenerator().create((Object[]) createArrayWithNullKey()));
  }

    }

    @Override
    public int encode(byte[] buffer, int offset) {
        int start = offset;

        // Write context header
        SMBUtil.writeInt4(0, buffer, offset); // Next (offset to next context, 0 for last)
        offset += 4;

        SMBUtil.writeInt2(16, buffer, offset); // NameOffset (from start of context)
        offset += 2;

     */
    public ArrayIterator(final T... items) {
        this.items = items;
    }

    @Override
    public boolean hasNext() {
        return index < items.length;
    }

    @Override
    public T next() {
        try {
            final T o = items[index];
            index++;
            return o;
        } catch (final IndexOutOfBoundsException e) {
            throw new NoSuchElementException("index=" + index);

        List<Plugin> plugins = getMetadata().getPlugins();
        boolean found = false;
        for (Iterator<Plugin> i = plugins.iterator(); i.hasNext() && !found; ) {
            Plugin plugin = i.next();
            if (plugin.getPrefix().equals(goalPrefix)) {
                found = true;
            }
        }
        if (!found) {
            Plugin plugin = new Plugin();

            link.setAttribute("url", "../userguide/feature_lifecycle.html");
            link.appendChild(document.createTextNode("deprecated"));
            para.appendChild(document.createTextNode(" and will be removed in the next major version of Gradle."));
        }
        if (elementDoc.isIncubating()) {
            Document document = parent.getOwnerDocument();
            Element caution = document.createElement("caution");

    return new AbstractIterator<E>() {
      @Override
      protected @Nullable E computeNext() {
        while (entries.hasNext()) {
          Entry<E, ?> entry = entries.next();
          if (targetNode.equals(entry.getValue())) {
            return entry.getKey();
          }
        }
        return endOfData();
      }
    };
  }

  @Override

        }
    }

    @Override
    public List<String> convert(final String text, final String field, final String... lang) throws IOException {
        // Use LinkedHashSet to maintain insertion order while eliminating duplicates
        final Set<String> resultSet = new LinkedHashSet<>();
        resultSet.add(text);

        // Start with the original text as the first input
        List<String> currentInputs = new ArrayList<>();