/* * Copyright (c) 2013, SRI International * All rights reserved. * Licensed under the The BSD 3-Clause License; * you may not use this file except in compliance with the License. * You may obtain a copy of the License at: * * http://opensource.org/licenses/BSD-3-Clause * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * Neither the name of the aic-util nor the names of its * contributors may be used to endorse or promote products derived from * this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED * OF THE POSSIBILITY OF SUCH DAMAGE. */ package com.sri.ai.util.collect; import java.util.Iterator; import com.google.common.annotations.Beta; import com.sri.ai.util.Util; import com.sri.ai.util.base.NullaryFunction; /** * An immutable implementation of {@link LazyTree}. * * @author braz * */ @Beta class DefaultLazyTree<E> implements LazyTree<E> { private E information; private Iterator<NullaryFunction<LazyTree<E>>> subTreeMakers; public DefaultLazyTree(E information) { this(information, Util.iterator()); } public DefaultLazyTree(Iterator<NullaryFunction<LazyTree<E>>> subTreeMakers) { this(null, subTreeMakers); } public DefaultLazyTree(E information, Iterator<NullaryFunction<LazyTree<E>>> subTreeMakers) { super(); this.information = information; this.subTreeMakers = subTreeMakers; } @Override public E getInformation() { return information; } @Override public Iterator<NullaryFunction<LazyTree<E>>> getSubTreeMakers() { return subTreeMakers; } }