* a "hole" in it so that set tests of {@code ContiguousSet} can suppress them with {@code
   * FeatureSpecificTestSuiteBuilder.suppressing()}.
   */
  /*
   * TODO(cpovirk): or we could make HOLES_FORBIDDEN a feature. Or we could declare that
   * implementations are permitted to throw IAE if a hole is requested, and we could update

            final Rule rule = ruleManager.getRule(responseData);
            if (rule == null) {
                logger.warn("No matching url rule for url='{}'", url);
            } else {
                responseData.setRuleId(rule.getRuleId());
                final ResponseProcessor responseProcessor = rule.getResponseProcessor();

     */
    RdmaMemoryRegion registerMemory(ByteBuffer buffer, 
                                   EnumSet<RdmaAccess> access) throws IOException;
    
    /**
     * Get provider name (e.g., "InfiniBand", "iWARP", "RoCE")
     */
    String getProviderName();
    
    /**
     * Get maximum message size supported
     */
    int getMaxMessageSize();
    
    /**
     * Clean up provider resources
     */

import org.codelibs.core.exception.NullArgumentException;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.ExpectedException;

/**
 * @author shot
 * @author manhole
 */
public class EnumerationIteratorTest {

    /**
     * @see org.junit.rules.ExpectedException
     */
    @Rule
    public ExpectedException exception = ExpectedException.none();

    /**
     *

        // CrawlerContext crawlerContext = (CrawlerContext) objs[0];
        // UrlQueue<?> urlQueue = (UrlQueue<?>) objs[1];
        final ResponseData responseData = (ResponseData) objs[2];
        // Rule rule = (Rule) objs[3];
        if (logger.isDebugEnabled()) {
            logger.debug("No ResponseProcessor for ({}, {}). PLEASE CHECK YOUR CONFIGURATION.", responseData.getUrl(),
                    responseData.getMimeType());

        return minChildIndex;
      }
      return crossOverUp(index, x);
    }

    /**
     * Fills the hole at {@code index} by moving in the least of its grandchildren to this position,
     * then recursively filling the new hole created.
     *
     * @return the position of the new hole (where the lowest grandchild moved from, that had no
     *     grandchild to replace it)
     */
    int fillHoleAt(int index) {

import org.codelibs.core.exception.ClIllegalArgumentException;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.ExpectedException;

/**
 * @author higa
 *
 */
public class LoggerTest {

    /**
     * @see org.junit.rules.ExpectedException
     */
    @Rule
    public ExpectedException exception = ExpectedException.none();

    START_THREAD,
    /** Indicates the finish of a crawler thread. */
    FINISHED_THREAD,
    /** Indicates no response processor is available. */
    NO_RESPONSE_PROCESSOR,
    /** Indicates no rule is available for processing. */
    NO_RULE,
    /** Indicates a system error occurred. */
    SYSTEM_ERROR

      buffer.write(this, length.toLong())
    }
    while (!buffer.exhausted()) {
      var publicSuffix = buffer.readUtf8LineStrict()
      if (publicSuffix.contains("*")) {
        // A wildcard rule, let's replace the wildcard with a value.
        publicSuffix = publicSuffix.replace("\\*".toRegex(), "square")
      }
      assertThat(publicSuffixDatabase.getEffectiveTldPlusOne(publicSuffix)).isNull()

            "registeredAddress", null, false, false, false, "keyword", 0, 0, null, null, false, null, null, null, null, null, false);
    protected final ColumnInfo _columnRoles = cci("roles", "roles", null, null, String[].class, "roles", null, false, false, false,
            "keyword", 0, 0, null, null, false, null, null, null, null, null, false);