home | career | drupal | java | mac | mysql | perl | scala | uml | unix  

Java example source code file (NodesSet.java)

This example Java source code file (NodesSet.java) is included in the alvinalexander.com "Java Source Code Warehouse" project. The intent of this project is to help you "Learn Java by Example" TM.

Learn more about this Java project at its project page.

Java - Java tags/keywords

arraylist, bsptree, iterable, iterator, nodesset, space, util

The NodesSet.java Java example source code

/*
 * 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> {

    /** List of sub-hyperplanes. */
    private List<BSPTree list;

    /** Simple constructor.
     */
    public NodesSet() {
        list = new ArrayList<BSPTree();
    }

    /** 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 iterator) {
        for (final BSPTree<S> node : iterator) {
            add(node);
        }
    }

    /** {@inheritDoc} */
    public Iterator<BSPTree iterator() {
        return list.iterator();
    }

}

Other Java examples (source code examples)

Here is a short list of links related to this Java NodesSet.java source code file:



my book on functional programming

 

new blog posts

 

Copyright 1998-2019 Alvin Alexander, alvinalexander.com
All Rights Reserved.

A percentage of advertising revenue from
pages under the /java/jwarehouse URI on this website is
paid back to open source projects.