}
  }

  private fun headersToList(response: MockResponse.Builder): List<String> {
    val headers = response.build().headers
    return headers.map { (key, value) -> "$key: $value" }.toList()
  }

  @Test
  fun closeWithoutStart() {
    val server = MockWebServer()
    server.close()
  }

  @Test
  fun closeViaClosable() {

        when(mockNameServiceClient.getNbtAllByAddress(any(NetbiosAddress.class))).thenReturn(new NbtAddress[0]);

        assertFalse(nbtAddress.isBeingDeleted(mockContext)); // Default value before update
        verify(mockNameServiceClient).getNbtAllByAddress(any(NetbiosAddress.class));
    }

    @Test
    void testIsBeingDeleted_NoCheckNodeStatusDataCall() throws UnknownHostException {

                        fieldMap.put("result", field.getValueCountMap().entrySet().stream().map(e -> {
                            final Map<String, Object> valueCount = new HashMap<>(2, 1f);
                            valueCount.put("value", e.getKey());
                            valueCount.put("count", e.getValue());
                            return valueCount;
                        }).collect(Collectors.toList()));

    assertThat(transformation.inverse().inverse()).isSameInstanceAs(transformation);
  }

  /**
   * Asserts that {@code transformation} is horizontal with the given value of {@code y}. Includes
   * assertions about all the public instance methods of {@link LinearTransformation}, including an
   * assertion that {@link LinearTransformation#transform} and {@link LinearTransformation#slope} on

	// workerStartMu sync.Mutex
	lastStarted time.Time

	wg sync.WaitGroup

	// Channel of log entries.
	// Reading logCh must hold read lock on logChMu (to avoid read race)
	// Sending a value on logCh must hold read lock on logChMu (to avoid closing)
	logCh   chan any
	logChMu sync.RWMutex

	// If this webhook is being re-configured we will
	// assign the new webhook target to this field.

    }

    public void test_metaDataGetterSetter() {
        // Test metadata getter/setter
        UrlQueueImpl<Long> queue = new UrlQueueImpl<>();

        String metaData = "{\"key\":\"value\"}";
        queue.setMetaData(metaData);
        assertEquals(metaData, queue.getMetaData());

        queue.setMetaData(null);
        assertNull(queue.getMetaData());
    }

    ): String? {
      var low = 0
      var high = size
      var match: String? = null
      while (low < high) {
        var mid = (low + high) / 2
        // Search for a '\n' that marks the start of a value. Don't go back past the start of the
        // array.
        while (mid > -1 && this[mid] != '\n'.code.toByte()) {
          mid--
        }
        mid++

        // Now look for the ending '\n'.

                        problems,
                        Severity.WARNING,
                        prefix + ".layout",
                        repository.getId(),
                        "uses the unsupported value 'legacy', artifact resolution might fail.");
            }
        }
    }

    // ----------------------------------------------------------------------
    // Field validation

  }

  public <T> void testWhere_mapFromBoundedWildcard() {
    Type subtype = new TypeCapture<TypedKeyMap<T>>() {}.capture();
    // TODO(benyu): This should check equality to an expected value, see discussion in cl/98674873
    Type unused =
        new TypeResolver()
            .where(
                new TypeCapture<Map<Integer, T>>() {}.capture(),

    //    second thread can then dispatch to the subscriber it took before the first thread does.
    //
    // All this makes me really wonder if there's any value in queueing here at all. A dispatcher
    // that simply loops through the subscribers and dispatches the event to each would actually
    // probably provide a stronger order guarantee, though that order would obviously be different