}

    // Happy path for SMB2: a response is received and the list is returned; tree is closed
    @Test
    @DisplayName("watch() SMB2 happy path returns notifications and closes tree")
    void watch_smb2_success_returnsList_andClosesTree() throws Exception {
        List<FileNotifyInformation> info = new ArrayList<>();
        NotifyResponse resp = mock(NotifyResponse.class);

   * #add(Range) add} any range not {@linkplain Range#encloses(Range) enclosed} by {@code view}.
   */
  RangeSet<C> subRangeSet(Range<C> view);

  // Modification

  /**
   * Adds the specified range to this {@code RangeSet} (optional operation). That is, for equal
   * range sets a and b, the result of {@code a.add(range)} is that {@code a} will be the minimal

  }

  @Override
  public int count(@Nullable Object element) {
    Count frequency = safeGet(backingMap, element);
    return (frequency == null) ? 0 : frequency.get();
  }

  // Optional Operations - Modification Operations

  /**
   * {@inheritDoc}
   *
   * @throws IllegalArgumentException if the call would result in more than {@link
   *     Integer#MAX_VALUE} occurrences of {@code element} in this multiset.
   */

         * Gets the size of this cached file in bytes
         * @return the file size
         */
        public long getSize() {
            return size;
        }

        /**
         * Gets the last modification timestamp of this cached item
         * @return the last modified time
         */
        public long getLastModified() {
            return lastModified;
        }

        /**

       *   to iterate it to exhaustion. Then we can apply the logic above about an empty
       *   columnIterator. (This assumes no concurrent modification, but behavior under concurrent
       *   modification is undefined, anyway.)
       */
      requireNonNull(rowEntry);
      Entry<C, V> columnEntry = columnIterator.next();

        }
    }

    /**
     * Modifies an entry by adding a new attribute.
     *
     * @param modifyList The list of modification items.
     * @param name The name of the attribute.
     * @param value The value of the attribute.
     */

   * #add(Range) add} any range not {@linkplain Range#encloses(Range) enclosed} by {@code view}.
   */
  RangeSet<C> subRangeSet(Range<C> view);

  // Modification

  /**
   * Adds the specified range to this {@code RangeSet} (optional operation). That is, for equal
   * range sets a and b, the result of {@code a.add(range)} is that {@code a} will be the minimal

       *   to iterate it to exhaustion. Then we can apply the logic above about an empty
       *   columnIterator. (This assumes no concurrent modification, but behavior under concurrent
       *   modification is undefined, anyway.)
       */
      requireNonNull(rowEntry);
      Entry<C, V> columnEntry = columnIterator.next();

    this.inverse = inverse;
  }

  // Query Operations (optimizations)

  @Override
  public boolean containsValue(@Nullable Object value) {
    return inverse.containsKey(value);
  }

  // Modification Operations

  @CanIgnoreReturnValue
  @Override
  public @Nullable V put(@ParametricNullness K key, @ParametricNullness V value) {
    return putInBothMaps(key, value, false);
  }

    List<RemovalNotification<Object, Object>> notifications = new ArrayList<>();
    RemovalListener<Object, Object> removalListener = notifications::add;
    Cache<Object, Object> cache =
        CacheBuilder.newBuilder().removalListener(removalListener).build();
    cache.put("a", "b");
    cache.asMap().computeIfAbsent("a", k -> "c");
    assertThat(notifications).isEmpty();
  }