public class DescribeConcurrencyUsageResponse extends AbstractModel
header, skipSign| Constructor and Description | 
|---|
| DescribeConcurrencyUsageResponse() | 
| DescribeConcurrencyUsageResponse(DescribeConcurrencyUsageResponse 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 | 
|---|---|
| Long | getAvailableConcurrency()Get 可用并发数上限 | 
| Long | getConcurrencyPeak()Get 并发峰值 | 
| Long | getExceedUsageTime()Get 超出可用并发数上限的次数 | 
| String | getRequestId()Get 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。 | 
| void | setAvailableConcurrency(Long AvailableConcurrency)Set 可用并发数上限 | 
| void | setConcurrencyPeak(Long ConcurrencyPeak)Set 并发峰值 | 
| void | setExceedUsageTime(Long ExceedUsageTime)Set 超出可用并发数上限的次数 | 
| void | setRequestId(String RequestId)Set 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。 | 
| 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 DescribeConcurrencyUsageResponse()
public DescribeConcurrencyUsageResponse(DescribeConcurrencyUsageResponse source)
public Long getAvailableConcurrency()
public void setAvailableConcurrency(Long AvailableConcurrency)
AvailableConcurrency - 可用并发数上限public Long getConcurrencyPeak()
public void setConcurrencyPeak(Long ConcurrencyPeak)
ConcurrencyPeak - 并发峰值public Long getExceedUsageTime()
public void setExceedUsageTime(Long ExceedUsageTime)
ExceedUsageTime - 超出可用并发数上限的次数public String getRequestId()
public void setRequestId(String RequestId)
RequestId - 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。Copyright © 2025. All rights reserved.