--- /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.accessor.binary;\r
+\r
+import java.io.IOException;\r
+import java.lang.ref.WeakReference;\r
+import java.util.Collection;\r
+import java.util.HashMap;\r
+import java.util.Map;\r
+import java.util.Map.Entry;\r
+import java.util.SortedMap;\r
+import java.util.TreeMap;\r
+\r
+import org.simantics.databoard.Bindings;\r
+import org.simantics.databoard.accessor.Accessor;\r
+import org.simantics.databoard.accessor.ArrayAccessor;\r
+import org.simantics.databoard.accessor.CloseableAccessor;\r
+import org.simantics.databoard.accessor.StreamAccessor;\r
+import org.simantics.databoard.accessor.error.AccessorConstructionException;\r
+import org.simantics.databoard.accessor.error.AccessorException;\r
+import org.simantics.databoard.accessor.error.ReferenceException;\r
+import org.simantics.databoard.accessor.event.ArrayElementAdded;\r
+import org.simantics.databoard.accessor.event.ArrayElementRemoved;\r
+import org.simantics.databoard.accessor.event.Event;\r
+import org.simantics.databoard.accessor.event.ValueAssigned;\r
+import org.simantics.databoard.accessor.file.FileArrayAccessor;\r
+import org.simantics.databoard.accessor.impl.AccessorParams;\r
+import org.simantics.databoard.accessor.impl.ListenerEntry;\r
+import org.simantics.databoard.accessor.interestset.ArrayInterestSet;\r
+import org.simantics.databoard.accessor.interestset.InterestSet;\r
+import org.simantics.databoard.accessor.reference.ChildReference;\r
+import org.simantics.databoard.accessor.reference.IndexReference;\r
+import org.simantics.databoard.accessor.reference.LabelReference;\r
+import org.simantics.databoard.adapter.AdaptException;\r
+import org.simantics.databoard.binding.ArrayBinding;\r
+import org.simantics.databoard.binding.Binding;\r
+import org.simantics.databoard.binding.error.BindingException;\r
+import org.simantics.databoard.binding.mutable.MutableVariant;\r
+import org.simantics.databoard.serialization.Serializer;\r
+import org.simantics.databoard.serialization.SerializerConstructionException;\r
+import org.simantics.databoard.type.ArrayType;\r
+import org.simantics.databoard.type.Datatype;\r
+import org.simantics.databoard.type.LongType;\r
+import org.simantics.databoard.util.binary.Blob;\r
+import org.simantics.databoard.util.binary.RandomAccessBinary.ByteSide;\r
+\r
+/**\r
+ * Binary Array is accessor to a byte backed array of elements.\r
+ * <p>\r
+ * \r
+ * Note, To increase the random access performance of the record, create sub-accessors of\r
+ * its fields. \r
+ *\r
+ * @author Toni Kalajainen <toni.kalajainen@vtt.fi>\r
+ */\r
+public class BinaryVariableWidthStreamArray extends BinaryObject implements ArrayAccessor, FileArrayAccessor, ArrayAccessor.CloseableArrayAccessor, StreamAccessor {\r
+\r
+ /** Accessors to children */\r
+ TreeMap<Integer, java.lang.ref.Reference<BinaryObject>> children = new TreeMap<Integer, java.lang.ref.Reference<BinaryObject>>(); \r
+\r
+ Binding cb;\r
+ Serializer cs;\r
+ Integer constantSize;\r
+ ArrayAccessor index;\r
+ \r
+ public BinaryVariableWidthStreamArray(BinaryObject parent, Blob blob, Datatype type, AccessorParams params, ArrayAccessor index) \r
+ throws AccessorConstructionException\r
+ {\r
+ super(parent, blob, type, params);\r
+ ArrayType at = (ArrayType) type;\r
+ cb = params.bindingScheme.getBindingUnchecked(at.componentType);\r
+ cs = params.serializerScheme.getSerializerUnchecked( cb );\r
+ constantSize = cs.getConstantSize();\r
+ if (index==null || index.type().componentType instanceof LongType == false) {\r
+ throw new AccessorConstructionException("Index must be Long[]");\r
+ }\r
+ this.index = index;\r
+ }\r
+ \r
+ public ArrayType type() {\r
+ return (ArrayType) type;\r
+ }\r
+ \r
+ /**\r
+ * Get existing sub accessor\r
+ * @param index\r
+ * @return sub-accessor or <code>null</code>\r
+ */\r
+ BinaryObject getExistingAccessor(int index)\r
+ { \r
+ java.lang.ref.Reference<BinaryObject> ref = children.get(index);\r
+ if (ref==null) return null;\r
+ BinaryObject res = (BinaryObject) ref.get();\r
+// if (res==null) children.remove(index);\r
+ return res;\r
+ } \r
+ \r
+ /**\r
+ * Get start position of a field\r
+ * \r
+ * @param fieldIndex\r
+ * @return\r
+ * @throws AccessorException\r
+ */\r
+ long getStartPosition(int fieldIndex) throws AccessorException {\r
+ int c = this.index.size();\r
+ if ( fieldIndex==c )\r
+ try {\r
+ return b.length();\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ }\r
+ if ( fieldIndex>c || fieldIndex<0 ) throw new AccessorException("Index out of bounds");\r
+ return (Long) index.get(fieldIndex, Bindings.LONG);\r
+ } \r
+ \r
+ long getLength(int index, long pos) throws AccessorException {\r
+ int c = this.index.size();\r
+ if ( index>=c || index<0 ) return 0;\r
+ if ( index==c-1 ) \r
+ {\r
+ try {\r
+ return b.length() - (Long) this.index.get(c-1, Bindings.LONG);\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ }\r
+ } else {\r
+ return (Long) this.index.get(index+1, Bindings.LONG) - (Long) this.index.get(index, Bindings.LONG);\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void setNoflush(int index, Binding rcb, Object rcv)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ \r
+ writeLock();\r
+ try {\r
+\r
+ int count = size();\r
+ if ( index==count ) {\r
+ addNoflush(count, rcb, rcv);\r
+ return;\r
+ } \r
+ \r
+ // Write \r
+ Serializer rcs = params.serializerScheme.getSerializer( rcb );\r
+ long pos = getStartPosition(index);\r
+ long oldSize = getLength(index, pos);\r
+ long newSize = rcs.getSize(rcv, null);\r
+ b.position(pos);\r
+ long diff = newSize - oldSize; \r
+ if (diff>0) {\r
+ b.insertBytes( newSize - oldSize, ByteSide.Right );\r
+ } else if (diff<0) { \r
+ b.removeBytes( oldSize - newSize, ByteSide.Right );\r
+ }\r
+ b.position(pos);\r
+ rcs.serialize(b, null, rcv);\r
+\r
+ // Update index of the higher indices\r
+ if ( diff!= 0 ) {\r
+ for (int i=index+1; i<count; i++) {\r
+ long p = (Long) this.index.get(i, Bindings.LONG);\r
+ p += diff;\r
+ this.index.set(i, Bindings.LONG, p);\r
+ }\r
+ }\r
+ \r
+ // Update Blobs\r
+ /*\r
+ BinaryObject sa = getExistingAccessor(index);\r
+ if (sa!=null && newSize != oldSize) {\r
+ sa.b.setPositionInSource(pos, newSize);\r
+ }*/\r
+ \r
+ // Shift consecutive blobs \r
+/* if (!children.isEmpty()) {\r
+ Integer lastKey = children.lastKey();\r
+ if (lastKey!=null && index+1 <= lastKey && diff!=0) {\r
+ SortedMap<Integer, Reference<BinaryObject>> pm = children.subMap(index+1, true, lastKey, true);\r
+ for (Entry<Integer, Reference<BinaryObject>> e : pm.entrySet()) {\r
+ BinaryObject sa_ = e.getValue().get();\r
+ if (sa_ == null) continue;\r
+ sa_.b.setPositionInSource( sa_.b.getStartPositionInSourceBinary() + diff, sa_.b.length());\r
+ }\r
+ }\r
+ }*/\r
+ \r
+ // Notify\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+ if (is.inNotificationsOf(index)) {\r
+ MutableVariant newValue = null;\r
+ if (is.inValues()) newValue = new MutableVariant(rcb, rcb.isImmutable() ? rcv : rcb.clone(rcv)); \r
+ \r
+ Event e = new ValueAssigned(new IndexReference(index), newValue);\r
+ emitEvent(le, e);\r
+ }\r
+ le = le.next;\r
+ }\r
+ \r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } catch (AdaptException e) {\r
+ throw new AccessorException(e);\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException(e);\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ \r
+ }\r
+ \r
+ /**\r
+ * Set all values\r
+ * \r
+ * @param arrayBinding\r
+ * @param newArray\r
+ */\r
+ @Override\r
+ public void setValueNoflush(Binding arrayBinding, Object newArray)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ // Write \r
+ ArrayBinding rb = ((ArrayBinding)arrayBinding);\r
+ Binding rcb = rb.getComponentBinding();\r
+ Serializer rcs = params.serializerScheme.getSerializer( rcb );\r
+ int oldCount = index.size();\r
+ int newCount = rb.size(newArray); \r
+ b.setLength( params.serializerScheme.getSerializer( rb ).getSize(newArray) );\r
+ index.setSize(newCount);\r
+ \r
+ // Serialize\r
+ for (int index=0; index<newCount; index++) {\r
+ //long startPos = b.position();\r
+ Object obj = rb.get(newArray, index);\r
+ this.index.set(index, Bindings.LONG, b.position());\r
+ rcs.serialize(b, obj);\r
+ //long endPos = b.position();\r
+ //long len = endPos - startPos;\r
+ \r
+ // update location\r
+ /*\r
+ BinaryObject sa = getExistingAccessor(index);\r
+ if (sa!=null) {\r
+ sa.b.setPositionInSource(startPos, len);\r
+ }*/\r
+ }\r
+ \r
+ // Notify removal\r
+ for (int index=oldCount-1; index>=newCount; index--) {\r
+ BinaryObject sa = getExistingAccessor(index);\r
+ if (sa!=null) {\r
+ sa.invalidatedNotification();\r
+ children.remove(index);\r
+ sa = null;\r
+ }\r
+ \r
+ // Notify changes\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+ if (is.inNotificationsOf(index)) {\r
+ Event e = new ArrayElementRemoved(index);\r
+ emitEvent(le, e);\r
+ }\r
+ le = le.next;\r
+ }\r
+ }\r
+ \r
+ // Notify new assignment\r
+ if (listeners!=null) {\r
+ for (int index=0; index<newCount; index++) {\r
+ Object cv = rb.get(newArray, index);\r
+ \r
+ // Notify changes\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+ if (is.inNotificationsOf(index)) { \r
+ MutableVariant vv = null;\r
+ if (is.inValues()) vv = new MutableVariant(rcb, cb.isImmutable() ? cv : rcb.clone(cv)); \r
+ \r
+ Event e = index<oldCount ? new ValueAssigned(new IndexReference(index), vv) : new ArrayElementAdded(index, vv);\r
+ emitEvent(le, e);\r
+ }\r
+ le = le.next;\r
+ } \r
+ }\r
+ }\r
+ \r
+ } catch (BindingException e) {\r
+ throw new AccessorException(e);\r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } catch (AdaptException e) {\r
+ throw new AccessorException(e);\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException(e);\r
+ } finally {\r
+ writeUnlock(); \r
+ }\r
+ \r
+ }\r
+\r
+ @Override\r
+ public void addNoflush(int index, Binding rcb, Object rcv) throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ Serializer rcs = params.serializerScheme.getSerializer( rcb ); \r
+ // Write \r
+ int oldCount = this.index.size();\r
+ int newCount = oldCount+1;\r
+ boolean lastEntry = index == oldCount;\r
+ if (index>oldCount) throw new AccessorException("Index out of range");\r
+ \r
+ long pos = getStartPosition(index);\r
+ int size = rcs.getSize(rcv);\r
+ b.position(pos);\r
+ b.insertBytes(size, ByteSide.Left);\r
+ rcs.serialize(b, null, rcv);\r
+ \r
+ this.index.add(index, Bindings.LONG, pos);\r
+ \r
+ for (int i=index+1; i<newCount; i++) {\r
+ long p = (Long) this.index.get(i, Bindings.LONG);\r
+ p += size;\r
+ this.index.set(i, Bindings.LONG, p);\r
+ }\r
+ \r
+ \r
+ // Update child map keys\r
+ if (!lastEntry && !children.isEmpty()) {\r
+ Integer key = children.lastKey();\r
+ while (key != null && key >= index) {\r
+ java.lang.ref.Reference<BinaryObject> value = children.remove(key);\r
+ if (value.get()!=null) children.put(key+1, value);\r
+ key = children.lowerKey(key);\r
+ }\r
+ }\r
+ \r
+ // Notify Listeners\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+ if (is.inNotifications()) {\r
+ MutableVariant newValue = null;\r
+ if (is.inValues()) newValue = new MutableVariant(rcb, rcb.isImmutable() ? rcv : rcb.clone(rcv)); \r
+ ArrayElementAdded e = new ArrayElementAdded(index, newValue);\r
+ emitEvent(le, e);\r
+ }\r
+ \r
+ // Update indices of interest sets\r
+ if (is.componentInterests!=null) {\r
+ Map<Integer, InterestSet> oldCis = is.componentInterests;\r
+ boolean needUpdates = false;\r
+ for (Integer i : oldCis.keySet()) {\r
+ needUpdates |= i>=index;\r
+ if (needUpdates) break;\r
+ }\r
+ \r
+ if (needUpdates) {\r
+ Map<Integer, InterestSet> newCis = new HashMap<Integer, InterestSet>(oldCis.size()); \r
+ for (Integer i : oldCis.keySet())\r
+ {\r
+ Integer oldKey = i;\r
+ Integer newKey = i>=index ? i+1 : i;\r
+ InterestSet oldValue = oldCis.get(oldKey);\r
+ newCis.put(newKey, oldValue); \r
+ }\r
+ is.componentInterests = newCis;\r
+ }\r
+ }\r
+ \r
+ // Add component interest listener\r
+ /*\r
+ boolean hadSa = getExistingAccessor(index) != null; \r
+ if (!hadSa) {\r
+ // Add component interest listener\r
+ InterestSet cis = is.getComponentInterest(); \r
+ if (cis != null) {\r
+ Accessor sa = getAccessor(index);\r
+ } \r
+ cis = is.getComponentInterest(index); \r
+ if (cis != null) {\r
+ Accessor sa = getAccessor(index);\r
+ }\r
+ } */ \r
+ \r
+ le = le.next;\r
+ }\r
+ \r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } catch (AdaptException e) {\r
+ throw new AccessorException(e);\r
+ } catch (SerializerConstructionException e) { \r
+ throw new AccessorException(e);\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void addNoflush(Binding binding, Object value)\r
+ throws AccessorException {\r
+ addNoflush(size(), binding, value);\r
+ }\r
+\r
+ @Override\r
+ public void addAllNoflush(Binding binding, Object[] values)\r
+ throws AccessorException {\r
+ addAllNoflush(size(), binding, values);\r
+ }\r
+\r
+ @Override\r
+ public void addAllNoflush(int index, Binding rcb, Object[] rcvs)\r
+ throws AccessorException {\r
+ if (index<0||index>size()) throw new AccessorException("Index out of bounds");\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ Serializer rcs = params.serializerScheme.getSerializer( rcb ); \r
+ // Write \r
+ b.position(0L);\r
+ int repeatCount = rcvs.length;\r
+ int oldCount = b.readInt();\r
+ int newCount = oldCount + rcvs.length;\r
+ if (index>oldCount) throw new AccessorException("Index out of range");\r
+ boolean lastEntry = index == oldCount;\r
+ \r
+ long size = 0;\r
+ for (int i=0; i<rcvs.length; i++)\r
+ size += rcs.getSize(rcvs[i]);\r
+ long pos = getStartPosition(index);\r
+ b.position(pos);\r
+ b.insertBytes(size, ByteSide.Right);\r
+\r
+ long p = pos;\r
+ for (int i=0; i<repeatCount; i++) {\r
+ this.index.add(index+i, Bindings.LONG, (Long) p);\r
+ p += rcs.getSize(rcvs[i]);\r
+ }\r
+ for (int i=index+repeatCount; i<newCount; i++) {\r
+ p = (Long) this.index.get(i, Bindings.LONG);\r
+ p += size;\r
+ this.index.set(i, Bindings.LONG, p);\r
+ }\r
+ \r
+ b.position(pos);\r
+ for (int i=0; i<rcvs.length; i++) {\r
+ Object rcv = rcvs[i];\r
+ rcs.serialize(b, rcv); \r
+ }\r
+ \r
+ // Update child map keys\r
+ if (!lastEntry && !children.isEmpty()) {\r
+ Integer key = children.lastKey();\r
+ while (key!=null && key >= index) {\r
+ java.lang.ref.Reference<BinaryObject> value = children.remove(key);\r
+ if (value.get()!=null) children.put(key+rcvs.length, value);\r
+ key = children.lowerKey(key);\r
+ }\r
+ }\r
+ \r
+ // Notify Listeners\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+ if (is.inNotifications()) {\r
+ for (int i=0; i<rcvs.length; i++) {\r
+ MutableVariant newValue = null;\r
+ if (is.inValues()) newValue = new MutableVariant(rcb, rcb.isImmutable() ? rcvs[i] : cb.clone(rcvs[i])); \r
+ ArrayElementAdded e = new ArrayElementAdded(index, newValue);\r
+ emitEvent(le, e);\r
+ }\r
+ }\r
+ \r
+ // Update indices of interest sets\r
+ if (is.componentInterests!=null) {\r
+ Map<Integer, InterestSet> oldCis = is.componentInterests;\r
+ boolean needUpdates = false;\r
+ for (Integer i : oldCis.keySet()) {\r
+ needUpdates |= i>=index;\r
+ if (needUpdates) break;\r
+ }\r
+ \r
+ if (needUpdates) {\r
+ Map<Integer, InterestSet> newCis = new HashMap<Integer, InterestSet>(oldCis.size()); \r
+ for (Integer i : oldCis.keySet())\r
+ {\r
+ Integer oldKey = i;\r
+ Integer newKey = i>=index ? i+rcvs.length : i;\r
+ InterestSet oldValue = oldCis.get(oldKey);\r
+ newCis.put(newKey, oldValue); \r
+ }\r
+ is.componentInterests = newCis;\r
+ }\r
+ \r
+ // Add component interest listener\r
+ /*\r
+ for (int i = index; i<index+rcvs.length; i++) {\r
+ boolean hadSa = getExistingAccessor(i)!=null;\r
+ if (hadSa) continue;\r
+ \r
+ InterestSet cis = is.getComponentInterest(); \r
+ if (cis != null) {\r
+ Accessor sa = getAccessor(i);\r
+ } \r
+ cis = is.getComponentInterest(index); \r
+ if (cis != null) {\r
+ Accessor sa = getAccessor(i);\r
+ }\r
+ }\r
+ */\r
+ \r
+ }\r
+ \r
+ le = le.next;\r
+ }\r
+ \r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } catch (AdaptException e) {\r
+ throw new AccessorException(e);\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException(e);\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+\r
+ void addRepeatNoflush(int index, Binding rcb, Object obj, int repeatCount) throws AccessorException {\r
+ if (index<0||index>size()) throw new AccessorException("Index out of bounds");\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ Serializer rcs = params.serializerScheme.getSerializer( rcb ); \r
+ // Write \r
+ b.position(0L);\r
+ int oldCount = this.index.size();\r
+ int newCount = oldCount + repeatCount;\r
+ if (index>oldCount) throw new AccessorException("Index out of range");\r
+ boolean lastEntry = index == oldCount;\r
+ \r
+ long componentSize = rcs.getSize(obj);\r
+ long size = componentSize * repeatCount;\r
+ long pos = getStartPosition(index);\r
+ b.position(pos);\r
+ b.insertBytes(size, ByteSide.Right);\r
+ long p = pos;\r
+ for (int i=0; i<repeatCount; i++) {\r
+ this.index.add(index+i, Bindings.LONG, (Long) p);\r
+ pos += componentSize;\r
+ }\r
+ for (int i=index+repeatCount; i<newCount; i++) {\r
+ p = (Long) this.index.get(i, Bindings.LONG);\r
+ p += size;\r
+ this.index.set(i, Bindings.LONG, p);\r
+ }\r
+ \r
+ b.position(pos);\r
+ for (int i=0; i<repeatCount; i++) {\r
+ rcs.serialize(b, obj); \r
+ }\r
+ \r
+ // Update child map keys\r
+ if (!lastEntry && !children.isEmpty()) {\r
+ Integer key = children.lastKey();\r
+ while (key!=null && key >= index) {\r
+ java.lang.ref.Reference<BinaryObject> value = children.remove(key);\r
+ if (value.get()!=null) children.put(key+repeatCount, value);\r
+ key = children.lowerKey(key);\r
+ }\r
+ }\r
+ \r
+ // Notify Listeners\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+ if (is.inNotifications()) {\r
+ for (int i=0; i<repeatCount; i++) {\r
+ MutableVariant newValue = null;\r
+ if (is.inValues()) newValue = new MutableVariant(rcb, obj/*rcb.isImmutable() ? obj : cb.clone(obj)*/); \r
+ ArrayElementAdded e = new ArrayElementAdded(index, newValue);\r
+ emitEvent(le, e);\r
+ }\r
+ }\r
+ \r
+ // Update indices of interest sets\r
+ if (is.componentInterests!=null) {\r
+ Map<Integer, InterestSet> oldCis = is.componentInterests;\r
+ boolean needUpdates = false;\r
+ for (Integer i : oldCis.keySet()) {\r
+ needUpdates |= i>=index;\r
+ if (needUpdates) break;\r
+ }\r
+ \r
+ if (needUpdates) {\r
+ Map<Integer, InterestSet> newCis = new HashMap<Integer, InterestSet>(oldCis.size()); \r
+ for (Integer i : oldCis.keySet())\r
+ {\r
+ Integer oldKey = i;\r
+ Integer newKey = i>=index ? i+repeatCount : i;\r
+ InterestSet oldValue = oldCis.get(oldKey);\r
+ newCis.put(newKey, oldValue); \r
+ }\r
+ is.componentInterests = newCis;\r
+ }\r
+ \r
+ }\r
+ \r
+ le = le.next;\r
+ }\r
+ \r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException(e);\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+ \r
+ @Override\r
+ public void removeNoflush(int index, int count) throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ // Write\r
+ boolean lastEntry = index == count;\r
+ int oldCount = this.index.size();\r
+ int newCount = oldCount - count;\r
+ if (index<0||index+count>oldCount) throw new AccessorException("Index out of bounds");\r
+ long pos = getStartPosition(index); \r
+ long lastPos = getStartPosition(index+count-1); \r
+ long lastLen = getLength(index, lastPos);\r
+ long end = lastPos + lastLen;\r
+ long len = end - pos;\r
+ b.position(pos);\r
+ b.removeBytes(len, ByteSide.Right);\r
+ this.index.remove(index, count);\r
+ for (int i=index; i<newCount; i++) {\r
+ long p = (Long) this.index.get(i, Bindings.LONG);\r
+ p -= len;\r
+ this.index.set(i, Bindings.LONG, p);\r
+ }\r
+ \r
+ // Remove children\r
+ SortedMap<Integer, java.lang.ref.Reference<BinaryObject>> sm = children.subMap(index, true, index+count, false);\r
+ for (Entry<Integer, java.lang.ref.Reference<BinaryObject>> e : sm.entrySet()) {\r
+ BinaryObject bo = e.getValue().get();\r
+ if (bo==null) continue;\r
+ bo.invalidatedNotification(); \r
+ }\r
+ sm.clear();\r
+ \r
+ // Update the keys of consecutive children\r
+ if (!lastEntry && !children.isEmpty()) {\r
+ Integer lastKey = children.lastKey();\r
+ Integer key = children.higherKey(index);\r
+ while (key != null && key <= lastKey) {\r
+ java.lang.ref.Reference<BinaryObject> value = children.remove(key);\r
+ if (value.get()!=null) children.put(key-count, value);\r
+ key = children.higherKey(key);\r
+ }\r
+ }\r
+ \r
+ // Notify Listeners\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+ if (is.inNotifications()) {\r
+ ArrayElementRemoved e = new ArrayElementRemoved(index);\r
+ emitEvent(le, e);\r
+ }\r
+ \r
+ // Update indices of interest sets\r
+ if (is.componentInterests!=null) {\r
+ Map<Integer, InterestSet> oldCis = is.componentInterests;\r
+ boolean needUpdates = false;\r
+ for (Integer i : oldCis.keySet()) {\r
+ needUpdates |= i>=index;\r
+ if (needUpdates) break;\r
+ }\r
+ \r
+ if (needUpdates) {\r
+ Map<Integer, InterestSet> newCis = new HashMap<Integer, InterestSet>(oldCis.size()); \r
+ for (Integer i : oldCis.keySet())\r
+ {\r
+ Integer oldKey = i;\r
+ Integer newKey = i>=index ? i-1 : i;\r
+ InterestSet oldValue = oldCis.get(oldKey);\r
+ newCis.put(newKey, oldValue); \r
+ }\r
+ is.componentInterests = newCis;\r
+ }\r
+ } \r
+ le = le.next;\r
+ }\r
+ \r
+ \r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+ \r
+ @Override\r
+ public Object get(int index, Binding valueBinding) throws AccessorException {\r
+ assert b.isOpen();\r
+ readLock();\r
+ try {\r
+ long pos = getStartPosition(index);\r
+ b.position(pos);\r
+ Serializer s = params.serializerScheme.getSerializer(valueBinding);\r
+ return s.deserialize(b);\r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException(e);\r
+ } finally {\r
+ readUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void get(int index, Binding valueBinding, Object dst) throws AccessorException {\r
+ assert b.isOpen();\r
+ readLock();\r
+ try {\r
+ long pos = getStartPosition(index);\r
+ b.position(pos);\r
+ Serializer s = params.serializerScheme.getSerializer(valueBinding);\r
+ s.deserializeTo(b, dst);\r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException(e);\r
+ } finally {\r
+ readUnlock();\r
+ }\r
+ }\r
+\r
+ \r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public <T extends Accessor> T getAccessor(int index)\r
+ throws AccessorConstructionException {\r
+ assert b.isOpen();\r
+ readLock();\r
+ try {\r
+ b.position(0L);\r
+ int count = b.readInt();\r
+ if (index<0 || index>=count) throw new ReferenceException("Element index ("+index+") out of bounds ("+count+")");\r
+ \r
+ // Get existing or create new\r
+ BinaryObject sa = getExistingAccessor(index);\r
+ if (sa==null) {\r
+ long pos = getStartPosition(index);\r
+ long len = getLength(index, pos);\r
+\r
+ // Instantiate correct sub accessor. \r
+ sa = createSubAccessor(cb.type(), pos, len, params); \r
+ children.put(index, new WeakReference<BinaryObject>(sa) );\r
+\r
+ // Add component interest sets\r
+ ListenerEntry le = listeners;\r
+ while (le!=null) { \r
+ ArrayInterestSet is = le.getInterestSet();\r
+\r
+ // Generic element interest\r
+ InterestSet gis = is.getComponentInterest(); \r
+ if (gis != null) {\r
+ try {\r
+ ChildReference childPath = ChildReference.concatenate(le.path, new IndexReference(index) );\r
+ sa.addListener(le.listener, gis, childPath, le.executor);\r
+ } catch (AccessorException e) {\r
+ throw new AccessorConstructionException(e);\r
+ }\r
+ }\r
+ \r
+ // Specific element interest\r
+ InterestSet cis = is.getComponentInterest(index); \r
+ if (cis != null) {\r
+ try {\r
+ ChildReference childPath = ChildReference.concatenate(le.path, new IndexReference(index) );\r
+ sa.addListener(le.listener, cis, childPath,le.executor);\r
+ } catch (AccessorException e) {\r
+ throw new AccessorConstructionException(e);\r
+ }\r
+ }\r
+ \r
+ // Next listener\r
+ le = le.next;\r
+ } \r
+ \r
+ }\r
+ \r
+ return (T) sa;\r
+ } catch (IOException e) {\r
+ throw new AccessorConstructionException(e);\r
+ } catch (AccessorException e) {\r
+ throw new AccessorConstructionException(e);\r
+ } finally {\r
+ readUnlock();\r
+ }\r
+ }\r
+\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public <T extends Accessor> T getComponent(ChildReference reference)\r
+ throws AccessorConstructionException {\r
+ if (reference==null) return (T) this;\r
+ if (reference instanceof LabelReference) {\r
+ LabelReference lr = (LabelReference) reference;\r
+ try {\r
+ Integer index = new Integer( lr.label );\r
+ Accessor result = getAccessor(index);\r
+ if (reference.getChildReference() != null)\r
+ result = result.getComponent(reference.getChildReference());\r
+ return (T) result;\r
+ } catch ( NumberFormatException nfe ) {\r
+ throw new ReferenceException(nfe);\r
+ } \r
+ } else if (reference instanceof IndexReference) {\r
+ IndexReference ref = (IndexReference) reference;\r
+ int index = ref.getIndex();\r
+ Accessor result = getAccessor(index);\r
+ if (reference.getChildReference() != null)\r
+ result = result.getComponent(reference.getChildReference());\r
+ return (T) result;\r
+ } throw new ReferenceException(reference.getClass().getName()+" is not a reference of an array"); \r
+ }\r
+ \r
+ @Override\r
+ public void getAll(Binding valueBinding, Object[] array)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ readLock();\r
+ try {\r
+ b.position(0L);\r
+ int size = b.readInt();\r
+ if (size > array.length) throw new AccessorException("Argument array too short");\r
+ Serializer s = params.serializerScheme.getSerializer(valueBinding);\r
+ for (int i=0; i<size; i++) {\r
+ array[i] = s.deserialize(b);\r
+ }\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ readUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void getAll(Binding valueBinding, Collection<Object> values)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ readLock();\r
+ try {\r
+ b.position(0L);\r
+ int size = b.readInt();\r
+ Serializer s = params.serializerScheme.getSerializer(valueBinding);\r
+ for (int i=0; i<size; i++) {\r
+ values.add( s.deserialize(b) );\r
+ }\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } catch (SerializerConstructionException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ readUnlock();\r
+ }\r
+ }\r
+ \r
+ @Override\r
+ public void setSizeNoflush(int newSize) throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ int oldSize = size();\r
+\r
+ // Remove instances \r
+ if (newSize<oldSize) {\r
+ remove(newSize, oldSize-newSize);\r
+ }\r
+ \r
+ // Add dummy instances\r
+ if (newSize>oldSize) {\r
+ Object dummy = cb.createDefault();\r
+ int count = newSize-oldSize;\r
+ addRepeatNoflush(oldSize, cb, dummy, count);\r
+ }\r
+ \r
+ } catch (BindingException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void setSize(int newSize) throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ setSizeNoflush(newSize);\r
+ b.flush();\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+ \r
+ @Override\r
+ public int size() throws AccessorException {\r
+ assert b.isOpen();\r
+ readLock();\r
+ return index.size();\r
+ }\r
+\r
+ @Override\r
+ Event applyLocal(Event e, boolean makeRollback) throws AccessorException {\r
+ Event rollback = null;\r
+ if (e instanceof ValueAssigned) {\r
+ ValueAssigned va = (ValueAssigned) e;\r
+ if (makeRollback) rollback = new ValueAssigned(cb, getValue(cb)); \r
+ setValueNoflush(va.newValue.getBinding(), va.newValue.getValue());\r
+ } else \r
+ if (e instanceof ArrayElementAdded) {\r
+ ArrayElementAdded aa = (ArrayElementAdded) e;\r
+ addNoflush(aa.index, aa.value.getBinding(), aa.value.getValue());\r
+ if (makeRollback) rollback = new ArrayElementRemoved(aa.index);\r
+ } else if (e instanceof ArrayElementRemoved) {\r
+ ArrayElementRemoved ar = (ArrayElementRemoved) e;\r
+ if (ar.index<0 || ar.index >=size()) throw new AccessorException("Array index out of bounds");\r
+ if (makeRollback) {\r
+ Object cv = get(ar.index, cb);\r
+ rollback = new ArrayElementAdded(ar.index, new MutableVariant(cb, cv));\r
+ }\r
+ removeNoflush(ar.index, 1);\r
+ } else {\r
+ throw new AccessorException("Cannot apply "+e.getClass().getName()+" to Array");\r
+ }\r
+ \r
+ return rollback;\r
+ }\r
+\r
+ @Override\r
+ public void add(Binding binding, Object value) throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ addNoflush(binding, value);\r
+ b.flush();\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void add(int index, Binding binding, Object value)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ addNoflush(index, binding, value);\r
+ b.flush();\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void addAll(Binding binding, Object[] values)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ addAllNoflush(binding, values);\r
+ b.flush();\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void addAll(int index, Binding binding, Object[] values)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ addAllNoflush(index, binding, values);\r
+ b.flush();\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock(); \r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void remove(int index, int count) throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ removeNoflush(index, count);\r
+ b.flush();\r
+ } catch (IOException e) {\r
+ throw new AccessorException( e );\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+\r
+ @Override\r
+ public void set(int index, Binding binding, Object value)\r
+ throws AccessorException {\r
+ assert b.isOpen();\r
+ writeLock();\r
+ try {\r
+ setNoflush(index, binding, value);\r
+ b.flush();\r
+ } catch (IOException e) {\r
+ throw new AccessorException(e);\r
+ } finally {\r
+ writeUnlock();\r
+ }\r
+ }\r
+ \r
+ @Override\r
+ public void close() throws AccessorException {\r
+ if ( this.index instanceof CloseableAccessor ) {\r
+ CloseableAccessor ca = (CloseableAccessor) this.index;\r
+ ca.close();\r
+ }\r
+ super.close();\r
+ }\r
+ \r
+}\r
+\r
Code Review / simantics / platform.git / blobdiff