// In this case, parity == 0 implies that this object version is a
			// delete marker
			readQuorum = N/2 + 1
		}
		if occ < readQuorum {
			// Ignore this parity since we don't have enough shards for read quorum
			continue
		}

		if occ > maxOcc {
			maxOcc = occ
			cparity = parity
		}
	}

	if maxOcc == 0 {
		// Did not found anything useful
		return -1
	}

labels.searchlog_usersessionid=Benutzer-ID
labels.searchlog_requestedtime=Zeitpunkt
labels.searchlog_accesstype=Zugriffsart
labels.maintenance_title_configuration=Wartung
labels.number_of_shards_for_doc=Anzahl der Shards
labels.auto_expand_replicas_for_doc=Replicas automatisch erweitern
labels.clear_crawler_index=Crawler-Indizes
labels.clear_crawler_index_button=Crawler-Indizes leeren
labels.diagnostic_logs=Diagnose

labels.searchlog_usersessionid=User ID
labels.searchlog_requestedtime=Time
labels.searchlog_accesstype=Access Type
labels.maintenance_title_configuration=Maintenance
labels.number_of_shards_for_doc=The number of shards
labels.auto_expand_replicas_for_doc=Auto expand replicas
labels.clear_crawler_index=Crawler Indices
labels.clear_crawler_index_button=Clear Crawler Indices
labels.diagnostic_logs=Diagnostic

labels.searchlog_usersessionid=User ID
labels.searchlog_requestedtime=Time
labels.searchlog_accesstype=Access Type
labels.maintenance_title_configuration=Maintenance
labels.number_of_shards_for_doc=The number of shards
labels.auto_expand_replicas_for_doc=Auto expand replicas
labels.clear_crawler_index=Crawler Indices
labels.clear_crawler_index_button=Clear Crawler Indices
labels.diagnostic_logs=Diagnostic

labels.searchlog_usersessionid=User ID
labels.searchlog_requestedtime=Time
labels.searchlog_accesstype=Access Type
labels.maintenance_title_configuration=Maintenance
labels.number_of_shards_for_doc=The number of shards
labels.auto_expand_replicas_for_doc=Auto expand replicas
labels.clear_crawler_index=Crawler Indices
labels.clear_crawler_index_button=Clear Crawler Indices
labels.diagnostic_logs=Diagnostic

labels.searchlog_usersessionid=User ID
labels.searchlog_requestedtime=Time
labels.searchlog_accesstype=Access Type
labels.maintenance_title_configuration=Maintenance
labels.number_of_shards_for_doc=The number of shards
labels.auto_expand_replicas_for_doc=Auto expand replicas
labels.clear_crawler_index=Crawler Indices
labels.clear_crawler_index_button=Clear Crawler Indices
labels.diagnostic_logs=Diagnostic

	// To avoid these problems we must split the work at scale. With 1000 node
	// setup becoming a reality we must try to shard the work properly such as
	// pick 10 nodes that precisely can send those 100 requests the first node
	// in the 10 node shard would coordinate between other 9 shards to get the
	// rest of the `99*9` requests.
	//
	// This essentially splits the workload properly and also allows for network

// upon return or (b) locking is irrelevant.

// StartFunction begins the process of handling a request.  If the
// request gets queued then this function uses the given hashValue as
// the source of entropy as it shuffle-shards the request into a
// queue.  The descr1 and descr2 values play no role in the logic but
// appear in log messages.  This method does not return until the
// queuing, if any, for this request is done.  If `execute` is false

 *
 * @author Kevin Bourrillion
 * @since 1.0
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault
public final class Chars {
  private Chars() {}

  /**
   * The number of bytes required to represent a primitive {@code char} value.
   *
   * <p><b>Java 8+ users:</b> use {@link Character#BYTES} instead.
   */

 *
 * @author Kevin Bourrillion
 * @since 1.0
 */
@GwtCompatible(emulated = true)
@ElementTypesAreNonnullByDefault
public final class Chars {
  private Chars() {}

  /**
   * The number of bytes required to represent a primitive {@code char} value.
   *
   * <p><b>Java 8+ users:</b> use {@link Character#BYTES} instead.
   */