// Clean up temporary directory
            deleteDirectory(tempDir);
        }
    }

    @BeforeEach
    void setupTest() throws Exception {
        // No specific setup needed - tests will create their own files
        log.debug("Test setup completed");
    }

    @AfterEach
    void cleanupTest() throws Exception {
        // Simple cleanup between tests
        try {

	bucket := ri.Bucket
	object := ri.Name

	// set defaults for replication action based on operation being performed - actual
	// replication action can only be determined after stat on remote. This default is
	// needed for updating replication metrics correctly when target is offline.
	rAction := replicateMetadata

	rinfo = replicatedTargetInfo{
		Size:                  ri.ActualSize,
		Arn:                   tgt.ARN,

    }
    return new FluentIterable<T>() {
      @Override
      public Iterator<T> iterator() {
        return Iterators.concat(
            /* lazily generate the iterators on each input only as needed */
            new AbstractIndexedListIterator<Iterator<? extends T>>(inputs.length) {
              @Override
              public Iterator<? extends T> get(int i) {
                return inputs[i].iterator();

    this.entries = null;
    this.keys = null;
    this.values = null;
    incrementModCount();
    return newDelegate;
  }

  /** Stores the hash table mask as the number of bits needed to represent an index. */
  private void setHashTableMask(int mask) {
    int hashTableBits = Integer.SIZE - Integer.numberOfLeadingZeros(mask);
    metadata =

    }
    return new FluentIterable<T>() {
      @Override
      public Iterator<T> iterator() {
        return Iterators.concat(
            /* lazily generate the iterators on each input only as needed */
            new AbstractIndexedListIterator<Iterator<? extends T>>(inputs.length) {
              @Override
              public Iterator<? extends T> get(int i) {
                return inputs[i].iterator();

   * at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first
   * element in the result.
   *
   * <p>If needed, the {@link Traverser} class provides more flexible and lighter-weight ways to
   * list the nodes reachable from a given node or nodes. See the <a

   * bulkGet(keys)} with a relative large number of keys can cause an excessive number of shared
   * stripes (much like the birthday paradox, where much fewer than anticipated birthdays are needed
   * for a pair of them to match). Please consider carefully the implications of the number of
   * stripes, the intended concurrency level, and the typical number of keys used in a {@code

   * at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first
   * element in the result.
   *
   * <p>If needed, the {@link Traverser} class provides more flexible and lighter-weight ways to
   * list the nodes reachable from a given node or nodes. See the <a

    Smb2CreateRequest request = new Smb2CreateRequest();
    request.setPath(handle.path);
    request.addReconnectContext(handle.fileId);
    
    // Add lease context if needed
    if (handle.leaseKey != null) {
        request.addLeaseContext(handle.leaseKey, Smb2LeaseState.SMB2_LEASE_NONE, false);
    }
    
    Smb2CreateResponse response = (Smb2CreateResponse) tree.send(request);
    

        </field>
      </fields>
    </class>

    <class xdoc.anchorName="dependency">
      <name>Dependency</name>
      <version>1.0.0/1.1.0</version>
      <description>Definition of a dependency, needed by the plugin at runtime.</description>
      <fields>
        <field>
          <name>groupId</name>
          <required>true</required>
          <version>1.0.0+</version>
          <type>String</type>