public class DescribeDBXlogsResponse extends AbstractModel
header, skipSign
Constructor and Description |
---|
DescribeDBXlogsResponse() |
DescribeDBXlogsResponse(DescribeDBXlogsResponse 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 |
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 Number of date entries returned this time.
|
Xlog[] |
getXlogList()
Get Xlog 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 Number of date entries returned this time.
|
void |
setXlogList(Xlog[] XlogList)
Set Xlog list
|
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 DescribeDBXlogsResponse()
public DescribeDBXlogsResponse(DescribeDBXlogsResponse source)
public Long getTotalCount()
public void setTotalCount(Long TotalCount)
TotalCount
- Number of date entries returned this time.public Xlog[] getXlogList()
public void setXlogList(Xlog[] XlogList)
XlogList
- Xlog 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.