void clearValueReferenceQueue() {
      while (valueReferenceQueue.poll() != null) {}
    }

    // recency queue, shared by expiration and eviction

    /**
     * Records the relative order in which this read was performed by adding {@code entry} to the
     * recency queue. At write-time, or when the queue is full past the threshold, the queue will be
     * drained and the entries therein processed.
     *

  /**
   * Creates a graph from a list of node pairs (encoded as strings, e.g. "ab" means that this graph
   * has an edge between 'a' and 'b').
   *
   * <p>The {@code successors} are always returned in alphabetical order.
   */
  private static SuccessorsFunction<Character> createGraph(boolean directed, String... edges) {
    ImmutableMultimap.Builder<Character, Character> graphMapBuilder = ImmutableMultimap.builder();

				"application/vnd.lotus-approach",
				"application/vnd.lotus-freelance",
				"application/vnd.lotus-notes",
				"application/vnd.lotus-organizer",
				"application/vnd.lotus-screencam",
				"application/vnd.lotus-wordpro",
				"application/vnd.macports.portpkg",
				"application/vnd.marlin.drm.actiontoken+xml",
				"application/vnd.marlin.drm.conftoken+xml",
				"application/vnd.marlin.drm.license+xml",

labels.errorCountMax=Максимальное количество ошибок
labels.errorCountMin=Минимальное количество ошибок
labels.facet=Фасет
labels.geo=Гео
labels.groups=Группы
labels.hash=Хэш
labels.maxSize=Максимальный размер
labels.order=Порядок
labels.purgeSuggestSearchLogDay=Удалить старую информацию о предложениях
labels.q=Запрос
labels.roles=Роли
labels.suggestSearchLog=Журнал поиска предложений
labels.suggestWord=Предложить слово

labels.crawler=크롤러
labels.crudMode=모드
labels.errorCountMax=최대 오류 수
labels.errorCountMin=최소 오류 수
labels.facet=패싯
labels.geo=지오
labels.groups=그룹
labels.hash=해시
labels.maxSize=최대 크기
labels.order=순서
labels.purgeSuggestSearchLogDay=이전 추천 정보 삭제
labels.q=쿼리
labels.roles=역할
labels.suggestSearchLog=추천용 검색 로그
labels.suggestWord=추천 단어
labels.targetLabel=라벨
labels.term=검색어
labels.fields=필드

labels.crudMode=Modo
labels.errorCountMax=Número máximo de erros
labels.errorCountMin=Número mínimo de erros
labels.facet=Faceta
labels.geo=Geo
labels.groups=Grupos
labels.hash=Hash
labels.maxSize=Tamanho máximo
labels.order=Ordem
labels.purgeSuggestSearchLogDay=Excluir informações de sugestão anteriores
labels.q=Consulta
labels.roles=Funções
labels.suggestSearchLog=Log de pesquisa para sugestões
labels.suggestWord=Palavra sugerida

 * @author George van den Driessche
 */
// TODO: Descriptive assertion messages, with hints as to probable fixes.
// TODO: Add another constructor parameter indicating whether the class under test is ordered, and
// check the order if so.
// TODO: Refactor to share code with SetTestBuilder etc.
@GwtCompatible
@NullMarked
public abstract class MapInterfaceTest<K extends @Nullable Object, V extends @Nullable Object>
    extends TestCase {

    }

    /**
     * Creates and returns a new instance of {@link SynchronousQueue}.
     *
     * @param <E> the element type of {@link SynchronousQueue}
     * @param fair whether the access order is FIFO for waiting threads
     * @return a new instance of {@link SynchronousQueue}
     * @see SynchronousQueue#SynchronousQueue()
     */

    } else if (obj instanceof MediaType) {
      MediaType that = (MediaType) obj;
      return this.type.equals(that.type)
          && this.subtype.equals(that.subtype)
          // compare parameters regardless of order
          && this.parametersAsMap().equals(that.parametersAsMap());
    } else {
      return false;
    }
  }

  @Override
  public int hashCode() {
    // racy single-check idiom

import org.codelibs.core.nio.ChannelUtil;

/**
 * Utility for copying.
 * <p>
 * The combinations of input and output types and the unit of elements copied are as follows:
 * </p>
 * <table border="1">
 * <caption>Elements for copying instances</caption>
 * <tr>
 * <th rowspan="2">Input type</th>
 * <th colspan="4">Output type</th>
 * </tr>
 * <tr>
 * <th>{@link OutputStream}</th>
 * <th>{@link Writer}</th>