* of as interfaces in every important sense. Each public class such as {@link ImmutableSet} is a
 * <i>type</i> offering meaningful behavioral guarantees. This is substantially different from the
 * case of (say) {@link HashSet}, which is an <i>implementation</i>, with semantics that were
 * largely defined by its supertype.
 *
 * <p>For field types and method return types, you should generally use the immutable type (such as

			}
			for j := range disks[:test.offDisks] {
				if bitrotReaders[j] == nil {
					continue
				}
				switch r := bitrotReaders[j].(type) {
				case *wholeBitrotReader:
					r.disk = badDisk{nil}
				case *streamingBitrotReader:
					r.disk = badDisk{nil}
				}
			}
			if test.offDisks > 0 {
				bitrotReaders[0] = nil
			}
			writer.Reset()

        assertEquals(17, JvmUtil.getJavaVersion());

        System.setProperty("java.version", "8.0.332");
        assertEquals(8, JvmUtil.getJavaVersion());

        // Edge case: version starts with 1 but not old format
        System.setProperty("java.version", "18.0.1");
        assertEquals(18, JvmUtil.getJavaVersion());

        // Test with extra parts

    * Como o parâmetro `q` é declarado com `= None`, ele é opcional.
    * Sem o `None` ele poderia ser obrigatório (como o corpo no caso de `PUT`).
* Para requisições `PUT` para `/items/{item_id}`, lerá o corpo como JSON e:
    * Verifica que tem um atributo obrigatório `name` que deve ser `str`.

 *
 * <p>The extra bookkeeping done by cycle detecting locks comes at some cost to performance.
 * Benchmarks (as of December 2011) show that:
 *
 * <ul>
 *   <li>for an unnested {@code lock()} and {@code unlock()}, a cycle detecting lock takes 38ns as
 *       opposed to the 24ns taken by a plain lock.
 *   <li>for nested locking, the cost increases with the depth of the nesting:
 *       <ul>

   * authenticator. This gives the authenticator the option to customize the CONNECT request. It can
   * decline to do so by returning null, in which case OkHttp will use it as-is.
   */
  @Throws(IOException::class)
  private fun createTunnelRequest(route: Route): Request {
    val proxyConnectRequest =
      Request
        .Builder()

import org.codelibs.fess.unit.UnitFessTestCase;

public class SystemUtilTest extends UnitFessTestCase {

    public void test_getSearchEngineHttpAddress_null() {
        // Clear the system property to test null case
        String originalValue = System.getProperty(Constants.FESS_SEARCH_ENGINE_HTTP_ADDRESS);
        System.clearProperty(Constants.FESS_SEARCH_ENGINE_HTTP_ADDRESS);

        try {

        ALLOWS_NULL_KEYS);
  }

  /**
   * Map generator that verifies that {@code setUp()} methods are called in all the test cases. The
   * {@code setUpRan} parameter is set true by the {@code setUp} that every test case is supposed to
   * have registered, and set false by the {@code tearDown}. We use a dynamic proxy to intercept all
   * of the {@code Map} method calls and check that {@code setUpRan} is true.
   */

        assertEquals(0, tree.connectionState);
    }

    @Test
    void testMatches() {
        SmbTree tree = new SmbTree(session, "testShare", "testService");

        // Test matching share and service (case insensitive)
        assertTrue(tree.matches("testShare", "testService"));
        assertTrue(tree.matches("TESTSHARE", "testService"));
        assertTrue(tree.matches("testshare", "TESTSERVICE"));

        }
    }

    @BeforeEach
    void setUp() {
        lenient().when(fileEntry.getName()).thenReturn("test");
    }

    @Test
    @DisplayName("Iterator without filter - simple case")
    void iteratorWithoutFilter() {
        // Setup: constructor calls advance() once
        when(delegate.hasNext()).thenReturn(true, false);
        when(delegate.next()).thenReturn(fileEntry);