public class DescribeProxyNodesRequest extends AbstractModel
header, skipSign| Constructor and Description | 
|---|
| DescribeProxyNodesRequest() | 
| DescribeProxyNodesRequest(DescribeProxyNodesRequest 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 | 
|---|---|
| QueryFilter[] | getFilters()Get 搜索条件,若存在多个Filter时,Filter间的关系为逻辑与(AND)关系。 | 
| Long | getLimit()Get 返回数量,默认为 20,最大值为 100 | 
| Long | getOffset()Get 记录偏移量,默认值为0 | 
| String | getOrderBy()Get 排序字段,取值范围:
 CREATETIME:创建时间
 PERIODENDTIME:过期时间 | 
| String | getOrderByType()Get 排序类型,取值范围:
 ASC:升序排序 
 DESC:降序排序  | 
| void | setFilters(QueryFilter[] Filters)Set 搜索条件,若存在多个Filter时,Filter间的关系为逻辑与(AND)关系。 | 
| void | setLimit(Long Limit)Set 返回数量,默认为 20,最大值为 100 | 
| void | setOffset(Long Offset)Set 记录偏移量,默认值为0 | 
| void | setOrderBy(String OrderBy)Set 排序字段,取值范围:
 CREATETIME:创建时间
 PERIODENDTIME:过期时间 | 
| void | setOrderByType(String OrderByType)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 DescribeProxyNodesRequest()
public DescribeProxyNodesRequest(DescribeProxyNodesRequest source)
public Long getLimit()
public void setLimit(Long Limit)
Limit - 返回数量,默认为 20,最大值为 100public Long getOffset()
public void setOffset(Long Offset)
Offset - 记录偏移量,默认值为0public String getOrderBy()
public void setOrderBy(String OrderBy)
OrderBy - 排序字段,取值范围:
public String getOrderByType()
public void setOrderByType(String OrderByType)
OrderByType - 排序类型,取值范围:
public QueryFilter[] getFilters()
public void setFilters(QueryFilter[] Filters)
Filters - 搜索条件,若存在多个Filter时,Filter间的关系为逻辑与(AND)关系。Copyright © 2025. All rights reserved.