var ErrAlreadyLocked = errors.New("file already locked")

// RLockedFile represents a read locked file, implements a special
// closer which only closes the associated *os.File when the ref count.
// has reached zero, i.e when all the readers have given up their locks.
type RLockedFile struct {
	*LockedFile
	mutex sync.Mutex
	refs  int // Holds read lock refs.
}

# limitations under the License.
# ==============================================================================
source "${BASH_SOURCE%/*}/utilities/setup.sh"

# Record GPU count and CUDA version status
if [[ "$TFCI_NVIDIA_SMI_ENABLE" == 1 ]]; then
  tfrun nvidia-smi
fi

# Update the version numbers for Nightly only
if [[ "$TFCI_NIGHTLY_UPDATE_VERSION_ENABLE" == 1 ]]; then
  python_bin=python3

 *
 * <ul>
 *   <li><b>Total nodes:</b> 65535 (16-bit index in the trie)
 *   <li><b>String pool size:</b> 65535 characters (16-bit offset in the String Pool)
 *   <li><b>Max children per node:</b> 2047 (11-bit count in the bitfield)
 * </ul>
 *
 * <p>As of Jan 2026, the capacity usage is approximately:
 *
 * <ul>
 *   <li>Total nodes: ~16% (10k / 65k)
 *   <li>String pool size: ~79% (52k / 65k)

        securityDescriptorBytes[22] = 8; // ACL size (low byte)
        securityDescriptorBytes[23] = 0; // ACL size (high byte)
        securityDescriptorBytes[24] = 0; // ACE count (low byte) - 0 ACEs
        securityDescriptorBytes[25] = 0; // ACE count (high byte)
        securityDescriptorBytes[26] = 0; // sbz2 (low byte)
        securityDescriptorBytes[27] = 0; // sbz2 (high byte)

    ImmutableIntArray.of().forEach(i -> fail());
    ImmutableIntArray.of(0, 1, 3).subArray(1, 1).forEach(i -> fail());

    AtomicInteger count = new AtomicInteger(0);
    ImmutableIntArray.of(0, 1, 2, 3).forEach(i -> assertThat(i).isEqualTo(count.getAndIncrement()));
    assertThat(count.get()).isEqualTo(4);
  }

  public void testStream() {
    ImmutableIntArray.of().stream().forEach(i -> fail());

    assertThrows(NullPointerException.class, () -> ImmutableSortedMultiset.copyOf(iterator));
  }

  private static class CountingIterable implements Iterable<String> {
    int count = 0;

    @Override
    public Iterator<String> iterator() {
      count++;
      return asList("a", "b", "a").iterator();
    }
  }

  public void testCopyOf_plainIterable() {
    CountingIterable iterable = new CountingIterable();

// been checked previously in the stack) and you want to extract values from
// it.
func ParseUnverifiedStandardClaims(token []byte, claims *StandardClaims, buf []byte) (*SigningMethodHMAC, error) {
	if bytes.Count(token, []byte(".")) != 2 {
		return nil, jwtgo.ErrSignatureInvalid
	}

	i := bytes.IndexByte(token, '.')
	j := bytes.LastIndexByte(token, '.')

	n, err := base64DecodeBytes(token[:i], buf)
	if err != nil {

            return parent.subList(fromIndex, toIndex);
        }

        /**
         * Returns the total number of records across all pages.
         *
         * @return the total record count
         */
        public int getAllRecordCount() {
            return allRecordCount;
        }

        /**
         * Returns the page size (number of records per page).
         *

            assertTrue(url.contains("failure"), "URL should contain 'failure'");
        }

        logger.info("[END] testSearchByUrl");
    }

    /**
     * Test: Search failure URL logs by error count range
     */
    private void testSearchByErrorCount() {
        logger.info("[BEGIN] testSearchByErrorCount");

        final Map<String, Object> searchBody = new HashMap<>();

    // Put a floor on the keep alive duration, otherwise cleanup will spin loop.
    require(keepAliveDuration > 0L) { "keepAliveDuration <= 0: $keepAliveDuration" }
  }

  fun idleConnectionCount(): Int =
    connections.count {
      it.withLock { it.calls.isEmpty() }
    }

  fun connectionCount(): Int = connections.size

  /**
   * Attempts to acquire a recycled connection to [address] for [call]. Returns the connection if it