@GwtIncompatible // NavigableSet
  ImmutableSortedSet<C> createDescendingSet() {
    return new DescendingImmutableSortedSet<>(this);
  }

  /** Returns a shorthand representation of the contents such as {@code "[1..100]"}. */
  @Override
  public String toString() {
    return range().toString();
  }

  /**
   * Not supported. {@code ContiguousSet} instances are constructed with {@link #create}. This

         */
        Config.setProperty("jcifs.smb1.smb.client.soTimeout", "1800000");
        Config.setProperty("jcifs.smb1.netbios.cachePolicy", "1200");
        /* The Filter can only work with NTLMv1 as it uses a man-in-the-middle
         * techinque that NTLMv2 specifically thwarts. A real NTLM Filter would

            message.setClientComputerName(context.getConfig().getNetbiosHostname());
            message.setFlags(request.getFlags());
            message.setTimeout((int) (context.getConfig().getWitnessRegistrationTimeout() / 1000));

            // Send the RPC request
            rpcHandle.sendrecv(message);

            // Create response from RPC message results
            WitnessRegisterResponse response = new WitnessRegisterResponse();

         * that this will suffice. I have not even benchmarked with different size limits.
         */
        if (validClasses.size() > 1000) {
          validClasses.clear();
        }

        validClasses.add(new WeakReference<Class<? extends Exception>>(exceptionClass));
      }
    }

    /**

	for i := 0; i < 2+numReaders; i++ {
		<-cdone
	}
}

// Borrowed from rwmutex_test.go
func TestRWMutex(t *testing.T) {
	defer runtime.GOMAXPROCS(runtime.GOMAXPROCS(-1))
	n := 1000
	if testing.Short() {
		n = 5
	}
	HammerRWMutex(1, 1, n)
	HammerRWMutex(1, 3, n)
	HammerRWMutex(1, 10, n)
	HammerRWMutex(4, 1, n)
	HammerRWMutex(4, 3, n)
	HammerRWMutex(4, 10, n)

    // Check the first 100,000 integers
    for (int i = 0; i < 100000; i++) {
      assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
    }

    // Then check 1000 deterministic pseudo-random int values.
    Random rand = new Random(1);
    for (int i = 0; i < 1000; i++) {
      int n = rand.nextInt(Integer.MAX_VALUE);
      assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
    }
  }

     *
     * @return lease timeout in milliseconds
     * @since 2.2
     */
    int getLeaseTimeout();

    /**
     * Property {@code jcifs.smb.client.maxLeases} (int, default 1000)
     *
     * @return maximum number of concurrent leases
     * @since 2.2
     */
    int getMaxLeases();

    /**
     * Property {@code jcifs.smb.client.leaseVersion} (int, default 2)
     *

    executorService =
        new ThreadPoolExecutor(
            NUM_THREADS,
            NUM_THREADS,
            Long.MAX_VALUE,
            SECONDS,
            new ArrayBlockingQueue<Runnable>(1000));
    executorService.prestartAllCoreThreads();
    AtomicInteger integer = new AtomicInteger();
    // Execute a bunch of tasks to ensure that our threads are allocated and hot

    /**
     * Test isSearchField() performance with large field set.
     */
    @Test
    public void test_isSearchField_performance() {
        // Create a large set of search fields
        int fieldCount = 1000;
        String[] fields = new String[fieldCount];
        for (int i = 0; i < fieldCount; i++) {
            fields[i] = "field" + i;
        }
        queryFieldConfig.setSearchFields(fields);

        assertSame(specificHandle, handleField.get(lookupSids));
    }

    @Test
    void constructor_shouldHandleLargeSidArray() {
        // Arrange
        int largeSize = 1000;
        testSids = new jcifs.SID[largeSize];
        for (int i = 0; i < largeSize; i++) {
            testSids[i] = mock(jcifs.SID.class);
            when(testSids[i].unwrap(sid_t.class)).thenReturn(mockSidT);