Re: Merging Linked Lists

public class PositionalHolder<T>
        implements Comparable<PositionalHolder<T>> {
    public double position;
    public T object;
    public PositionalHolder (T object, double position) {
        this.object = object;
        this.position = position;
    }
    @SuppressWarnings("unchecked")
    public void equals (Object x) {
        return (x == this)
            ||(x instanceof PositionalHolder
             && ((PositionalHolder)x).position
            == position);
    }
    public int hashCode () {
        return Double.valueOf(position).hashCode();
    }
    public int compareTo (PositionalHolder<T> other) {
        return (position < other.position)
            ?-1:((position > other.position)?1:0);
    }
    public void putBetween (PositionalHolder<T> x,
            PositionalHolder<T> y) {
        // Convenience method.
        position = (x.position + y.position)/2;
    }
}