state.incrementRetry(); // Retry 2
        assertTrue(state.shouldRetry());

        state.incrementRetry(); // Retry 3
        assertFalse(state.shouldRetry()); // Max retries reached
    }

    @Test
    void testFailoverStateBackoff() {
        ChannelFailover.FailoverState state = new ChannelFailover.FailoverState("test-channel");

        long firstRetry = state.getNextRetryTime();

        return inputStream.markSupported();
    }

    /**
     * Reads the next byte of data from the input stream.
     *
     * @return the next byte of data, or -1 if the end of the stream is reached
     * @throws IOException if an I/O error occurs
     */
    @Override
    public int read() throws IOException {
        return inputStream.read();
    }

    /**

	LastFailedCount uint64 `json:"failedCount_last5min"`
	// Count of unreplicated entries that were dropped after MRF retry limit reached since cluster start.
	TotalDroppedCount uint64 `json:"droppedCount_since_uptime"`
	// Bytes of unreplicated entries that were dropped after MRF retry limit reached since cluster start.
	TotalDroppedBytes uint64 `json:"droppedBytes_since_uptime"`
}

// SMA struct for calculating simple moving average

	onComma := func(data []byte, atEOF bool) (advance int, token []byte, err error) {
		i := bytes.IndexByte(data, ',')
		if i == -1 {
			if !atEOF {
				return 0, nil, nil
			}
			// If we have reached the end, return the last token.
			return 0, data, bufio.ErrFinalToken
		}
		// If the token is "STOP", stop the scanning and ignore the rest.
		if string(data[:i]) == "STOP" {
			return i + 1, nil, bufio.ErrFinalToken

					throughputHighestGet = totalGet
				}
				sendResult()
				break
			}

			// We break if we did not see 2.5% growth rate in total GET
			// requests, we have reached our peak at this point.
			doBreak := float64(totalGet-throughputHighestGet)/float64(totalGet) < 0.025

			throughputHighestGet = totalGet
			throughputHighestResults = results
			throughputHighestPut = totalPut

        break;
      }
    }
    return processor.getResult();
  }

  /**
   * Reads and discards data from the given {@code Readable} until the end of the stream is reached.
   * Returns the total number of chars read. Does not close the stream.
   *
   * @since 20.0
   */
  @CanIgnoreReturnValue
  public static long exhaust(Readable readable) throws IOException {

        if (cleaned == 2) {
            assertNull(entry1);
            assertNull(leaseManager.getLease(key2));
        }
    }

    @Test
    @DisplayName("Should evict oldest leases when max limit reached")
    void testMaxLeaseEviction() throws InterruptedException {
        // Create a context with low max lease limit
        Configuration limitedConfig = mock(Configuration.class);

arcfour
aes128-cbc
3des-cbc
```

`--sftp=mac-algos=...` specifies a default set of MAC algorithms in preference order.
This is based on RFC 4253, section 6.4, but with hmac-md5 variants removed because they have 
reached the end of their useful life.

Valid values: 

```
******@****.***
******@****.***
hmac-sha2-256
hmac-sha2-512
hmac-sha1
hmac-sha1-96
```

   */
  Set<N> adjacentNodes(N node);

  /**
   * Returns a live view of all nodes in this network adjacent to {@code node} which can be reached
   * by traversing {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge.
   *
   * <p>In an undirected network, this is equivalent to {@link #adjacentNodes(Object)}.
   *

        // When/Then - Should retry for attempts 1 and 2
        assertTrue(exception.shouldRetry(1));
        assertTrue(exception.shouldRetry(2));
        assertFalse(exception.shouldRetry(3)); // Max attempts reached

        // Verify exponential backoff
        assertEquals(1000, exception.getRetryDelayMs(1));
        assertEquals(2000, exception.getRetryDelayMs(2));
        assertEquals(4000, exception.getRetryDelayMs(3));
    }