*
 * <p>The iteration ordering of the collections generated by {@code keySet}, {@code keys}, and
 * {@code asMap} has a few subtleties. As long as the set of keys remains unchanged, adding or
 * removing mappings does not affect the key iteration order. However, if you remove all values
 * associated with a key and then add the key back to the multimap, that key will come last in the
 * key iteration order.
 *

 * }
 *
 * <p>{@link GraphBuilder#build()} returns an instance of {@link MutableGraph}, which is a subtype
 * of {@code Graph} that provides methods for adding and removing nodes and edges. If you do not
 * need to mutate a graph (e.g. if you write a method than runs a read-only algorithm on the graph),
 * you should use the non-mutating {@link Graph} interface, or an {@link ImmutableGraph}.
 *

        }
    }

    /**
     * Deletes all crawling information records and their parameters that expired before the specified date.
     * This is a bulk cleanup operation for removing old session data.
     *
     * @param date the expiration time threshold - records expired before this time will be deleted
     */
    public void deleteBefore(final long date) {

                docList.stream().forEach(doc -> {
                    if (!thumbnailManager.offer(doc)) {
                        if (logger.isDebugEnabled()) {
                            logger.debug("Removing {}={} from doc[{}]", thumbnailField, doc.get(thumbnailField),
                                    doc.get(fessConfig.getIndexFieldUrl()));
                        }
                        doc.remove(thumbnailField);

)

//go:generate msgp -file $GOFILE

// BucketMetadata contains bucket metadata.
// When adding/removing fields, regenerate the marshal code using the go generate above.
// Only changing meaning of fields requires a version bump.
// bucketMetadataFormat refers to the format.

import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * CompactHashSet is an implementation of a Set. All optional operations (adding and removing) are
 * supported. The elements can be any objects.
 *
 * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)

     * @return the generated key
     * @throws IOException if an I/O error occurs
     */
    protected abstract long makeKey(Request request) throws IOException;

    /**
     * Peek at the next key without removing it from the input stream
     *
     * @return the next key or null if none available
     * @throws IOException if an I/O error occurs
     */
    protected abstract Long peekKey() throws IOException;

 *   <li>A key is contained in the multimap if and only if it maps to at least one value. Any
 *       operation that causes a key to have zero associated values has the effect of
 *       <i>removing</i> that key from the multimap.
 *   <li>The total entry count is available as {@link #size}.
 *   <li>Many complex operations become easier; for example, {@code

                }
            }
        }

        result.setArtifactResolutionNodes(set);

        return result;
    }

    /**
     * Get the map of managed versions, removing the originating artifact if it is also in managed versions
     *
     * @param originatingArtifact artifact we are processing
     * @param managedVersions original managed versions
     */

            if (!cleanup) {
                return executorService.submit(() -> process(fessConfig, entity));
            }
            if (logger.isDebugEnabled()) {
                logger.debug("Removing thumbnail queue: {}", entity);
            }
            return null;
        }).filter(f -> f != null).forEach(f -> {
            try {
                f.get();
            } catch (final Exception e) {