*
     * @param th the SMB tree handle for the connection
     * @param parent the parent resource being enumerated
     * @param wildcard the wildcard pattern for filtering entries
     * @param filter additional resource name filter to apply
     * @param searchAttributes the file attributes to search for
     * @throws CIFSException if an error occurs during initialization
     */

    return CompactHashMap.create();
  }

  /**
   * Returns the platform preferred map implementation that preserves insertion order when used only
   * for insertions, with a hint for how many entries to expect.
   */
  static <K extends @Nullable Object, V extends @Nullable Object>
      Map<K, V> preservesInsertionOrderOnPutsMapWithExpectedSize(int expectedSize) {

		arnErr, ok := err.(*event.ErrARNNotFound)
		if ok {
			for i, queue := range config.QueueList {
				// Remove ARN not found queues, because we previously allowed
				// adding unexpected entries into the config.
				//
				// With newer config disallowing changing / turning off
				// notification targets without removing ARN in notification
				// configuration we won't see this problem anymore.

 * such as those associated with files and directories. The Windows OS
 * determines which users have the necessary permissions to access objects
 * based on these entries.
 * <p>
 * To fully understand the information exposed by this class a description
 * of the access check algorithm used by Windows is required. The following

     */
    int getCount();

    /**
     * {@inheritDoc}
     *
     * <p>Returns {@code true} if the given object is also a multiset entry and the two entries
     * represent the same element and count. That is, two entries {@code a} and {@code b} are equal
     * if:
     *
     * {@snippet :
     * Objects.equals(a.getElement(), b.getElement())
     *     && a.getCount() == b.getCount()
     * }

    split(range.upperBound);

    // Due to the splitting of any entries spanning the range bounds, we know that any entry with a
    // lower bound in the merge range is entirely contained by the merge range.
    Set<Entry<Cut<K>, RangeMapEntry<K, V>>> entriesInMergeRange =
        entriesByLowerBound.subMap(range.lowerBound, range.upperBound).entrySet();

    // Create entries mapping any unmapped ranges in the merge range to the specified value.

	versionID  string `json:"-"`
	RetryCount int    `json:"retryCount" msg:"rc"`
	sz         int64  `json:"-"`
}

// MRFReplicateEntries has the map of MRF entries to save to disk
type MRFReplicateEntries struct {
	Entries map[string]MRFReplicateEntry `json:"entries" msg:"e"`
	Version int                          `json:"version" msg:"v"`
}

// ToMRFEntry returns the relevant info needed by MRF

  K checkKey(K key) {
    return checkNotNull(key);
  }

  @Override
  V checkValue(V value) {
    return checkNotNull(value);
  }

  /**
   * @serialData the key class, value class, number of entries, first key, first value, second key,
   *     second value, and so on.
   */
  @GwtIncompatible // java.io.ObjectOutputStream
  private void writeObject(ObjectOutputStream stream) throws IOException {

            changeNotifier.stopWatching(path);
        }

        // Clear caches
        directoryCache.clear();
        leaseToPath.clear();
    }

    /**
     * Clean up expired cache entries
     */
    private void cleanupExpiredEntries() {
        List<String> expiredPaths = new ArrayList<>();

        for (Map.Entry<String, DirectoryCacheEntry> entry : directoryCache.entrySet()) {

        assertEquals(action, notifyInfo.getAction());
        assertEquals(fileName, notifyInfo.getFileName());
    }

    @Test
    @DisplayName("Test decode with multiple entries (non-zero next offset)")
    void testDecodeWithNextEntry() throws SMBProtocolDecodingException {
        String fileName = "test.txt";
        int action = FileNotifyInformation.FILE_ACTION_REMOVED;