public class DescribeNodePoolsRequest extends AbstractModel
header, skipSign
Constructor and Description |
---|
DescribeNodePoolsRequest() |
DescribeNodePoolsRequest(DescribeNodePoolsRequest 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 |
getClusterId()
Get Cluster ID
|
Filter[] |
getFilters()
Get Query filter criteria:
· NodePoolsName
Filter by [Node Pool Name].
|
Long |
getLimit()
Get Maximum number of output entries.
|
Long |
getOffset()
Get Offset.
|
void |
setClusterId(String ClusterId)
Set Cluster ID
|
void |
setFilters(Filter[] Filters)
Set Query filter criteria:
· NodePoolsName
Filter by [Node Pool Name].
|
void |
setLimit(Long Limit)
Set Maximum number of output entries.
|
void |
setOffset(Long Offset)
Set Offset.
|
void |
toMap(HashMap<String,String> map,
String prefix)
Internal implementation, normal users should not use it.
|
any, fromJsonString, getBinaryParams, GetHeader, getMultipartRequestParams, getSkipSign, set, SetHeader, setParamArrayObj, setParamArraySimple, setParamObj, setParamSimple, setSkipSign, toJsonString
public DescribeNodePoolsRequest()
public DescribeNodePoolsRequest(DescribeNodePoolsRequest source)
public String getClusterId()
public void setClusterId(String ClusterId)
ClusterId
- Cluster IDpublic Filter[] getFilters()
public void setFilters(Filter[] Filters)
Filters
- Query filter criteria:
· NodePoolsName
Filter by [Node Pool Name].
Type: String
Required: No
· NodePoolsId
Filter by [Node Pool id].
Type: String
Required: No
· tags
Filter by [Tag Key-value Pairs].
Type: String
Required: No
· tag:tag-key
Filter by [Tag Key-value Pairs].
Type: String
Required: Nopublic Long getOffset()
public void setOffset(Long Offset)
Offset
- Offset. Default value: 0public Long getLimit()
public void setLimit(Long Limit)
Limit
- Maximum number of output entries. Default value: 20; maximum value: 100.Copyright © 2025. All rights reserved.