public static int checkElementIndex(int index, int size, String desc) {
    // Carefully optimized for execution by hotspot (explanatory comment above)
    if (index < 0 || index >= size) {
      throw new IndexOutOfBoundsException(badElementIndex(index, size, desc));
    }
    return index;
  }

  private static String badElementIndex(int index, int size, String desc) {
    if (index < 0) {

    }

    /**
     * Gets the name of the data index for the crawler.
     *
     * @return the data index name
     */
    @Override
    public String getDataIndex() {
        return ComponentUtil.getFessConfig().getIndexDocumentCrawlerIndex() + ".data";
    }

    /**
     * Gets the name of the filter index for the crawler.
     *
     * @return the filter index name
     */
    @Override

    }

    /**
     * Writes a 16-bit integer value to a byte array in little-endian format
     * @param val the value to write
     * @param dst the destination byte array
     * @param dstIndex the starting index in the destination array
     */
    public static void writeInt2(final long val, final byte[] dst, int dstIndex) {
        dst[dstIndex] = (byte) val;
        dstIndex++;
        dst[dstIndex] = (byte) (val >> 8);
    }

    }

    /**
     * Gets the OpenSearch index name.
     *
     * @return The index name.
     */
    public String getIndex() {
        return index;
    }

    /**
     * Sets the OpenSearch index name.
     *
     * @param index The index name.
     */
    public void setIndex(final String index) {
        this.index = index;
    }

    /**

            }
        }

        @Override
        public void addRule(int index, Rule rule) {
            if (rule != null) {
                if (index < 0 || index > rules.size()) {
                    throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + rules.size());
                }
                rules.add(index, rule);
            }
        }

        @Override

        buffer[index++] = (byte) ((testSessionId >> 8) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 16) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 24) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 32) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 40) & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 48) & 0xFF);

            final int index = offset + SmbConstants.SIGNATURE_OFFSET;
            for (int i = 0; i < 8; i++) {
                data[index + i] = 0;
            }
            ServerMessageBlock.writeInt4(signSequence, data, index);
            update(data, offset, length);
            System.arraycopy(digest(), 0, data, index, 8);
            if (bypass) {
                bypass = false;

    public boolean hasNext() {
        for (; index < iterators.length; ++index) {
            if (iterators[index].hasNext()) {
                return true;
            }
        }
        return false;
    }

    @Override
    public E next() {
        if (!hasNext()) {
            throw new NoSuchElementException();
        }
        return iterators[index].next();
    }

    @Override

final class SortedLists {
  private SortedLists() {}

  /**
   * A specification for which index to return if the list contains at least one element that
   * compares as equal to the key.
   */
  enum KeyPresentBehavior {
    /**
     * Return the index of any list element that compares as equal to the key. No guarantees are
     * made as to which index is returned, if more than one element compares as equal to the key.
     */
    ANY_PRESENT {

            assertTrue(robotsTxt.allows("/private/index.html", userAgent));
            assertTrue(robotsTxt.allows("/help/", userAgent));
            assertTrue(robotsTxt.allows("/help.html", userAgent));
            assertTrue(robotsTxt.allows("/help/faq.html", userAgent));
            assertTrue(robotsTxt.allows("/foo/bar/", userAgent));
            assertTrue(robotsTxt.allows("/foo/bar/index.html", userAgent));