View Javadoc
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.Space;
29  
30  /** Set of {@link BSPTree BSP tree} nodes.
31   * @see BoundaryAttribute
32   * @param <S> Type of the space.
33   */
34  public class NodesSet<S extends Space> implements Iterable<BSPTree<S>> {
35  
36      /** List of sub-hyperplanes. */
37      private final List<BSPTree<S>> list;
38  
39      /** Simple constructor.
40       */
41      public NodesSet() {
42          list = new ArrayList<>();
43      }
44  
45      /** Add a node if not already known.
46       * @param node node to add
47       */
48      public void add(final BSPTree<S> node) {
49  
50          for (final BSPTree<S> existing : list) {
51              if (node == existing) {
52                  // the node is already known, don't add it
53                  return;
54              }
55          }
56  
57          // the node was not known, add it
58          list.add(node);
59  
60      }
61  
62      /** Add nodes if they are not already known.
63       * @param iterator nodes iterator
64       */
65      public void addAll(final Iterable<BSPTree<S>> iterator) {
66          for (final BSPTree<S> node : iterator) {
67              add(node);
68          }
69      }
70  
71      /** {@inheritDoc} */
72      @Override
73      public Iterator<BSPTree<S>> iterator() {
74          return list.iterator();
75      }
76  
77  }