-/*******************************************************************************\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.List;\r
-import java.util.Map;\r
-import java.util.Set;\r
-import java.util.TreeSet;\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.binding.reflection.VoidBinding;\r
-import org.simantics.databoard.type.MapType;\r
-import org.simantics.databoard.type.RecordType;\r
-\r
-/**\r
- * Binds java.util.Set to Map(T, {})\r
- * \r
- * This binding accepts all java.util.Set instances, but instantiates\r
- * java.util.TreeSet objects.\r
- *\r
- * @author Reino Ruusu <reino.ruusu@vtt.fi>\r
- */\r
-@SuppressWarnings("unchecked")\r
-public class DefaultSetBinding extends MapBinding {\r
- \r
- public DefaultSetBinding(MapType mapType, Binding elementBinding) {\r
- super(mapType, elementBinding, VoidBinding.VOID_BINDING);\r
- }\r
- \r
- public DefaultSetBinding(Binding elementBinding) {\r
- super(new MapType(elementBinding.type(), RecordType.VOID_TYPE), elementBinding, VoidBinding.VOID_BINDING);\r
- }\r
-\r
- @Override\r
- public void clear(Object set) throws BindingException {\r
- Set<Object> _set = (Set<Object>) set;\r
- _set.clear();\r
- }\r
-\r
- @Override\r
- public boolean containsKey(Object set, Object key) throws BindingException {\r
- Set<Object> _set = (Set<Object>) set;\r
- return _set.contains(key);\r
- }\r
-\r
- @Override\r
- public boolean containsValue(Object set, Object value)\r
- throws BindingException {\r
- return false;\r
- }\r
-\r
- @Override\r
- public Object create() throws BindingException {\r
- return new TreeSet<Object>( keyBinding );\r
- }\r
-\r
- public Object create(Set<?> initialSet) throws BindingException {\r
- return initialSet;\r
- }\r
-\r
- @Override\r
- public Object create(Map<?, ?> initialMap) throws BindingException {\r
- Set<Object> result = new TreeSet<Object>( keyBinding );\r
- result.addAll(initialMap.keySet());\r
- return result;\r
- }\r
-\r
- @Override\r
- public Object create(Object[] keys, Object[] values)\r
- throws BindingException { \r
- Set<Object> result = new TreeSet<Object>( keyBinding );\r
- for (int i=0; i<keys.length; i++) {\r
- result.add( keys[i] );\r
- }\r
- return result;\r
- }\r
- \r
- @Override\r
- public Object create(List<Object> keys, List<Object> values) {\r
- Set<Object> result = new TreeSet<Object>( keyBinding );\r
- for (int i=0; i<keys.size(); i++)\r
- result.add(keys.get(i));\r
- return result;\r
- } \r
-\r
- @Override\r
- public Object get(Object set, Object key) throws BindingException {\r
- return null;\r
- }\r
- \r
- @Override\r
- public <K, V> void getAll(Object setFrom, Map<K, V> to) throws BindingException {\r
- Map<K, V> _to = (Map<K, V>) to;\r
- Set<K> _setFrom = (Set<K>) setFrom;\r
- for (K k : _setFrom)\r
- _to.put(k, null);\r
- }\r
-\r
- @Override\r
- public void getAll(Object setFrom, Object[] keys, Object[] values)\r
- throws BindingException {\r
- Set<Object> _setFrom = (Set<Object>) setFrom;\r
- int i=0;\r
- for (Object k : _setFrom) {\r
- keys[i] = k;\r
- values[i] = null;\r
- } \r
- }\r
-\r
- @Override\r
- public Object[] getKeys(Object set) throws BindingException {\r
- Set<Object> _set = (Set<Object>) set;\r
- return _set.toArray(new Object[_set.size()]);\r
- }\r
-\r
- @Override\r
- public void getKeys(Object set, Set<Object> keys) throws BindingException {\r
- Set<Object> s = (Set<Object>) set;\r
- keys.addAll(s);\r
- }\r
- \r
- @Override\r
- public Object[] getValues(Object set) throws BindingException {\r
- Set<Object> _set = (Set<Object>) set;\r
- return new Object[_set.size()];\r
- }\r
- \r
- @Override\r
- public int count(Object src, Object from, boolean fromInclusive, Object end, boolean endInclusive) throws BindingException {\r
- if (src instanceof TreeSet)\r
- return new TreeSetBinding(keyBinding).count(src, from, fromInclusive, end, endInclusive);\r
- else\r
- return new HashSetBinding(keyBinding).count(src, from, fromInclusive, end, endInclusive);\r
- }\r
- \r
- @Override\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
- return 0;\r
- }\r
-\r
- @Override\r
- public void put(Object set, Object key, Object value)\r
- throws BindingException {\r
- Set<Object> _set = (Set<Object>) set;\r
- if (value!=null) throw new BindingException("Cannot put non-null to a Set");\r
- _set.add(key);\r
- }\r
-\r
- public void putAll(Object setTo, Set<?> from) {\r
- Set<Object> _set = (Set<Object>) setTo;\r
- _set.addAll(from);\r
- }\r
- \r
- @Override\r
- public <K,V> void putAll(Object setTo, Map<K,V> from) throws BindingException {\r
- Set<Object> _set = (Set<Object>) setTo;\r
- _set.addAll(from.keySet());\r
- }\r
-\r
- @Override\r
- public Object remove(Object set, Object key) throws BindingException {\r
- Set<Object> _set = (Set<Object>) set;\r
- _set.remove(key);\r
- return null;\r
- }\r
-\r
- @Override\r
- public int size(Object set) throws BindingException {\r
- Set<Object> _set = (Set<Object>) set;\r
- return _set.size();\r
- }\r
-\r
- @Override\r
- public boolean isInstance(Object obj) {\r
- return obj instanceof Set;\r
- }\r
-\r
- @Override\r
- public Object getCeilingKey(Object set, Object key) {\r
- if (set instanceof TreeSet)\r
- return new TreeSetBinding(keyBinding).getCeilingKey(set, key);\r
- else\r
- return new HashSetBinding(keyBinding).getCeilingKey(set, key);\r
- }\r
-\r
- @Override\r
- public Object getFirstKey(Object set) {\r
- if (set instanceof TreeSet)\r
- return new TreeSetBinding(keyBinding).getFirstKey(set);\r
- else\r
- return new HashSetBinding(keyBinding).getFirstKey(set);\r
- }\r
-\r
- @Override\r
- public Object getFloorKey(Object set, Object key) {\r
- if (set instanceof TreeSet)\r
- return new TreeSetBinding(keyBinding).getFloorKey(set, key);\r
- else\r
- return new HashSetBinding(keyBinding).getFloorKey(set, key);\r
- }\r
-\r
- @Override\r
- public Object getHigherKey(Object set, Object key) {\r
- if (set instanceof TreeSet)\r
- return new TreeSetBinding(keyBinding).getHigherKey(set, key);\r
- else\r
- return new HashSetBinding(keyBinding).getHigherKey(set, key);\r
- }\r
-\r
- @Override\r
- public Object getLastKey(Object set) {\r
- if (set instanceof TreeSet)\r
- return new TreeSetBinding(keyBinding).getLastKey(set);\r
- else\r
- return new HashSetBinding(keyBinding).getLastKey(set);\r
- }\r
-\r
- @Override\r
- public Object getLowerKey(Object set, Object key) {\r
- if (set instanceof TreeSet)\r
- return new TreeSetBinding(keyBinding).getLowerKey(set, key);\r
- else\r
- return new HashSetBinding(keyBinding).getLowerKey(set, key);\r
- }\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.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.TreeSet;
+
+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.binding.reflection.VoidBinding;
+import org.simantics.databoard.type.MapType;
+import org.simantics.databoard.type.RecordType;
+
+/**
+ * Binds java.util.Set to Map(T, {})
+ *
+ * This binding accepts all java.util.Set instances, but instantiates
+ * java.util.TreeSet objects.
+ *
+ * @author Reino Ruusu <reino.ruusu@vtt.fi>
+ */
+@SuppressWarnings("unchecked")
+public class DefaultSetBinding extends MapBinding {
+
+ public DefaultSetBinding(MapType mapType, Binding elementBinding) {
+ super(mapType, elementBinding, VoidBinding.VOID_BINDING);
+ }
+
+ public DefaultSetBinding(Binding elementBinding) {
+ super(new MapType(elementBinding.type(), RecordType.VOID_TYPE), elementBinding, VoidBinding.VOID_BINDING);
+ }
+
+ @Override
+ public void clear(Object set) throws BindingException {
+ Set<Object> _set = (Set<Object>) set;
+ _set.clear();
+ }
+
+ @Override
+ public boolean containsKey(Object set, Object key) throws BindingException {
+ Set<Object> _set = (Set<Object>) set;
+ return _set.contains(key);
+ }
+
+ @Override
+ public boolean containsValue(Object set, Object value)
+ throws BindingException {
+ return false;
+ }
+
+ @Override
+ public Object create() throws BindingException {
+ return new TreeSet<Object>( keyBinding );
+ }
+
+ public Object create(Set<?> initialSet) throws BindingException {
+ return initialSet;
+ }
+
+ @Override
+ public Object create(Map<?, ?> initialMap) throws BindingException {
+ Set<Object> result = new TreeSet<Object>( keyBinding );
+ result.addAll(initialMap.keySet());
+ return result;
+ }
+
+ @Override
+ public Object create(Object[] keys, Object[] values)
+ throws BindingException {
+ Set<Object> result = new TreeSet<Object>( keyBinding );
+ for (int i=0; i<keys.length; i++) {
+ result.add( keys[i] );
+ }
+ return result;
+ }
+
+ @Override
+ public Object create(List<Object> keys, List<Object> values) {
+ Set<Object> result = new TreeSet<Object>( keyBinding );
+ for (int i=0; i<keys.size(); i++)
+ result.add(keys.get(i));
+ return result;
+ }
+
+ @Override
+ public Object get(Object set, Object key) throws BindingException {
+ return null;
+ }
+
+ @Override
+ public <K, V> void getAll(Object setFrom, Map<K, V> to) throws BindingException {
+ Map<K, V> _to = (Map<K, V>) to;
+ Set<K> _setFrom = (Set<K>) setFrom;
+ for (K k : _setFrom)
+ _to.put(k, null);
+ }
+
+ @Override
+ public void getAll(Object setFrom, Object[] keys, Object[] values)
+ throws BindingException {
+ Set<Object> _setFrom = (Set<Object>) setFrom;
+ int i=0;
+ for (Object k : _setFrom) {
+ keys[i] = k;
+ values[i] = null;
+ i++;
+ }
+ }
+
+ @Override
+ public Object[] getKeys(Object set) throws BindingException {
+ Set<Object> _set = (Set<Object>) set;
+ return _set.toArray(new Object[_set.size()]);
+ }
+
+ @Override
+ public void getKeys(Object set, Set<Object> keys) throws BindingException {
+ Set<Object> s = (Set<Object>) set;
+ keys.addAll(s);
+ }
+
+ @Override
+ public Object[] getValues(Object set) throws BindingException {
+ Set<Object> _set = (Set<Object>) set;
+ return new Object[_set.size()];
+ }
+
+ @Override
+ public int count(Object src, Object from, boolean fromInclusive, Object end, boolean endInclusive) throws BindingException {
+ if (src instanceof TreeSet)
+ return new TreeSetBinding(keyBinding).count(src, from, fromInclusive, end, endInclusive);
+ else
+ return new HashSetBinding(keyBinding).count(src, from, fromInclusive, end, endInclusive);
+ }
+
+ @Override
+ 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 {
+ return 0;
+ }
+
+ @Override
+ public void put(Object set, Object key, Object value)
+ throws BindingException {
+ Set<Object> _set = (Set<Object>) set;
+ if (value!=null) throw new BindingException("Cannot put non-null to a Set");
+ _set.add(key);
+ }
+
+ public void putAll(Object setTo, Set<?> from) {
+ Set<Object> _set = (Set<Object>) setTo;
+ _set.addAll(from);
+ }
+
+ @Override
+ public <K,V> void putAll(Object setTo, Map<K,V> from) throws BindingException {
+ Set<Object> _set = (Set<Object>) setTo;
+ _set.addAll(from.keySet());
+ }
+
+ @Override
+ public Object remove(Object set, Object key) throws BindingException {
+ Set<Object> _set = (Set<Object>) set;
+ _set.remove(key);
+ return null;
+ }
+
+ @Override
+ public int size(Object set) throws BindingException {
+ Set<Object> _set = (Set<Object>) set;
+ return _set.size();
+ }
+
+ @Override
+ public boolean isInstance(Object obj) {
+ return obj instanceof Set;
+ }
+
+ @Override
+ public Object getCeilingKey(Object set, Object key) {
+ if (set instanceof TreeSet)
+ return new TreeSetBinding(keyBinding).getCeilingKey(set, key);
+ else
+ return new HashSetBinding(keyBinding).getCeilingKey(set, key);
+ }
+
+ @Override
+ public Object getFirstKey(Object set) {
+ if (set instanceof TreeSet)
+ return new TreeSetBinding(keyBinding).getFirstKey(set);
+ else
+ return new HashSetBinding(keyBinding).getFirstKey(set);
+ }
+
+ @Override
+ public Object getFloorKey(Object set, Object key) {
+ if (set instanceof TreeSet)
+ return new TreeSetBinding(keyBinding).getFloorKey(set, key);
+ else
+ return new HashSetBinding(keyBinding).getFloorKey(set, key);
+ }
+
+ @Override
+ public Object getHigherKey(Object set, Object key) {
+ if (set instanceof TreeSet)
+ return new TreeSetBinding(keyBinding).getHigherKey(set, key);
+ else
+ return new HashSetBinding(keyBinding).getHigherKey(set, key);
+ }
+
+ @Override
+ public Object getLastKey(Object set) {
+ if (set instanceof TreeSet)
+ return new TreeSetBinding(keyBinding).getLastKey(set);
+ else
+ return new HashSetBinding(keyBinding).getLastKey(set);
+ }
+
+ @Override
+ public Object getLowerKey(Object set, Object key) {
+ if (set instanceof TreeSet)
+ return new TreeSetBinding(keyBinding).getLowerKey(set, key);
+ else
+ return new HashSetBinding(keyBinding).getLowerKey(set, key);
+ }
+
+}
+