errors.login.failure = Inloggen mislukt.
errors.app.illegal.transition = Illegale overgang. Probeer het opnieuw.
errors.app.db.already.deleted = Mogelijk is het al verwijderd door een ander proces. Probeer de bewerking opnieuw.
errors.app.db.already.updated = Mogelijk is het al bijgewerkt door een ander proces. Probeer de bewerking opnieuw.
errors.app.db.already.exists = Gegevens bestaan al. Probeer de bewerking opnieuw.

labels.search=Zoeken
labels.similar_doc_result_status=Vergelijkbare resultaten worden weergegeven.
labels.search_result_status=Zoekresultaten voor <b>{0}</b><span class="br-phone"></span> <b>{2}</b> - <b>{3}</b> van <b>{1}</b>
labels.search_result_status_over=Zoekresultaten voor <b>{0}</b><span class="br-phone"></span> ongeveer <b>{1}</b> of meer <b>{2}</b> - <b>{3}</b>
labels.search_result_time=({0} seconden)
labels.prev_page=Vorige

          "type":       "stop",

@NullUnmarked
public class SourceSinkTester<S, T, F extends SourceSinkFactory<S, T>> extends TestCase {

  static final String LOREM_IPSUM =
      "Lorem ipsum dolor sit amet, consectetur adipiscing "
          + "elit. Cras fringilla elit ac ipsum adipiscing vulputate. Maecenas in lorem nulla, ac "
          + "sollicitudin quam. Praesent neque elit, sodales quis vestibulum vel, pellentesque nec "

   * close or flush the reader.
   *
   * <p>This is identical to {@link #copy(Readable, Appendable)} but optimized for these specific
   * types. CharBuffer has poor performance when being written into or read out of so round tripping
   * all the bytes through the buffer takes a long time. With these specialized types we can just
   * use a char array.
   *

        TlsVersion.TLS_1_2,
        reversed,
      )

    makeRequest(client)

    val expectedConnectionCipherSuites = expectedConnectionCipherSuites(client)
    // Will choose a poor cipher suite but not plaintext.
//    assertThat(handshake.cipherSuite).isEqualTo("TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256")
    assertThat(handshakeEnabledCipherSuites).containsExactly(

   *       servers {@code alpha}, {@code bravo}, and {@code charlie} and you occasionally need to
   *       take each of the servers offline, {@code consistentHash} will be a poor fit: It provides
   *       no way for you to specify which of the three buckets is disappearing. Thus, if your
   *       buckets change from {@code [alpha, bravo, charlie]} to {@code [bravo, charlie]}, it will

   * WeakReference} (by default, strong references are used).
   *
   * <p>Weak values will be garbage collected once they are weakly reachable. This makes them a poor
   * candidate for caching.
   *
   * <p><b>Warning:</b> when this method is used, the resulting map will use identity ({@code ==})

   *       servers {@code alpha}, {@code bravo}, and {@code charlie} and you occasionally need to
   *       take each of the servers offline, {@code consistentHash} will be a poor fit: It provides
   *       no way for you to specify which of the three buckets is disappearing. Thus, if your
   *       buckets change from {@code [alpha, bravo, charlie]} to {@code [bravo, charlie]}, it will

    // The Dolphin algorithm is attractive because it does the fewest array reads and writes: each
    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two
    // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about