All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.cactoos.list.JoinedListIterator Maven / Gradle / Ivy

There is a newer version: 0.56.1
Show newest version
/*
 * The MIT License (MIT)
 *
 * Copyright (c) 2017-2022 Yegor Bugayenko
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included
 * in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
package org.cactoos.list;

import java.util.Collections;
import java.util.List;
import java.util.ListIterator;
import java.util.NoSuchElementException;
import java.util.concurrent.atomic.AtomicInteger;

/**
 * A few {@link ListIterator} joined together.
 *
 * 

There is no thread-safety guarantee. * * @param Items type * @since 1.0.0 * @todo #1254:30min We should implement mutable operations (#add, #set and #remove) * according to their javadoc. Also, the behaviour of adding/setting/removing an element * when the cursor is in between two listerators should be well documented in this * class (because there are multiple options in that case). */ @SuppressWarnings("PMD.TooManyMethods") public final class JoinedListIterator implements ListIterator { /** * {@link List} of {@link ListIterator}. */ private final List> listiters; /** * Cursor of the {@link List} of {@link ListIterator}. */ private final AtomicInteger cursorlit; /** * Cursor of {@link ListIterator}. */ private final AtomicInteger cursor; /** * Ctor. * @param items Items to concatenate */ @SafeVarargs public JoinedListIterator(final ListIterator... items) { this(new ListOf<>(items)); } /** * Ctor. * @param item First item * @param items ListIterator */ @SuppressWarnings("unchecked") public JoinedListIterator(final T item, final ListIterator items) { this(new ListOf<>(new ListOf<>(item).listIterator(), items)); } /** * Ctor. * @param items ListIterators * @param item End item */ @SuppressWarnings("unchecked") public JoinedListIterator(final ListIterator items, final T item) { this(new ListOf<>(items, new ListOf<>(item).listIterator())); } /** * Ctor. * @param items Items to concatenate */ public JoinedListIterator(final List> items) { this.listiters = items; this.cursorlit = new AtomicInteger(-1); this.cursor = new AtomicInteger(-1); } @Override public boolean hasNext() { while (!this.currentListIterator().hasNext() && this.listHasNextElt()) { this.cursorlit.getAndIncrement(); } return this.currentListIterator().hasNext(); } @Override public T next() { if (!this.hasNext()) { throw new NoSuchElementException(); } final T next = this.currentListIterator().next(); this.cursor.getAndIncrement(); return next; } @Override public boolean hasPrevious() { while (!this.currentListIterator().hasPrevious() && this.listHasPreviousElt()) { this.cursorlit.getAndDecrement(); } return this.currentListIterator().hasPrevious(); } @Override public T previous() { if (!this.hasPrevious()) { throw new NoSuchElementException(); } final T previous = this.currentListIterator().previous(); this.cursor.getAndDecrement(); return previous; } @Override public int nextIndex() { return this.cursor.get() + 1; } @Override public int previousIndex() { int previousidx = -1; if (this.hasPrevious()) { previousidx = this.cursor.get() - 1; } return previousidx; } @Override public void remove() { throw new UnsupportedOperationException(); } @Override public void set(final T elt) { throw new UnsupportedOperationException(); } @Override public void add(final T elt) { throw new UnsupportedOperationException(); } /** * If {@link List} of {@link ListIterator} has next element. * @return Has or no */ private boolean listHasNextElt() { return this.cursorlit.get() + 1 <= this.listiters.size() - 1; } /** * If {@link List} of {@link ListIterator} has previous element. * @return Has or no */ private boolean listHasPreviousElt() { return this.cursorlit.get() - 1 >= 0; } /** * Get current {@link ListIterator}. * @return Current element */ private ListIterator currentListIterator() { final ListIterator current; if (this.cursorlit.get() == -1) { current = Collections.emptyListIterator(); } else { current = this.listiters.get(this.cursorlit.get()); } return current; } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy