mockNotifications.add(fileNotifyInfo1);
        mockNotifications.add(fileNotifyInfo2);
        mockNotifications.add(fileNotifyInfo3);
    }

    /**
     * Test watch() method returning notifications
     */
    @Test
    void testWatch() throws CIFSException {
        // Setup mock behavior
        when(watchHandle.watch()).thenReturn(mockNotifications);

        // Execute

   * #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

        assertEquals(combinedFilter, readFilter);
        assertEquals(0x1F, readFilter); // 1 + 2 + 4 + 8 + 16 = 31 = 0x1F
    }

    @Test
    @DisplayName("Should handle all file change notifications")
    void testAllFileChangeNotifications() {
        // Given - all possible filters
        int allFilters = Smb2ChangeNotifyRequest.FILE_NOTIFY_CHANGE_FILE_NAME | Smb2ChangeNotifyRequest.FILE_NOTIFY_CHANGE_DIR_NAME

  }

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

        /**

   * allocated, the value of {@code metadata} combines the number of bits in the "short hash", in
   * its bottom {@value CompactHashing#HASH_TABLE_BITS_MAX_BITS} bits, with a modification count in
   * the remaining bits that is used to detect concurrent modification during iteration.
   */
  private transient int metadata;

  /** The number of elements contained in the set. */
  private transient int size;

     * Constructs a new CharMappingFile instance.
     *
     * @param id the unique identifier for this mapping file
     * @param path the file path to the character mapping dictionary
     * @param timestamp the last modification timestamp of the file
     */
    public CharMappingFile(final String id, final String path, final Date timestamp) {
        super(id, path, timestamp);
    }

    /**

    }

    // 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);

Luego tu API (imaginemos):

* Enviará la factura a algún cliente del desarrollador externo.
* Recogerá el dinero.
* Enviará una notificación de vuelta al usuario de la API (el desarrollador externo).
    * Esto se hará enviando un request POST (desde *tu API*) a alguna *API externa* proporcionada por ese desarrollador externo (este es el "callback").

   * #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