private @Nullable MoveDesc<E> fillHole(int index, E toTrickle) {
    Heap heap = heapForIndex(index);
    // We consider elementData(index) a "hole", and we want to fill it
    // with the last element of the heap, toTrickle.
    // Since the last element of the heap is from the bottom level, we
    // optimistically fill index position with elements from lower levels,
    // moving the hole down. In most cases this reduces the number of

   * New entries are added at the tail of the list at write time; stale entries are expired from
   * the head of the list.
   */

  /** Returns the time that this entry was last accessed, in ns. */
  @SuppressWarnings("GoodTime")
  long getAccessTime();

  /** Sets the entry access time in ns. */
  @SuppressWarnings("GoodTime") // b/122668874
  void setAccessTime(long time);

     * @param fid the file identifier
     * @param attributes the file attributes to set
     * @param createTime the file creation time
     * @param lastWriteTime the last write time
     * @param lastAccessTime the last access time
     */
    public Trans2SetFileInformation(final Configuration config, final int fid, final int attributes, final long createTime,

      private @Nullable Entry<E> last;

      @Override
      protected Iterator<Entry<E>> delegate() {
        return readOnlyIterator;
      }

      @Override
      public Entry<E> next() {
        last = super.next();
        return last;
      }

      @Override
      public void remove() {
        checkState(last != null, "no calls to next() since the last call to remove()");

 */
package jcifs;

import java.net.URL;

/**
 * Location information for a SMB resource
 *
 * @author mbechler
 *
 */
public interface SmbResourceLocator {

    /**
     * Returns the last component of the target URL. This will
     * effectively be the name of the file or directory represented by this
     * <code>SmbFile</code> or in the case of URLs that only specify a server

     *
     * @return the isEndOfSearch
     */
    public final boolean isEndOfSearch() {
        return this.isEndOfSearch;
    }

    /**
     * Gets the last file name in the response.
     *
     * @return the lastName
     */
    public final String getLastName() {
        return this.lastName;
    }

    /**
     * Gets the resume key for continuing the search.

| metadata_1      | msgp bin array              | Metadata of version 1
| ...header_n     | msgp bin array              | Header of last version
| ...metadata_n   | msgp bin array              | Metadata of last version

Each header contains a mspg array (tuple) encoded object:

xlHeaderVersion version == 1:

```
//msgp:tuple xlMetaV2VersionHeader

                "  <div class=\"wistia-video\"> \n" +
                "    <div class=\"wistia-player\"> \n" +
                "      <script src=\"https://fast.wistia.com/embed/medias/$2.jsonp\" async></script> \n" +
                "      <script src=\"https://fast.wistia.com/assets/external/E-v1.js\" async></script> \n" +
                "        <div class=\"wistia_responsive_padding\" style=\"padding:55.94% 0 0 0;position:relative;\"> \n" +

//
// Scanning stops unrecoverably at EOF, the first I/O error, or a token too
// large to fit in the [Scanner.Buffer]. When a scan stops, the reader may have
// advanced arbitrarily far past the last token. Programs that need more
// control over error handling or large tokens, or must run sequential scans
// on a reader, should use [bufio.Reader] instead.
type Scanner struct {

 * thus currentVersion will be one of these.
 * <p>
 * Considering:
 * <dl>
 *     <dt>M, M &gt; 0</dt>
 *     <dd>last released major</dd>
 *     <dt>N, N &gt; 0</dt>
 *     <dd>last released minor</dd>
 * </dl>
 *
 * <ul>
 * <li>the unreleased <b>major</b>, M+1.0.0 on the `master` branch</li>