/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You 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 org.apache.commons.math3.geometry.partitioning;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

import org.apache.commons.math3.geometry.Space;

/** Set of {@link BSPTree BSP tree} nodes.
 * @see BoundaryAttribute
 * @param <S> Type of the space.
 * @since 3.4
 */
public class NodesSet<S extends Space> implements Iterable<BSPTree<S>> {

    /** List of sub-hyperplanes. */
    private List<BSPTree<S>> list;

    /** Simple constructor.
     */
    public NodesSet() {
        list = new ArrayList<BSPTree<S>>();
    }

    /** Add a node if not already known.
     * @param node node to add
     */
    public void add(final BSPTree<S> node) {

        for (final BSPTree<S> existing : list) {
            if (node == existing) {
                // the node is already known, don't add it
                return;
            }
        }

        // the node was not known, add it
        list.add(node);

    }

    /** Add nodes if they are not already known.
     * @param iterator nodes iterator
     */
    public void addAll(final Iterable<BSPTree<S>> iterator) {
        for (final BSPTree<S> node : iterator) {
            add(node);
        }
    }

    /** {@inheritDoc} */
    public Iterator<BSPTree<S>> iterator() {
        return list.iterator();
    }

}