this.filters = new LinkedHashSet<>();
    }

    public OrArtifactFilter(Collection<ArtifactFilter> filters) {
        this.filters = new LinkedHashSet<>(filters);
    }

    @Override
    public boolean include(Artifact artifact) {
        for (ArtifactFilter filter : filters) {
            if (filter.include(artifact)) {
                return true;
            }
        }

        return false;
    }

     */
    void setRequestCredits(int credits);

    /**
     * Checks if this is a cancel request.
     *
     * @return whether this is a cancel request
     */
    boolean isCancel();

    /**
     * Gets the next request in the chain.
     *
     * @return chained request
     */
    Request getNext();

    /**
     * Gets the response for this request.
     *

     *
     * @param c the character to check
     * @return {@code true} if the character is a valid URL character, {@code false} otherwise
     */
    public static boolean isUrlChar(final char c) {
        if (c >= 'a' && c <= 'z' //
                || c >= 'A' && c <= 'Z' //
                || c >= '0' && c <= '9' //
                || c == '.' //
                || c == '-' //

    static final int ONE_WAY_TRANSACTION = 0x02;

    static final int PADDING_SIZE = 4;

    private final int tflags = 0x00;
    private int pad1 = 0;
    private int pad2 = 0;
    private boolean hasMore = true;
    private boolean isPrimary = true;
    private int bufParameterOffset;
    private int bufDataOffset;

    static final int TRANSACTION_BUF_SIZE = 0xFFFF;

    /**

     *
     * @return True if the item has been updated.
     */
    public boolean isUpdated() {
        return newToken != null;
    }

    /**
     * Returns true if the item has been deleted.
     *
     * @return True if the item has been deleted.
     */
    public boolean isDeleted() {
        return isUpdated() && newToken.length() == 0;
    }

    @Override

   */
  @Override
  @CanIgnoreReturnValue
  public boolean offer(E e) {
    return add(e);
  }

  /**
   * Adds the given element to this queue. If the queue is currently full, the element at the head
   * of the queue is evicted to make room.
   *
   * @return {@code true} always
   */
  @Override
  @CanIgnoreReturnValue
  public boolean add(E e) {
    checkNotNull(e); // check before removing

    long bits = doubleToRawLongBits(d);
    bits &= SIGNIFICAND_MASK;
    return (exponent == MIN_EXPONENT - 1) ? bits << 1 : bits | IMPLICIT_BIT;
  }

  static boolean isFinite(double d) {
    return getExponent(d) <= MAX_EXPONENT;
  }

  static boolean isNormal(double d) {
    return getExponent(d) >= MIN_EXPONENT;
  }

  /*
   * Returns x scaled by a power of 2 such that it is in the range [1, 2). Assumes x is positive,

    GeneralSpliterator(Spliterator<E> spliterator) {
      this.spliterator = checkNotNull(spliterator);
    }

    abstract void forEachRemaining(Consumer<? super E> action);

    abstract boolean tryAdvance(Consumer<? super E> action);

    abstract @Nullable GeneralSpliterator<E> trySplit();

    final int characteristics() {
      return spliterator.characteristics();
    }

    GeneralSpliterator(Spliterator<E> spliterator) {
      this.spliterator = checkNotNull(spliterator);
    }

    abstract void forEachRemaining(Consumer<? super E> action);

    abstract boolean tryAdvance(Consumer<? super E> action);

    abstract @Nullable GeneralSpliterator<E> trySplit();

    final int characteristics() {
      return spliterator.characteristics();
    }

    checkNotNull(action).accept(singleKey, singleValue);
  }

  @Override
  public boolean containsKey(@Nullable Object key) {
    return singleKey.equals(key);
  }

  @Override
  public boolean containsValue(@Nullable Object value) {
    return singleValue.equals(value);
  }

  @Override
  boolean isPartialView() {
    return false;
  }

  @Override
  ImmutableSet<Entry<K, V>> createEntrySet() {