heap.java

一个很好的LIBSVM的JAVA源码。对于要研究和改进SVM算法的学者。可以参考。来自数据挖掘工具YALE工具包。

/*
 *  YALE - Yet Another Learning Environment
 *  Copyright (C) 2001-2004
 *      Simon Fischer, Ralf Klinkenberg, Ingo Mierswa, 
 *          Katharina Morik, Oliver Ritthoff
 *      Artificial Intelligence Unit
 *      Computer Science Department
 *      University of Dortmund
 *      44221 Dortmund,  Germany
 *  email: [e-mail]
 *  web:   http://yale.cs.uni-dortmund.de/
 *
 *  This program is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU General Public License as 
 *  published by the Free Software Foundation; either version 2 of the
 *  License, or (at your option) any later version. 
 *
 *  This program 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
 *  General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
 *  USA.
 */
package edu.udo.cs.mySVM.Util;

/**
 * Implements a Heap on n doubles and ints
 * @author Stefan R?ping
 * @version 1.0
 */
public abstract class Heap {

    protected int the_size;
    protected int last;
    protected double[] heap;
    protected int[] indizes;

    public Heap(){};


    public Heap(int n){
	the_size = 0;
	init(n);
    };


    public int size()
    {
	return last; // last = number of elements
    };


    public void init(int n)
    {
	if(the_size != n){
	    the_size = n;
	    heap = new double[n];
	    indizes = new int[n];
	};
	last = 0;
    };


    public void clear()
    {
	the_size = 0;
	last = 0;
	heap = null;
	indizes = null;
    };


    public int[] get_values()
    {
	return indizes;
    };


    public abstract void add(double value, int index);


    public double top_value()
    {
      return heap[0];
    };


    public boolean empty()
    {
      return(last == 0);
    };


    protected abstract void heapify(int start, int size);

};