# excluded.
debian-8
opensuse-leap-15.1
ol-7.7
sles-12.3 # older version used in Vagrant image
sles-12.5
sles-15.1
sles-15.2
sles-15.3

# These OSes are deprecated and filtered starting with 8.0.0, but need to be excluded
# for PR checks
centos-6

 *
 * @author Mike Bostock
 * @since 2.0
 */
@GwtCompatible
@J2ktIncompatible
public final class EnumBiMap<K extends Enum<K>, V extends Enum<V>> extends AbstractBiMap<K, V> {
  /*
   * J2CL's EnumMap does not need the Class instance, so we can use Object.class instead. (Or we
   * could use null, but that messes with our nullness checking, including under J2KT. We could

    assertThat(expected)
        .hasMessageThat()
        .isEqualTo("I bet you didn't think Thread.interrupt could throw");
    /*
     * We need to wait for the runner to exit. It used to be that the runner would get stuck in the
     * busy loop when interrupt threw.
     *
     * While we're at it, we confirm that the interrupt happened as expected.
     */

    private NameQueryResponse nameQueryResponse;

    @BeforeEach
    void setUp() {
        // Mock the OEM encoding configuration with lenient stubbing
        // since not all tests need this stub
        lenient().when(mockConfig.getOemEncoding()).thenReturn("UTF-8");

        // Initialize NameQueryResponse before each test
        nameQueryResponse = new NameQueryResponse(mockConfig);
    }

    public Slf4jStdoutLogger() {
        this(System.out);
    }

    public Slf4jStdoutLogger(PrintStream out) {
        this.out = requireNonNull(out);
    }

    //
    // These are the only methods we need in our primordial logger
    //
    @Override
    public void error(String msg) {
        out.print(ERROR);
        out.println(msg);
    }

    @Override
    public void error(String msg, Throwable t) {

 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * topological sort) that only need a way of accessing the predecessors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :

    uniqueEntries.addAll(ms.entrySet());
    assertEquals(3, uniqueEntries.size());
  }

  // Wrapper of EnumMultiset factory methods, because we need to skip create(Class).
  // create(Enum1.class) is equal to create(Enum2.class) but testEquals() expects otherwise.
  // For the same reason, we need to skip create(Iterable, Class).
  private static class EnumMultisetFactory {
    @Keep // used reflectively by testEquals

    // exponent == floor(log2(abs(x)))
    if (exponent < Long.SIZE - 1) {
      return x.longValue();
    } else if (exponent > MAX_EXPONENT) {
      return x.signum() * POSITIVE_INFINITY;
    }

    /*
     * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding
     * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or

 */
package jcifs.internal.smb2;

/**
 * Interface for SMB2 requests that require a file ID.
 *
 * This interface is implemented by SMB2 request classes that need
 * to reference a specific file using its file ID.
 *
 * @author mbechler
 */
public interface RequestWithFileId {

    /**
     * Sets the file ID for this request.
     *

	shardSize := int(e.ShardSize())
	var b []byte

	// We should always have enough capacity, but older objects may be bigger
	// we do not need stashbuffer for them.
	if globalBytePoolCap.Load().WidthCap() >= len(readers)*shardSize {
		// Fill buffers
		b = globalBytePoolCap.Load().Get()
		// Seed the buffers.
		for i := range bufs {
			bufs[i] = b[i*shardSize : (i+1)*shardSize]
		}
	}

	return &parallelReader{