|
@@ -19,25 +19,25 @@ import org.eclipse.emf.ecore.util.EObjectWithInverseResolvingEList;
|
|
|
import org.eclipse.emf.ecore.util.InternalEList;
|
|
|
|
|
|
import ua.ansymo.hintco.HintcoPackage;
|
|
|
-import ua.ansymo.hintco.PrecendenceNode;
|
|
|
+import ua.ansymo.hintco.PrecedenceNode;
|
|
|
|
|
|
/**
|
|
|
* <!-- begin-user-doc -->
|
|
|
- * An implementation of the model object '<em><b>Precendence Node</b></em>'.
|
|
|
+ * An implementation of the model object '<em><b>Precedence Node</b></em>'.
|
|
|
* <!-- end-user-doc -->
|
|
|
* <p>
|
|
|
* The following features are implemented:
|
|
|
* </p>
|
|
|
* <ul>
|
|
|
- * <li>{@link ua.ansymo.hintco.impl.PrecendenceNodeImpl#getPrecedes <em>Precedes</em>}</li>
|
|
|
- * <li>{@link ua.ansymo.hintco.impl.PrecendenceNodeImpl#getSucceeds <em>Succeeds</em>}</li>
|
|
|
- * <li>{@link ua.ansymo.hintco.impl.PrecendenceNodeImpl#getBefore <em>Before</em>}</li>
|
|
|
- * <li>{@link ua.ansymo.hintco.impl.PrecendenceNodeImpl#getAfter <em>After</em>}</li>
|
|
|
+ * <li>{@link ua.ansymo.hintco.impl.PrecedenceNodeImpl#getPrecedes <em>Precedes</em>}</li>
|
|
|
+ * <li>{@link ua.ansymo.hintco.impl.PrecedenceNodeImpl#getSucceeds <em>Succeeds</em>}</li>
|
|
|
+ * <li>{@link ua.ansymo.hintco.impl.PrecedenceNodeImpl#getBefore <em>Before</em>}</li>
|
|
|
+ * <li>{@link ua.ansymo.hintco.impl.PrecedenceNodeImpl#getAfter <em>After</em>}</li>
|
|
|
* </ul>
|
|
|
*
|
|
|
* @generated
|
|
|
*/
|
|
|
-public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container implements PrecendenceNode {
|
|
|
+public abstract class PrecedenceNodeImpl extends MinimalEObjectImpl.Container implements PrecedenceNode {
|
|
|
/**
|
|
|
* The cached value of the '{@link #getPrecedes() <em>Precedes</em>}' reference list.
|
|
|
* <!-- begin-user-doc -->
|
|
@@ -46,7 +46,7 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* @generated
|
|
|
* @ordered
|
|
|
*/
|
|
|
- protected EList<PrecendenceNode> precedes;
|
|
|
+ protected EList<PrecedenceNode> precedes;
|
|
|
|
|
|
/**
|
|
|
* The cached value of the '{@link #getSucceeds() <em>Succeeds</em>}' reference list.
|
|
@@ -56,7 +56,7 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* @generated
|
|
|
* @ordered
|
|
|
*/
|
|
|
- protected EList<PrecendenceNode> succeeds;
|
|
|
+ protected EList<PrecedenceNode> succeeds;
|
|
|
|
|
|
/**
|
|
|
* The cached value of the '{@link #getBefore() <em>Before</em>}' reference.
|
|
@@ -66,7 +66,7 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* @generated
|
|
|
* @ordered
|
|
|
*/
|
|
|
- protected PrecendenceNode before;
|
|
|
+ protected PrecedenceNode before;
|
|
|
|
|
|
/**
|
|
|
* The cached value of the '{@link #getAfter() <em>After</em>}' reference.
|
|
@@ -76,14 +76,14 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* @generated
|
|
|
* @ordered
|
|
|
*/
|
|
|
- protected PrecendenceNode after;
|
|
|
+ protected PrecedenceNode after;
|
|
|
|
|
|
/**
|
|
|
* <!-- begin-user-doc -->
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- protected PrecendenceNodeImpl() {
|
|
|
+ protected PrecedenceNodeImpl() {
|
|
|
super();
|
|
|
}
|
|
|
|
|
@@ -94,7 +94,7 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
*/
|
|
|
@Override
|
|
|
protected EClass eStaticClass() {
|
|
|
- return HintcoPackage.Literals.PRECENDENCE_NODE;
|
|
|
+ return HintcoPackage.Literals.PRECEDENCE_NODE;
|
|
|
}
|
|
|
|
|
|
/**
|
|
@@ -102,9 +102,9 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public EList<PrecendenceNode> getPrecedes() {
|
|
|
+ public EList<PrecedenceNode> getPrecedes() {
|
|
|
if (precedes == null) {
|
|
|
- precedes = new EObjectWithInverseResolvingEList.ManyInverse<PrecendenceNode>(PrecendenceNode.class, this, HintcoPackage.PRECENDENCE_NODE__PRECEDES, HintcoPackage.PRECENDENCE_NODE__SUCCEEDS);
|
|
|
+ precedes = new EObjectWithInverseResolvingEList.ManyInverse<PrecedenceNode>(PrecedenceNode.class, this, HintcoPackage.PRECEDENCE_NODE__PRECEDES, HintcoPackage.PRECEDENCE_NODE__SUCCEEDS);
|
|
|
}
|
|
|
return precedes;
|
|
|
}
|
|
@@ -114,9 +114,9 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public EList<PrecendenceNode> getSucceeds() {
|
|
|
+ public EList<PrecedenceNode> getSucceeds() {
|
|
|
if (succeeds == null) {
|
|
|
- succeeds = new EObjectWithInverseResolvingEList.ManyInverse<PrecendenceNode>(PrecendenceNode.class, this, HintcoPackage.PRECENDENCE_NODE__SUCCEEDS, HintcoPackage.PRECENDENCE_NODE__PRECEDES);
|
|
|
+ succeeds = new EObjectWithInverseResolvingEList.ManyInverse<PrecedenceNode>(PrecedenceNode.class, this, HintcoPackage.PRECEDENCE_NODE__SUCCEEDS, HintcoPackage.PRECEDENCE_NODE__PRECEDES);
|
|
|
}
|
|
|
return succeeds;
|
|
|
}
|
|
@@ -126,13 +126,13 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public PrecendenceNode getBefore() {
|
|
|
+ public PrecedenceNode getBefore() {
|
|
|
if (before != null && before.eIsProxy()) {
|
|
|
InternalEObject oldBefore = (InternalEObject)before;
|
|
|
- before = (PrecendenceNode)eResolveProxy(oldBefore);
|
|
|
+ before = (PrecedenceNode)eResolveProxy(oldBefore);
|
|
|
if (before != oldBefore) {
|
|
|
if (eNotificationRequired())
|
|
|
- eNotify(new ENotificationImpl(this, Notification.RESOLVE, HintcoPackage.PRECENDENCE_NODE__BEFORE, oldBefore, before));
|
|
|
+ eNotify(new ENotificationImpl(this, Notification.RESOLVE, HintcoPackage.PRECEDENCE_NODE__BEFORE, oldBefore, before));
|
|
|
}
|
|
|
}
|
|
|
return before;
|
|
@@ -143,7 +143,7 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public PrecendenceNode basicGetBefore() {
|
|
|
+ public PrecedenceNode basicGetBefore() {
|
|
|
return before;
|
|
|
}
|
|
|
|
|
@@ -152,11 +152,11 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public NotificationChain basicSetBefore(PrecendenceNode newBefore, NotificationChain msgs) {
|
|
|
- PrecendenceNode oldBefore = before;
|
|
|
+ public NotificationChain basicSetBefore(PrecedenceNode newBefore, NotificationChain msgs) {
|
|
|
+ PrecedenceNode oldBefore = before;
|
|
|
before = newBefore;
|
|
|
if (eNotificationRequired()) {
|
|
|
- ENotificationImpl notification = new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECENDENCE_NODE__BEFORE, oldBefore, newBefore);
|
|
|
+ ENotificationImpl notification = new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECEDENCE_NODE__BEFORE, oldBefore, newBefore);
|
|
|
if (msgs == null) msgs = notification; else msgs.add(notification);
|
|
|
}
|
|
|
return msgs;
|
|
@@ -167,18 +167,18 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public void setBefore(PrecendenceNode newBefore) {
|
|
|
+ public void setBefore(PrecedenceNode newBefore) {
|
|
|
if (newBefore != before) {
|
|
|
NotificationChain msgs = null;
|
|
|
if (before != null)
|
|
|
- msgs = ((InternalEObject)before).eInverseRemove(this, HintcoPackage.PRECENDENCE_NODE__AFTER, PrecendenceNode.class, msgs);
|
|
|
+ msgs = ((InternalEObject)before).eInverseRemove(this, HintcoPackage.PRECEDENCE_NODE__AFTER, PrecedenceNode.class, msgs);
|
|
|
if (newBefore != null)
|
|
|
- msgs = ((InternalEObject)newBefore).eInverseAdd(this, HintcoPackage.PRECENDENCE_NODE__AFTER, PrecendenceNode.class, msgs);
|
|
|
+ msgs = ((InternalEObject)newBefore).eInverseAdd(this, HintcoPackage.PRECEDENCE_NODE__AFTER, PrecedenceNode.class, msgs);
|
|
|
msgs = basicSetBefore(newBefore, msgs);
|
|
|
if (msgs != null) msgs.dispatch();
|
|
|
}
|
|
|
else if (eNotificationRequired())
|
|
|
- eNotify(new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECENDENCE_NODE__BEFORE, newBefore, newBefore));
|
|
|
+ eNotify(new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECEDENCE_NODE__BEFORE, newBefore, newBefore));
|
|
|
}
|
|
|
|
|
|
/**
|
|
@@ -186,13 +186,13 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public PrecendenceNode getAfter() {
|
|
|
+ public PrecedenceNode getAfter() {
|
|
|
if (after != null && after.eIsProxy()) {
|
|
|
InternalEObject oldAfter = (InternalEObject)after;
|
|
|
- after = (PrecendenceNode)eResolveProxy(oldAfter);
|
|
|
+ after = (PrecedenceNode)eResolveProxy(oldAfter);
|
|
|
if (after != oldAfter) {
|
|
|
if (eNotificationRequired())
|
|
|
- eNotify(new ENotificationImpl(this, Notification.RESOLVE, HintcoPackage.PRECENDENCE_NODE__AFTER, oldAfter, after));
|
|
|
+ eNotify(new ENotificationImpl(this, Notification.RESOLVE, HintcoPackage.PRECEDENCE_NODE__AFTER, oldAfter, after));
|
|
|
}
|
|
|
}
|
|
|
return after;
|
|
@@ -203,7 +203,7 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public PrecendenceNode basicGetAfter() {
|
|
|
+ public PrecedenceNode basicGetAfter() {
|
|
|
return after;
|
|
|
}
|
|
|
|
|
@@ -212,11 +212,11 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public NotificationChain basicSetAfter(PrecendenceNode newAfter, NotificationChain msgs) {
|
|
|
- PrecendenceNode oldAfter = after;
|
|
|
+ public NotificationChain basicSetAfter(PrecedenceNode newAfter, NotificationChain msgs) {
|
|
|
+ PrecedenceNode oldAfter = after;
|
|
|
after = newAfter;
|
|
|
if (eNotificationRequired()) {
|
|
|
- ENotificationImpl notification = new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECENDENCE_NODE__AFTER, oldAfter, newAfter);
|
|
|
+ ENotificationImpl notification = new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECEDENCE_NODE__AFTER, oldAfter, newAfter);
|
|
|
if (msgs == null) msgs = notification; else msgs.add(notification);
|
|
|
}
|
|
|
return msgs;
|
|
@@ -227,18 +227,18 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
* <!-- end-user-doc -->
|
|
|
* @generated
|
|
|
*/
|
|
|
- public void setAfter(PrecendenceNode newAfter) {
|
|
|
+ public void setAfter(PrecedenceNode newAfter) {
|
|
|
if (newAfter != after) {
|
|
|
NotificationChain msgs = null;
|
|
|
if (after != null)
|
|
|
- msgs = ((InternalEObject)after).eInverseRemove(this, HintcoPackage.PRECENDENCE_NODE__BEFORE, PrecendenceNode.class, msgs);
|
|
|
+ msgs = ((InternalEObject)after).eInverseRemove(this, HintcoPackage.PRECEDENCE_NODE__BEFORE, PrecedenceNode.class, msgs);
|
|
|
if (newAfter != null)
|
|
|
- msgs = ((InternalEObject)newAfter).eInverseAdd(this, HintcoPackage.PRECENDENCE_NODE__BEFORE, PrecendenceNode.class, msgs);
|
|
|
+ msgs = ((InternalEObject)newAfter).eInverseAdd(this, HintcoPackage.PRECEDENCE_NODE__BEFORE, PrecedenceNode.class, msgs);
|
|
|
msgs = basicSetAfter(newAfter, msgs);
|
|
|
if (msgs != null) msgs.dispatch();
|
|
|
}
|
|
|
else if (eNotificationRequired())
|
|
|
- eNotify(new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECENDENCE_NODE__AFTER, newAfter, newAfter));
|
|
|
+ eNotify(new ENotificationImpl(this, Notification.SET, HintcoPackage.PRECEDENCE_NODE__AFTER, newAfter, newAfter));
|
|
|
}
|
|
|
|
|
|
/**
|
|
@@ -250,18 +250,18 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
@Override
|
|
|
public NotificationChain eInverseAdd(InternalEObject otherEnd, int featureID, NotificationChain msgs) {
|
|
|
switch (featureID) {
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__PRECEDES:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__PRECEDES:
|
|
|
return ((InternalEList<InternalEObject>)(InternalEList<?>)getPrecedes()).basicAdd(otherEnd, msgs);
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__SUCCEEDS:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__SUCCEEDS:
|
|
|
return ((InternalEList<InternalEObject>)(InternalEList<?>)getSucceeds()).basicAdd(otherEnd, msgs);
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__BEFORE:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__BEFORE:
|
|
|
if (before != null)
|
|
|
- msgs = ((InternalEObject)before).eInverseRemove(this, HintcoPackage.PRECENDENCE_NODE__AFTER, PrecendenceNode.class, msgs);
|
|
|
- return basicSetBefore((PrecendenceNode)otherEnd, msgs);
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__AFTER:
|
|
|
+ msgs = ((InternalEObject)before).eInverseRemove(this, HintcoPackage.PRECEDENCE_NODE__AFTER, PrecedenceNode.class, msgs);
|
|
|
+ return basicSetBefore((PrecedenceNode)otherEnd, msgs);
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__AFTER:
|
|
|
if (after != null)
|
|
|
- msgs = ((InternalEObject)after).eInverseRemove(this, HintcoPackage.PRECENDENCE_NODE__BEFORE, PrecendenceNode.class, msgs);
|
|
|
- return basicSetAfter((PrecendenceNode)otherEnd, msgs);
|
|
|
+ msgs = ((InternalEObject)after).eInverseRemove(this, HintcoPackage.PRECEDENCE_NODE__BEFORE, PrecedenceNode.class, msgs);
|
|
|
+ return basicSetAfter((PrecedenceNode)otherEnd, msgs);
|
|
|
}
|
|
|
return super.eInverseAdd(otherEnd, featureID, msgs);
|
|
|
}
|
|
@@ -274,13 +274,13 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
@Override
|
|
|
public NotificationChain eInverseRemove(InternalEObject otherEnd, int featureID, NotificationChain msgs) {
|
|
|
switch (featureID) {
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__PRECEDES:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__PRECEDES:
|
|
|
return ((InternalEList<?>)getPrecedes()).basicRemove(otherEnd, msgs);
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__SUCCEEDS:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__SUCCEEDS:
|
|
|
return ((InternalEList<?>)getSucceeds()).basicRemove(otherEnd, msgs);
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__BEFORE:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__BEFORE:
|
|
|
return basicSetBefore(null, msgs);
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__AFTER:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__AFTER:
|
|
|
return basicSetAfter(null, msgs);
|
|
|
}
|
|
|
return super.eInverseRemove(otherEnd, featureID, msgs);
|
|
@@ -294,14 +294,14 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
@Override
|
|
|
public Object eGet(int featureID, boolean resolve, boolean coreType) {
|
|
|
switch (featureID) {
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__PRECEDES:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__PRECEDES:
|
|
|
return getPrecedes();
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__SUCCEEDS:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__SUCCEEDS:
|
|
|
return getSucceeds();
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__BEFORE:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__BEFORE:
|
|
|
if (resolve) return getBefore();
|
|
|
return basicGetBefore();
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__AFTER:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__AFTER:
|
|
|
if (resolve) return getAfter();
|
|
|
return basicGetAfter();
|
|
|
}
|
|
@@ -317,19 +317,19 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
@Override
|
|
|
public void eSet(int featureID, Object newValue) {
|
|
|
switch (featureID) {
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__PRECEDES:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__PRECEDES:
|
|
|
getPrecedes().clear();
|
|
|
- getPrecedes().addAll((Collection<? extends PrecendenceNode>)newValue);
|
|
|
+ getPrecedes().addAll((Collection<? extends PrecedenceNode>)newValue);
|
|
|
return;
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__SUCCEEDS:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__SUCCEEDS:
|
|
|
getSucceeds().clear();
|
|
|
- getSucceeds().addAll((Collection<? extends PrecendenceNode>)newValue);
|
|
|
+ getSucceeds().addAll((Collection<? extends PrecedenceNode>)newValue);
|
|
|
return;
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__BEFORE:
|
|
|
- setBefore((PrecendenceNode)newValue);
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__BEFORE:
|
|
|
+ setBefore((PrecedenceNode)newValue);
|
|
|
return;
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__AFTER:
|
|
|
- setAfter((PrecendenceNode)newValue);
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__AFTER:
|
|
|
+ setAfter((PrecedenceNode)newValue);
|
|
|
return;
|
|
|
}
|
|
|
super.eSet(featureID, newValue);
|
|
@@ -343,17 +343,17 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
@Override
|
|
|
public void eUnset(int featureID) {
|
|
|
switch (featureID) {
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__PRECEDES:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__PRECEDES:
|
|
|
getPrecedes().clear();
|
|
|
return;
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__SUCCEEDS:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__SUCCEEDS:
|
|
|
getSucceeds().clear();
|
|
|
return;
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__BEFORE:
|
|
|
- setBefore((PrecendenceNode)null);
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__BEFORE:
|
|
|
+ setBefore((PrecedenceNode)null);
|
|
|
return;
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__AFTER:
|
|
|
- setAfter((PrecendenceNode)null);
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__AFTER:
|
|
|
+ setAfter((PrecedenceNode)null);
|
|
|
return;
|
|
|
}
|
|
|
super.eUnset(featureID);
|
|
@@ -367,16 +367,16 @@ public abstract class PrecendenceNodeImpl extends MinimalEObjectImpl.Container i
|
|
|
@Override
|
|
|
public boolean eIsSet(int featureID) {
|
|
|
switch (featureID) {
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__PRECEDES:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__PRECEDES:
|
|
|
return precedes != null && !precedes.isEmpty();
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__SUCCEEDS:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__SUCCEEDS:
|
|
|
return succeeds != null && !succeeds.isEmpty();
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__BEFORE:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__BEFORE:
|
|
|
return before != null;
|
|
|
- case HintcoPackage.PRECENDENCE_NODE__AFTER:
|
|
|
+ case HintcoPackage.PRECEDENCE_NODE__AFTER:
|
|
|
return after != null;
|
|
|
}
|
|
|
return super.eIsSet(featureID);
|
|
|
}
|
|
|
|
|
|
-} //PrecendenceNodeImpl
|
|
|
+} //PrecedenceNodeImpl
|