public class ModifyIncrementalMigrationResponse extends AbstractModel
header, skipSign
Constructor and Description |
---|
ModifyIncrementalMigrationResponse() |
ModifyIncrementalMigrationResponse(ModifyIncrementalMigrationResponse 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 |
getIncrementalMigrationId()
Get ID of an incremental backup import task
|
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).
|
void |
setIncrementalMigrationId(String IncrementalMigrationId)
Set ID of an incremental backup import task
|
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 |
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 ModifyIncrementalMigrationResponse()
public ModifyIncrementalMigrationResponse(ModifyIncrementalMigrationResponse source)
public String getIncrementalMigrationId()
public void setIncrementalMigrationId(String IncrementalMigrationId)
IncrementalMigrationId
- ID of an incremental backup import taskpublic 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.