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

io.kubernetes.client.openapi.models.V1ResourceRequirementsFluent Maven / Gradle / Ivy

The newest version!
package io.kubernetes.client.openapi.models;

import io.kubernetes.client.fluent.VisitableBuilder;
import java.lang.SuppressWarnings;
import io.kubernetes.client.fluent.Nested;
import java.util.ArrayList;
import io.kubernetes.client.custom.Quantity;
import java.lang.String;
import java.util.LinkedHashMap;
import java.util.function.Predicate;
import io.kubernetes.client.fluent.BaseFluent;
import java.util.Iterator;
import java.util.Collection;
import java.lang.Object;
import java.util.List;
import java.util.Map;

/**
 * Generated
 */
@SuppressWarnings("unchecked")
public class V1ResourceRequirementsFluent> extends BaseFluent{
  public V1ResourceRequirementsFluent() {
  }
  
  public V1ResourceRequirementsFluent(V1ResourceRequirements instance) {
    this.copyInstance(instance);
  }
  private ArrayList claims;
  private Map limits;
  private Map requests;
  
  protected void copyInstance(V1ResourceRequirements instance) {
    instance = (instance != null ? instance : new V1ResourceRequirements());
    if (instance != null) {
          this.withClaims(instance.getClaims());
          this.withLimits(instance.getLimits());
          this.withRequests(instance.getRequests());
        }
  }
  
  public A addToClaims(int index,V1ResourceClaim item) {
    if (this.claims == null) {this.claims = new ArrayList();}
    V1ResourceClaimBuilder builder = new V1ResourceClaimBuilder(item);
    if (index < 0 || index >= claims.size()) {
        _visitables.get("claims").add(builder);
        claims.add(builder);
    } else {
        _visitables.get("claims").add(builder);
        claims.add(index, builder);
    }
    return (A)this;
  }
  
  public A setToClaims(int index,V1ResourceClaim item) {
    if (this.claims == null) {this.claims = new ArrayList();}
    V1ResourceClaimBuilder builder = new V1ResourceClaimBuilder(item);
    if (index < 0 || index >= claims.size()) {
        _visitables.get("claims").add(builder);
        claims.add(builder);
    } else {
        _visitables.get("claims").add(builder);
        claims.set(index, builder);
    }
    return (A)this;
  }
  
  public A addToClaims(io.kubernetes.client.openapi.models.V1ResourceClaim... items) {
    if (this.claims == null) {this.claims = new ArrayList();}
    for (V1ResourceClaim item : items) {V1ResourceClaimBuilder builder = new V1ResourceClaimBuilder(item);_visitables.get("claims").add(builder);this.claims.add(builder);} return (A)this;
  }
  
  public A addAllToClaims(Collection items) {
    if (this.claims == null) {this.claims = new ArrayList();}
    for (V1ResourceClaim item : items) {V1ResourceClaimBuilder builder = new V1ResourceClaimBuilder(item);_visitables.get("claims").add(builder);this.claims.add(builder);} return (A)this;
  }
  
  public A removeFromClaims(io.kubernetes.client.openapi.models.V1ResourceClaim... items) {
    if (this.claims == null) return (A)this;
    for (V1ResourceClaim item : items) {V1ResourceClaimBuilder builder = new V1ResourceClaimBuilder(item);_visitables.get("claims").remove(builder); this.claims.remove(builder);} return (A)this;
  }
  
  public A removeAllFromClaims(Collection items) {
    if (this.claims == null) return (A)this;
    for (V1ResourceClaim item : items) {V1ResourceClaimBuilder builder = new V1ResourceClaimBuilder(item);_visitables.get("claims").remove(builder); this.claims.remove(builder);} return (A)this;
  }
  
  public A removeMatchingFromClaims(Predicate predicate) {
    if (claims == null) return (A) this;
    final Iterator each = claims.iterator();
    final List visitables = _visitables.get("claims");
    while (each.hasNext()) {
      V1ResourceClaimBuilder builder = each.next();
      if (predicate.test(builder)) {
        visitables.remove(builder);
        each.remove();
      }
    }
    return (A)this;
  }
  
  public List buildClaims() {
    return this.claims != null ? build(claims) : null;
  }
  
  public V1ResourceClaim buildClaim(int index) {
    return this.claims.get(index).build();
  }
  
  public V1ResourceClaim buildFirstClaim() {
    return this.claims.get(0).build();
  }
  
  public V1ResourceClaim buildLastClaim() {
    return this.claims.get(claims.size() - 1).build();
  }
  
  public V1ResourceClaim buildMatchingClaim(Predicate predicate) {
      for (V1ResourceClaimBuilder item : claims) {
        if (predicate.test(item)) {
          return item.build();
        }
      }
      return null;
  }
  
  public boolean hasMatchingClaim(Predicate predicate) {
      for (V1ResourceClaimBuilder item : claims) {
        if (predicate.test(item)) {
          return true;
        }
      }
      return false;
  }
  
  public A withClaims(List claims) {
    if (this.claims != null) {
      this._visitables.get("claims").clear();
    }
    if (claims != null) {
        this.claims = new ArrayList();
        for (V1ResourceClaim item : claims) {
          this.addToClaims(item);
        }
    } else {
      this.claims = null;
    }
    return (A) this;
  }
  
  public A withClaims(io.kubernetes.client.openapi.models.V1ResourceClaim... claims) {
    if (this.claims != null) {
        this.claims.clear();
        _visitables.remove("claims");
    }
    if (claims != null) {
      for (V1ResourceClaim item : claims) {
        this.addToClaims(item);
      }
    }
    return (A) this;
  }
  
  public boolean hasClaims() {
    return this.claims != null && !this.claims.isEmpty();
  }
  
  public ClaimsNested addNewClaim() {
    return new ClaimsNested(-1, null);
  }
  
  public ClaimsNested addNewClaimLike(V1ResourceClaim item) {
    return new ClaimsNested(-1, item);
  }
  
  public ClaimsNested setNewClaimLike(int index,V1ResourceClaim item) {
    return new ClaimsNested(index, item);
  }
  
  public ClaimsNested editClaim(int index) {
    if (claims.size() <= index) throw new RuntimeException("Can't edit claims. Index exceeds size.");
    return setNewClaimLike(index, buildClaim(index));
  }
  
  public ClaimsNested editFirstClaim() {
    if (claims.size() == 0) throw new RuntimeException("Can't edit first claims. The list is empty.");
    return setNewClaimLike(0, buildClaim(0));
  }
  
  public ClaimsNested editLastClaim() {
    int index = claims.size() - 1;
    if (index < 0) throw new RuntimeException("Can't edit last claims. The list is empty.");
    return setNewClaimLike(index, buildClaim(index));
  }
  
  public ClaimsNested editMatchingClaim(Predicate predicate) {
    int index = -1;
    for (int i=0;i map) {
    if(this.limits == null && map != null) { this.limits = new LinkedHashMap(); }
    if(map != null) { this.limits.putAll(map);} return (A)this;
  }
  
  public A removeFromLimits(String key) {
    if(this.limits == null) { return (A) this; }
    if(key != null && this.limits != null) {this.limits.remove(key);} return (A)this;
  }
  
  public A removeFromLimits(Map map) {
    if(this.limits == null) { return (A) this; }
    if(map != null) { for(Object key : map.keySet()) {if (this.limits != null){this.limits.remove(key);}}} return (A)this;
  }
  
  public Map getLimits() {
    return this.limits;
  }
  
  public A withLimits(Map limits) {
    if (limits == null) {
      this.limits = null;
    } else {
      this.limits = new LinkedHashMap(limits);
    }
    return (A) this;
  }
  
  public boolean hasLimits() {
    return this.limits != null;
  }
  
  public A addToRequests(String key,Quantity value) {
    if(this.requests == null && key != null && value != null) { this.requests = new LinkedHashMap(); }
    if(key != null && value != null) {this.requests.put(key, value);} return (A)this;
  }
  
  public A addToRequests(Map map) {
    if(this.requests == null && map != null) { this.requests = new LinkedHashMap(); }
    if(map != null) { this.requests.putAll(map);} return (A)this;
  }
  
  public A removeFromRequests(String key) {
    if(this.requests == null) { return (A) this; }
    if(key != null && this.requests != null) {this.requests.remove(key);} return (A)this;
  }
  
  public A removeFromRequests(Map map) {
    if(this.requests == null) { return (A) this; }
    if(map != null) { for(Object key : map.keySet()) {if (this.requests != null){this.requests.remove(key);}}} return (A)this;
  }
  
  public Map getRequests() {
    return this.requests;
  }
  
  public A withRequests(Map requests) {
    if (requests == null) {
      this.requests = null;
    } else {
      this.requests = new LinkedHashMap(requests);
    }
    return (A) this;
  }
  
  public boolean hasRequests() {
    return this.requests != null;
  }
  
  public boolean equals(Object o) {
    if (this == o) return true;
    if (o == null || getClass() != o.getClass()) return false;
    if (!super.equals(o)) return false;
    V1ResourceRequirementsFluent that = (V1ResourceRequirementsFluent) o;
    if (!java.util.Objects.equals(claims, that.claims)) return false;
    if (!java.util.Objects.equals(limits, that.limits)) return false;
    if (!java.util.Objects.equals(requests, that.requests)) return false;
    return true;
  }
  
  public int hashCode() {
    return java.util.Objects.hash(claims,  limits,  requests,  super.hashCode());
  }
  
  public String toString() {
    StringBuilder sb = new StringBuilder();
    sb.append("{");
    if (claims != null && !claims.isEmpty()) { sb.append("claims:"); sb.append(claims + ","); }
    if (limits != null && !limits.isEmpty()) { sb.append("limits:"); sb.append(limits + ","); }
    if (requests != null && !requests.isEmpty()) { sb.append("requests:"); sb.append(requests); }
    sb.append("}");
    return sb.toString();
  }
  public class ClaimsNested extends V1ResourceClaimFluent> implements Nested{
    ClaimsNested(int index,V1ResourceClaim item) {
      this.index = index;
      this.builder = new V1ResourceClaimBuilder(this, item);
    }
    V1ResourceClaimBuilder builder;
    int index;
    
    public N and() {
      return (N) V1ResourceRequirementsFluent.this.setToClaims(index,builder.build());
    }
    
    public N endClaim() {
      return and();
    }
    
  
  }

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy