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 | * http://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 | package agents.anac.y2019.harddealer.math3.geometry.partitioning;
|
---|
18 |
|
---|
19 | import java.util.ArrayList;
|
---|
20 | import java.util.Iterator;
|
---|
21 | import java.util.List;
|
---|
22 |
|
---|
23 | import agents.anac.y2019.harddealer.math3.geometry.Space;
|
---|
24 |
|
---|
25 | /** Set of {@link BSPTree BSP tree} nodes.
|
---|
26 | * @see BoundaryAttribute
|
---|
27 | * @param <S> Type of the space.
|
---|
28 | * @since 3.4
|
---|
29 | */
|
---|
30 | public class NodesSet<S extends Space> implements Iterable<BSPTree<S>> {
|
---|
31 |
|
---|
32 | /** List of sub-hyperplanes. */
|
---|
33 | private List<BSPTree<S>> list;
|
---|
34 |
|
---|
35 | /** Simple constructor.
|
---|
36 | */
|
---|
37 | public NodesSet() {
|
---|
38 | list = new ArrayList<BSPTree<S>>();
|
---|
39 | }
|
---|
40 |
|
---|
41 | /** Add a node if not already known.
|
---|
42 | * @param node node to add
|
---|
43 | */
|
---|
44 | public void add(final BSPTree<S> node) {
|
---|
45 |
|
---|
46 | for (final BSPTree<S> existing : list) {
|
---|
47 | if (node == existing) {
|
---|
48 | // the node is already known, don't add it
|
---|
49 | return;
|
---|
50 | }
|
---|
51 | }
|
---|
52 |
|
---|
53 | // the node was not known, add it
|
---|
54 | list.add(node);
|
---|
55 |
|
---|
56 | }
|
---|
57 |
|
---|
58 | /** Add nodes if they are not already known.
|
---|
59 | * @param iterator nodes iterator
|
---|
60 | */
|
---|
61 | public void addAll(final Iterable<BSPTree<S>> iterator) {
|
---|
62 | for (final BSPTree<S> node : iterator) {
|
---|
63 | add(node);
|
---|
64 | }
|
---|
65 | }
|
---|
66 |
|
---|
67 | /** {@inheritDoc} */
|
---|
68 | public Iterator<BSPTree<S>> iterator() {
|
---|
69 | return list.iterator();
|
---|
70 | }
|
---|
71 |
|
---|
72 | }
|
---|