labels.webauth_parameters=Parameter
labels.webauth_web_crawling_config=Web-Konfiguration
labels.webauth_scheme_basic=Basic
labels.webauth_scheme_digest=Digest
labels.webauth_scheme_ntlm=NTLM
labels.webauth_scheme_form=Formular
labels.log_configuration=Protokolldateien
labels.log_file_name=Dateiname
labels.log_file_date=Zeitstempel
labels.labeltype_configuration=Label
labels.labeltype_title_details=Label
labels.labeltype_name=Name

y.Bytes()[{{.p}}ElementLength-1] & 1 buf = append(buf, x.Bytes()...) return buf } // Add sets q = p1 + p2, and returns q. The points may overlap. func (q *{{.P}}Point) Add(p1, p2 *{{.P}}Point) *{{.P}}Point { // Complete addition formula for a = -3 from "Complete addition formulas for // prime order elliptic curves" (https://eprint.iacr.org/2015/1060), §A.2. t0 := new({{.Element}}).Mul(p1.x, p2.x) // t0 := X1 * X2 t1 := new({{.Element}}).Mul(p1.y, p2.y) // t1 := Y1 * Y2 t2 := new({{.Element}}).Mul(p1.z,...

    @Override
    public int hashCode() {
      // Warning: this is broken if size() == 0, so it is critical that we
      // substitute an empty ImmutableSet to the user in place of this

      // It's a weird formula, but tests prove it works.
      int adjust = size() - 1;
      for (int i = 0; i < axes.size(); i++) {
        adjust *= 31;
        adjust = ~~adjust;

y.Bytes()[{{.p}}ElementLength-1] & 1 buf = append(buf, x.Bytes()...) return buf } // Add sets q = p1 + p2, and returns q. The points may overlap. func (q *{{.P}}Point) Add(p1, p2 *{{.P}}Point) *{{.P}}Point { // Complete addition formula for a = -3 from "Complete addition formulas for // prime order elliptic curves" (https://eprint.iacr.org/2015/1060), §A.2. t0 := new({{.Element}}).Mul(p1.x, p2.x) // t0 := X1 * X2 t1 := new({{.Element}}).Mul(p1.y, p2.y) // t1 := Y1 * Y2 t2 := new({{.Element}}).Mul(p1.z,...

  
  Containers with memory requests equal to their memory limits also won't have
  swap access, and it is a way to opt-out of swap for a single container.
  
  The formula for the swap limit for Burstable QoS pods is:
  `(<memory-request>/<node-memory-capacity>)*<node-swap-capacity>`.