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