href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link>
										</c:if>
										<c:if test="${3 <= s.index}">
											<la:link styleClass="d-none d-sm-inline-block"
												href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link>
										</c:if>
									</c:forEach>
								</p>
							</div>
						</c:if>

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

/**
 * Simplified circuit breaker implementation for SMB operations.
 * Thread-safe and lock-free implementation to prevent cascading failures.
 *
 * Features:
 * - Simple state management (CLOSED, OPEN, HALF_OPEN)
 * - Lock-free atomic operations
 * - Configurable thresholds and timeouts
 * - No complex dependencies
 */
public class SimpleCircuitBreaker {

     * Test activeThreadCountLock getter
     */
    public void test_activeThreadCountLock() {
        Object lock = crawlerContext.getActiveThreadCountLock();
        assertNotNull(lock);

        // Should return same instance
        Object sameLock = crawlerContext.getActiveThreadCountLock();
        assertSame(lock, sameLock);
    }

    /**
     * Test numOfThread getter and setter
     */

        response.numEntries = 2;
        byte[] params = { 0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x02, 0x00 };
        response.readParametersWireFormat(params, 0, params.length);

        // Data block: 2 entries
        byte[] data = new byte[100];
        // Entry 1: SHARE1, type 0 (Disk), remark "Remark 1"
        System.arraycopy("SHARE1".getBytes(StandardCharsets.US_ASCII), 0, data, 0, 6);
        data[14] = 0x00;

        // When - Release session to trigger cleanup
        session.release();

        // Then - Trees should be cleared (we can't directly verify as it's internal,
        // but the cleanup code with synchronized block ensures it happens atomically)
        // The important part is that no exception occurs and the operation is atomic
    }

    /**
     * Test concurrent acquire and release operations.
     */
    @Test

    private static final Logger log = LoggerFactory.getLogger(NameServiceClientImpl.class);

    private final Object LOCK = new Object();

    private int nbnsIndex = 0;

    private final Map<Name, CacheEntry> addressCache = new HashMap<>();
    private final Set<Name> inFlightLookups = new HashSet<>();

    private final int lport;

rflow-y-auto{overflow-y:auto!important}.overflow-y-hidden{overflow-y:hidden!important}.overflow-y-visible{overflow-y:visible!important}.overflow-y-scroll{overflow-y:scroll!important}.d-inline{display:inline!important}.d-inline-block{display:inline-block!important}.d-block{display:block!important}.d-grid{display:grid!important}.d-inline-grid{display:inline-grid!important}.d-table{display:table!important}.d-table-row{display:table-row!important}.d-table-cell{display:table-cell!important}.d-flex{di...

        int bytesWritten = write.writeBytesWireFormat(dst, 0);

        // Assert
        assertEquals(6, bytesWritten, "Should write 6 bytes (1 type + 2 length + 3 data)");
        assertEquals(0x01, dst[0], "Data block type");
        assertEquals(3, dst[1] & 0xFF, "Data length low byte");
        assertEquals(0, dst[2] & 0xFF, "Data length high byte");
        assertEquals(2, dst[3], "First data byte");

    }

    @Test
    void sendResetsResponseAndForwards() throws Exception {
        SmbSession session = new SmbSession(addr, 445, inet, 0, auth);
        // prepare a dummy request/response using a real SMB block type
        ServerMessageBlock req = new SmbComOpenAndX("test.txt", 0, 0, null);
        ServerMessageBlock resp = new SmbComOpenAndX("test.txt", 0, 0, null);
        resp.received = true;

 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
package jcifs.internal.smb2.lock;

import jcifs.CIFSContext;
import jcifs.Configuration;
import jcifs.internal.smb2.ServerMessageBlock2Request;
import jcifs.internal.smb2.Smb2Constants;
import jcifs.internal.smb2.lease.Smb2LeaseKey;