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

  /**
   * Returns a live view of all nodes in this graph 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 graph, this is equivalent to {@link #adjacentNodes(Object)}.
   *

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

  /**
   * Returns a live view of all nodes in this graph 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 graph, this is equivalent to {@link #adjacentNodes(Object)}.
   *

	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

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

  /**
   * Returns a live view of all nodes in this graph 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 graph, this is equivalent to {@link #adjacentNodes(Object)}.
   *

                if (is == null) {
                    throw new IOException("Resource not found: non/existent/resource.json");
                }
                // This line should not be reached
                new String(is.readAllBytes(), StandardCharsets.UTF_8);
                fail("Should throw IOException for missing resource");
            }
        } catch (IOException e) {

					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

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
```

    CacheTesting.checkValidState(cache);
  }

  /**
   * With an unlimited-size cache with maxWeight of 0, entries weighing 0 should still be cached.
   * Entries with positive weight should not be cached (nor dump existing cache).
   */
  public void testEviction_maxWeight_zero() {
    CountingRemovalListener<Integer, Integer> removalListener = countingRemovalListener();

        // 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));
    }

        jcifs.SID mockSid1 = mock(jcifs.SID.class);
        jcifs.SID mockSid2 = mock(jcifs.SID.class);
        when(mockSid1.unwrap(sid_t.class)).thenReturn(mockSidT);
        // Don't stub mockSid2 since it won't be reached due to NPE on null element
        testSids = new jcifs.SID[] { mockSid1, null, mockSid2 };

        // Act & Assert - This should throw an exception when LsarSidArrayX tries to process null