/*
 *  Copyright (C) 2014 Shashank Tulsyan
 * 
 *  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 neembuu.release1.defaultImpl.linkgroup;

import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import neembuu.release1.api.linkhandler.TrialLinkHandler;
import neembuu.release1.api.linkgroup.TrialLinkGroup;

/**
 *
 * @author Shashank Tulsyan
 */
public class SplitsTrialLinkGroup implements TrialLinkGroup {

    String name;
    final List<SplitPart> splitParts = new LinkedList<SplitPart>();

    @Override
    public boolean absorb(TrialLinkHandler other) {
        SplitsTrialLinkGroup otherLP = SplitsLinkGroupMaker.tryHandle(other);

        if (otherLP == null) {
            return false;
        }
        SplitPart otherSplit = otherLP.splitParts.get(0);

        if (name.equalsIgnoreCase(otherLP.name)) {
            for (SplitPart s1 : splitParts) {
                if (s1.index == otherSplit.index) {
                    //already exists
                    return false;
                }
            }
            splitParts.add(otherSplit);
            return true;
        }
        return false;
    }

    @Override
    public String tempDisplayName() {
        return name;
    }

    @Override
    public String toString() {
        String ret = name + "{\n";
        for (SplitPart splitPart : splitParts) {
            ret += "\t" + splitPart.splitName + " index=" + splitPart.index + "\n";
        }
        ret += "}\n";
        return ret;

    }
    
    final static class SplitPart {
        int index;
        String splitName;
        TrialLinkHandler th;

        public int getIndex() {
            return index;
        }

        public String getName() {
            return splitName;
        }

        public TrialLinkHandler getTrialLinkHandler() {
            return th;
        }
    }

    @Override
    public List<TrialLinkHandler> getAbsorbedLinks() {
        final List<TrialLinkHandler> abs = new LinkedList<TrialLinkHandler>();
        for(SplitPart sp : splitParts ){
            abs.add(sp.getTrialLinkHandler());
        }
        return abs;
    }
    
    @Override
    public List<TrialLinkHandler> getFailedLinks() {
        if(complete()){
            return Collections.emptyList();
        }
        
        final List<TrialLinkHandler> failedLinks = new LinkedList<TrialLinkHandler>();
        for(SplitPart sp : splitParts ){
            failedLinks.add(sp.getTrialLinkHandler());
        }
        return failedLinks;
    }
    
    @Override
    public boolean complete() {
        Collections.sort(splitParts, new Comparator<SplitPart>() {
            @Override
            public int compare(SplitPart o1, SplitPart o2) {
                return o1.index - o2.index;
            }
        });
        
        int i = 1;
        boolean complete = false;
        
        
        for(SplitPart sp : splitParts){
            if(sp.index!=i){
                break;
            }
            i++;
        }
        
        if(i==splitParts.size()+1){
            complete = true;
        }
        
        return complete;
    }
}