public class GtidSet extends Object
gtid_set: uuid_set[,uuid_set]... uuid_set: uuid:interval[:interval]... uuid: hhhhhhhh-hhhh-hhhh-hhhh-hhhhhhhhhhhh, h: [0-9|A-F] interval: n[-n], (n >= 1)
Modifier and Type | Class and Description |
---|---|
static class |
GtidSet.Interval
An interval of contiguous transaction identifiers.
|
static class |
GtidSet.UUIDSet
A range of GTIDs for a single server with a specific UUID.
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(String gtid) |
boolean |
equals(Object obj) |
GtidSet.UUIDSet |
getUUIDSet(String uuid)
Find the
GtidSet.UUIDSet for the server with the specified UUID. |
Collection<GtidSet.UUIDSet> |
getUUIDSets()
Get an immutable collection of the
range of GTIDs for a single server . |
int |
hashCode() |
boolean |
isContainedWithin(GtidSet other)
Determine if the GTIDs represented by this object are contained completely within the supplied set of GTIDs.
|
GtidSet.UUIDSet |
putUUIDSet(GtidSet.UUIDSet uuidSet)
Add or replace the UUIDSet
|
String |
toString() |
public GtidSet(String gtidSet)
gtidSet
- gtid set comprised of closed intervals (like MySQL's executed_gtid_set).public Collection<GtidSet.UUIDSet> getUUIDSets()
range of GTIDs for a single server
.GTID ranges for each server
; never nullpublic GtidSet.UUIDSet getUUIDSet(String uuid)
GtidSet.UUIDSet
for the server with the specified UUID.uuid
- the UUID of the serverGtidSet.UUIDSet
for the identified server, or null
if there are no GTIDs from that server.public GtidSet.UUIDSet putUUIDSet(GtidSet.UUIDSet uuidSet)
uuidSet
- UUIDSet to be addedGtidSet.UUIDSet
for the server given in uuidSet param,
or null
if there are no UUIDSet for the given server.public boolean add(String gtid)
gtid
- GTID ("source_id:transaction_id")public boolean isContainedWithin(GtidSet other)
GtidSet
s are equal, then they both are subsets of the other.other
- the other set of GTIDs; may be nulltrue
if all of the GTIDs in this set are equal to or completely contained within the supplied
set of GTIDs, or false
otherwiseCopyright © 2020. All rights reserved.