/**
 * Replication Benchmarker
 * https://github.com/score-team/replication-benchmarker/
 * Copyright (C) 2013 LORIA / Inria / SCORE Team
 *
 * 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 3 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, see <http://www.gnu.org/licenses/>.
 */
package jbenchmarker.logoot;

import java.io.Serializable;

/**
 * Element of a standard logoot identifier 
 * TODO : move as inner class of LogootIdentifier. 
 * @author urso
 */
public class LogootComponent implements Comparable<LogootComponent>,Serializable {

    final private long digit;
    final private int peerID;
    final private int clock;

    public LogootComponent(long d, int pid, int c) {
        this.digit = d;
        this.peerID = pid;
        this.clock = c;
    }

    public long getDigit() {
        return digit;
    }

    public int getPeerID() {
        return peerID;
    }

    public int getClock() {
        return clock;
    }

    @Override
    public boolean equals(Object obj) {
        if (obj == null) {
            return false;
        }
        if (getClass() != obj.getClass()) {
            return false;
        }
        final LogootComponent other = (LogootComponent) obj;
        if (this.digit != other.digit) {
            return false;
        }
        if (this.peerID != other.peerID) {
            return false;
        }
        if (this.clock != other.clock) {
            return false;
        }
        return true;
    }

    @Override
    public int hashCode() {
        int hash = 7;
        hash = 97 * hash + (int) (this.digit ^ (this.digit >>> 32));
        hash = 97 * hash + this.peerID;
        hash = 97 * hash + this.clock;
        return hash;
    }

    @Override
    public String toString() {
        return "<" + digit + ',' + peerID + ',' + clock + '>';
    }

    public int compareTo(LogootComponent t) {
        if (this.digit == t.digit) {
            return (this.peerID == t.peerID) ? this.clock - t.clock : this.peerID - t.peerID;
        } else {
            return (this.digit - t.digit > 0) ? 1 : -1;
        }
    }

    public LogootComponent clone() {
        return new LogootComponent(digit, peerID, clock);
    }
}