public class DescribeUsagePlanSecretIdsResponse extends AbstractModel
header, skipSign| Constructor and Description |
|---|
DescribeUsagePlanSecretIdsResponse() |
DescribeUsagePlanSecretIdsResponse(DescribeUsagePlanSecretIdsResponse 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 |
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).
|
UsagePlanBindSecretStatus |
getResult()
Get List of keys bound to usage plan.
|
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 |
setResult(UsagePlanBindSecretStatus Result)
Set List of keys bound to usage plan.
|
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 DescribeUsagePlanSecretIdsResponse()
public DescribeUsagePlanSecretIdsResponse(DescribeUsagePlanSecretIdsResponse source)
public UsagePlanBindSecretStatus getResult()
public void setResult(UsagePlanBindSecretStatus Result)
Result - List of keys bound to usage plan.
Note: this field may return null, indicating that no valid values can be obtained.public 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 © 2025. All rights reserved.