for (i = 0; i < hits.length; i++) {
                reslist.push(hits[i].text);
              }
              $olEle = $("<ol/>");
              $olEle.css("list-style", "none");
              $olEle.css("padding", "0");
              $olEle.css("margin", "2px");

              for (
                j = 0;
                j < reslist.length && listNum < settingAjaxInfo.num;
                j++

labels.advance_search_occt_allinurl=in der URL der Seite
labels.advance_search_sitesearch=Website oder Domain
labels.advance_search_timestamp=Letzte Aktualisierung
labels.advance_search_timestamp_default=Jederzeit
labels.advance_search_timestamp_pastday=Letzte 24 Stunden
labels.advance_search_timestamp_pastweek=Letzte Woche
labels.advance_search_timestamp_pastmonth=Letzter Monat
labels.advance_search_timestamp_pastyear=Letztes Jahr

.formUtils.addValidator({name:"complexity",validatorFunction:function(b,c,d,e){var f=c.valAttr("require-uc-letter")||"0",g=c.valAttr("require-lc-letter")||"0",h=c.valAttr("require-special-char")||"0",i=c.valAttr("require-numeral")||"0",j=c.valAttr("require-length")||"0",k={"uc-letter":{pattern:"^(?=(?:.*[A-Z]){"+f+",}).+",numRequired:f,dialogEnd:e.passwordComplexityUppercaseInfo},"lc-letter":{pattern:"^(?=(?:.*[a-z]){"+g+",}).+",numRequired:g,dialogEnd:e.passwordComplexityLowercaseInfo},"special...

errors.app.db.already.updated = Il a peut-être été mis à jour par un autre processus. Veuillez réessayer.
errors.app.db.already.exists = Les données existent déjà. Veuillez réessayer.
errors.app.double.submit.request = Il a peut-être été traité avant cette requête. Veuillez réessayer.
# _/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/
# you can define your messages here:
# e.g.
# errors.xxx = ...
# info.xxx = ...
# _/_/_/_/_/_/_/_/_/_/

    /*
     * The striding algorithm works roughly as follows: it is universally the case that
     * CRC(x ^ y) == CRC(x) ^ CRC(y).  The approach we take is to break the message as follows,
     * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate
     * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)

      InternetDomainName.from("j\u00f8rpeland.no");
  private static final InternetDomainName PUNYCODE_EXAMPLE =
      InternetDomainName.from("xn--jrpeland-54a.no");

  /** The Greek letter delta, used in unicode testing. */
  private static final String DELTA = "\u0394";

  /** A domain part which is valid under lenient validation, but invalid under strict validation. */

"The REGON entered is invalid",badreCaptcha:"Please confirm that you are not a bot",passwordComplexityStart:"Password must contain at least ",passwordComplexitySeparator:", ",passwordComplexityUppercaseInfo:" uppercase letter(s)",passwordComplexityLowercaseInfo:" lowercase letter(s)",passwordComplexitySpecialCharsInfo:" special character(s)",passwordComplexityNumericCharsInfo:" numeric character(s)",passwordComplexityEnd:"."}})}(a,window),function(a){a.formUtils.addValidator({name:"email",valida...

labels.search_list_button_delete=Supprimer
labels.search_list_delete_confirmation=Êtes-vous sûr de vouloir supprimer ?
labels.search_list_button_delete_all=Tout supprimer par cette requête
labels.search_list_delete_all_confirmation=Êtes-vous sûr de vouloir tout supprimer par cette requête ?
labels.search_list_button_cancel=Annuler
labels.failure_url_configuration=URL d'échec
labels.failure_url_search_url=URL

     * for this entry is one, this is simply the string representation of the corresponding element.
     * Otherwise, it is the string representation of the element, followed by the three characters
     * {@code " x "} (space, letter x, space), followed by the count.
     */
    @Override
    String toString();
  }

  // Comparison and hashing

  /**

     * for this entry is one, this is simply the string representation of the corresponding element.
     * Otherwise, it is the string representation of the element, followed by the three characters
     * {@code " x "} (space, letter x, space), followed by the count.
     */
    @Override
    String toString();
  }

  /**
   * Runs the specified action for each distinct element in this multiset, and the number of