1 /*
2 * #%L
3 * prolobjectlink-jpi
4 * %%
5 * Copyright (C) 2019 Prolobjectlink Project
6 * %%
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
13 *
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
20 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
23 * THE SOFTWARE.
24 * #L%
25 */
26 package io.github.prolobjectlink.prolog;
27
28 import java.util.Iterator;
29 import java.util.NoSuchElementException;
30
31 /**
32 * Iterator implementation over array of elements.
33 *
34 * @param <E> Generic Element Type
35 * @author Jose Zalacain
36 * @since 1.0
37 */
38 public class ArrayIterator<E> extends AbstractIterator<E> implements Iterator<E> {
39
40 private int next = 0;
41 private final int size;
42 private final E[] elements;
43
44 /**
45 * Create an instance of {@link ArrayIterator} to iterate over given array of
46 * elements
47 *
48 * @param elements array of elements to be iterated
49 * @since 1.0
50 */
51 public ArrayIterator(E[] elements) {
52 this.size = elements.length;
53 this.elements = elements;
54 }
55
56 public boolean hasNext() {
57 return next != size;
58 }
59
60 public E next() {
61 if (next >= size) {
62 throw new NoSuchElementException();
63 }
64 return elements[next++];
65 }
66
67 }