public class DescribeRaspRuleVulsRequest extends AbstractModel
header, skipSign| Constructor and Description | 
|---|
| DescribeRaspRuleVulsRequest() | 
| DescribeRaspRuleVulsRequest(DescribeRaspRuleVulsRequest 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 | getBy()Get 排序字段:披露时间:SubmitTime | 
| RunTimeFilters[] | getFilters()Get 过滤条件。
Level- String - 是否必填:否 - 威胁等级,CRITICAL:严重 HIGH:高/MIDDLE:中/LOW:低
CVEID- string - 是否必填:否 - CVE编号
Name- string -是否必填: 否 - 漏洞名称 | 
| Long | getLimit()Get 需要返回的数量,默认为10,最大值为100 | 
| Long | getOffset()Get 偏移量,默认为0。 | 
| String | getOrder()Get 排序方式:asc/desc | 
| void | setBy(String By)Set 排序字段:披露时间:SubmitTime | 
| void | setFilters(RunTimeFilters[] Filters)Set 过滤条件。
Level- String - 是否必填:否 - 威胁等级,CRITICAL:严重 HIGH:高/MIDDLE:中/LOW:低
CVEID- string - 是否必填:否 - CVE编号
Name- string -是否必填: 否 - 漏洞名称 | 
| void | setLimit(Long Limit)Set 需要返回的数量,默认为10,最大值为100 | 
| void | setOffset(Long Offset)Set 偏移量,默认为0。 | 
| void | setOrder(String Order)Set 排序方式:asc/desc | 
| 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 DescribeRaspRuleVulsRequest()
public DescribeRaspRuleVulsRequest(DescribeRaspRuleVulsRequest source)
public RunTimeFilters[] getFilters()
public void setFilters(RunTimeFilters[] Filters)
Filters - 过滤条件。
public Long getLimit()
public void setLimit(Long Limit)
Limit - 需要返回的数量,默认为10,最大值为100public Long getOffset()
public void setOffset(Long Offset)
Offset - 偏移量,默认为0。public String getOrder()
public void setOrder(String Order)
Order - 排序方式:asc/descpublic String getBy()
public void setBy(String By)
By - 排序字段:披露时间:SubmitTimeCopyright © 2025. All rights reserved.