1 /*
2 * Licensed to the Apache Software Foundation (ASF) under one or more
3 * contributor license agreements. See the NOTICE file distributed with
4 * this work for additional information regarding copyright ownership.
5 * The ASF licenses this file to You under the Apache License, Version 2.0
6 * (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 *
9 * https://www.apache.org/licenses/LICENSE-2.0
10 *
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
16 */
17
18 /*
19 * This is not the original file distributed by the Apache Software Foundation
20 * It has been modified by the Hipparchus project
21 */
22 package org.hipparchus.geometry.partitioning;
23
24 import java.util.ArrayList;
25 import java.util.Iterator;
26 import java.util.List;
27
28 import org.hipparchus.geometry.Point;
29 import org.hipparchus.geometry.Space;
30
31 /** Set of {@link BSPTree BSP tree} nodes.
32 * @see BoundaryAttribute
33 * @param <S> Type of the space.
34 * @param <P> Type of the points in space.
35 * @param <H> Type of the hyperplane.
36 * @param <I> Type of the sub-hyperplane.
37 */
38 public class NodesSet<S extends Space, P extends Point<S, P>, H extends Hyperplane<S, P, H, I>, I extends SubHyperplane<S, P, H, I>>
39 implements Iterable<BSPTree<S, P, H, I>> {
40
41 /** List of sub-hyperplanes. */
42 private final List<BSPTree<S, P, H, I>> list;
43
44 /** Simple constructor.
45 */
46 public NodesSet() {
47 list = new ArrayList<>();
48 }
49
50 /** Add a node if not already known.
51 * @param node node to add
52 */
53 public void add(final BSPTree<S, P, H, I> node) {
54
55 for (final BSPTree<S, P, H, I> existing : list) {
56 if (node == existing) {
57 // the node is already known, don't add it
58 return;
59 }
60 }
61
62 // the node was not known, add it
63 list.add(node);
64
65 }
66
67 /** Add nodes if they are not already known.
68 * @param iterator nodes iterator
69 */
70 public void addAll(final Iterable<BSPTree<S, P, H, I>> iterator) {
71 for (final BSPTree<S, P, H, I> node : iterator) {
72 add(node);
73 }
74 }
75
76 /** {@inheritDoc} */
77 @Override
78 public Iterator<BSPTree<S, P, H, I>> iterator() {
79 return list.iterator();
80 }
81
82 }