X-Git-Url: https://gerrit.simantics.org/r/gitweb?a=blobdiff_plain;f=bundles%2Forg.simantics.databoard%2Fsrc%2Forg%2Fsimantics%2Fdataboard%2Fbinding%2Fimpl%2FDefaultMapBinding.java;h=c9d2288d211c9f1280ee526a778c8fad6be51940;hb=1dfc44ff89362fb4500ee9427432541b92d1953f;hp=43c1e97aa50589bc356dba8e325365259d21f52e;hpb=06718abb2b3cc780748553811c4857c165499809;p=simantics%2Fplatform.git

diff --git a/bundles/org.simantics.databoard/src/org/simantics/databoard/binding/impl/DefaultMapBinding.java b/bundles/org.simantics.databoard/src/org/simantics/databoard/binding/impl/DefaultMapBinding.java
index 43c1e97aa..c9d2288d2 100644
--- a/bundles/org.simantics.databoard/src/org/simantics/databoard/binding/impl/DefaultMapBinding.java
+++ b/bundles/org.simantics.databoard/src/org/simantics/databoard/binding/impl/DefaultMapBinding.java
@@ -1,326 +1,326 @@
-/*******************************************************************************
- *  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);
-        }
-    }
-}
+/*******************************************************************************
+ *  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);
+        }
+    }
+}