public class DescribeReplicationGroupRequest extends AbstractModel
Constructor and Description |
---|
DescribeReplicationGroupRequest() |
DescribeReplicationGroupRequest(DescribeReplicationGroupRequest source)
NOTE: Any ambiguous key set via .set("AnyKey", "value") will be a shallow copy,
and any explicit key, i.e Foo, set via .setFoo("value") will be a deep copy.
|
Modifier and Type | Method and Description |
---|---|
String |
getGroupId()
Get Replication group ID
|
Long |
getLimit()
Get Number of instances returned per page.
|
Long |
getOffset()
Get Pagination offset, which is an integral multiple of `Limit`.
|
String |
getSearchKey()
Get Key words for fuzzy query, which can be set as the ID or name of a replication group.
|
void |
setGroupId(String GroupId)
Set Replication group ID
|
void |
setLimit(Long Limit)
Set Number of instances returned per page.
|
void |
setOffset(Long Offset)
Set Pagination offset, which is an integral multiple of `Limit`.
|
void |
setSearchKey(String SearchKey)
Set Key words for fuzzy query, which can be set as the ID or name of a replication group.
|
void |
toMap(HashMap<String,String> map,
String prefix)
Internal implementation, normal users should not use it.
|
any, fromJsonString, getBinaryParams, getMultipartRequestParams, set, setParamArrayObj, setParamArraySimple, setParamObj, setParamSimple, toJsonString
public DescribeReplicationGroupRequest()
public DescribeReplicationGroupRequest(DescribeReplicationGroupRequest source)
public Long getLimit()
public void setLimit(Long Limit)
Limit
- Number of instances returned per page. Default value: `20`.public Long getOffset()
public void setOffset(Long Offset)
Offset
- Pagination offset, which is an integral multiple of `Limit`. `offset` = `limit` * (page number - 1).public String getGroupId()
public void setGroupId(String GroupId)
GroupId
- Replication group IDpublic String getSearchKey()
public void setSearchKey(String SearchKey)
SearchKey
- Key words for fuzzy query, which can be set as the ID or name of a replication group.Copyright © 2023. All rights reserved.