+/*******************************************************************************\r
+ * Copyright (c) 2010 Association for Decentralized Information Management in\r
+ * Industry THTH ry.\r
+ * All rights reserved. This program and the accompanying materials\r
+ * are made available under the terms of the Eclipse Public License v1.0\r
+ * which accompanies this distribution, and is available at\r
+ * http://www.eclipse.org/legal/epl-v10.html\r
+ *\r
+ * Contributors:\r
+ * VTT Technical Research Centre of Finland - initial API and implementation\r
+ *******************************************************************************/\r
+package org.simantics.databoard.binding.impl;\r
+\r
+import java.util.IdentityHashMap;\r
+import java.util.List;\r
+import java.util.Map;\r
+import java.util.Map.Entry;\r
+import java.util.Set;\r
+import java.util.TreeMap;\r
+\r
+import org.simantics.databoard.binding.ArrayBinding;\r
+import org.simantics.databoard.binding.Binding;\r
+import org.simantics.databoard.binding.MapBinding;\r
+import org.simantics.databoard.binding.error.BindingException;\r
+import org.simantics.databoard.type.MapType;\r
+\r
+/**\r
+ * Binds java.util.Map to MapType\r
+ * \r
+ * This Binding type accepts all java.util.Map instances, but creates\r
+ * java.util.TreeMap instances by default.\r
+ * \r
+ * @author Reino Ruusu <reino.ruusu@vtt.fi>\r
+ */\r
+@SuppressWarnings("rawtypes")\r
+public class DefaultMapBinding extends MapBinding {\r
+\r
+ public DefaultMapBinding(Binding keyBinding, Binding valueBinding) {\r
+ super(keyBinding, valueBinding);\r
+ }\r
+\r
+ public DefaultMapBinding(MapType mapType, Binding keyBinding,\r
+ Binding valueBinding) {\r
+ super(mapType, keyBinding, valueBinding);\r
+ }\r
+\r
+ public void postConstruction() {\r
+ }\r
+\r
+ @Override\r
+ public Object create() {\r
+ return new TreeMap<Object,Object>( keyBinding );\r
+ }\r
+\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public Object create(Object[] keys, Object[] values) {\r
+ if (keys.length != values.length)\r
+ throw new IllegalArgumentException("Equal length arrays expected");\r
+\r
+ int len = keys.length;\r
+ Map result = new TreeMap<Object,Object>( keyBinding );\r
+\r
+ for (int i = 0; i < len; i++) {\r
+ Object key = keys[i];\r
+ Object value = values[i];\r
+ result.put(key, value);\r
+ }\r
+\r
+ return result;\r
+ }\r
+ \r
+ \r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public Object create(List<Object> keys, List<Object> values) {\r
+ if (keys.size()!=values.size())\r
+ throw new IllegalArgumentException("Equal length arrays expected");\r
+ \r
+ int len = keys.size();\r
+ Map result = new TreeMap<Object,Object>( keyBinding );\r
+ \r
+ for (int i=0; i<len; i++) {\r
+ Object key = keys.get(i);\r
+ Object value = values.get(i);\r
+ result.put(key, value);\r
+ }\r
+ \r
+ return result;\r
+ } \r
+\r
+ @Override\r
+ public Object create(Map<?,?> map) {\r
+ return map;\r
+ }\r
+ \r
+ @Override\r
+ public void clear(Object map) {\r
+ ((Map) map).clear();\r
+ }\r
+\r
+ @Override\r
+ public boolean containsKey(Object map, Object key) {\r
+ Map m = ((Map) map);\r
+ return m.containsKey(key);\r
+ }\r
+\r
+ @Override\r
+ public boolean containsValue(Object map, Object value) {\r
+ Map m = ((Map) map);\r
+ Binding vb = getValueBinding();\r
+ for (Object v : m.values())\r
+ {\r
+ if (vb.equals(v, value)) return true;\r
+ }\r
+ return false;\r
+ }\r
+\r
+ @Override\r
+ public Object get(Object map, Object key) {\r
+ Map m = ((Map) map);\r
+ return m.get(key);\r
+ }\r
+\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public Object[] getKeys(Object map) {\r
+ Map m = ((Map) map);\r
+ return m.keySet().toArray(new Object[m.size()]);\r
+ }\r
+ \r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public void getKeys(Object map, Set<Object> keys) throws BindingException {\r
+ Map m = ((Map)map);\r
+ keys.addAll(m.keySet());\r
+ } \r
+ \r
+ /**\r
+ * Count the number of entries between two keyes\r
+ * @param from\r
+ * @param fromInclusive\r
+ * @param end \r
+ * @param endInclusive\r
+ * @throws BindingException\r
+ */\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public int count(Object src, Object from, boolean fromInclusive, Object end, boolean endInclusive) throws BindingException {\r
+ // Assert end > from\r
+ if (keyBinding.compare(from, end)>0) return 0;\r
+ \r
+ if (src instanceof TreeMap) {\r
+ TreeMap m = (TreeMap) src;\r
+ Map sm = m.subMap(from, fromInclusive, end, endInclusive);\r
+ return sm.size();\r
+ }\r
+ else {\r
+ int result = 0;\r
+ Map<Object, Object> m = ((Map<Object, Object>)src);\r
+ for (Object k : m.keySet()) {\r
+ int fk = keyBinding.compare(from, k);\r
+ int ek = keyBinding.compare(k, end);\r
+ boolean fromMatches = fromInclusive ? fk<=0 : fk<0;\r
+ boolean endMatches = endInclusive ? ek<=0 : ek <0; \r
+ if ( fromMatches && endMatches ) result++;\r
+ } \r
+ return result;\r
+ }\r
+ }\r
+ \r
+ /**\r
+ * Read a range of entries\r
+ * \r
+ * @param src\r
+ * @param from\r
+ * @param fromInclusive\r
+ * @param end \r
+ * @param endInclusive\r
+ * @param dstKeyArrayBinding\r
+ * @param dstKeyArray\r
+ * @param dstValueArrayBinding\r
+ * @param dstValueArray\r
+ * @throws BindingException\r
+ */\r
+ public int getEntries(Object src, Object from, boolean fromInclusive, Object end, boolean endInclusive, ArrayBinding dstKeyArrayBinding, Object dstKeyArray, ArrayBinding dstValueArrayBinding, Object dstValueArray, int limit) throws BindingException {\r
+ if (src instanceof TreeMap) {\r
+ return new TreeMapBinding(keyBinding, valueBinding).getEntries(src, from, fromInclusive, end, endInclusive, dstKeyArrayBinding, dstKeyArray, dstValueArrayBinding, dstValueArray, limit);\r
+ }\r
+ else {\r
+ return new HashMapBinding(keyBinding, valueBinding).getEntries(src, from, fromInclusive, end, endInclusive, dstKeyArrayBinding, dstKeyArray, dstValueArrayBinding, dstValueArray, limit);\r
+ }\r
+ }\r
+ \r
+\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public Object[] getValues(Object map) {\r
+ Map m = ((Map) map);\r
+ return m.values().toArray(new Object[m.size()]);\r
+ }\r
+\r
+ @Override\r
+ public <K, V> void put(Object map, K key, V value) {\r
+ @SuppressWarnings("unchecked")\r
+ Map<K, V> m = ((Map<K, V>) map);\r
+ m.put(key, value);\r
+ }\r
+\r
+ @Override\r
+ public <K, V> void putAll(Object dstMap, Map<K, V> srcMap) {\r
+ @SuppressWarnings("unchecked")\r
+ Map<K, V> dst = ((Map<K, V>) dstMap);\r
+ dst.putAll(srcMap);\r
+ }\r
+\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public void getAll(Object mapFrom, Map to) {\r
+ Map<?, ?> m = ((Map<?, ?>) mapFrom);\r
+ to.putAll(m);\r
+ }\r
+\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public void getAll(Object mapFrom, Object[] keys, Object[] values) {\r
+ Map m = (Map) mapFrom;\r
+ int i = 0;\r
+ for (Entry<Object, Object> e : (Set<Entry<Object, Object>>) m.entrySet()) {\r
+ keys[i] = e.getKey();\r
+ values[i] = e.getValue();\r
+ i++;\r
+ }\r
+ }\r
+ \r
+ @Override\r
+ public Object remove(Object map, Object key) {\r
+ Map m = ((Map) map);\r
+ return m.remove(key);\r
+ }\r
+\r
+ @Override\r
+ public int size(Object map) {\r
+ Map m = ((Map) map);\r
+ return m.size();\r
+ }\r
+\r
+ @Override\r
+ public boolean isInstance(Object obj) {\r
+ return obj instanceof Map;\r
+ }\r
+\r
+ @Override\r
+ public int deepHashValue(Object map, IdentityHashMap<Object, Object> hashedObjects) throws BindingException {\r
+ int result = 0;\r
+ Map m = ((Map) map);\r
+ @SuppressWarnings("unchecked")\r
+ Set<Entry> s = m.entrySet();\r
+ for (Entry e : s) {\r
+ int keyTree = getKeyBinding().deepHashValue(e.getKey(), hashedObjects);\r
+ int valueTree = getValueBinding().deepHashValue(e.getValue(), hashedObjects);\r
+ result += (keyTree ^ valueTree);\r
+ }\r
+ return result;\r
+ }\r
+\r
+ @Override\r
+ public Object getCeilingKey(Object map, Object key) {\r
+ if (map instanceof TreeMap) {\r
+ return new TreeMapBinding(keyBinding, valueBinding).getCeilingKey(map, key);\r
+ }\r
+ else {\r
+ return new HashMapBinding(keyBinding, valueBinding).getCeilingKey(map, key);\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public Object getFirstKey(Object map) {\r
+ if (map instanceof TreeMap) {\r
+ return new TreeMapBinding(keyBinding, valueBinding).getFirstKey(map);\r
+ }\r
+ else {\r
+ return new HashMapBinding(keyBinding, valueBinding).getFirstKey(map);\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public Object getFloorKey(Object map, Object key) {\r
+ if (map instanceof TreeMap) {\r
+ return new TreeMapBinding(keyBinding, valueBinding).getFloorKey(map, key);\r
+ }\r
+ else {\r
+ return new HashMapBinding(keyBinding, valueBinding).getFloorKey(map, key);\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public Object getHigherKey(Object map, Object key) {\r
+ if (map instanceof TreeMap) {\r
+ return new TreeMapBinding(keyBinding, valueBinding).getHigherKey(map, key);\r
+ }\r
+ else {\r
+ return new HashMapBinding(keyBinding, valueBinding).getHigherKey(map, key);\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public Object getLastKey(Object map) {\r
+ if (map instanceof TreeMap) {\r
+ return new TreeMapBinding(keyBinding, valueBinding).getLastKey(map);\r
+ }\r
+ else {\r
+ return new HashMapBinding(keyBinding, valueBinding).getLastKey(map);\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public Object getLowerKey(Object map, Object key) {\r
+ if (map instanceof TreeMap) {\r
+ return new TreeMapBinding(keyBinding, valueBinding).getLowerKey(map, key);\r
+ }\r
+ else {\r
+ return new HashMapBinding(keyBinding, valueBinding).getLowerKey(map, key);\r
+ }\r
+ }\r
+}\r
Code Review / simantics / platform.git / commitdiff