public int compareTo(Object o) 
{
        if (o instanceof TreeEntry) {
            TreeEntry other = (TreeEntry)o;
            return key.compareTo(other.key);
        } else {
            return key.compareTo(o);
        }
}

 TreeEntry copy() 
{
        TreeEntry copy = new TreeEntry();
        copy.key = this.key;
        copy.indexOffset = this.indexOffset;
        copy.prevPageId = this.prevPageId;
        copy.nextPageId = this.nextPageId;
        return copy;
}

 public boolean equals(Object o) 
{
        return compareTo(o) == 0;
}

 long getIndexOffset() 
{
        return this.indexOffset;
}

 Comparable getKey() 
{
        return this.key;
}

 long getNextPageId() 
{
        return this.nextPageId;
}

 long getPrevPageId() 
{
        return this.prevPageId;
}

 boolean hasChildPagesReferences() 
{
        return prevPageId != NOT_SET || nextPageId != NOT_SET;
}

 public int hashCode() 
{
        return key.hashCode();
}

  void read(Marshaller keyMarshaller,
    DataInput dataIn) throws IOException 
{
        key = (Comparable)keyMarshaller.readPayload(dataIn);
        indexOffset = dataIn.readLong();
        nextPageId = dataIn.readLong();
        prevPageId = dataIn.readLong();
}

  void reset() 
{
        prevPageId = NOT_SET;
        nextPageId = NOT_SET;
}

  void setIndexOffset(long indexOffset) 
{
        this.indexOffset = indexOffset;
}

  void setKey(Comparable key) 
{
        this.key = key;
}

  void setNextPageId(long nextPageId) 
{
        this.nextPageId = nextPageId;
}

  void setPrevPageId(long prevPageId) 
{
        this.prevPageId = prevPageId;
}

 public String toString() 
{
        return "TreeEntry(" + key + "," + indexOffset + ")prev=" + prevPageId + ",next=" + nextPageId;
}

  void write(Marshaller keyMarshaller,
    DataOutput dataOut) throws IOException 
{
        keyMarshaller.writePayload(key, dataOut);
        dataOut.writeLong(indexOffset);
        dataOut.writeLong(nextPageId);
        dataOut.writeLong(prevPageId);
}