2 * Sone - PartContainer.java - Copyright © 2010–2013 David Roden
4 * This program is free software: you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation, either version 3 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 package net.pterodactylus.sone.text;
20 import java.util.ArrayDeque;
21 import java.util.ArrayList;
22 import java.util.Deque;
23 import java.util.Iterator;
24 import java.util.List;
25 import java.util.NoSuchElementException;
28 * Part implementation that can contain an arbitrary amount of other parts.
29 * Parts are added using the {@link #add(Part)} method and will be rendered in
30 * the order they are added.
32 * @author <a href="mailto:bombe@pterodactylus.net">David ‘Bombe’ Roden</a>
34 public class PartContainer implements Part, Iterable<Part> {
36 /** The parts to render. */
37 private final List<Part> parts = new ArrayList<Part>();
44 public boolean isPlainText() {
49 public boolean isFreenetLink() {
54 * Adds a part to render.
59 public void add(Part part) {
64 * Returns the part at the given index.
67 * The index of the part
70 public Part getPart(int index) {
71 return parts.get(index);
75 * Removes the part at the given index.
78 * The index of the part to remove
80 public void removePart(int index) {
85 * Returns the number of parts.
87 * @return The number of parts
98 public String getText() {
99 StringBuilder partText = new StringBuilder();
100 for (Part part : parts) {
101 partText.append(part.getText());
103 return partText.toString();
111 @SuppressWarnings("synthetic-access")
112 public Iterator<Part> iterator() {
113 return new Iterator<Part>() {
115 private Deque<Iterator<Part>> partStack = new ArrayDeque<Iterator<Part>>();
116 private Part nextPart;
117 private boolean foundNextPart;
118 private boolean noNextPart;
121 partStack.push(parts.iterator());
124 private void findNext() {
129 while (!partStack.isEmpty()) {
130 Iterator<Part> parts = partStack.pop();
131 if (parts.hasNext()) {
132 nextPart = parts.next();
133 partStack.push(parts);
134 if (nextPart instanceof PartContainer) {
135 partStack.push(((PartContainer) nextPart).iterator());
142 foundNextPart = true;
146 public boolean hasNext() {
155 throw new NoSuchElementException();
157 foundNextPart = false;
162 public void remove() {