public class DownloadL7LogsResponse extends AbstractModel
header, skipSign| Constructor and Description |
|---|
DownloadL7LogsResponse() |
DownloadL7LogsResponse(DownloadL7LogsResponse 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 |
|---|---|
L7OfflineLog[] |
getData()
Get List of L7 logs.
|
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 of query results.
|
void |
setData(L7OfflineLog[] Data)
Set List of L7 logs.
|
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 of query results.
|
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 DownloadL7LogsResponse()
public DownloadL7LogsResponse(DownloadL7LogsResponse source)
public Long getTotalCount()
public void setTotalCount(Long TotalCount)
TotalCount - Total number of query results.public L7OfflineLog[] getData()
public void setData(L7OfflineLog[] Data)
Data - List of L7 logs.public 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.