/**
 * 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.rga;

import crdt.CRDT;
import java.util.List;
import java.util.ArrayList;
import collect.VectorClock;
import jbenchmarker.core.Document;
import jbenchmarker.core.MergeAlgorithm;
import crdt.Operation;
import crdt.simulator.IncorrectTraceException;
import jbenchmarker.core.SequenceOperation;

/**
 *
 * @author Roh
 */
public class RGAMerge extends MergeAlgorithm {

    private VectorClock siteVC;
//	private RGAPurger	purger;

    public RGAMerge(Document doc, int r) {
        super(doc, r);
        siteVC = new VectorClock();
//		purger = new RGAPurger((RGADocument)this.getDoc());
    }

    @Override
    protected void integrateRemote(crdt.Operation message) throws IncorrectTraceException {
        RGAOperation rgaop = (RGAOperation) message;
        RGADocument rgadoc = (RGADocument) (this.getDoc());
        this.siteVC.inc(rgaop.getReplica());
        rgadoc.apply(rgaop);
//		purger.setLastVC(rgaop.getS4VTms().sid, rgaop.getOriginalOp().getVectorClock());
        //RGANode tau = purger.tryPurge();
        //if(tau != null) rgadoc.purge(tau);
    }

    @Override
    protected List<Operation> localInsert(SequenceOperation opt) throws IncorrectTraceException {
        List<Operation> lop = new ArrayList<Operation>();
        RGADocument rgadoc = (RGADocument) (this.getDoc());
        RGAS4Vector s4vtms, s4vpos = null;
        RGAOperation rgaop;
        RGANode target = null;

        int p = opt.getPosition();
        int offset;

        offset = opt.getContent().size();
        if (p == 0) {
            s4vpos = null;
        } else {
            s4vpos = rgadoc.getVisibleS4V(p); // if head, s4vpos = null; if after tail, s4vpos= the last one. 		
        }
        for (int i = 0; i < offset; i++) {
            this.siteVC.inc(this.getReplicaNumber());
            s4vtms = new RGAS4Vector(this.getReplicaNumber(), this.siteVC);
            rgaop = new RGAOperation(p + i, s4vpos, opt.getContent().get(i), s4vtms);
            s4vpos = s4vtms; // The s4v of the current insert becomes the s4vpos of next insert.
            lop.add(rgaop);
            rgadoc.apply(rgaop);

//			purger.setLastVC(this.getReplicaNumber(),this.siteVC);
        }

        return lop;
    }

    @Override
    protected List<Operation> localDelete(SequenceOperation opt) throws IncorrectTraceException {
        List<Operation> lop = new ArrayList<Operation>();
        RGADocument rgadoc = (RGADocument) (this.getDoc());
        RGAS4Vector s4vtms, s4vpos = null;
        RGAOperation rgaop;
        RGANode target = null;

        int p = opt.getPosition();
        int offset;

        offset = opt.getLenghOfADel();
        target = rgadoc.getVisibleNode(p + 1);

        for (int i = 0; i < offset; i++) {
            this.siteVC.inc(this.getReplicaNumber());
            s4vtms = new RGAS4Vector(this.getReplicaNumber(), this.siteVC);
            rgaop = new RGAOperation(p + 1, target.getKey(), s4vtms);
            target = target.getNextVisible();
            lop.add(rgaop);
            rgadoc.apply(rgaop);

//			purger.setLastVC(this.getReplicaNumber(),this.siteVC);
        }

        return lop;
    }

    @Override
    public CRDT<String> create() {
        return new RGAMerge(new RGADocument(), 0);
    }
}