# ---------------
constraints.AssertFalse.message = {item} moet onwaar zijn.
constraints.AssertTrue.message = {item} moet waar zijn.
constraints.DecimalMax.message = {item} moet kleiner zijn dan {value}.
constraints.DecimalMin.message = {item} moet groter zijn dan {value}.
constraints.Digits.message = {item} moet een getal zijn. (Verwacht: <getal>.<getal>)
constraints.Future.message = {item} moet een toekomstige waarde zijn.

labels.wizard_start_crawling_desc=U kunt nu beginnen met crawlen door op de knop "Start crawlen" te klikken.
labels.wizard_button_start_crawling=Start crawlen
labels.wizard_button_finish=Overslaan
labels.search_list_configuration=Zoeken
labels.search_list_button_delete=Verwijderen
labels.search_list_delete_confirmation=Weet u zeker dat u wilt verwijderen?
labels.search_list_button_delete_all=Alles verwijderen met deze query

 * `RESTRICTED_TLS` is a secure configuration, intended to meet stricter compliance requirements.
 * `MODERN_TLS` is a secure configuration that connects to modern HTTPS servers.
 * `COMPATIBLE_TLS` is a secure configuration that connects to secure–but not current–HTTPS servers.

   * </ul>
   *
   * <p>This method is suitable for the common use case of dividing work among buckets that meet the
   * following conditions:
   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,

   * occur after a call is canceled. Typically cancellation takes effect when an expensive I/O
   * operation is required.
   *
   * This is invoked at most once, even if [Call.cancel] is invoked multiple times. It may be
   * invoked at any point in a call's life, including before [callStart] and after [callEnd].
   */
  open fun canceled(call: Call) {
  }

  /**

   * </ul>
   *
   * <p>This method is suitable for the common use case of dividing work among buckets that meet the
   * following conditions:
   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,

  }

  /**
   * Enters this monitor. Blocks at most the given time.
   *
   * @return whether the monitor was entered
   * @since 28.0 (but only since 33.4.0 in the Android flavor)
   */
  public boolean enter(Duration time) {
    return enter(toNanosSaturated(time), TimeUnit.NANOSECONDS);
  }

  /**
   * Enters this monitor. Blocks at most the given time.
   *
   * @return whether the monitor was entered

labels.suggest_word_configuration=Suggérer un mot
labels.suggest_word_title_details=Suggérer un mot
labels.suggest_word_type=Type de mot
labels.suggest_word_number=Nombre de mots
labels.suggest_word_type_all=Tous
labels.suggest_word_type_document=Document
labels.suggest_word_type_query=Requête
labels.elevate_word_configuration=Élever un mot
labels.elevate_word_title_details=Élever un mot
labels.elevate_word_link_list=Liste

errors.invalid_kuromoji_segmentation=Le nombre de segmentations pour {0} et {1} est différent.
errors.invalid_str_is_included = {1} n'est pas valide pour {0}.
errors.blank_password = Le mot de passe est requis.
errors.invalid_confirm_password = Ne correspond pas à un mot de passe de confirmation.
errors.cannot_delete_doc_because_of_running = Un robot d'exploration est en cours d'exécution. Vous ne pouvez pas supprimer de documents.

   *       <ul>
   *         <li>UNSET, meaning "null pointer"
   *         <li>one plus an index into the keys, values, and entries arrays
   *       </ul>
   *   <li>another java.util.Map delegate implementation. In most modern JDKs, normal java.util hash
   *       collections intelligently fall back to a binary search tree if hash table collisions are
   *       detected. Rather than going to all the trouble of reimplementing this ourselves, we