public class DescribeNetworkFirewallNamespaceLabelListResponse extends AbstractModel
| Constructor and Description | 
|---|
| DescribeNetworkFirewallNamespaceLabelListResponse() | 
| DescribeNetworkFirewallNamespaceLabelListResponse(DescribeNetworkFirewallNamespaceLabelListResponse 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 | 
|---|---|
| NetworkClusterNamespaceLabelInfo[] | getClusterNamespaceLabelList()Get Cluster namespace label details | 
| String | getRequestId()Get The unique request ID, which is returned for each request. | 
| Long | getTotalCount()Get Total number of clusters | 
| void | setClusterNamespaceLabelList(NetworkClusterNamespaceLabelInfo[] ClusterNamespaceLabelList)Set Cluster namespace label details | 
| void | setRequestId(String RequestId)Set The unique request ID, which is returned for each request. | 
| void | setTotalCount(Long TotalCount)Set Total number of clusters | 
| void | toMap(HashMap<String,String> map,
     String prefix)Internal implementation, normal users should not use it. | 
any, fromJsonString, getBinaryParams, getMultipartRequestParams, set, setParamArrayObj, setParamArraySimple, setParamObj, setParamSimple, toJsonStringpublic DescribeNetworkFirewallNamespaceLabelListResponse()
public DescribeNetworkFirewallNamespaceLabelListResponse(DescribeNetworkFirewallNamespaceLabelListResponse source)
public Long getTotalCount()
public void setTotalCount(Long TotalCount)
TotalCount - Total number of clusterspublic NetworkClusterNamespaceLabelInfo[] getClusterNamespaceLabelList()
public void setClusterNamespaceLabelList(NetworkClusterNamespaceLabelInfo[] ClusterNamespaceLabelList)
ClusterNamespaceLabelList - Cluster namespace label detailspublic String getRequestId()
public void setRequestId(String RequestId)
RequestId - The unique request ID, which is returned for each request. RequestId is required for locating a problem.Copyright © 2023. All rights reserved.