return new ThreadPoolExecutor(nThreads, nThreads, 0L, TimeUnit.MILLISECONDS, new LinkedBlockingQueue<>(nThreads),
                new ThreadPoolExecutor.CallerRunsPolicy());
    }

    @Override
    public void store(final DataStoreParams paramMap, final Map<String, Object> dataMap) {
        final CrawlerStatsHelper crawlerStatsHelper = ComponentUtil.getCrawlerStatsHelper();

        when(tree.acquire(false)).thenReturn(tree);
        when(tree.getTreeType()).thenReturn(7);
        when(tree.getShare()).thenReturn("SHARE");
        setTree(c, tree);

        assertEquals(7, c.getTreeType());
        assertEquals("SHARE", c.getConnectedShare());
        // try-with-resources closes the acquired tree
        verify(tree, atLeastOnce()).close();
    }

    @Test

pkg sync/atomic, method (*Bool) Load() bool #50860
pkg sync/atomic, method (*Bool) Store(bool) #50860
pkg sync/atomic, method (*Bool) Swap(bool) bool #50860
pkg sync/atomic, method (*Int32) Add(int32) int32 #50860
pkg sync/atomic, method (*Int32) CompareAndSwap(int32, int32) bool #50860
pkg sync/atomic, method (*Int32) Load() int32 #50860
pkg sync/atomic, method (*Int32) Store(int32) #50860
pkg sync/atomic, method (*Int32) Swap(int32) int32 #50860

  //
  // Essentially, then, `table[h]` gives us the start of a linked list in `entries`, where every
  // element of the list has the short hash value h.
  //
  // A wrinkle here is that the value 0 (called UNSET in the code) is used as the equivalent of a
  // null pointer. If `table[h] == 0` that means there are no keys in the map whose short hash is h.

        return this.sessionKey;
    }

    @Override
    public SmbTreeImpl getSmbTree(String share, String service) {
        if (share == null) {
            share = "IPC$";
        }

        synchronized (this.trees) {
            for (SmbTreeImpl t : this.trees) {
                if (t.matches(share, service)) {
                    return t.acquire();
                }
            }

        this.keyStore = keyStore;
        this.keyStorePassword = keyStorePassword != null ? keyStorePassword.clone() : null;
    }

    /**
     * Store a session key
     *
     * @param sessionId unique session identifier
     * @param key the secret key to store
     * @param algorithm the key algorithm (e.g., "AES")
     */
    public void storeSessionKey(String sessionId, byte[] key, String algorithm) {

     *
     * @param src the source byte array
     * @param si the starting index in the source array
     * @return the decoded short value
     */
    public static short dec_uint16be(final byte[] src, final int si) {
        return (short) ((src[si] & 0xFF) << 8 | src[si + 1] & 0xFF);
    }

    /**
     * Decodes a 32-bit unsigned integer from big-endian byte order.
     *

 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

package jcifs.smb1.dcerpc.msrpc;

import jcifs.smb1.smb1.FileEntry;
import jcifs.smb1.smb1.SmbShareInfo;

/**
 * MS-RPC share enumeration operation.
 *
 * This class implements the Server Service (SRVSVC) ShareEnumAll operation
 * for enumerating network shares on a remote server.
 */
public class MsrpcShareEnum extends srvsvc.ShareEnumAll {

import org.apache.maven.artifact.repository.metadata.RepositoryMetadataStoreException;

/**
 * Contains metadata about an artifact, and methods to retrieve/store it from an artifact repository.
 * TODO merge with artifactmetadatasource
 * TODO retrieval exception not appropriate for store
 *
 */
public interface ArtifactMetadata {
    /**
     * Whether this metadata should be stored alongside the artifact.
     *

        // The getEntries method returns FileEntry objects. We can check their names.
        assertEquals("\\domain\share1", entries[0].getName(), "The name of the first share should be correct.");
        assertEquals("\\domain\share2", entries[1].getName(), "The name of the second share should be correct.");
    }

    /**
     * Test the getEntries() method when the DfsEnumArray200 is empty.
     * Verifies that an empty array is returned.