public class DescribeTasksRequest extends AbstractModel
| Constructor and Description | 
|---|
| DescribeTasksRequest() | 
| DescribeTasksRequest(DescribeTasksRequest 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[] | getClusterIds()Get List of IDs of clusters where the tasks to be queried reside | 
| Filter[] | getFilters()Get Filter. | 
| Long | getLimit()Get Number of returned results in query list | 
| Long | getOffset()Get Query list offset | 
| String[] | getTaskIds()Get List of IDs of tasks to be queried | 
| void | setClusterIds(String[] ClusterIds)Set List of IDs of clusters where the tasks to be queried reside | 
| void | setFilters(Filter[] Filters)Set Filter. | 
| void | setLimit(Long Limit)Set Number of returned results in query list | 
| void | setOffset(Long Offset)Set Query list offset | 
| void | setTaskIds(String[] TaskIds)Set List of IDs of tasks to be queried | 
| void | toMap(HashMap<String,String> map,
     String prefix)Internal implementation, normal users should not use it. | 
any, fromJsonString, getBinaryParams, getMultipartRequestParams, set, setParamArrayObj, setParamArraySimple, setParamObj, setParamSimple, toJsonStringpublic DescribeTasksRequest()
public DescribeTasksRequest(DescribeTasksRequest source)
public String[] getClusterIds()
public void setClusterIds(String[] ClusterIds)
ClusterIds - List of IDs of clusters where the tasks to be queried residepublic String[] getTaskIds()
public void setTaskIds(String[] TaskIds)
TaskIds - List of IDs of tasks to be queriedpublic Filter[] getFilters()
public void setFilters(Filter[] Filters)
Filters - Filter. Valid values: Content, TaskType, Operator, Timepublic Long getOffset()
public void setOffset(Long Offset)
Offset - Query list offsetpublic Long getLimit()
public void setLimit(Long Limit)
Limit - Number of returned results in query listCopyright © 2023. All rights reserved.