if (current == State.HALF_OPEN) {
            int successes = halfOpenSuccesses.incrementAndGet();
            if (successes >= successThreshold) {
                if (state.compareAndSet(State.HALF_OPEN, State.CLOSED)) {
                    stateChangeTime.set(System.currentTimeMillis());
                    log.info("Circuit breaker {} closed after {} successful attempts", name, successes);
                }
            }
        }

        // First success should transition to HALF_OPEN
        String result = circuitBreaker.executeWithCircuitBreaker(() -> "success 0");
        assertEquals("success 0", result, "Should execute in HALF_OPEN");
        assertEquals(State.HALF_OPEN, circuitBreaker.getState(), "Should be in HALF_OPEN after first success");

        // Need successThreshold (2) consecutive successes to close the circuit

        if (currentState == State.HALF_OPEN) {
            int successes = successCount.incrementAndGet();
            log.debug("[{}] Success in HALF_OPEN state ({}/{})", name, successes, successThreshold);

            if (successes >= successThreshold) {
                log.info("[{}] Circuit breaker closing after {} successful attempts", name, successes);
                transitionTo(State.CLOSED);
            }

        // Next call should transition to HALF_OPEN
        String result = circuitBreaker.call(() -> "success");
        assertEquals("success", result);
        assertEquals(SimpleCircuitBreaker.State.HALF_OPEN, circuitBreaker.getState());
    }

    @Test
    @DisplayName("Test circuit closes after success threshold in HALF_OPEN")
    void testCircuitClosesAfterSuccessThreshold() throws Exception {

      }

      for (N successor : sanityCheckSet(network.successors(node))) {
        assertThat(network.predecessors(successor)).contains(node);
        assertThat(network.edgesConnecting(node, successor)).isNotEmpty();
      }

      for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) {
        assertTrue(
            network.inEdges(node).contains(incidentEdge)

        checkArgument(incidentEdge.nodeU().equals(thisNode));

        N successor = incidentEdge.nodeV();
        V value = successorNodeToValueFn.apply(successor);

        Object existingValue = adjacentNodeValues.put(successor, value);
        if (existingValue != null) {
          checkArgument(existingValue == PRED);
          adjacentNodeValues.put(successor, new PredAndSucc(value));
        }

   * Creates an {@code MonitorBasedArrayBlockingQueue} with the given (fixed) capacity and the
   * specified access policy.
   *
   * @param capacity the capacity of this queue
   * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal,
   *     are processed in FIFO order; if {@code false} the access order is unspecified.
   * @throws IllegalArgumentException if {@code capacity} is less than 1
   */

  @Synchronized
  @Throws(IOException::class)
  internal fun completeEdit(
    editor: Editor,
    success: Boolean,
  ) {
    val entry = editor.entry
    check(entry.currentEditor == editor)

    // If this edit is creating the entry for the first time, every index must have a value.
    if (success && !entry.readable) {
      for (i in 0 until valueCount) {
        if (!editor.written!![i]) {

    assume().that(graphIsMutable()).isTrue();

    addNode(N1);
    Set<Integer> successors = graph.successors(N1);
    assertThrows(UnsupportedOperationException.class, () -> successors.add(N2));
    putEdge(N1, N2);
    assertThat(graph.successors(N1)).containsExactlyElementsIn(successors);
  }

  @Override
  @Test
  public void incidentEdges_checkReturnedSetMutability() {

success.upload_kuromoji_file = Plik Kuromoji przesłano.
success.upload_elevate_word = Plik słów podniesionych przesłano.
success.upload_bad_word = Plik słów zakazanych przesłano.
success.upload_mapping_file = Plik mapowania przesłano.
success.send_testmail=Wysłano e-mail testowy.
success.job_log_delete_all=Dzienniki zadań usunięto.
success.changed_password=Hasło zmieniono.
success.started_data_update=Rozpoczęto proces aktualizacji danych.