com.diffplug.common.base.TreeIterable Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of durian Show documentation
Durian - Guava's spikier (unofficial) cousin
There is a newer version: 3.4.0
/**
 * Copyright 2015 DiffPlug
 *
 * Licensed 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
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * 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.
 */
package com.diffplug.common.base;

import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.NoSuchElementException;

/** An immutable tree. */
public class TreeIterable {
	private TreeIterable() {}

	/** Returns a breadth-first traversal of the given tree, including the current node. */
	public static  Iterable toParent(TreeDef.Parented treeDef, T node) {
		return () -> new Iterator() {
			T tip = node;

			@Override
			public boolean hasNext() {
				return tip != null;
			}

			@Override
			public T next() {
				if (tip == null) {
					throw new NoSuchElementException();
				}
				T next = tip;
				tip = treeDef.parentOf(tip);
				return next;
			}
		};
	}

	/** Returns a breadth-first search of the given tree, not including root. */
	public static  Iterable breadthFirst(TreeDef treeDef, T node) {
		return () -> new Iterator() {
			Deque queue = new ArrayDeque<>(Arrays.asList(node));

			@Override
			public boolean hasNext() {
				return !queue.isEmpty();
			}

			@Override
			public T next() {
				if (queue.isEmpty()) {
					throw new NoSuchElementException();
				}
				T next = queue.removeFirst();
				treeDef.childrenOf(next).forEach(queue::addLast);
				return next;
			}
		};
	}

	/** Returns a breadth-first traversal of the given tree, not including root. */
	public static  Iterable depthFirst(TreeDef treeDef, T node) {
		return () -> new Iterator() {
			Deque queue = new ArrayDeque<>(Arrays.asList(node));

			@Override
			public boolean hasNext() {
				return !queue.isEmpty();
			}

			@Override
			public T next() {
				if (queue.isEmpty()) {
					throw new NoSuchElementException();
				}
				T next = queue.removeLast();
				List children = treeDef.childrenOf(next);
				ListIterator iterator = children.listIterator(children.size());
				while (iterator.hasPrevious()) {
					queue.addLast(iterator.previous());
				}
				return next;
			}
		};
	}
}