}

    @Override
    public void removeTransport(final SmbTransport trans) {
        if (log.isDebugEnabled()) {
            log.debug("Scheduling transport connection for removal " + trans + " (" + System.identityHashCode(trans) + ")");
        }
        this.toRemove.add((SmbTransportImpl) trans);
    }

    private void cleanup() {
        SmbTransportImpl trans;

     * An empty match is retained if there is only a single key under match.
     *
     * @param subKey   the key name directly under match to remove. For example "_type"
     * @param testName the testName to apply removal
     */
    public void removeMatch(String subKey, String testName) {
        transformations.add(new RemoveMatch(subKey, testName));
    }

    /**

          continue;
        }

        if (limit == 1) {
          // The limit has been reached, return the rest of the string as the
          // final item. This is tested after empty string removal so that
          // empty strings do not count towards the limit.
          end = toSplit.length();
          offset = -1;
          // Since we may have changed the end, we need to trim it again.

	exit 1
fi

## Check replication of deleted ILM expiry rules when target has transition part as well
## Only the expiry part of rules should get removed as part if replication of removal from
## other site
id=$(./mc ilm rule list siteb/bucket --json | jq '.config.Rules[] | select(.Expiration.Days==3) | .ID' | sed 's/"//g')
# Remove rule from siteb
./mc ilm rule remove --id "${id}" siteb/bucket

   * higher than performing just the operation without enforcing the capacity constraint.
   *
   * This implementation uses a per-segment queue to record a memento of the additions, removals,
   * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
   * its capacity threshold.
   *

    entry.updateChild("file1.txt", attrs);
    
    assertTrue(entry.hasChild("file1.txt"));
    assertEquals(1, entry.getChildren().size());
    
    // Test removal
    entry.removeChild("file1.txt");
    assertFalse(entry.hasChild("file1.txt"));
    assertEquals(0, entry.getChildren().size());
}

@Test
public void testDirectoryLeaseManager() {

          continue;
        }

        if (limit == 1) {
          // The limit has been reached, return the rest of the string as the
          // final item. This is tested after empty string removal so that
          // empty strings do not count towards the limit.
          end = toSplit.length();
          offset = -1;
          // Since we may have changed the end, we need to trim it again.

        backingRowMap = computeBackingRowMap();
      }
    }

    @Nullable Map<C, V> computeBackingRowMap() {
      return backingMap.get(rowKey);
    }

    // Call this every time we perform a removal.
    void maintainEmptyInvariant() {
      updateBackingRowMapField();
      if (backingRowMap != null && backingRowMap.isEmpty()) {
        backingMap.remove(rowKey);
        backingRowMap = null;
      }

        backingRowMap = computeBackingRowMap();
      }
    }

    @Nullable Map<C, V> computeBackingRowMap() {
      return backingMap.get(rowKey);
    }

    // Call this every time we perform a removal.
    void maintainEmptyInvariant() {
      updateBackingRowMapField();
      if (backingRowMap != null && backingRowMap.isEmpty()) {
        backingMap.remove(rowKey);
        backingRowMap = null;
      }

   * higher than performing just the operation without enforcing the capacity constraint.
   *
   * This implementation uses a per-segment queue to record a memento of the additions, removals,
   * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
   * its capacity threshold.
   *