constraints.Past.message = {item} muss ein vergangener Wert sein.
constraints.Pattern.message = {item} stimmt nicht mit "{regexp}" überein.
constraints.Size.message = Die Größe von {item} muss zwischen {min} und {max} liegen.
# ----------------------------------------------------------
# Hibernate Validator
# -------------------
constraints.CreditCardNumber.message = {item} ist eine ungültige Kreditkartennummer.

    @Test
    @DisplayName("Test with special characters in names")
    void testWithSpecialCharacters() {
        String specialName = "Share$\\Special/Name:*?";
        String specialRemark = "Remark with\nnewline\tand\rtabs";

        SmbShareInfo info = new SmbShareInfo(specialName, 0, specialRemark);

        assertEquals(specialName, info.getName());
        String str = info.toString();

   * equivalently, if this inverse view contains a key that is equal to {@code value}).
   *
   * <p>Due to the property that values in a BiMap are unique, this will tend to execute in
   * faster-than-linear time.
   *
   * @param value the object to search for in the values of this BiMap
   * @return true if a mapping exists from a key to the specified value
   */
  @Override

    if (!iterator.hasNext()) {
      return Optional.absent();
    }

    /*
     * TODO(kevinb): consider whether this "optimization" is worthwhile. Users with SortedSets tend
     * to know they are SortedSets and probably would not call this method.
     */
    if (iterable instanceof SortedSet) {
      SortedSet<E> sortedSet = (SortedSet<E>) iterable;

    if (!iterator.hasNext()) {
      return Optional.absent();
    }

    /*
     * TODO(kevinb): consider whether this "optimization" is worthwhile. Users with SortedSets tend
     * to know they are SortedSets and probably would not call this method.
     */
    if (iterable instanceof SortedSet) {
      SortedSet<E> sortedSet = (SortedSet<E>) iterable;

labels.eol_error=Das von Ihnen verwendete System wird nicht mehr unterstützt. Bitte beachten Sie die Seite zum Produkt-Support-Lebenszyklus und führen Sie ein Upgrade durch.
labels.tooltip_search_view=Suchbildschirm
labels.tooltip_run_crawler=Crawler ausführen
labels.tooltip_forum=Forum
labels.tooltip_onlinehelp=Hilfe
labels.tooltip_logout=Abmelden

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to

"nur", "ob", "oder", "ohne", "sehr", "sein", "seine", "seinem", "seinen", "seiner", "seines", "selbst", "sich", "sie", "ihnen", "sind", "so", "solche", "solchem", "solchen", "solcher", "solches", "soll", "sollte", "sondern", "sonst", "über", "um", "und", "uns", "unse", "unsem", "unsen", "unser", "unses", "unter", "viel", "vom", "von", "vor", "während", "war", "waren", "warst", "was", "weg", "weil", "weiter", "welche", "welchem", "welchen", "welcher", "welches", "wenn", "werde", "werden", "wie", "wieder",...