All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.tencentcloudapi.yunjing.v20180228.models.DescribeVulsRequest 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.yunjing.v20180228.models;

import com.tencentcloudapi.common.AbstractModel;
import com.google.gson.annotations.SerializedName;
import com.google.gson.annotations.Expose;
import java.util.HashMap;

public class DescribeVulsRequest extends AbstractModel{

    /**
    * 漏洞类型。
  • WEB:Web应用漏洞
  • SYSTEM:系统组件漏洞
  • BASELINE:安全基线
  • */ @SerializedName("VulType") @Expose private String VulType; /** * 返回数量,默认为10,最大值为100。 */ @SerializedName("Limit") @Expose private Long Limit; /** * 偏移量,默认为0。 */ @SerializedName("Offset") @Expose private Long Offset; /** * 过滤条件。
  • Status - String - 是否必填:否 - 状态筛选(UN_OPERATED: 待处理 | FIXED:已修复) Status过滤条件值只能取其一,不能是“或”逻辑。 */ @SerializedName("Filters") @Expose private Filter [] Filters; /** * Get 漏洞类型。
  • WEB:Web应用漏洞
  • SYSTEM:系统组件漏洞
  • BASELINE:安全基线
  • * @return VulType 漏洞类型。
  • WEB:Web应用漏洞
  • SYSTEM:系统组件漏洞
  • BASELINE:安全基线
  • */ public String getVulType() { return this.VulType; } /** * Set 漏洞类型。
  • WEB:Web应用漏洞
  • SYSTEM:系统组件漏洞
  • BASELINE:安全基线
  • * @param VulType 漏洞类型。
  • WEB:Web应用漏洞
  • SYSTEM:系统组件漏洞
  • BASELINE:安全基线
  • */ public void setVulType(String VulType) { this.VulType = VulType; } /** * Get 返回数量,默认为10,最大值为100。 * @return Limit 返回数量,默认为10,最大值为100。 */ public Long getLimit() { return this.Limit; } /** * Set 返回数量,默认为10,最大值为100。 * @param Limit 返回数量,默认为10,最大值为100。 */ public void setLimit(Long Limit) { this.Limit = Limit; } /** * Get 偏移量,默认为0。 * @return Offset 偏移量,默认为0。 */ public Long getOffset() { return this.Offset; } /** * Set 偏移量,默认为0。 * @param Offset 偏移量,默认为0。 */ public void setOffset(Long Offset) { this.Offset = Offset; } /** * Get 过滤条件。
  • Status - String - 是否必填:否 - 状态筛选(UN_OPERATED: 待处理 | FIXED:已修复) Status过滤条件值只能取其一,不能是“或”逻辑。 * @return Filters 过滤条件。
  • Status - String - 是否必填:否 - 状态筛选(UN_OPERATED: 待处理 | FIXED:已修复) Status过滤条件值只能取其一,不能是“或”逻辑。 */ public Filter [] getFilters() { return this.Filters; } /** * Set 过滤条件。
  • Status - String - 是否必填:否 - 状态筛选(UN_OPERATED: 待处理 | FIXED:已修复) Status过滤条件值只能取其一,不能是“或”逻辑。 * @param Filters 过滤条件。
  • Status - String - 是否必填:否 - 状态筛选(UN_OPERATED: 待处理 | FIXED:已修复) Status过滤条件值只能取其一,不能是“或”逻辑。 */ public void setFilters(Filter [] Filters) { this.Filters = Filters; } public DescribeVulsRequest() { } /** * 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 DescribeVulsRequest(DescribeVulsRequest source) { if (source.VulType != null) { this.VulType = new String(source.VulType); } if (source.Limit != null) { this.Limit = new Long(source.Limit); } if (source.Offset != null) { this.Offset = new Long(source.Offset); } if (source.Filters != null) { this.Filters = new Filter[source.Filters.length]; for (int i = 0; i < source.Filters.length; i++) { this.Filters[i] = new Filter(source.Filters[i]); } } } /** * Internal implementation, normal users should not use it. */ public void toMap(HashMap map, String prefix) { this.setParamSimple(map, prefix + "VulType", this.VulType); this.setParamSimple(map, prefix + "Limit", this.Limit); this.setParamSimple(map, prefix + "Offset", this.Offset); this.setParamArrayObj(map, prefix + "Filters.", this.Filters); } }




  • © 2015 - 2025 Weber Informatics LLC | Privacy Policy