HasConstraint(dst interface{}, name string) bool

	// Indexes
	CreateIndex(dst interface{}, name string) error
	DropIndex(dst interface{}, name string) error
	HasIndex(dst interface{}, name string) bool
	RenameIndex(dst interface{}, oldName, newName string) error
	GetIndexes(dst interface{}) ([]Index, error)

        }

        public E get(final int index) {
            return parent.get(index);
        }

        public E set(final int index, final E element) {
            return parent.set(index, element);
        }

        public void add(final int index, final E element) {
            parent.add(index, element);
        }

        public E remove(final int index) {
            return parent.remove(index);

						<c:forEach var="item" varStatus="s" items="${popularWords}">
							<c:if test="${s.index < 3}">
								<la:link
									href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link>
							</c:if>
							<c:if test="${3 <= s.index}">
								<la:link styleClass="d-none d-sm-inline-block"

						<c:forEach var="item" varStatus="s" items="${popularWords}">
							<c:if test="${s.index < 3}">
								<la:link
									href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link>
							</c:if>
							<c:if test="${3 <= s.index}">
								<la:link styleClass="d-none d-sm-inline-block"

                    List<String> order = new ArrayList<>();
                    for (String s : insertionOrder) {
                      int index = order.indexOf(s);
                      if (index == -1) {
                        order.add(s);
                      } else {
                        order.add(index, s);
                      }
                    }
                    return order;
                  }
                })

   * and ABSENT for empty positions.  We then look up the keys in alternatingKeysAndValues.
   *
   * (The index actually stored is the index of the key in alternatingKeysAndValues, which is
   * double the index of the entry in entrySet.asList.)
   *
   * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing.

import jakarta.annotation.Resource;

/**
 * API action for admin document management.
 * Provides RESTful API endpoints for bulk document operations in the Fess search engine.
 * Supports indexing multiple documents with automatic field validation and default value assignment.
 */
public class ApiAdminDocumentsAction extends FessApiAdminAction {

        assertEquals(0, qrList.indexOf(doc1));
        assertEquals(1, qrList.indexOf(doc2));
        assertEquals(2, qrList.lastIndexOf(doc1));

        Map<String, Object> doc3 = new HashMap<>();
        doc3.put("title", "Doc3");
        assertEquals(-1, qrList.indexOf(doc3));
    }

    public void test_listOperations_iterators() {

    // Here we know that:
    // * (to < from) and that both are valid indices.
    // * Everything with (index < to) should be kept.
    // * Everything with (to <= index < from) should be removed.
    // * The element with (index == from) should be kept.
    // * Everything with (index > from) has not been checked yet.

    // Check from the end of the list backwards (minimize expected cost of

errors.could_not_find_backup_index=Could not find any backup index.
errors.no_user_for_changing_password=The current password is not correct.
errors.failed_to_change_password=Failed to change your password.
errors.unknown_version_for_upgrade=Unknown version for upgrade.
errors.failed_to_upgrade_from=Failed to upgrade from {0}.
errors.failed_to_reindex=Failed to start re-indexing from {0} to {1}.