org.openlca.io.ilcd.input.models.Graph Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of olca-io Show documentation
There is a newer version: 2.2.1
package org.openlca.io.ilcd.input.models;

import org.openlca.core.database.IDatabase;
import org.openlca.core.model.Exchange;
import org.openlca.core.model.Process;
import org.openlca.ilcd.models.Group;
import org.openlca.ilcd.models.Model;
import org.openlca.ilcd.util.Models;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.function.Consumer;

class Graph {

	Node root;

	// private final List<> nodes = new ArrayList<>();
	private final Map nodes = new HashMap<>();

	private final List links = new ArrayList<>();
	private final Map> inLinks = new HashMap<>();
	private final Map> outLinks = new HashMap<>();

	/** Creates an empty graph. */
	Graph() {
	}

	/**
	 * Creates a graph that synchronizes the given eILCD model with the given
	 * database.
	 */
	static Graph build(Model model, IDatabase db) {
		Graph g = new Graph();
		Logger log = LoggerFactory.getLogger(Graph.class);
		if (model == null || model.getInfo() == null || db == null) {
			log.warn("Invalid constraints; return empty index");
			return g;
		}
		var tech = Models.getTechnology(model);
		if (tech == null) {
			log.warn("No processes in model; return empty index");
			return g;
		}

		var groups = new HashMap();
		for (var group : tech.getGroups()) {
			groups.put(group.getId(), group);
		}

		for (var pi : tech.getProcesses()) {
			var processId = pi.getProcess() != null
					? pi.getProcess().getUUID()
					: null;
			if (processId == null) {
				log.warn("Invalid process reference node={}", pi.getId());
				continue;
			}
			var process = db.get(Process.class, processId);
			if (process == null) {
				log.warn("Could not find process {}; skip node {}",
					processId, pi.getId());
				continue;
			}
			var node = Node.init(pi, process);
			if (!pi.getGroupRefs().isEmpty()) {
				var gr = pi.getGroupRefs().get(0);
				node.group = groups.get(gr.getGroupID());
			}
			g.putNode(node);
		}
		buildLinks(g, model);

		var qRef = Models.getQuantitativeReference(model);
		if (qRef != null && qRef.getRefProcess() != null) {
			g.root = g.getNode(qRef.getRefProcess());
		}

		return g;
	}

	private static void buildLinks(Graph g, Model model) {
		// in the eILCD format the process links are modeled in downstream
		// direction. However, in some implementations downstream and output
		// means upstream and input (especially for waste flows). We try to
		// also support such things here...
		for (var pi : Models.getProcesses(model)) {
			var refNode = g.getNode(pi.getId());
			if (refNode == null)
				continue;
			for (var con : pi.getConnections()) {
				Exchange output = refNode.findOutput(con.getOutputFlow());
				Exchange input = null;
				if (output == null) {
					input = refNode.findInput(con.getOutputFlow());
					if (input == null)
						continue;
				}
				for (var dLink : con.getDownstreamLinks()) {
					Node provider;
					Node recipient;
					if (output != null) {
						provider = refNode;
						recipient = g.getNode(dLink.getProcess());
						if (recipient == null)
							continue;
						input = recipient.findInput(dLink.getInputFlow());
					} else {
						recipient = refNode;
						provider = g.getNode(dLink.getProcess());
						if (provider == null)
							continue;
						output = provider.findOutput(dLink.getInputFlow());
					}
					if (input == null || output == null)
						continue;
					Link link = new Link();
					link.provider = provider;
					link.output = output;
					link.recipient = recipient;
					link.input = input;
					g.putLink(link);
				}
			}
		}
	}

	void putNode(Node n) {
		nodes.put(n.id, n);
	}

	void putLink(Link link) {
		link.id = links.size();
		links.add(link);
		int recipientID = link.recipient.id;
		var inList = inLinks.computeIfAbsent(recipientID, k -> new ArrayList<>());
		inList.add(link.id);
		int providerID = link.provider.id;
		var outList = outLinks.computeIfAbsent(providerID, k -> new ArrayList<>());
		outList.add(link.id);
	}

	/**
	 * Returns the node for the ID as used in the eILCD model.
	 */
	Node getNode(int modelID) {
		return nodes.get(modelID);
	}

	void eachNode(Consumer fn) {
		if (fn == null)
			return;
		for (var node : nodes.values()) {
			fn.accept(node);
		}
	}

	void eachLink(Consumer fn) {
		if (fn == null)
			return;
		for (Link link : links) {
			fn.accept(link);
		}
	}

	List getInputLinks(int nodeID) {
		List inList = inLinks.get(nodeID);
		if (inList == null)
			return Collections.emptyList();
		List list = new ArrayList<>();
		for (int i : inList) {
			list.add(links.get(i));
		}
		return list;
	}

	List getOutputLinks(int nodeID) {
		List outList = outLinks.get(nodeID);
		if (outList == null)
			return Collections.emptyList();
		List list = new ArrayList<>();
		for (int i : outList) {
			list.add(links.get(i));
		}
		return list;
	}

}