1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
/*******************************************************************************
* Copyright (c) 2016 Willink Transformations and others.
* 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:
* E.D.Willink - Initial API and implementation
*******************************************************************************/
package org.eclipse.qvtd.runtime.internal.evaluation;
import java.util.ArrayList;
import java.util.List;
import org.eclipse.jdt.annotation.NonNull;
import org.eclipse.ocl.pivot.ids.CollectionTypeId;
import org.eclipse.qvtd.runtime.evaluation.AbstractInvocation;
import org.eclipse.qvtd.runtime.evaluation.AbstractTransformer;
import org.eclipse.qvtd.runtime.evaluation.Interval;
import org.eclipse.qvtd.runtime.evaluation.Invocation;
/**
* An AbstractConnection maintains the values between one or more sources, typically Mappings, that
* invoke append() and one or more consumers that consume each value.
*
* The AbstractConnection may optionally enforce uniqueness on the internal values where the overall
* application is unable to do so automatically.
*
* Incremental update is supported by a revoke() or an append(), or a replace() of an appended value.
*/
public abstract class AbstractUnenforcedConnectionInternal extends AbstractConnectionInternal
{
protected AbstractUnenforcedConnectionInternal(@NonNull Interval interval, @NonNull String name, @NonNull CollectionTypeId typeId) {
super(interval, name, typeId);
}
/**
* Append aValue to the contents, and waking up the overall
* connection manager to schedule a propagate() to consumers when convenient.
*/
@Override
public synchronized @NonNull Object append(@NonNull Object aValue) {
if (debugAppends) {
AbstractTransformer.APPENDS.println(this + " - " + aValue);
}
List<@NonNull Object> valueAndConsumingInvocations = new ArrayList<>();
valueAndConsumingInvocations.add(aValue); // VALUE_INDEX
valueAndConsumingInvocations.add(listOfValueAndConsumingInvocations.size()); // INDEX_INDEX
listOfValueAndConsumingInvocations.add(valueAndConsumingInvocations);
queue();
return valueAndConsumingInvocations;
}
@Override
public void check() {
for (int i = 0; i < listOfValueAndConsumingInvocations.size(); i++) {
List<@NonNull Object> valueAndConsumingInvocations = listOfValueAndConsumingInvocations.get(i);
if (valueAndConsumingInvocations != null) {
assert valueAndConsumingInvocations.get(INDEX_INDEX) == Integer.valueOf(i);
}
}
}
/**
* Replace the old value at connectionKey by newValue.The old value is removed,
* its consumingInvocations are invalidated so that they recompute with the newValue which replaces the old.
*/
@Override
public synchronized @NonNull Object replace(@NonNull Object connectionKey, @NonNull Object newValue) {
@SuppressWarnings("unchecked") List<@NonNull Object> valueAndConsumingInvocations = (List<@NonNull Object>) connectionKey;
Object oldValue = valueAndConsumingInvocations.get(VALUE_INDEX);
if (newValue != oldValue) { // FIXME ?? equals/oclEquals ??
valueAndConsumingInvocations.set(VALUE_INDEX, newValue);
int iMax = valueAndConsumingInvocations.size();
for (int i = INDEX_INDEX+1; i < iMax; i++) {
Invocation consumer = (Invocation) valueAndConsumingInvocations.get(i);
interval.queue(consumer);
}
}
return connectionKey;
}
/**
* Revoke, inverse append, the old value at connectionKey. The old value is removed,
* its consumingInvocations are revoked so that their appends are also revoked.
*/
@Override
public synchronized void revoke(@NonNull Object connectionKey) {
@SuppressWarnings("unchecked") List<@NonNull Object> valueAndConsumingInvocations = (List<@NonNull Object>) connectionKey;
int valueIndex = (int) valueAndConsumingInvocations.get(INDEX_INDEX);
listOfValueAndConsumingInvocations.set(valueIndex, null); // Do not disrupt index equivalence.
int iMax = valueAndConsumingInvocations.size();
for (int i = INDEX_INDEX+1; i < iMax; i++) {
AbstractInvocation consumingInvocation = (AbstractInvocation) valueAndConsumingInvocations.get(i);
consumingInvocation.revoke();
}
}
}
|
