registration.updateHeartbeat();

        // After update, should not be expired with long timeout
        assertFalse(registration.isExpired(60000));

        // Verify heartbeat was actually updated
        assertTrue(registration.getLastHeartbeat() > initialTime);
    }

    @Test
    void testExpiration() throws InterruptedException {
        // Registration should not be expired initially with long timeout

        // Verify
        assertEquals(14 + nameBytes.length, bytesEncoded);

        // Check timeout (should be 0)
        assertEquals(0L, SMBUtil.readInt8(buffer, 0));

        // Check name length
        assertEquals(nameBytes.length, SMBUtil.readInt4(buffer, 8));

        // Check timeout specified flag (should be 0)
        assertEquals(0x0, buffer[12]);

        // Check padding
        assertEquals(0x0, buffer[13]);

      BiMap<V, K> inv = getMap().inverse();
      assertFalse(
          "Inverse should not contain entry " + reversed, inv.entrySet().contains(reversed));
      assertFalse(
          "Inverse should not contain key " + reversed.getKey(),
          inv.containsKey(reversed.getKey()));
      assertFalse(
          "Inverse should not contain value " + reversed.getValue(),
          inv.containsValue(reversed.getValue()));
      /*

        // Check for sorted concatenated strings
        assertTrue("Result should contain sorted tags", result.contains("aaammmzzz"));
        assertTrue("Result should contain sorted roles", result.contains("role1role2role3"));
        assertTrue("Result should contain sorted fields", result.contains("field1field2field3"));
        assertTrue("Result should contain sorted excludes", result.contains("exclude1exclude2exclude3"));
    }

        StopwordsItem item4 = new StopwordsItem(1, "different");

        // Same input should have same hashCode regardless of id
        assertEquals(item1.hashCode(), item2.hashCode());
        assertEquals(item1.hashCode(), item3.hashCode());

        // Different input should have different hashCode
        assertNotSame(item1.hashCode(), item4.hashCode());
    }

    public void test_equals() {

     * @param useDefaultExcludes whether to augment excludes with default SCM exclusion patterns
     * @return a PathMatcher that can be used to test if paths should be included
     * @throws NullPointerException if baseDirectory is null
     */
    @Nonnull
    PathMatcher createPathMatcher(
            @Nonnull Path baseDirectory,
            Collection<String> includes,

        assertTrue(it.hasNext(), "Iterator should have first element");
        assertSame(fe1, it.next(), "First element must match first page");
        assertTrue(it.hasNext(), "Iterator should have second element");
        assertSame(fe2, it.next(), "Second element must match first page");

        // Next page fetched via fetchMore()
        assertTrue(it.hasNext(), "Iterator should have third element after fetchMore");

 *
 * Implementations should check if the initial request already included an attempt to
 * authenticate. If so it is likely that further attempts will not be useful and the authenticator
 * should give up.
 *
 * When reactive authentication is requested by an origin web server, the response code is 401
 * and the implementation should respond with a new request that sets the "Authorization" header.
 *

// 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.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

package cmd

import (
	"fmt"
	"os"
	"path"
)

        SmbPipeOutputStream out = newStream();
        when(handle.isOpen()).thenReturn(state);

        // Act
        boolean result = out.isOpen();

        // Assert
        assertEquals(state, result, "isOpen should reflect handle state");
        verify(handle, times(1)).isOpen();
    }

    @Test
    @DisplayName("ensureTreeConnected delegates and returns the tree handle")