- [Changelog since v1.25.14](#changelog-since-v12514)
  - [Changes by Kind](#changes-by-kind)
    - [Feature](#feature)
    - [Bug or Regression](#bug-or-regression)
    - [Other (Cleanup or Flake)](#other-cleanup-or-flake)
  - [Dependencies](#dependencies-1)
    - [Added](#added-1)
    - [Changed](#changed-1)
    - [Removed](#removed-1)
- [v1.25.14](#v12514)
  - [Downloads for v1.25.14](#downloads-for-v12514)

    assertEquals(liveCount, originalMap.size());
    // can't compare map contents until cleanup occurs

    for (int i = 1; i <= originalCount * 2; i *= 2) {
      if (i > 1) {
        segment.expand();
      }
      assertEquals(i, segment.table.length());
      assertEquals(liveCount, countLiveEntries(map, 0));
      // expansion cleanup is sloppy, with a goal of avoiding unnecessary copies

- `kube-proxy --cleanup will` return the correct exit code if the cleanup was successful ([#78775](https://github.com/kubernetes/kubernetes/pull/78775), [@johscheuer](https://github.com/johscheuer))

        labelList = new ArrayList<>();
        labelType = null;
    }

    /**
     * SAX event handler called at the end of document parsing.
     * Cleans up internal data structures used during parsing.
     *
     * @throws SAXException if a SAX error occurs during cleanup
     */
    @Override
    public void endDocument() throws SAXException {
        globalParams.clear();
        tagQueue.clear();
    }

    assertEquals(liveCount, countLiveEntries(map));
    ImmutableMap<Object, Object> originalMap = ImmutableMap.copyOf(map);
    assertEquals(liveCount, originalMap.size());
    // can't compare map contents until cleanup occurs

    for (int i = 1; i <= originalCount * 2; i *= 2) {
      if (i > 1) {
        // TODO(b/145386688): This access should be guarded by 'segment', which is not currently
        // held

    assertEquals(liveCount, countLiveEntries(map));
    ImmutableMap<Object, Object> originalMap = ImmutableMap.copyOf(map);
    assertEquals(liveCount, originalMap.size());
    // can't compare map contents until cleanup occurs

    for (int i = 1; i <= originalCount * 2; i *= 2) {
      if (i > 1) {
        // TODO(b/145386688): This access should be guarded by 'segment', which is not currently
        // held

                th.close();
            } else {
                // Let connection pooling handle cleanup - this improves performance
                // for scenarios where the same file or directory is accessed multiple times
                log.trace("Tree handle released to connection pool for reuse");
                // The connection pool will handle cleanup based on its own timeout settings
            }
        }

  - [Changes by Kind](#changes-by-kind-3)
    - [API Change](#api-change)
    - [Feature](#feature-3)
    - [Bug or Regression](#bug-or-regression-3)
    - [Other (Cleanup or Flake)](#other-cleanup-or-flake)
  - [Dependencies](#dependencies-3)
    - [Added](#added-3)
    - [Changed](#changed-3)
    - [Removed](#removed-3)
- [v1.24.13](#v12413)
  - [Downloads for v1.24.13](#downloads-for-v12413)

    }
}
```

## 9. Performance Considerations

### 9.1 Memory Management
- Lease entries should be evicted based on LRU when max leases reached
- Implement periodic cleanup of expired leases

### 9.2 Thread Safety
- Use concurrent data structures for lease storage
- Minimize lock contention in hot paths
- Async handling of lease breaks

### 9.3 Network Efficiency

        this.leaseToPath = new ConcurrentHashMap<>();
        this.scheduler = Executors.newScheduledThreadPool(1);
        this.changeNotifier = new DirectoryChangeNotifier(this);
        
        // Schedule periodic cache cleanup
        scheduler.scheduleAtFixedRate(this::cleanupExpiredEntries, 60, 60, TimeUnit.SECONDS);
    }
    
    public Smb2LeaseKey requestDirectoryLease(String directoryPath,