org.eclipse.emf.emfstore.internal.server.conflictDetection
Class ExistenceOppositeReservationMap
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<String,V>
org.eclipse.emf.emfstore.internal.server.conflictDetection.LinkedHashMapWithConflictBucketCandidate<ConflictBucketCandidate>
org.eclipse.emf.emfstore.internal.server.conflictDetection.OppositeReservationMap
org.eclipse.emf.emfstore.internal.server.conflictDetection.ExistenceOppositeReservationMap
- All Implemented Interfaces:
- Serializable, Cloneable, Map<String,ConflictBucketCandidate>
public class ExistenceOppositeReservationMap
- extends OppositeReservationMap
Tracks any reservation based an a opposite model element.
- Author:
- mkoegel, emueller
- See Also:
- Serialized Form
Methods inherited from interface java.util.Map |
containsKey, entrySet, equals, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
ExistenceOppositeReservationMap
public ExistenceOppositeReservationMap()
- Default constructor that assumes that there are no opposites.
getAllConflictBucketCandidates
public Set<ConflictBucketCandidate> getAllConflictBucketCandidates()
- Description copied from class:
LinkedHashMapWithConflictBucketCandidate
- Returns all
ConflictBucketCandidate
s.
- Overrides:
getAllConflictBucketCandidates
in class OppositeReservationMap
- Returns:
- a set of candidates.
addConflictBucketCandidate
public void addConflictBucketCandidate(ConflictBucketCandidate conflictBucketCandidate)
- Adds a
ConflictBucketCandidate
.
- Parameters:
conflictBucketCandidate
- the ConflictBucketCandidate
to be added
setConflictBucketCandidate
public void setConflictBucketCandidate(ConflictBucketCandidate conflictBucketCandidate)
- Description copied from class:
LinkedHashMapWithConflictBucketCandidate
- Sets the
ConflictBucketCandidate
for this map.
- Overrides:
setConflictBucketCandidate
in class LinkedHashMapWithConflictBucketCandidate<ConflictBucketCandidate>
- Parameters:
conflictBucketCandidate
- the candidate to set
Copyright © 2015. All Rights Reserved.