for (int i = 0; i < entries.size(); i++) {
        Range<K> range = entries.get(i).getKey();
        if (i > 0) {
          Range<K> prevRange = entries.get(i - 1).getKey();
          if (range.isConnected(prevRange) && !range.intersection(prevRange).isEmpty()) {
            throw new IllegalArgumentException(
                "Overlapping ranges: range " + prevRange + " overlaps with entry " + range);
          }
        }

    protected void doCloseInternal() throws CIFSException {
        try {
            @SuppressWarnings("resource")
            final SmbTreeHandleImpl th = getTreeHandle();
            if (this.fileId != null && th.isConnected()) {
                th.send(new Smb2CloseRequest(th.getConfig(), this.fileId));
            }
        } finally {
            this.fileId = null;
        }
    }

  RegularContiguousSet(Range<C> range, DiscreteDomain<C> domain) {
    super(domain);
    this.range = range;
  }

  private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
    return range.isConnected(other)
        ? ContiguousSet.create(range.intersection(other), domain)
        : new EmptyContiguousSet<C>(domain);
  }

  @Override
  ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {

  RegularContiguousSet(Range<C> range, DiscreteDomain<C> domain) {
    super(domain);
    this.range = range;
  }

  private ContiguousSet<C> intersectionInCurrentDomain(Range<C> other) {
    return range.isConnected(other)
        ? ContiguousSet.create(range.intersection(other), domain)
        : new EmptyContiguousSet<C>(domain);
  }

  @Override
  ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {

     * {@inheritDoc}
     *
     * @see jcifs.SmbFileHandle#isValid()
     */
    @Override
    public boolean isValid() {
        return this.open && this.tree_num == this.tree.getTreeId() && this.tree.isConnected();
    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.SmbFileHandle#close(long)
     */
    @Override
    public synchronized void close(final long lastWriteTime) throws CIFSException {

        when(mockTree.getReceiveBufferSize()).thenReturn(0x10000);
        when(mockTree.getMaximumBufferSize()).thenReturn(0x10000);
        when(mockTree.getConfig()).thenReturn(mockConfig);
        when(mockTree.isConnected()).thenReturn(true);
        when(mockTree.getTreeId()).thenReturn(1L);

        when(mockFile.getType()).thenReturn(SmbConstants.TYPE_FILESYSTEM);
    }

    @Nested
    @DisplayName("Happy path")

    @Mock
    private CIFSContext cifsContext;

    @BeforeEach
    void setup() {
        // Tree handle lifecycle and config
        lenient().when(tree.acquire()).thenReturn(tree);
        lenient().when(tree.isConnected()).thenReturn(true);

        // CIFS context returns same config to build responses during initResponse
        lenient().when(cifsContext.getConfig()).thenReturn(config);
    }

    @AfterEach

                ftpClient.disconnect();
            } catch (final IOException e) {
                if (logger.isDebugEnabled()) {
                    logger.debug("Failed to disconnect FTP client: connected={}", ftpClient.isConnected(), e);
                }
            }
        }
        if (logger.isDebugEnabled()) {
            logger.debug("FTP client closed");
        }
    }

    /*
     * (non-Javadoc)
     *

  go func() {
   for {
    // Reconnect if the connection is lost.
    if stanConnection == nil || stanConnection.NatsConn() == nil ||  !stanConnection.NatsConn().IsConnected() {
     stanConnection, _ = stan.Connect("test-cluster", "test-client", stan.NatsURL("nats://yourusername:yoursecret@0.0.0.0:4222"), stan.SetConnectionLostHandler(func(c stan.Conn, _ error) {
      if c.NatsConn() != nil {

            }
        }, 30, TimeUnit.SECONDS);
    }
    
    private boolean testWitnessService() {
        // Simple connectivity test
        return client != null && client.isConnected();
    }
    
    private void reregisterNotifications() {
        // Re-register all previous registrations
        // Implementation would store registration details for recovery
    }
}
```