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

   * use {@code Stream.generate(() -> collection).flatMap(Collection::stream)}.
   */
  public final FluentIterable<E> cycle() {
    return from(Iterables.cycle(getDelegate()));
  }

  /**
   * Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable,

   * use {@code Stream.generate(() -> collection).flatMap(Collection::stream)}.
   */
  public final FluentIterable<E> cycle() {
    return from(Iterables.cycle(getDelegate()));
  }

  /**
   * Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable,

          }

          @Override
          public void remove() {
            listIter.remove();
          }
        };
  }

  static <T extends @Nullable Object> Iterator<T> cycle(Iterable<T> iterable) {
    return new Iterator<T>() {
      Iterator<T> iterator = Collections.<T>emptySet().iterator();

      @Override
      public boolean hasNext() {
        return true;
      }

          }

          @Override
          public void remove() {
            listIter.remove();
          }
        };
  }

  static <T extends @Nullable Object> Iterator<T> cycle(Iterable<T> iterable) {
    return new Iterator<T>() {
      Iterator<T> iterator = Collections.<T>emptySet().iterator();

      @Override
      public boolean hasNext() {
        return true;
      }

log.notification.search.size=1000
# Maximum number of events to buffer in memory.
log.notification.buffer.size=1000
# Interval (seconds) for the notification job cycle, used in notification messages.

    // one should still pass (testVerifyGetsCalled()).
    stimuli = (Stimulus<E, ? super I>[]) new Stimulus<?, ?>[steps];
    checkArgument(elementsToInsertIterable.iterator().hasNext());
    elementsToInsert = Helpers.cycle(elementsToInsertIterable);
    this.features = copyToSet(features);
    this.expectedElements = copyToList(expectedElements);
    this.knownOrder = knownOrder;
    this.startIndex = startIndex;
  }

  /**

    // one should still pass (testVerifyGetsCalled()).
    stimuli = (Stimulus<E, ? super I>[]) new Stimulus<?, ?>[steps];
    checkArgument(elementsToInsertIterable.iterator().hasNext());
    elementsToInsert = Helpers.cycle(elementsToInsertIterable);
    this.features = copyToSet(features);
    this.expectedElements = copyToList(expectedElements);
    this.knownOrder = knownOrder;
    this.startIndex = startIndex;
  }

  /**

labels.eol_error=Le système que vous utilisez n'est plus pris en charge. Veuillez vous référer à la page du cycle de vie du support produit et effectuer une mise à niveau.
labels.tooltip_search_view=Écran de recherche
labels.tooltip_run_crawler=Exécuter le robot d'exploration
labels.tooltip_forum=Forum
labels.tooltip_onlinehelp=Aide

    /**
     * Get the value for the key 'log.notification.interval'. <br>
     * The value is, e.g. 300 <br>
     * comment: Interval (seconds) for the notification job cycle, used in notification messages.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */
    String getLogNotificationInterval();

    /**