soln.java

这是一个CRF(条件随机域)算法的实现,希望能对从事算法的有些帮助.

/*
 * Created on Apr 25, 2005
 *
 */
package iitb.CRF;

import java.io.Serializable;
import java.util.Comparator;

/**
 * @author sunita
 *
 */
public class Soln implements Serializable, Comparable {
    private static final long serialVersionUID = 812L;
    public float score=-1*Float.MAX_VALUE;
    public Soln prevSoln=null;
    public int label = -1;
    public int pos;
    
    public Soln(int id, int p) {label = id;pos = p;}
    void clear() {
        score=-1*Float.MAX_VALUE;
        prevSoln=null;
    }
    boolean isClear() {
        return (score == -1*Double.MAX_VALUE);
    }
    protected void copy(Soln soln) {
        score = soln.score;
        prevSoln = soln.prevSoln;
    }
    public int prevPos() {
        return (prevSoln == null)?-1:prevSoln.pos;
    }
    protected int prevLabel() {
        return (prevSoln == null)?-1:prevSoln.label;
    }
    public boolean equals(Soln s) {
        return (label == s.label) && (pos == s.pos) && (prevPos() == s.prevPos()) && (prevLabel() == s.prevLabel());
    }
    
    /**
     * @param prevSoln2
     * @param score2
     */
    protected void setPrevSoln(Soln prevSoln, float score) {
        this.prevSoln = (prevSoln==null)?null:prevSoln.getSoln();
        this.score = score;
    }
    protected Soln getSoln() {
        return this;
    }
    public int compareTo(Object s) {
		return ((((Soln)this).score-((Soln)s).score)>0)?1:-1; 
	}
};