// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

ºÌöjhàYfúêqTKAQô|½I}t¾—­cst7ayTûPCµV[pGGÀ|üà˜Ô PyG¼å}}uKXHªOïz ¦Løm†ãIV_|}¾Rcna Õ¥ ´ wq4¸}VFfW®ÈñT@¨Ö[^iCªtñ„VXw²Pm\}D òxªl[`K_ ^}zwr`kFˆinñRe’¸ CD¼aÈ9eL&1 UxˆLø%„LWXKªû ¾hBChèû)~ UeGÔÂhjhÕpÔFqNqyy~hŸåup¨7—jozE xMxhã娽—{r^7 cJ Ù ¾‚¸¡Ü/t¢‘ teÖ1}z}nR^j|bÚÆ yÜõ zXiZ²lBiTo{@÷òrrˆgã ïÁºGCDuŠFìï¾ZßÜï]„qze†ÐO\qû Ns Eor]_q<ê \eÙ .f¼ ã x †|K_Ü%HTªñ Œ\KXciBÈ0 SZCRÀÕ>L}híqr>Tfi†ôaDsK}êl²v[f>{XiVkGG¾@W>Z}aiªOBLñox°øôDjúSfÖxgXóIKnl%å{r„7­HK~ñerÄ@xjöÔ%­»¦QJV NvGGÀ–¥‚&þ÷Õ KºS xrŽûÀxi`juOªszin滸Ē*˜' ¾ qjD ¦¼aÜc¥®ºImW...

### 3.2 Directory Cache Scopes
```java
public enum DirectoryCacheScope {
    IMMEDIATE_CHILDREN,    // Only direct children
    RECURSIVE_TREE,        // Entire subtree (if supported)
    METADATA_ONLY,         // File attributes but not content
    FULL_ENUMERATION      // Complete directory listing
}
```

## 4. Data Structures

### 4.1 Directory Lease Context
```java
package jcifs.internal.smb2.lease;

    for (int i = 0; i < elements.length; i++) {
      multimap.put(elements[i], i);
    }
  }

  /**
   * Implements {@code Multimap.put()} -- and no other methods -- for a {@code Map} by ignoring all
   * but the latest value for each key. This class exists only so that we can use {@link
   * MultimapsCollectionTest#populateMultimapForGet(Multimap, String[])} and similar methods to

        .addEqualityGroup(ImmutableDoubleArray.of(1, 2, 3))
        .testEquals();
  }

  /**
   * This is probably a weird and hacky way to test what we're really trying to test, but hey, it
   * caught a bug.
   */
  public void testTrimmed() {
    ImmutableDoubleArray iia = ImmutableDoubleArray.of(0, 1, 3);
    assertDoesntActuallyTrim(iia);
    assertDoesntActuallyTrim(iia.subArray(0, 3));

    return file(new File(first), more);
  }

  /** Returns a {@code File} object for the given path parts. */
  private static File file(File first, String... more) {
    // not very efficient, but should definitely be correct
    File file = first;
    for (String name : more) {
      file = new File(file, name);
    }
    return file;
  }

    private NonPublicConstantIgnored() {}
  }

  public static class NonStaticFieldIgnored {
    // This should cause infinite recursion. But it shouldn't be used anyway.
    public final NonStaticFieldIgnored instance = new NonStaticFieldIgnored();

    private NonStaticFieldIgnored() {}
  }

 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 *