1 /*******************************************************************************
\r
2 * Copyright (c) 2010 Association for Decentralized Information Management in
\r
4 * All rights reserved. This program and the accompanying materials
\r
5 * are made available under the terms of the Eclipse Public License v1.0
\r
6 * which accompanies this distribution, and is available at
\r
7 * http://www.eclipse.org/legal/epl-v10.html
\r
10 * VTT Technical Research Centre of Finland - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.databoard.binding.impl;
\r
14 import java.util.List;
\r
15 import java.util.Map;
\r
16 import java.util.Set;
\r
17 import java.util.TreeSet;
\r
19 import org.simantics.databoard.binding.ArrayBinding;
\r
20 import org.simantics.databoard.binding.Binding;
\r
21 import org.simantics.databoard.binding.MapBinding;
\r
22 import org.simantics.databoard.binding.error.BindingException;
\r
23 import org.simantics.databoard.binding.reflection.VoidBinding;
\r
24 import org.simantics.databoard.type.MapType;
\r
25 import org.simantics.databoard.type.RecordType;
\r
28 * Binds java.util.Set to Map(T, {})
\r
30 * This binding accepts all java.util.Set instances, but instantiates
\r
31 * java.util.TreeSet objects.
\r
33 * @author Reino Ruusu <reino.ruusu@vtt.fi>
\r
35 @SuppressWarnings("unchecked")
\r
36 public class DefaultSetBinding extends MapBinding {
\r
38 public DefaultSetBinding(MapType mapType, Binding elementBinding) {
\r
39 super(mapType, elementBinding, VoidBinding.VOID_BINDING);
\r
42 public DefaultSetBinding(Binding elementBinding) {
\r
43 super(new MapType(elementBinding.type(), RecordType.VOID_TYPE), elementBinding, VoidBinding.VOID_BINDING);
\r
47 public void clear(Object set) throws BindingException {
\r
48 Set<Object> _set = (Set<Object>) set;
\r
53 public boolean containsKey(Object set, Object key) throws BindingException {
\r
54 Set<Object> _set = (Set<Object>) set;
\r
55 return _set.contains(key);
\r
59 public boolean containsValue(Object set, Object value)
\r
60 throws BindingException {
\r
65 public Object create() throws BindingException {
\r
66 return new TreeSet<Object>( keyBinding );
\r
69 public Object create(Set<?> initialSet) throws BindingException {
\r
74 public Object create(Map<?, ?> initialMap) throws BindingException {
\r
75 Set<Object> result = new TreeSet<Object>( keyBinding );
\r
76 result.addAll(initialMap.keySet());
\r
81 public Object create(Object[] keys, Object[] values)
\r
82 throws BindingException {
\r
83 Set<Object> result = new TreeSet<Object>( keyBinding );
\r
84 for (int i=0; i<keys.length; i++) {
\r
85 result.add( keys[i] );
\r
91 public Object create(List<Object> keys, List<Object> values) {
\r
92 Set<Object> result = new TreeSet<Object>( keyBinding );
\r
93 for (int i=0; i<keys.size(); i++)
\r
94 result.add(keys.get(i));
\r
99 public Object get(Object set, Object key) throws BindingException {
\r
104 public <K, V> void getAll(Object setFrom, Map<K, V> to) throws BindingException {
\r
105 Map<K, V> _to = (Map<K, V>) to;
\r
106 Set<K> _setFrom = (Set<K>) setFrom;
\r
107 for (K k : _setFrom)
\r
112 public void getAll(Object setFrom, Object[] keys, Object[] values)
\r
113 throws BindingException {
\r
114 Set<Object> _setFrom = (Set<Object>) setFrom;
\r
116 for (Object k : _setFrom) {
\r
123 public Object[] getKeys(Object set) throws BindingException {
\r
124 Set<Object> _set = (Set<Object>) set;
\r
125 return _set.toArray(new Object[_set.size()]);
\r
129 public void getKeys(Object set, Set<Object> keys) throws BindingException {
\r
130 Set<Object> s = (Set<Object>) set;
\r
135 public Object[] getValues(Object set) throws BindingException {
\r
136 Set<Object> _set = (Set<Object>) set;
\r
137 return new Object[_set.size()];
\r
141 public int count(Object src, Object from, boolean fromInclusive, Object end, boolean endInclusive) throws BindingException {
\r
142 if (src instanceof TreeSet)
\r
143 return new TreeSetBinding(keyBinding).count(src, from, fromInclusive, end, endInclusive);
\r
145 return new HashSetBinding(keyBinding).count(src, from, fromInclusive, end, endInclusive);
\r
149 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
154 public void put(Object set, Object key, Object value)
\r
155 throws BindingException {
\r
156 Set<Object> _set = (Set<Object>) set;
\r
157 if (value!=null) throw new BindingException("Cannot put non-null to a Set");
\r
161 public void putAll(Object setTo, Set<?> from) {
\r
162 Set<Object> _set = (Set<Object>) setTo;
\r
167 public <K,V> void putAll(Object setTo, Map<K,V> from) throws BindingException {
\r
168 Set<Object> _set = (Set<Object>) setTo;
\r
169 _set.addAll(from.keySet());
\r
173 public Object remove(Object set, Object key) throws BindingException {
\r
174 Set<Object> _set = (Set<Object>) set;
\r
180 public int size(Object set) throws BindingException {
\r
181 Set<Object> _set = (Set<Object>) set;
\r
182 return _set.size();
\r
186 public boolean isInstance(Object obj) {
\r
187 return obj instanceof Set;
\r
191 public Object getCeilingKey(Object set, Object key) {
\r
192 if (set instanceof TreeSet)
\r
193 return new TreeSetBinding(keyBinding).getCeilingKey(set, key);
\r
195 return new HashSetBinding(keyBinding).getCeilingKey(set, key);
\r
199 public Object getFirstKey(Object set) {
\r
200 if (set instanceof TreeSet)
\r
201 return new TreeSetBinding(keyBinding).getFirstKey(set);
\r
203 return new HashSetBinding(keyBinding).getFirstKey(set);
\r
207 public Object getFloorKey(Object set, Object key) {
\r
208 if (set instanceof TreeSet)
\r
209 return new TreeSetBinding(keyBinding).getFloorKey(set, key);
\r
211 return new HashSetBinding(keyBinding).getFloorKey(set, key);
\r
215 public Object getHigherKey(Object set, Object key) {
\r
216 if (set instanceof TreeSet)
\r
217 return new TreeSetBinding(keyBinding).getHigherKey(set, key);
\r
219 return new HashSetBinding(keyBinding).getHigherKey(set, key);
\r
223 public Object getLastKey(Object set) {
\r
224 if (set instanceof TreeSet)
\r
225 return new TreeSetBinding(keyBinding).getLastKey(set);
\r
227 return new HashSetBinding(keyBinding).getLastKey(set);
\r
231 public Object getLowerKey(Object set, Object key) {
\r
232 if (set instanceof TreeSet)
\r
233 return new TreeSetBinding(keyBinding).getLowerKey(set, key);
\r
235 return new HashSetBinding(keyBinding).getLowerKey(set, key);
\r