org.apache.commons.math3.geometry.partitioning.NodesSet Maven / Gradle / Ivy
The newest version!
/*
* 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 Type of the space.
* @since 3.4
*/
public class NodesSet implements Iterable> {
/** List of sub-hyperplanes. */
private List> list;
/** Simple constructor.
*/
public NodesSet() {
list = new ArrayList>();
}
/** Add a node if not already known.
* @param node node to add
*/
public void add(final BSPTree node) {
for (final BSPTree 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> iterator) {
for (final BSPTree node : iterator) {
add(node);
}
}
/** {@inheritDoc} */
public Iterator> iterator() {
return list.iterator();
}
}