// Tolerance is not set, defaults to half of the locker clients.
	tolerance := len(restClnts) / 2

	// Quorum is effectively = total clients subtracted with tolerance limit
	quorum := len(restClnts) - tolerance
	if !isReadLock {
		// In situations for write locks, as a special case
		// to avoid split brains we make sure to acquire
		// quorum + 1 when tolerance is exactly half of the
		// total locker clients.

  private final long k1;

  /**
   * @param c the number of compression rounds (must be positive)
   * @param d the number of finalization rounds (must be positive)
   * @param k0 the first half of the key
   * @param k1 the second half of the key
   */
  SipHashFunction(int c, int d, long k0, long k1) {
    checkArgument(
        c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.suggest.normalizer;

/**
 * Normalizes full-width alphanumeric characters to half-width alphanumeric characters.
 */
public class FullWidthToHalfWidthAlphabetNormalizer implements Normalizer {
    /**
     * Constructs a new {@link FullWidthToHalfWidthAlphabetNormalizer}.
     */

MinIO protects data against hardware failures and silent data corruption using erasure code and checksums. With the highest level of redundancy, you may lose up to half (N/2) of the total drives and still be able to recover the data.

## What is Erasure Code?

            circuitBreaker.executeWithCircuitBreaker(() -> {
                assertEquals(State.HALF_OPEN, circuitBreaker.getState(), "Should be in HALF_OPEN state");
                throw new RuntimeException("Failure in half-open");
            });
            fail("Should have thrown exception");
        } catch (CIFSException e) {
            // Expected
        }

      return entry.value;
    }
    entry = cacheEntry2;
    if (entry != null && entry.key == key) {
      // Promote second cache entry to first so the access pattern
      // [K1, K2, K1, K3, K1, K4...] still hits the cache half the time.
      addToCache(entry);
      return entry.value;
    }
    return null;
  }

  @Override
  void clearCache() {
    super.clearCache();
    cacheEntry1 = null;
    cacheEntry2 = null;
  }

     * Creates a simple circuit breaker
     *
     * @param name the circuit breaker name
     * @param failureThreshold number of consecutive failures to open circuit
     * @param successThreshold number of successes in half-open to close circuit
     * @param timeoutMillis timeout before attempting to close open circuit
     */
    public SimpleCircuitBreaker(String name, int failureThreshold, int successThreshold, long timeoutMillis) {

  }

  private static long random() {
    return randomSource.nextLong();
  }

  // A random value that cannot be 0 and that is unsigned-less-than or equal
  // to the given dividend, so that we don't have half of our divisions being
  // trivial because the divisor is bigger than the dividend.
  // Using remainder here does not give us a uniform distribution but it should
  // not have a big impact on the measurement.

clock in a twinkling!  Half-past one, time for dinner!'

  (`I only wish it was,' the March Hare said to itself in a
whisper.)

  `That would be grand, certainly,' said Alice thoughtfully:
`but then--I shouldn't be hungry for it, you know.'

  `Not at first, perhaps,' said the Hatter:  `but you could keep
it to half-past one as long as you liked.'

        for (String result : results) {
            assertEquals(result, result.toLowerCase());
        }
    }

    public void test_convertHalfWidth() {
        // Test that full-width characters are converted to half-width
        List<String> results = converter.convert("アイウ", null);
        for (String result : results) {
            assertFalse(result.contains("Ａ")); // Full-width A