--- /dev/null
+/*******************************************************************************\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;
+
+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
+
+/**
+ * Binds java.util.TreeSet to Map(T, {})
+ *
+ * @author Toni Kalajainen <toni.kalajainen@vtt.fi>
+ */\r
+@SuppressWarnings("unchecked")
+public class TreeSetBinding extends MapBinding {
+
+ public TreeSetBinding(MapType mapType, Binding elementBinding) {
+ super(mapType, elementBinding, VoidBinding.VOID_BINDING);
+ }
+
+ public TreeSetBinding(Binding elementBinding) {
+ super(new MapType(elementBinding.type(), RecordType.VOID_TYPE), elementBinding, VoidBinding.VOID_BINDING);
+ }
+
+ @Override
+ public void clear(Object set) throws BindingException {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ _set.clear();
+ }
+
+ @Override
+ public boolean containsKey(Object set, Object key) throws BindingException {
+ TreeSet<Object> _set = (TreeSet<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>( getKeyBinding() );
+ }
+
+ public Object create(Set<?> initialSet) throws BindingException {
+ TreeSet<Object> result = new TreeSet<Object>(getKeyBinding());
+ result.addAll(initialSet);
+ return result;
+ }
+
+ @Override
+ public Object create(Map<?, ?> initialMap) throws BindingException {
+ TreeSet<Object> result = new TreeSet<Object>( getKeyBinding() );
+ result.addAll(initialMap.keySet());
+ return result;
+ }
+
+ @Override
+ public Object create(Object[] keys, Object[] values)
+ throws BindingException {
+ TreeSet<Object> result = new TreeSet<Object>( getKeyBinding() );
+ for (int i=0; i<keys.length; i++) {
+ result.add( keys[i] );
+ }
+ return result;
+ }
+
+ @Override
+ public Object create(List<Object> keys, List<Object> values) {
+ TreeSet<Object> result = new TreeSet<Object>( getKeyBinding() );
+ 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;
+ }\r
+
+ @Override
+ public <K, V> void getAll(Object setFrom, Map<K, V> to) throws BindingException {
+ Map<K, V> _to = (Map<K, V>) to;
+ TreeSet<K> _setFrom = (TreeSet<K>) setFrom;
+ for (K k : _setFrom)
+ _to.put(k, null);
+ }
+
+ @Override
+ public void getAll(Object setFrom, Object[] keys, Object[] values)
+ throws BindingException {
+ TreeSet<Object> _setFrom = (TreeSet<Object>) setFrom;
+ int i=0;
+ for (Object k : _setFrom) {
+ keys[i] = k;
+ values[i] = null;
+ }
+ }
+
+ @Override
+ public Object[] getKeys(Object set) throws BindingException {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.toArray(new Object[_set.size()]);
+ }
+
+ @Override
+ public void getKeys(Object set, Set<Object> keys) throws BindingException {
+ TreeSet<Object> s = (TreeSet<Object>) set;
+ keys.addAll(s);
+ }\r
+ \r
+ @Override\r
+ public Object[] getValues(Object set) throws BindingException {\r
+ TreeSet<Object> _set = (TreeSet<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
+ TreeSet<Object> m = (TreeSet<Object>) src; \r
+ Set<Object> sm = m.subSet(from, fromInclusive, end, endInclusive);\r
+ return sm.size();\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
+ }
+
+ @Override
+ public void put(Object set, Object key, Object value)
+ throws BindingException {
+ TreeSet<Object> _set = (TreeSet<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) {
+ TreeSet<Object> _set = (TreeSet<Object>) setTo;
+ _set.addAll(from);
+ }
+
+ @Override
+ public <K,V> void putAll(Object setTo, Map<K,V> from) throws BindingException {
+ TreeSet<Object> _set = (TreeSet<Object>) setTo;
+ _set.addAll(from.keySet());
+ }
+
+ @Override
+ public Object remove(Object set, Object key) throws BindingException {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ _set.remove(key);
+ return null;
+ }
+
+ @Override
+ public int size(Object set) throws BindingException {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.size();
+ }
+
+ @Override
+ public boolean isInstance(Object obj) {
+ return obj instanceof TreeSet;
+ }
+
+ @Override
+ public Object getCeilingKey(Object set, Object key) {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.ceiling(key);
+ }
+
+ @Override
+ public Object getFirstKey(Object set) {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.first();
+ }
+
+ @Override
+ public Object getFloorKey(Object set, Object key) {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.floor(key);
+ }
+
+ @Override
+ public Object getHigherKey(Object set, Object key) {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.higher(key);
+ }
+
+ @Override
+ public Object getLastKey(Object set) {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.last();
+ }
+
+ @Override
+ public Object getLowerKey(Object set, Object key) {
+ TreeSet<Object> _set = (TreeSet<Object>) set;
+ return _set.lower(key);
+ }
+
+
+}
+
Code Review / simantics / platform.git / blobdiff