licensed material, or material used under an exception or
     limitation to copyright. More considerations for licensors:
	wiki.creativecommons.org/Considerations_for_licensors

     Considerations for the public: By using one of our public
     licenses, a licensor grants the public permission to use the
     licensed material under specified terms and conditions. If
     the licensor's permission is not necessary for any reason--for

	isReadLock := false
	return dm.lockBlocking(ctx, cancel, id, source, isReadLock, opts)
}

// RLock holds a read lock on dm.
//
// If one or more read locks are already in use, it will grant another lock.
// Otherwise the calling go routine blocks until the mutex is available.
func (dm *DRWMutex) RLock(id, source string) {
	isReadLock := true

				t.Fatalf("n = %d: unexpected error on ReadByte: %v", n, err)
			}
			if b != data[i] {
				t.Fatalf("n = %d: incorrect byte returned from ReadByte: got %q, want %q", n, b, data[i])
			}
		}
		// Unread one byte if there is one.
		if n > 0 {
			if err := r.UnreadByte(); err != nil {
				t.Errorf("n = %d: unexpected error on UnreadByte: %v", n, err)
			}
		}
		// Test that we cannot unread any further.

    return new AndPredicate<>(Predicates.<T>asList(checkNotNull(first), checkNotNull(second)));
  }

  /**
   * Returns a predicate that evaluates to {@code true} if any one of its components evaluates to
   * {@code true}. The components are evaluated in order, and evaluation will be "short-circuited"
   * as soon as a true predicate is found. It defensively copies the iterable passed in, so future

			return n, nil
		}
		if b.err != nil {
			return n - remain, b.readErr()
		}
	}
}

// Read reads data into p.
// It returns the number of bytes read into p.
// The bytes are taken from at most one Read on the underlying [Reader],
// hence n may be less than len(p).
// To read exactly len(p) bytes, use io.ReadFull(b, p).
// If the underlying [Reader] can return a non-zero count with io.EOF,

Bµ~mFïpsve^Õ¹e]Z_o‘þÎûhq|Õ´z@÷^¤ªÜqŠVUoÙ¦ ah ¨µ$ Õ¢riHŽÕwtR}ZNiìˆjãTIUe{cG´^þœ„:7 ä†6ñ¤fwNZñM¾ ap Yl [cDfŽÐmPSqszïZB uBU~ãÛÏ Ÿ¥_ wyEˆŠ{MТli{Mô ðÏö {U\»¦ ªtexïcBkLys] `Jss¸V^ï¢`iÕN¼ +ºNm®ÜPK¢i}`ZãSlïv¾{}]òM¢@v}¼nÐ}Hiyò úÀ YNÜÉÑÐ <Þ¥V ons£zxA4¢x¯DŽ1ÅÒü ØÑüÁ./De|·` w·„Ó&Úøc²\{{^¸ ¯¦v^¯Ž#¾GÜ°~—_TÜŸ~KLãl²x{Žb©tùZyh {n¢X`e¨åá4V S, Ä*^ì» qay‘ øÔ¿Uc²xrA¢riîrkQ{òo¾ kukkòDK ^i¸HqòˆG¢YPqtìKjñTOª i~ uqrrIÊ Tª÷go +œ^Ø+FyppkRñZq cj ? WiPPIpÕˆ}ÖO¾BGÕî õÿ¯ˆol La‚¬}G\ZI¸tõ\u|ñÊíaxt:atD²CPù@A V]¥r² Ñ»>Lq]ò¦tuy^C^ï[ª...

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *

  public void testExplicit_withDuplicates() {
    assertThrows(IllegalArgumentException.class, () -> Ordering.explicit(1, 2, 3, 4, 2));
  }

  // A more limited test than the one that follows, but this one uses the
  // actual public API.
  @J2ktIncompatible // Ordering.arbitrary
  public void testArbitrary_withoutCollisions() {
    List<Object> list = new ArrayList<>();
    for (int i = 0; i < 50; i++) {

  public void testExplicit_withDuplicates() {
    assertThrows(IllegalArgumentException.class, () -> Ordering.explicit(1, 2, 3, 4, 2));
  }

  // A more limited test than the one that follows, but this one uses the
  // actual public API.
  @J2ktIncompatible // Ordering.arbitrary
  public void testArbitrary_withoutCollisions() {
    List<Object> list = new ArrayList<>();
    for (int i = 0; i < 50; i++) {

		lockerEpSet := set.NewStringSet()
		for j := range setDriveCount {
			wg.Add(1)
			go func(i int, endpoint Endpoint) {
				defer wg.Done()

				lk.Lock()
				// Only add lockers only one per endpoint and per erasure set.
				if locker, ok := erasureLockers[endpoint.Host]; ok && !lockerEpSet.Contains(endpoint.Host) {
					lockerEpSet.Add(endpoint.Host)
					s.erasureLockers[i] = append(s.erasureLockers[i], locker)