public class DescribeCertificatesResponse extends AbstractModel
header, skipSign| Constructor and Description |
|---|
DescribeCertificatesResponse() |
DescribeCertificatesResponse(DescribeCertificatesResponse 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 |
|---|---|
Certificate[] |
getCertificateSet()
Get Server certificate list, which includes certificate ID and certificate name.
|
String |
getRequestId()
Get The unique request ID, which is returned for each request.
|
Long |
getTotalCount()
Get Total quantity of server certificates that match the query conditions.
|
void |
setCertificateSet(Certificate[] CertificateSet)
Set Server certificate list, which includes certificate ID and certificate name.
|
void |
setRequestId(String RequestId)
Set The unique request ID, which is returned for each request.
|
void |
setTotalCount(Long TotalCount)
Set Total quantity of server certificates that match the query conditions.
|
void |
toMap(HashMap<String,String> map,
String prefix)
Internal implementation, normal users should not use it.
|
any, fromJsonString, getBinaryParams, GetHeader, getMultipartRequestParams, getSkipSign, isStream, set, SetHeader, setParamArrayObj, setParamArraySimple, setParamObj, setParamSimple, setSkipSign, toJsonStringpublic DescribeCertificatesResponse()
public DescribeCertificatesResponse(DescribeCertificatesResponse source)
public Certificate[] getCertificateSet()
public void setCertificateSet(Certificate[] CertificateSet)
CertificateSet - Server certificate list, which includes certificate ID and certificate name.public Long getTotalCount()
public void setTotalCount(Long TotalCount)
TotalCount - Total quantity of server certificates that match the query conditions.public String getRequestId()
public void setRequestId(String RequestId)
RequestId - The unique request ID, which is returned for each request. RequestId is required for locating a problem.Copyright © 2025. All rights reserved.