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

com.solidfire.element.api.VolumeQOS Maven / Gradle / Ivy

There is a newer version: 1.5.0.89
Show newest version
/*
 * Copyright © 2014-2016 NetApp, Inc. 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.
 */
/*
 * DO NOT EDIT THIS CODE BY HAND! It has been generated with jsvcgen.
 */
package com.solidfire.element.api;

import com.solidfire.gson.annotations.SerializedName;
import com.solidfire.jsvcgen.annotation.Since;
import com.solidfire.jsvcgen.client.ApiException;
import com.solidfire.jsvcgen.javautil.Optional;

import java.net.URL;

import java.io.Serializable;

import java.util.Arrays;
import java.util.Objects;
import java.util.TreeMap;

import static com.solidfire.jsvcgen.javautil.Optional.of;


/**
 * Quality of Service (QoS) Result values are used on SolidFire volumes to provision performance expectations.
 **/
public class VolumeQOS  implements Serializable  {

    private static final long serialVersionUID = -1221769299L;

    @SerializedName("minIOPS") private final Long minIOPS;
    @SerializedName("maxIOPS") private final Long maxIOPS;
    @SerializedName("burstIOPS") private final Long burstIOPS;
    @SerializedName("burstTime") private final Long burstTime;
    @SerializedName("curve") private final java.util.Map curve;

    /**
     * Quality of Service (QoS) Result values are used on SolidFire volumes to provision performance expectations.
     * @param minIOPS [required] Desired minimum 4KB IOPS to guarantee.
     * @param maxIOPS [required] Desired maximum 4KB IOPS allowed over an extended period of time.
     * @param burstIOPS [required] Maximum "peak" 4KB IOPS allowed for short periods of time.
     * @param burstTime [required] The length of time burst IOPS is allowed.
     * @param curve [required] The curve is a set of key-value pairs.
     * @since 7.0
     **/
    @Since("7.0")
    public VolumeQOS(Long minIOPS, Long maxIOPS, Long burstIOPS, Long burstTime, java.util.Map curve) {
        this.curve = curve;
        this.burstIOPS = burstIOPS;
        this.burstTime = burstTime;
        this.maxIOPS = maxIOPS;
        this.minIOPS = minIOPS;
    }


    /**
     * Desired minimum 4KB IOPS to guarantee.
     * The allowed IOPS will only drop below this level if all volumes have been capped
     * at their min IOPS value and there is still insufficient performance capacity.
     **/
    public Long getMinIOPS() {
        return this.minIOPS;
    }

    /**
     * Desired maximum 4KB IOPS allowed over an extended period of time.
     **/
    public Long getMaxIOPS() {
        return this.maxIOPS;
    }

    /**
     * Maximum "peak" 4KB IOPS allowed for short periods of time.
     * Allows for bursts of I/O activity over the normal max IOPS value.
     **/
    public Long getBurstIOPS() {
        return this.burstIOPS;
    }

    /**
     * The length of time burst IOPS is allowed.
     * The value returned is represented in time units of seconds.
     * 
Note: this value is calculated by the system based on IOPS set for QoS. **/ public Long getBurstTime() { return this.burstTime; } /** * The curve is a set of key-value pairs. * The keys are I/O sizes in bytes. * The values represent the cost performing an IOP at a specific I/O size. * The curve is calculated relative to a 4096 byte operation set at 100 IOPS. **/ public java.util.Map getCurve() { return this.curve; } @Override public boolean equals(Object o) { if (this == o) return true; if (o == null || getClass() != o.getClass()) return false; VolumeQOS that = (VolumeQOS) o; return Objects.equals( minIOPS , that.minIOPS ) && Objects.equals( maxIOPS , that.maxIOPS ) && Objects.equals( burstIOPS , that.burstIOPS ) && Objects.equals( burstTime , that.burstTime ) && Objects.equals( curve , that.curve ); } @Override public int hashCode() { return Objects.hash( minIOPS, maxIOPS, burstIOPS, burstTime, curve ); } @Override public String toString() { final StringBuilder sb = new StringBuilder(); sb.append( "{ " ); sb.append(" minIOPS : ").append(minIOPS).append(","); sb.append(" maxIOPS : ").append(maxIOPS).append(","); sb.append(" burstIOPS : ").append(burstIOPS).append(","); sb.append(" burstTime : ").append(burstTime).append(","); sb.append(" curve : ").append(curve); sb.append( " }" ); if(sb.lastIndexOf(", }") != -1) sb.deleteCharAt(sb.lastIndexOf(", }")); return sb.toString(); } public static Builder builder() { return new Builder(); } public final Builder asBuilder() { return new Builder().buildFrom(this); } public static class Builder { private Long minIOPS; private Long maxIOPS; private Long burstIOPS; private Long burstTime; private java.util.Map curve; private Builder() { } public VolumeQOS build() { return new VolumeQOS ( this.minIOPS, this.maxIOPS, this.burstIOPS, this.burstTime, this.curve ); } private VolumeQOS.Builder buildFrom(final VolumeQOS req) { this.minIOPS = req.minIOPS; this.maxIOPS = req.maxIOPS; this.burstIOPS = req.burstIOPS; this.burstTime = req.burstTime; this.curve = req.curve; return this; } public VolumeQOS.Builder minIOPS(final Long minIOPS) { this.minIOPS = minIOPS; return this; } public VolumeQOS.Builder maxIOPS(final Long maxIOPS) { this.maxIOPS = maxIOPS; return this; } public VolumeQOS.Builder burstIOPS(final Long burstIOPS) { this.burstIOPS = burstIOPS; return this; } public VolumeQOS.Builder burstTime(final Long burstTime) { this.burstTime = burstTime; return this; } public VolumeQOS.Builder curve(final java.util.Map curve) { this.curve = curve; return this; } } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy