Iterator<String> cycle = Iterators.cycle(iterable);
    assertTrue(cycle.hasNext());
    assertThat(cycle.next()).isEqualTo("a");
    cycle.remove();
    assertEquals(emptyList(), iterable);
    assertFalse(cycle.hasNext());
  }

  public void testCycleOfTwo() {
    Iterator<String> cycle = Iterators.cycle("a", "b");
    for (int i = 0; i < 3; i++) {
      assertTrue(cycle.hasNext());

    Iterator<String> cycle = Iterators.cycle(iterable);
    assertTrue(cycle.hasNext());
    assertThat(cycle.next()).isEqualTo("a");
    cycle.remove();
    assertEquals(emptyList(), iterable);
    assertFalse(cycle.hasNext());
  }

  public void testCycleOfTwo() {
    Iterator<String> cycle = Iterators.cycle("a", "b");
    for (int i = 0; i < 3; i++) {
      assertTrue(cycle.hasNext());

  // Graph query methods

  /**
   * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
   * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
   * and ending with the same node.
   *
   * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
   */
  public static <N> boolean hasCycle(Graph<N> graph) {

 *       verified or created.
 *   <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed
 *       to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new
 *       "safe" edge is created.
 *   <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential
 *       deadlock situation, and the appropriate Policy is executed.
 * </ul>
 *

    // always point to "a".
    assertThat(cycle.iterator().next()).isEqualTo("a");
  }

  public void testCycle_emptyIterable() {
    FluentIterable<Integer> cycle = FluentIterable.<Integer>of().cycle();
    assertFalse(cycle.iterator().hasNext());
  }

  public void testCycle_removingAllElementsStopsCycle() {
    FluentIterable<Integer> cycle = fluent(1, 2).cycle();
    Iterator<Integer> iterator = cycle.iterator();

Y compris comment gérer l'état de cycle de vie qui peut être utilisé dans d'autres parties de votre code.

///

## Sous-applications { #sub-applications }

	SD	X5, 4(X6)				// 23325300

	// 7.1: CSR Instructions
	CSRRC	X0, CYCLE, X5				// f33200c0
	CSRRC	X0, CYCLE, X0				// 733000c0
	CSRRC	X10, CYCLE, X5				// f33205c0
	CSRRC	$2, TIME, X5				// f37211c0
	CSRRCI	$2, TIME, X5				// f37211c0
	CSRRS	X0, CYCLE, X5				// f32200c0
	CSRRS	X0, CYCLE, X0				// 732000c0
	CSRRS	X10, CYCLE, X5				// f32205c0
	CSRRS	$2, TIME, X5				// f36211c0
	CSRRS	X0, VLENB, X5				// f32220c2

// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

TEXT errors(SB),$0
	CSRRC	(X10), CYCLE, X5		// ERROR "integer register or immediate expected for 1st operand"
	CSRRC	X0, TU, X5			// ERROR "unknown CSR"
	CSRRC	X0, CYCLE			// ERROR "missing CSR name"
	CSRRC	X0, CYCLE, (X10)		// ERROR "needs an integer register output"
	CSRRC	$-1, TIME, X15			// ERROR "immediate out of range 0 to 31"

   * elements.
   *
   * <p>To cycle over the iterable {@code n} times, use the following: {@code
   * Iterables.concat(Collections.nCopies(n, iterable))}
   *
   * <p><b>Java 8+ users:</b> The {@code Stream} equivalent of this method is {@code
   * Stream.generate(() -> iterable).flatMap(Streams::stream)}.
   */
  public static <T extends @Nullable Object> Iterable<T> cycle(Iterable<T> iterable) {
    checkNotNull(iterable);

  }

  public void testConcat_infiniteIterable() throws IOException {
    CharSource source = CharSource.wrap("abcd");
    Iterable<CharSource> cycle = Iterables.cycle(ImmutableList.of(source));
    CharSource concatenated = CharSource.concat(cycle);

    String expected = "abcdabcd";

    // read the first 8 chars manually, since there's no equivalent to ByteSource.slice