public class DescribeClustersResponse extends AbstractModel
header, skipSign
Constructor and Description |
---|
DescribeClustersResponse() |
DescribeClustersResponse(DescribeClustersResponse 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 |
---|---|
ClusterInfo[] |
getClusters()
Get Cluster instance list
|
String |
getRequestId()
Get The unique request ID, generated by the server, will be returned for every request (if the request fails to reach the server for other reasons, the request will not obtain a RequestId).
|
Long |
getTotalCount()
Get Number of cluster instances
|
void |
setClusters(ClusterInfo[] Clusters)
Set Cluster instance list
|
void |
setRequestId(String RequestId)
Set The unique request ID, generated by the server, will be returned for every request (if the request fails to reach the server for other reasons, the request will not obtain a RequestId).
|
void |
setTotalCount(Long TotalCount)
Set Number of cluster instances
|
void |
toMap(HashMap<String,String> map,
String prefix)
Internal implementation, normal users should not use it.
|
any, fromJsonString, getBinaryParams, GetHeader, getMultipartRequestParams, getSkipSign, set, SetHeader, setParamArrayObj, setParamArraySimple, setParamObj, setParamSimple, setSkipSign, toJsonString
public DescribeClustersResponse()
public DescribeClustersResponse(DescribeClustersResponse source)
public Long getTotalCount()
public void setTotalCount(Long TotalCount)
TotalCount
- Number of cluster instancespublic ClusterInfo[] getClusters()
public void setClusters(ClusterInfo[] Clusters)
Clusters
- Cluster instance listpublic String getRequestId()
public void setRequestId(String RequestId)
RequestId
- The unique request ID, generated by the server, will be returned for every request (if the request fails to reach the server for other reasons, the request will not obtain a RequestId). RequestId is required for locating a problem.Copyright © 2024. All rights reserved.