public class DescribeSearchTemplatesResponse extends AbstractModel
header, skipSign
Constructor and Description |
---|
DescribeSearchTemplatesResponse() |
DescribeSearchTemplatesResponse(DescribeSearchTemplatesResponse 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 |
---|---|
SearchTemplate[] |
getList()
Get Template 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 |
getTotalCount()
Get Total number
|
void |
setList(SearchTemplate[] List)
Set Template 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 |
setTotalCount(Long TotalCount)
Set Total number
|
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, toJsonString
public DescribeSearchTemplatesResponse()
public DescribeSearchTemplatesResponse(DescribeSearchTemplatesResponse source)
public Long getTotalCount()
public void setTotalCount(Long TotalCount)
TotalCount
- Total numberpublic SearchTemplate[] getList()
public void setList(SearchTemplate[] List)
List
- Template 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.