blob: 688279afd8faa970cf90aa2be5f3a0cc04b39b27 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/*
* 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();
}
}
|
