Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to You under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
An java.util.Iterator that iterates in a random order over a given sequence of elements. It is non-destructive.
public final class PermutingIterator<T> implements Iterator<T> {
  private final T[] elements;
  private final int[] permutation;
  private int offset;
  public PermutingIterator(T[] elements) {
    this. = elements;
    this. = new int[elements.length];
     = 0;
  private void buildPermutation() {
    int length = .;
    for (int i = 0; i < lengthi++) {
      [i] = i;
    Random r = RandomUtils.getRandom();
    for (int i = 0; i < length - 1; i++) {
      int swapWith = i + r.nextInt(length - i);
      if (i != swapWith) {
        int temp = [i];
        [i] = [swapWith];
        [swapWith] = temp;
  public boolean hasNext() {
    return  < .;
  public T next() {
    if ( >= .) {
      throw new NoSuchElementException();
    return [[++]];

  public void remove() {
    throw new UnsupportedOperationException();
New to GrepCode? Check out our FAQ X