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

io.fabric8.kubernetes.api.model.CapabilitiesFluentImpl Maven / Gradle / Ivy

package io.fabric8.kubernetes.api.model;

import java.util.ArrayList;
import java.lang.String;
import java.util.LinkedHashMap;
import java.util.function.Predicate;
import java.lang.Integer;
import io.fabric8.kubernetes.api.builder.BaseFluent;
import java.util.Collection;
import java.lang.Object;
import java.util.List;
import java.lang.Boolean;
import java.util.Map;

 /**
  * Generated
  */
public class CapabilitiesFluentImpl> extends io.fabric8.kubernetes.api.builder.BaseFluent implements io.fabric8.kubernetes.api.model.CapabilitiesFluent{
  public CapabilitiesFluentImpl() {
  }
  public CapabilitiesFluentImpl(io.fabric8.kubernetes.api.model.Capabilities instance) {
    this.withAdd(instance.getAdd()); 
    this.withDrop(instance.getDrop()); 
    this.withAdditionalProperties(instance.getAdditionalProperties());

  }
  private java.util.List add = new java.util.ArrayList();
  private java.util.List drop = new java.util.ArrayList();
  private java.util.Map additionalProperties;
  public A addToAdd(java.lang.Integer index,java.lang.String item) {
    if (this.add == null) {this.add = new java.util.ArrayList();}
    this.add.add(index, item);
    return (A)this;
  }
  public A setToAdd(java.lang.Integer index,java.lang.String item) {
    if (this.add == null) {this.add = new java.util.ArrayList();}
    this.add.set(index, item); return (A)this;
  }
  public A addToAdd(java.lang.String... items) {
    if (this.add == null) {this.add = new java.util.ArrayList();}
    for (java.lang.String item : items) {this.add.add(item);} return (A)this;
  }
  public A addAllToAdd(java.util.Collection items) {
    if (this.add == null) {this.add = new java.util.ArrayList();}
    for (java.lang.String item : items) {this.add.add(item);} return (A)this;
  }
  public A removeFromAdd(java.lang.String... items) {
    for (java.lang.String item : items) {if (this.add!= null){ this.add.remove(item);}} return (A)this;
  }
  public A removeAllFromAdd(java.util.Collection items) {
    for (java.lang.String item : items) {if (this.add!= null){ this.add.remove(item);}} return (A)this;
  }
  public java.util.List getAdd() {
    return this.add;
  }
  public java.lang.String getAdd(java.lang.Integer index) {
    return this.add.get(index);
  }
  public java.lang.String getFirstAdd() {
    return this.add.get(0);
  }
  public java.lang.String getLastAdd() {
    return this.add.get(add.size() - 1);
  }
  public java.lang.String getMatchingAdd(java.util.function.Predicate predicate) {
    for (java.lang.String item: add) { if(predicate.test(item)){ return item;} } return null;
  }
  public java.lang.Boolean hasMatchingAdd(java.util.function.Predicate predicate) {
    for (java.lang.String item: add) { if(predicate.test(item)){ return true;} } return false;
  }
  public A withAdd(java.util.List add) {
    if (add != null) {this.add = new java.util.ArrayList(); for (java.lang.String item : add){this.addToAdd(item);}} else { this.add = null;} return (A) this;
  }
  public A withAdd(java.lang.String... add) {
    if (this.add != null) {this.add.clear();}
    if (add != null) {for (java.lang.String item :add){ this.addToAdd(item);}} return (A) this;
  }
  public java.lang.Boolean hasAdd() {
    return add != null && !add.isEmpty();
  }
  public A addNewAdd(java.lang.String arg0) {
    return (A)addToAdd(new String(arg0));
  }
  public A addToDrop(java.lang.Integer index,java.lang.String item) {
    if (this.drop == null) {this.drop = new java.util.ArrayList();}
    this.drop.add(index, item);
    return (A)this;
  }
  public A setToDrop(java.lang.Integer index,java.lang.String item) {
    if (this.drop == null) {this.drop = new java.util.ArrayList();}
    this.drop.set(index, item); return (A)this;
  }
  public A addToDrop(java.lang.String... items) {
    if (this.drop == null) {this.drop = new java.util.ArrayList();}
    for (java.lang.String item : items) {this.drop.add(item);} return (A)this;
  }
  public A addAllToDrop(java.util.Collection items) {
    if (this.drop == null) {this.drop = new java.util.ArrayList();}
    for (java.lang.String item : items) {this.drop.add(item);} return (A)this;
  }
  public A removeFromDrop(java.lang.String... items) {
    for (java.lang.String item : items) {if (this.drop!= null){ this.drop.remove(item);}} return (A)this;
  }
  public A removeAllFromDrop(java.util.Collection items) {
    for (java.lang.String item : items) {if (this.drop!= null){ this.drop.remove(item);}} return (A)this;
  }
  public java.util.List getDrop() {
    return this.drop;
  }
  public java.lang.String getDrop(java.lang.Integer index) {
    return this.drop.get(index);
  }
  public java.lang.String getFirstDrop() {
    return this.drop.get(0);
  }
  public java.lang.String getLastDrop() {
    return this.drop.get(drop.size() - 1);
  }
  public java.lang.String getMatchingDrop(java.util.function.Predicate predicate) {
    for (java.lang.String item: drop) { if(predicate.test(item)){ return item;} } return null;
  }
  public java.lang.Boolean hasMatchingDrop(java.util.function.Predicate predicate) {
    for (java.lang.String item: drop) { if(predicate.test(item)){ return true;} } return false;
  }
  public A withDrop(java.util.List drop) {
    if (drop != null) {this.drop = new java.util.ArrayList(); for (java.lang.String item : drop){this.addToDrop(item);}} else { this.drop = null;} return (A) this;
  }
  public A withDrop(java.lang.String... drop) {
    if (this.drop != null) {this.drop.clear();}
    if (drop != null) {for (java.lang.String item :drop){ this.addToDrop(item);}} return (A) this;
  }
  public java.lang.Boolean hasDrop() {
    return drop != null && !drop.isEmpty();
  }
  public A addNewDrop(java.lang.String arg0) {
    return (A)addToDrop(new String(arg0));
  }
  public A addToAdditionalProperties(java.lang.String key,java.lang.Object value) {
    if(this.additionalProperties == null && key != null && value != null) { this.additionalProperties = new java.util.LinkedHashMap(); }
    if(key != null && value != null) {this.additionalProperties.put(key, value);} return (A)this;
  }
  public A addToAdditionalProperties(java.util.Map map) {
    if(this.additionalProperties == null && map != null) { this.additionalProperties = new java.util.LinkedHashMap(); }
    if(map != null) { this.additionalProperties.putAll(map);} return (A)this;
  }
  public A removeFromAdditionalProperties(java.lang.String key) {
    if(this.additionalProperties == null) { return (A) this; }
    if(key != null && this.additionalProperties != null) {this.additionalProperties.remove(key);} return (A)this;
  }
  public A removeFromAdditionalProperties(java.util.Map map) {
    if(this.additionalProperties == null) { return (A) this; }
    if(map != null) { for(Object key : map.keySet()) {if (this.additionalProperties != null){this.additionalProperties.remove(key);}}} return (A)this;
  }
  public java.util.Map getAdditionalProperties() {
    return this.additionalProperties;
  }
  public A withAdditionalProperties(java.util.Map additionalProperties) {
    if (additionalProperties == null) { this.additionalProperties =  null;} else {this.additionalProperties = new java.util.LinkedHashMap(additionalProperties);} return (A) this;
  }
  public java.lang.Boolean hasAdditionalProperties() {
    return this.additionalProperties != null;
  }
  public boolean equals(java.lang.Object o) {
    if (this == o) return true;
    if (o == null || getClass() != o.getClass()) return false;
    CapabilitiesFluentImpl that = (CapabilitiesFluentImpl) o;
    if (add != null ? !add.equals(that.add) :that.add != null) return false;
    if (drop != null ? !drop.equals(that.drop) :that.drop != null) return false;
    if (additionalProperties != null ? !additionalProperties.equals(that.additionalProperties) :that.additionalProperties != null) return false;
    return true;
  }
  public int hashCode() {
    return java.util.Objects.hash(add,  drop,  additionalProperties,  super.hashCode());
  }
  
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy