* otherwise, this method returns false.
   */
  boolean remove(K key, long value) {
    return map.remove(key, value);
  }

  /**
   * Atomically remove {@code key} from the map iff its associated value is 0.
   *
   * @since 20.0
   */
  @CanIgnoreReturnValue
  public boolean removeIfZero(K key) {
    return remove(key, 0);
  }

  /**

         * remove() method would remove one of the skipped elements instead of
         * throwing an IllegalStateException.
         */
        return new Iterator<T>() {
          boolean atStart = true;

          @Override
          public boolean hasNext() {
            return iterator.hasNext();
          }

          @Override
          @ParametricNullness
          public T next() {

      new Predicate<String>() {
        @Override
        public boolean apply(@Nullable String string) {
          return !Objects.equals(string, "banana") && !Objects.equals(string, "eggplant");
        }
      };

  static final Predicate<String> FILTER_VALUES =
      new Predicate<String>() {
        @Override
        public boolean apply(@Nullable String string) {

     */
    public boolean isUpdated() {
        return newInputs != null && newOutput != null;
    }

    /**
     * Checks whether this mapping item is marked for deletion.
     * An item is considered deleted if it has updates pending and the new inputs array is empty.
     *
     * @return true if the item is marked for deletion
     */
    public boolean isDeleted() {

      return inline.submit(Iterables.get(tasks, 0)).get(timeout, unit);
    }

    @Override
    public boolean isShutdown() {
      lastMethodCalled = "isShutdown";
      return false;
    }

    @Override
    public boolean isTerminated() {
      lastMethodCalled = "isTerminated";
      return false;
    }

    @Override
    public void shutdown() {

    @GuardedBy("this")
    final Queue<ListenerCallQueue.Event<L>> waitQueue = new ArrayDeque<>();

    @GuardedBy("this")
    final Queue<Object> labelQueue = new ArrayDeque<>();

    @GuardedBy("this")
    boolean isThreadScheduled;

    PerListenerQueue(L listener, Executor executor) {
      this.listener = checkNotNull(listener);
      this.executor = checkNotNull(executor);
    }

    private static final Logger log = LoggerFactory.getLogger(SmbFileHandleImpl.class);

    private final Configuration cfg;
    private final int fid;
    private final byte[] fileId;
    private boolean open = true;
    private final long tree_num; // for checking whether the tree changed
    private SmbTreeHandleImpl tree;

    private final AtomicLong usageCount = new AtomicLong(1);
    private final int flags;

     *
     * @return whether the share is in DFS
     */
    boolean isShareDfs();

    /**
     * Indicates whether the tree connection has been successfully established and has a valid tree ID.
     *
     * @return whether the tree id is a valid one
     */
    boolean isValidTid();

        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;
    }

    /**
     * artifact, closer to the entry point, is selected
     */
    @Configuration(name = "closer-first", value = "true")
    private boolean closerFirst = true;

    /**
     * newer artifact is selected
     */
    @Configuration(name = "newer-first", value = "true")
    private boolean newerFirst = true;

    @Override
    public MetadataGraphEdge apply(MetadataGraphEdge e1, MetadataGraphEdge e2) {