//
//RTree implementation.
//Copyright (C) 2002-2004 Wolfgang Baer - WBaer@gmx.de
//
//This library is free software; you can redistribute it and/or
//modify it under the terms of the GNU Lesser General Public
//License as published by the Free Software Foundation; either
//version 2.1 of the License, or (at your option) any later version.
//
//This library is distributed in the hope that it will be useful,
//but WITHOUT ANY WARRANTY; without even the implied warranty of
//MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
//Lesser General Public License for more details.
//
//You should have received a copy of the GNU Lesser General Public
//License along with this library; if not, write to the Free Software
//Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

package org.deegree.io.rtree;

import java.io.Serializable;


/**
 * <p>
 * Implementation of a LeafNode.
 * Inherits methods from the abstract class Node filling
 * the defined abstract methods with life.
 * </p>
 * @author Wolfgang Baer - WBaer@gmx.de
 */
class LeafNode extends Node implements Serializable {
	
    protected int[] data;
    //protected Object[] data;

    /**
	 * Constructor.
	 * @param pageNumber - number of this node in page file
	 * @param file - the PageFile of this node
     */
    protected LeafNode( int pageNumber, PageFile file ) {
        super( pageNumber, file );
        data = new int[file.getCapacity()];
        
        for ( int i = 0; i < file.getCapacity(); i++ )
            data[i] = -1;
    }

    /**
	 * Constructor.<br>
	 * The page number in the pagefile will be
	 * assigned with the first save to a page file
	 * @param file - the PageFile of this node
     */
    protected LeafNode( PageFile file ) {
        super( -1, file );
        data = new int[file.getCapacity()];

        for ( int i = 0; i < file.getCapacity(); i++ )
            data[i] = -1;
    }

    /**
	 * Return type is an Integer object
	 * @see Node#getData(int)
     */
    protected Object getData( int index ) {
        return new Integer( data[index] );
    }

    /**
	 * @see Node#insertData(java.lang.Object, HyperBoundingBox)
     */
	protected void insertData(Object obj, HyperBoundingBox box) {
        data[counter] = ( (Integer)obj ).intValue();
        hyperBBs[counter] = box;
        unionMinBB = unionMinBB.unionBoundingBox( box );
        counter = counter + 1;
    }

	/**
	 * @see Node#insertData(java.lang.Object, HyperBoundingBox)
     */
	protected void deleteData(int index) {
        if ( this.getUsedSpace() == 1 ) {
            // only one element is a special case.
            hyperBBs[0] = HyperBoundingBox.getNullHyperBoundingBox( file.getDimension() );
            data[0] = -1;
		} 
		else {
            System.arraycopy( hyperBBs, index + 1, hyperBBs, index, counter - index - 1 );
            System.arraycopy( data, index + 1, data, index, counter - index - 1 );
            hyperBBs[counter - 1] = HyperBoundingBox.getNullHyperBoundingBox( file.getDimension() );
            data[counter - 1] = -1;
        }

        counter--;
        updateNodeBoundingBox();
    }

    /**
	 * @see Node#clone()
     */
	protected Object clone() {
		
        LeafNode clone = new LeafNode( this.pageNumber, this.file );
        clone.counter = this.counter;
        clone.place = this.place;
        clone.unionMinBB = (HyperBoundingBox)this.unionMinBB.clone();
        clone.parentNode = this.parentNode;

        for ( int i = 0; i < file.getCapacity(); i++ )
            clone.hyperBBs[i] = (HyperBoundingBox)this.hyperBBs[i].clone();

        return clone;
    }
}/* ********************************************************************
Changes to this class. What the people have been up to:
$Log: LeafNode.java,v $
Revision 1.3  2006/07/12 14:46:17  poth
comment footer added

********************************************************************** */