return getEntryNullReplaces().getKey();
  }

  private Entry<K, V> getEntryNullReplaces() {
    Iterator<Entry<K, V>> entries = getSampleElements().iterator();
    for (int i = 0; i < getNullLocation(); i++) {
      entries.next();
    }
    return entries.next();
  }

  /**
   * @return an array of the proper size with {@code null} as the value of the middle element.
   */

    super(delegate);
  }

  RegularImmutableMap(Entry<? extends K, ? extends V>... entries) {
    this(/* throwIfDuplicateKeys= */ true, entries);
  }

  RegularImmutableMap(boolean throwIfDuplicateKeys, Entry<? extends K, ? extends V>[] entries) {
    super(throwIfDuplicateKeys, entries);
  }

    @SuppressWarnings("unchecked")
    @Override
    public BiMap<V, K> create(Object... elements) {
      Entry<?, ?>[] entries = new Entry<?, ?>[elements.length];
      for (int i = 0; i < elements.length; i++) {
        entries[i] = reverse((Entry<K, V>) elements[i]);
      }
      return generator.create((Object[]) entries).inverse();
    }

    @SuppressWarnings("unchecked")
    @Override

    /**
     * Fetches more entries from the server.
     *
     * @return true if more entries were fetched, false otherwise
     * @throws CIFSException if an error occurs during fetching
     */
    protected abstract boolean fetchMore() throws CIFSException;

    /**
     * Gets the current batch of results.
     *
     * @return array of file entries in the current batch
     */

				// directory symlinks are ignored.
				continue
			}
		case data.FileAttributes&syscall.FILE_ATTRIBUTE_DIRECTORY != 0:
			name += SlashSeparator
		}

		count--
		entries = append(entries, name)
	}

	return entries, nil
}

func globalSync() {
	// no-op on windows
}

func syscallErrToFileErr(dirPath string, err error) error {
	switch err {
	case nil:
		return nil

    }

    /**
     * Returns the DFS root entries retrieved from the enumeration.
     *
     * @return an array of FileEntry objects representing the DFS roots
     */
    public FileEntry[] getEntries() {
        final netdfs.DfsEnumArray200 a200 = (netdfs.DfsEnumArray200) this.info.e;
        final SmbShareInfo[] entries = new SmbShareInfo[a200.count];
        for (int i = 0; i < a200.count; i++) {

			var zb0002 uint32
			zb0002, err = dc.ReadMapHeader()
			if err != nil {
				err = msgp.WrapError(err, "Entries")
				return
			}
			if z.Entries == nil {
				z.Entries = make(map[string]MRFReplicateEntry, zb0002)
			} else if len(z.Entries) > 0 {
				for key := range z.Entries {
					delete(z.Entries, key)
				}
			}
			for zb0002 > 0 {
				zb0002--
				var za0001 string

            verify(mockNdrBuffer).enc_ndr_referent(array.entries, 1);
        }

        @Test
        @DisplayName("Should encode array with null entries")
        void testEncodeNullEntries() throws NdrException {
            // Given: SAM array with null entries
            samr.SamrSamArray array = new samr.SamrSamArray();
            array.count = 0;
            array.entries = null;

            // When: Encoding array

  @Nullable ReferenceEntry<K, V> getNext();

  /** Returns the entry's hash. */
  int getHash();

  /** Returns the key for this entry. */
  @Nullable K getKey();

  /*
   * Used by entries that use access order. Access entries are maintained in a doubly-linked list.
   * New entries are added at the tail of the list at write time; stale entries are expired from
   * the head of the list.
   */

    List<Entry<K, V>> entries =
        copyToList(
            getSubjectGenerator()
                .getSampleElements(getSubjectGenerator().getCollectionSize().getNumElements()));
    sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator()));

    // some tests assume SEVERAL == 3
    if (entries.size() >= 1) {
      a = entries.get(0);
      if (entries.size() >= 3) {
        c = entries.get(2);