co.turnus.analysis.trace.NearestNeighbor.java Source code

Introduction

Here is the source code for co.turnus.analysis.trace.NearestNeighbor.java

Source

/* 
 * TURNUS, the co-exploration framework
 * 
 * Copyright (C) 2014 EPFL SCI STI MM
 *
 * This file is part of TURNUS.
 *
 * TURNUS 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.
 *
 * TURNUS 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 TURNUS.  If not, see <http://www.gnu.org/licenses/>.
 * 
 * Additional permission under GNU GPL version 3 section 7
 * 
 * If you modify this Program, or any covered work, by linking or combining it
 * with Eclipse (or a modified version of Eclipse or an Eclipse plugin or 
 * an Eclipse library), containing parts covered by the terms of the 
 * Eclipse Public License (EPL), the licensors of this Program grant you 
 * additional permission to convey the resulting work.  Corresponding Source 
 * for a non-source form of such a combination shall include the source code 
 * for the parts of Eclipse libraries used as well as that of the  covered work.
 * 
 */
package co.turnus.analysis.trace;

import java.util.Collection;
import java.util.HashSet;
import java.util.Set;

import co.turnus.trace.Dependency;
import co.turnus.trace.Step;

import com.google.common.collect.Sets;

public class NearestNeighbor {

    public static Set<Step> find(Set<Step> ancestors, int maxNodes, int maxDegree, String firingAttributeId) {

        Set<Step> successors = new HashSet<>();
        for (Step ancestor : ancestors) {
            for (Dependency out : ancestor.getOutgoings()) {
                Step tgt = out.getTarget();
                if (!ancestors.contains(tgt) && !tgt.getAttribute(firingAttributeId, false)) {
                    successors.add(tgt);
                }
            }
        }

        // check if all the incoming are satisfied
        Collection<Step> removables = new HashSet<Step>();
        Collection<Step> incomings = new HashSet<Step>();
        for (Step successor : successors) {
            incomings.clear();
            for (Dependency in : successor.getIncomings()) {
                incomings.add(in.getSource());
            }
            for (Step incoming : incomings) {
                if (!(ancestors.contains(incoming) || incoming.getAttribute(firingAttributeId, false))) {
                    removables.add(successor);
                }
            }
        }
        successors.removeAll(removables);

        // check if new nodes should be searched
        maxDegree--;
        maxNodes -= successors.size();
        if (!(successors.isEmpty() || maxDegree <= 0 || maxNodes <= 0)) {
            Set<Step> newAnchestors = Sets.union(ancestors, successors);
            successors.addAll(find(newAnchestors, maxNodes, maxDegree, firingAttributeId));
        }

        return successors;

    }
}