*/
  private transient int @Nullable [] predecessor;

  /**
   * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
   * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] successor;

  /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */

    }
  }

  private static <T extends @Nullable Object> void successor(AvlNode<T> a, AvlNode<T> b) {
    a.succ = b;
    b.pred = a;
  }

  private static <T extends @Nullable Object> void successor(
      AvlNode<T> a, AvlNode<T> b, AvlNode<T> c) {
    successor(a, b);
    successor(b, c);
  }

  /*

    values[size] = value;

    insertIntoTableKToV(size, keyHash);
    insertIntoTableVToK(size, valueHash);

    int successor =
        (predecessor == ENDPOINT) ? firstInInsertionOrder : nextInInsertionOrder[predecessor];
    setSucceeds(predecessor, size);
    setSucceeds(size, successor);
    size++;
    modCount++;
    return null;
  }

  /**

/**
 * A builder of {@link LoadingCache} and {@link Cache} instances.
 *
 * <h2>Prefer <a href="https://github.com/ben-manes/caffeine/wiki">Caffeine</a> over Guava's caching
 * API</h2>
 *
 * <p>The successor to Guava's caching API is <a
 * href="https://github.com/ben-manes/caffeine/wiki">Caffeine</a>. Its API is designed to make it a
 * nearly drop-in replacement. Note that it is not available for Android or GWT/J2CL and that it may

  }

  private static final class NodeAndRemainingSuccessors<N> {
    final N node;

    /**
     * The successors left to be visited, or {@code null} if we just added this {@code
     * NodeAndRemainingSuccessors} instance to the stack. In the latter case, we'll compute the
     * successors if we determine that we need them after we've performed the initial processing of
     * the node.
     */

  }

  private static final class NodeAndRemainingSuccessors<N> {
    final N node;

    /**
     * The successors left to be visited, or {@code null} if we just added this {@code
     * NodeAndRemainingSuccessors} instance to the stack. In the latter case, we'll compute the
     * successors if we determine that we need them after we've performed the initial processing of
     * the node.
     */

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.

success.reindex_started=Reindexação iniciada.
success.bulk_process_started=Processo em massa iniciado.
success.print_thread_dump=Despejo de threads impresso no arquivo de log.
success.install_plugin=Instalando o plugin {0}.
success.delete_plugin=Excluindo o plugin {0}.
success.upload_file_to_storage={0} carregado.
success.sso_logout=Sessão encerrada.
success.update_storage_tags=Tags para {0} atualizadas.

  override fun connectTcp(): ConnectResult {
    check(rawSocket == null) { "TCP already connected" }

    var success = false

    // Tell the call about the connecting call so async cancels work.
    user.addPlanToCancel(this)
    try {
      user.connectStart(route)

      connectSocket()
      success = true
      return ConnectResult(plan = this)
    } catch (e: IOException) {

success.failure_url_delete_all = URL de fallo eliminada.
success.delete_file = Archivo {0} eliminado.
success.job_started = Trabajo {0} iniciado.
success.job_stopped = Trabajo {0} detenido.
success.upload_synonym_file = Archivo de sinónimos cargado.
success.upload_protwords_file = Archivo Protwords cargado.
success.upload_stopwords_file = Archivo de palabras vacías cargado.