
com.tencentcloudapi.cbs.v20170312.models.DescribeDiskStoragePoolResponse Maven / Gradle / Ivy
/*
* Copyright (c) 2017-2018 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.tencentcloudapi.cbs.v20170312.models;
import com.tencentcloudapi.common.AbstractModel;
import com.tencentcloudapi.common.SSEResponseModel;
import com.google.gson.annotations.SerializedName;
import com.google.gson.annotations.Expose;
import java.util.HashMap;
public class DescribeDiskStoragePoolResponse extends AbstractModel {
/**
* 符合条件的独享集群的数量
*/
@SerializedName("TotalCount")
@Expose
private Long TotalCount;
/**
* 独享集群的详细信息列表
*/
@SerializedName("CdcSet")
@Expose
private Cdc [] CdcSet;
/**
* 独享集群的详细信息列表
*/
@SerializedName("DiskStoragePoolSet")
@Expose
private Cdc [] DiskStoragePoolSet;
/**
* 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。
*/
@SerializedName("RequestId")
@Expose
private String RequestId;
/**
* Get 符合条件的独享集群的数量
* @return TotalCount 符合条件的独享集群的数量
*/
public Long getTotalCount() {
return this.TotalCount;
}
/**
* Set 符合条件的独享集群的数量
* @param TotalCount 符合条件的独享集群的数量
*/
public void setTotalCount(Long TotalCount) {
this.TotalCount = TotalCount;
}
/**
* Get 独享集群的详细信息列表
* @return CdcSet 独享集群的详细信息列表
*/
public Cdc [] getCdcSet() {
return this.CdcSet;
}
/**
* Set 独享集群的详细信息列表
* @param CdcSet 独享集群的详细信息列表
*/
public void setCdcSet(Cdc [] CdcSet) {
this.CdcSet = CdcSet;
}
/**
* Get 独享集群的详细信息列表
* @return DiskStoragePoolSet 独享集群的详细信息列表
*/
public Cdc [] getDiskStoragePoolSet() {
return this.DiskStoragePoolSet;
}
/**
* Set 独享集群的详细信息列表
* @param DiskStoragePoolSet 独享集群的详细信息列表
*/
public void setDiskStoragePoolSet(Cdc [] DiskStoragePoolSet) {
this.DiskStoragePoolSet = DiskStoragePoolSet;
}
/**
* Get 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。
* @return RequestId 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。
*/
public String getRequestId() {
return this.RequestId;
}
/**
* Set 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。
* @param RequestId 唯一请求 ID,由服务端生成,每次请求都会返回(若请求因其他原因未能抵达服务端,则该次请求不会获得 RequestId)。定位问题时需要提供该次请求的 RequestId。
*/
public void setRequestId(String RequestId) {
this.RequestId = RequestId;
}
public DescribeDiskStoragePoolResponse() {
}
/**
* 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.
*/
public DescribeDiskStoragePoolResponse(DescribeDiskStoragePoolResponse source) {
if (source.TotalCount != null) {
this.TotalCount = new Long(source.TotalCount);
}
if (source.CdcSet != null) {
this.CdcSet = new Cdc[source.CdcSet.length];
for (int i = 0; i < source.CdcSet.length; i++) {
this.CdcSet[i] = new Cdc(source.CdcSet[i]);
}
}
if (source.DiskStoragePoolSet != null) {
this.DiskStoragePoolSet = new Cdc[source.DiskStoragePoolSet.length];
for (int i = 0; i < source.DiskStoragePoolSet.length; i++) {
this.DiskStoragePoolSet[i] = new Cdc(source.DiskStoragePoolSet[i]);
}
}
if (source.RequestId != null) {
this.RequestId = new String(source.RequestId);
}
}
/**
* Internal implementation, normal users should not use it.
*/
public void toMap(HashMap map, String prefix) {
this.setParamSimple(map, prefix + "TotalCount", this.TotalCount);
this.setParamArrayObj(map, prefix + "CdcSet.", this.CdcSet);
this.setParamArrayObj(map, prefix + "DiskStoragePoolSet.", this.DiskStoragePoolSet);
this.setParamSimple(map, prefix + "RequestId", this.RequestId);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy