From 60f01f46ba232ed6416054f0a6115cb2a9b70b4e Mon Sep 17 00:00:00 2001
From: OszkarSemerath <oszka@152.66.252.189>
Date: Sat, 10 Jun 2017 19:05:05 +0200
Subject: Migrating Additional projects

---
 .../mit/inf/dslreasoner/util/CollectionsUtil.xtend | 82 ++++++++++++++++++++++
 1 file changed, 82 insertions(+)
 create mode 100644 Framework/hu.bme.mit.inf.dslreasoner.logic.model/src/hu/bme/mit/inf/dslreasoner/util/CollectionsUtil.xtend

(limited to 'Framework/hu.bme.mit.inf.dslreasoner.logic.model/src/hu/bme/mit/inf/dslreasoner/util/CollectionsUtil.xtend')

diff --git a/Framework/hu.bme.mit.inf.dslreasoner.logic.model/src/hu/bme/mit/inf/dslreasoner/util/CollectionsUtil.xtend b/Framework/hu.bme.mit.inf.dslreasoner.logic.model/src/hu/bme/mit/inf/dslreasoner/util/CollectionsUtil.xtend
new file mode 100644
index 00000000..25cddc05
--- /dev/null
+++ b/Framework/hu.bme.mit.inf.dslreasoner.logic.model/src/hu/bme/mit/inf/dslreasoner/util/CollectionsUtil.xtend
@@ -0,0 +1,82 @@
+package hu.bme.mit.inf.dslreasoner.util
+
+import java.util.HashSet
+import java.util.LinkedList
+import java.util.List
+import java.util.Map
+import java.util.Set
+import org.eclipse.xtext.xbase.lib.Functions.Function1
+import java.util.HashMap
+import java.util.LinkedHashMap
+
+class CollectionsUtil {
+	public def static <FROM,TO> TO lookup(FROM from, Map<? super FROM,TO> map) {
+		if(map.containsKey(from)) {
+			return map.get(from)
+		} else throw new IllegalArgumentException('''
+		The map does not contains the key "«from.toString»"!
+		--- Elements: ---
+		«FOR entry : map.entrySet SEPARATOR '\n'»«entry.key» -> «entry.value»«ENDFOR»
+		-----------------''');
+	}
+	public def <FROM,TO> TO ifThenElse(FROM source, Function1<FROM,Boolean> condition, Function1<FROM,TO> ifTrue, Function1<FROM,TO> ifFalse) {
+		if(condition.apply(source)) {
+			return ifTrue.apply(source)
+			}
+		else {
+			return ifFalse.apply(source)
+		}
+	}
+	public def static <Key,Value> Union(Map<Key,Value> a, Map<Key,Value> b) {
+		(a.keySet + b.keySet).toInvertedMap[key |
+			if(a.containsKey(key)) a.get(key)
+			else b.get(key)
+		]
+	}
+	public def static <Key,Value> putOrAddToSet(Map<Key,Set<Value>> map, Key key, Value value) {
+		if(map.containsKey(key)) {
+			map.get(key).add(value)
+		}else{
+			val set = new HashSet<Value>() => [it.add(value)]
+			map.put(key, set)
+		}
+	}
+	public def static <Key,Value> putOrAddToList(Map<Key,List<Value>> map, Key key, Value value) {
+		if(map.containsKey(key)) {
+			map.get(key).add(value)
+		}else{
+			val set = new LinkedList<Value>() => [it.add(value)]
+			map.put(key, set)
+		}
+	}
+	def public static <From,To,Property> Map<From,To> copyMap(Map<From,To> oldMap, Iterable<To> newValues, Function1<To,Property> indexExtractor) {
+		val Map<Property,To> valueIndexes = oldMap.values.toMap[to|indexExtractor.apply(to)];
+		val res = oldMap.mapValues[value | indexExtractor.apply(value).lookup(valueIndexes)]
+		return res
+	}
+	def public static <From,To> Map<To,From> bijectiveInverse(Map<From,To> m) { m.keySet.toMap[x|x.lookup(m)] }
+	def public static <From,To> Map<To,List<From>> inverse(Map<From,To> m) {
+		val res = new LinkedHashMap<To,List<From>>
+		m.entrySet.forEach[res.putOrAddToList(it.value,it.key)]
+		return res
+	}
+	
+	def public static <Type> List<Type> transitiveClosurePlus(Type source, Function1<Type,Iterable<Type>> next) {
+		val res = new LinkedList()
+		transitiveClosureHelper(res,source,next)
+		return res
+	}
+	def public static <Type> List<Type> transitiveClosureStar(Type source, Function1<Type,Iterable<Type>> next) {
+		val res = new LinkedList()
+		res += source
+		transitiveClosureHelper(res,source,next)
+		return res
+	}
+	def private static <Type> void transitiveClosureHelper(List<Type> result, Type actual, Function1<Type,Iterable<Type>> next) {
+		val front = next.apply(actual)
+		for(elementInFront : front) {
+			result += elementInFront
+			transitiveClosureHelper(result,elementInFront,next)
+		}
+	}
+}
-- 
cgit v1.2.3-54-g00ecf