labels.searchlog_requestedtime=Tijd
labels.searchlog_accesstype=Toegangstype
labels.maintenance_title_configuration=Onderhoud
labels.number_of_shards_for_doc=Aantal shards
labels.auto_expand_replicas_for_doc=Maximaal aantal replica's
labels.clear_crawler_index=Crawler-index
labels.clear_crawler_index_button=Crawler-index verwijderen
labels.diagnostic_logs=Diagnostiek
labels.download_diagnostic_logs_button=Logboeken downloaden

labels.searchlog_requestedtime=Zeit
labels.searchlog_accesstype=Zugriffstyp
labels.maintenance_title_configuration=Wartung
labels.number_of_shards_for_doc=Anzahl der Shards
labels.auto_expand_replicas_for_doc=Replikate automatisch erweitern
labels.clear_crawler_index=Crawler-Index
labels.clear_crawler_index_button=Crawler-Index löschen
labels.diagnostic_logs=Diagnose
labels.download_diagnostic_logs_button=Protokolle herunterladen

   * longer strings. It could have been one or the other throughout. The main advantage of the
   * combination is that CityHash has a bunch of special cases for short strings that don't need to
   * be replicated here. The result will never be 0 or 1.
   *
   * <p>This function is best understood as a <a
   * href="https://en.wikipedia.org/wiki/Fingerprint_(computing)">fingerprint</a> rather than a true

        Map<String, Object> doc2 = new HashMap<>();
        doc2.put("title", "Doc2");
        documentList.add(doc1);
        documentList.add(doc2);
        documentList.add(doc1); // duplicate

        QueryResponseList qrList = new QueryResponseList(documentList, 0, 10, 0);

        assertEquals(0, qrList.indexOf(doc1));
        assertEquals(1, qrList.indexOf(doc2));

	f := strings.Join(w.scope, ", ") + ", " + fmt.Sprintf(format, args...)
	if strings.Contains(f, "\n") {
		panic("feature contains newlines: " + f)
	}

	if _, dup := w.features[f]; dup {
		panic("duplicate feature inserted: " + f)
	}
	w.features[f] = true

	if verbose {
		log.Printf("feature: %s", f)
	}
}

func needApproval(filename string) bool {
	name := filepath.Base(filename)

/// tip | Dica

Não se preocupe se alguns desses itens sobre **contêineres**, Docker ou Kubernetes ainda não fizerem muito sentido.

   *
   * <p>Collections with weak, soft, or phantom references are not supported. Each call to {@code
   * createCollection} should create a new instance.
   *
   * <p>The returned collection class determines whether duplicate key-value pairs are allowed.
   *
   * @return an empty collection of values
   */
  abstract Collection<V> createCollection();

  /**

			switch op {
			case madmin.CredentialsUpdateType:
				if !globalSiteReplicationSys.isEnabled() {
					// credentials update is possible only in bucket replication. User will never
					// know the site replicator creds.
					tgt.Credentials = target.Credentials
					tgt.TargetBucket = target.TargetBucket
					tgt.Secure = target.Secure
					tgt.Endpoint = target.Endpoint
				}
			case madmin.SyncUpdateType:

}

// Metadata metadata items implemented to ensure XML marshaling works.
type Metadata struct {
	Items []struct {
		Key   string
		Value string
	}
}

// Set add items, duplicate items get replaced.
func (s *Metadata) Set(k, v string) {
	for i, item := range s.Items {
		if item.Key == k {
			s.Items[i] = struct {
				Key   string
				Value string
			}{
				Key:   k,

Y luego puedes establecer esos mismos límites de memoria y requisitos en tus configuraciones para tu sistema de gestión de contenedores (por ejemplo, en **Kubernetes**). De esa manera, podrá **replicar los contenedores** en las **máquinas disponibles** teniendo en cuenta la cantidad de memoria necesaria por ellos, y la cantidad disponible en las máquinas en el cluster.