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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
/*******************************************************************************
* Copyright (c) 2004-2008 Gabor Bergmann and Daniel Varro
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v. 2.0 which is available at
* http://www.eclipse.org/legal/epl-v20.html.
*
* SPDX-License-Identifier: EPL-2.0
*******************************************************************************/
package tools.refinery.viatra.runtime.matchers.tuple;
import java.util.Arrays;
import java.util.Objects;
/**
*
* Tuple that inherits another tuple on the left.
*
* @author Gabor Bergmann
*
*/
public final class LeftInheritanceTuple extends BaseLeftInheritanceTuple {
/**
* Array of substituted values above inheritedIndex. DO NOT MODIFY! Use Constructor to build a new instance instead.
*/
private final Object[] localElements;
//
// /**
// * Creates a Tuple instance, fills it with the given array.
// * @pre: no elements are null
// * @param elements array of substitution values
// */
// public Tuple(Object[] elements)
// {
// this.localElements = elements;
// this.ancestor=null;
// this.inheritedIndex = 0;
// calcHash();
// }
/**
* Creates a Tuple instance, lets it inherit from an ancestor, extends it with a given array. @pre: no elements are
* null
*
* @param localElements
* array of substitution values
*/
LeftInheritanceTuple(Tuple ancestor, Object[] localElements) {
super(ancestor);
this.localElements = localElements;
calcHash();
}
//
// /**
// * Creates a Tuple instance of size one, fills it with the given object.
// * @pre: o!=null
// * @param o the single substitution
// */
// public Tuple(Object o)
// {
// localElements = new Object [1];
// localElements[0] = o;
// this.ancestor=null;
// this.inheritedIndex = 0;
// calcHash();
// }
//
// /**
// * Creates a Tuple instance of size two, fills it with the given objects.
// * @pre: o1!=null, o2!=null
// */
// public Tuple(Object o1, Object o2)
// {
// localElements = new Object [2];
// localElements[0] = o1;
// localElements[1] = o2;
// this.ancestor=null;
// this.inheritedIndex = 0;
// calcHash();
// }
//
// /**
// * Creates a Tuple instance of size three, fills it with the given
// objects.
// * @pre: o1!=null, o2!=null, o3!=null
// */
// public Tuple(Object o1, Object o2, Object o3)
// {
// localElements = new Object [3];
// localElements[0] = o1;
// localElements[1] = o2;
// localElements[2] = o3;
// this.ancestor=null;
// this.inheritedIndex = 0;
// calcHash();
// }
/**
* @return number of elements
*/
public int getSize() {
return inheritedIndex + localElements.length;
}
@Override
public int getLocalSize() {
return localElements.length;
}
/**
* @pre: 0 <= index < getSize()
*
* @return the element at the specified index
*/
public Object get(int index) {
return (index < inheritedIndex) ? ancestor.get(index) : localElements[index - inheritedIndex];
}
/**
* Optimized hash calculation
*/
@Override
void calcHash() {
final int PRIME = 31;
cachedHash = ancestor.hashCode();
for (int i = 0; i < localElements.length; i++) {
cachedHash = PRIME * cachedHash;
Object element = localElements[i];
if (element != null)
cachedHash += element.hashCode();
}
}
/**
* Optimized equals calculation (prediction: true, since hash values match)
*/
@Override
protected boolean localEquals(BaseLeftInheritanceTuple other) {
if (other instanceof LeftInheritanceTuple) {
LeftInheritanceTuple lit = (LeftInheritanceTuple)other;
return Arrays.equals(this.localElements, lit.localElements);
} else {
if (localElements.length != other.getLocalSize())
return false;
int index = inheritedIndex;
for (int i = 0; i<localElements.length; ++i) {
if (! Objects.equals(localElements[i], other.get(index++)))
return false;
}
return true;
}
}
// public int compareTo(Object arg0) {
// Tuple other = (Tuple) arg0;
//
// int retVal = cachedHash - other.cachedHash;
// if (retVal==0) retVal = elements.length - other.elements.length;
// for (int i=0; retVal==0 && i<elements.length; ++i)
// {
// if (elements[i] == null && other.elements[i] != null) retVal = -1;
// else if (other.elements[i] == null) retVal = 1;
// else retVal = elements[i].compareTo(other.elements[i]);
// }
// return retVal;
// }
}
|
