public class DescribeOwaspWhiteRulesResponse extends AbstractModel
header, skipSign| Constructor and Description |
|---|
DescribeOwaspWhiteRulesResponse() |
DescribeOwaspWhiteRulesResponse(DescribeOwaspWhiteRulesResponse 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 |
|---|---|
OwaspWhiteRule[] |
getList()
Get Rule allowlist 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 |
getTotal()
Get Total number of rules.
|
void |
setList(OwaspWhiteRule[] List)
Set Rule allowlist 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 |
setTotal(Long Total)
Set Total number of rules.
|
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 DescribeOwaspWhiteRulesResponse()
public DescribeOwaspWhiteRulesResponse(DescribeOwaspWhiteRulesResponse source)
public Long getTotal()
public void setTotal(Long Total)
Total - Total number of rules.public OwaspWhiteRule[] getList()
public void setList(OwaspWhiteRule[] List)
List - Rule allowlist 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 © 2025. All rights reserved.