}

            int i = QUALIFIERS.indexOf(qualifier);

            // Just returning an Integer with the index here is faster, but requires a lot of if/then/else to check for
            // -1
            //  or QUALIFIERS.size and then resort to lexical ordering. Most comparisons are decided by the first
            // character,

            // Validate that security buffer doesn't exceed available data
            if (hdrStart + securityBufferOffset < hdrStart || // Check for integer overflow
                    hdrStart + securityBufferOffset + securityBufferLength < 0 || // Check for integer overflow
                    hdrStart + securityBufferOffset + securityBufferLength > buffer.length) {

But when checking benchmarks and comparisons you should keep the following in mind.

## Benchmarks and speed { #benchmarks-and-speed }

When you check the benchmarks, it is common to see several tools of different types compared as equivalent.

Specifically, to see Uvicorn, Starlette and FastAPI compared together (among many other tools).

	# Wait for Status: in MinIO output
	while true; do
		rv=$(check_online)
		if [ "$rv" != "1" ]; then
			# success
			break
		fi

		# Check if we should retry
		retry=$((retry + 1))
		if [ $retry -le 20 ]; then
			sleep 5
			continue
		fi

		# Failure
		fail
	done

	if ! ps -p $pid1 1>&2 >/dev/null; then

     *
     * @return the compression flags
     */
    public int getFlags() {
        return this.flags;
    }

    /**
     * Checks if a specific compression algorithm is supported.
     *
     * @param algorithm the algorithm to check
     * @return true if the algorithm is supported
     */
    public boolean supportsAlgorithm(int algorithm) {
        if (this.compressionAlgorithms == null) {

        // Execute
        indexUpdateCallback.store(paramMap, dataMap);

        // Verify
        assertEquals(1, indexUpdateCallback.getDocumentSize());
        // Check if fields were added (they should be added by the store method)
        assertNotNull("ID should be set", dataMap.get("id"));
        assertNotNull("Doc ID should be set", dataMap.get("doc_id"));

	// is obviously garbage (Unix time == 0), then ignore modtimes
	// and don't process the If-Modified-Since header.
	if objInfo.ModTime.IsZero() || objInfo.ModTime.Equal(time.Unix(0, 0)) {
		return false
	}

	// Check if the part number is correct.
	if opts.PartNumber > 1 {
		partFound := false
		for _, pi := range objInfo.Parts {
			if pi.Number == opts.PartNumber {
				partFound = true
				break
			}
		}

Then, when it's your turn, you do actual "productive" work, you process the menu, decide what you want, get your crush's choice, pay, check that you give the correct bill or card, check that you are charged correctly, check that the order has the correct items, etc.

			// distribution order.
			inconsistent++
			continue
		}
		if !meta.IsValid() {
			inconsistent++
			continue
		}
		if meta.XLV1 != fi.XLV1 {
			inconsistent++
			continue
		}
		// check if erasure distribution order matches the index
		// position if this is not correct we discard the disk
		// and move to collect others
		if distribution[i] != meta.Erasure.Index {

  for (i in namesAndValues.indices) {
    require(namesAndValues[i] != null) { "Headers cannot be null" }
    namesAndValues[i] = inputNamesAndValues[i].trim()
  }

  // Check for malformed headers.
  for (i in namesAndValues.indices step 2) {
    val name = namesAndValues[i]
    val value = namesAndValues[i + 1]
    headersCheckName(name)
    headersCheckValue(value, name)
  }