001/**
002 * Copyright (c) 2011, The University of Southampton and the individual contributors.
003 * All rights reserved.
004 *
005 * Redistribution and use in source and binary forms, with or without modification,
006 * are permitted provided that the following conditions are met:
007 *
008 *   *  Redistributions of source code must retain the above copyright notice,
009 *      this list of conditions and the following disclaimer.
010 *
011 *   *  Redistributions in binary form must reproduce the above copyright notice,
012 *      this list of conditions and the following disclaimer in the documentation
013 *      and/or other materials provided with the distribution.
014 *
015 *   *  Neither the name of the University of Southampton nor the names of its
016 *      contributors may be used to endorse or promote products derived from this
017 *      software without specific prior written permission.
018 *
019 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
020 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
021 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
022 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
023 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
024 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
025 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
026 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
027 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
028 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
029 */
030package org.openimaj.math.geometry.shape.util.polygon;
031
032/** */
033public class ScanBeamTreeEntries
034{
035        /** */
036        public int sbt_entries;
037
038        /** */
039        public ScanBeamTree sb_tree;
040
041        /**
042         * @return double  
043         */
044        public double[] build_sbt()
045        {
046                double[] sbt = new double[sbt_entries];
047
048                int entries = 0;
049                entries = inner_build_sbt( entries, sbt, sb_tree );
050                if( entries != sbt_entries )
051                {
052                        throw new IllegalStateException( "Something went wrong buildign sbt from tree." );
053                }
054                return sbt;
055        }
056
057        private int inner_build_sbt( int entries, double[] sbt, ScanBeamTree sbt_node )
058        {
059                if( sbt_node.less != null )
060                {
061                        entries = inner_build_sbt( entries, sbt, sbt_node.less );
062                }
063                sbt[entries] = sbt_node.y;
064                entries++;
065                if( sbt_node.more != null )
066                {
067                        entries = inner_build_sbt( entries, sbt, sbt_node.more );
068                }
069                return entries;
070        }
071}