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

annotations.io.alauda.kubernetes.api.model.extensions.NetworkPolicyIngressRuleFluent Maven / Gradle / Ivy

There is a newer version: 0.2.12
Show newest version
package io.alauda.kubernetes.api.model.extensions;

import com.fasterxml.jackson.annotation.JsonIgnore;
import com.fasterxml.jackson.annotation.JsonProperty;
import io.alauda.kubernetes.api.builder.Fluent;
import com.fasterxml.jackson.annotation.JsonInclude;
import io.alauda.kubernetes.api.builder.Nested;
import java.lang.String;
import io.alauda.kubernetes.api.builder.Predicate;
import java.lang.Deprecated;
import javax.validation.Valid;
import java.util.Collection;
import java.lang.Object;
import java.util.List;
import java.lang.Boolean;
import java.util.Map;

public interface NetworkPolicyIngressRuleFluent> extends Fluent{


    public A addToFrom(int index,NetworkPolicyPeer item);
    public A setToFrom(int index,NetworkPolicyPeer item);
    public A addToFrom(NetworkPolicyPeer... items);
    public A addAllToFrom(Collection items);
    public A removeFromFrom(NetworkPolicyPeer... items);
    public A removeAllFromFrom(Collection items);
    
/**
 * This method has been deprecated, please use method buildFrom instead.
 */
@Deprecated public List getFrom();
    public List buildFrom();
    public NetworkPolicyPeer buildFrom(int index);
    public NetworkPolicyPeer buildFirstFrom();
    public NetworkPolicyPeer buildLastFrom();
    public NetworkPolicyPeer buildMatchingFrom(io.alauda.kubernetes.api.builder.Predicate predicate);
    public A withFrom(List from);
    public A withFrom(NetworkPolicyPeer... from);
    public Boolean hasFrom();
    public NetworkPolicyIngressRuleFluent.FromNested addNewFrom();
    public NetworkPolicyIngressRuleFluent.FromNested addNewFromLike(NetworkPolicyPeer item);
    public NetworkPolicyIngressRuleFluent.FromNested setNewFromLike(int index,NetworkPolicyPeer item);
    public NetworkPolicyIngressRuleFluent.FromNested editFrom(int index);
    public NetworkPolicyIngressRuleFluent.FromNested editFirstFrom();
    public NetworkPolicyIngressRuleFluent.FromNested editLastFrom();
    public NetworkPolicyIngressRuleFluent.FromNested editMatchingFrom(io.alauda.kubernetes.api.builder.Predicate predicate);
    public A addToPorts(int index,NetworkPolicyPort item);
    public A setToPorts(int index,NetworkPolicyPort item);
    public A addToPorts(NetworkPolicyPort... items);
    public A addAllToPorts(Collection items);
    public A removeFromPorts(NetworkPolicyPort... items);
    public A removeAllFromPorts(Collection items);
    
/**
 * This method has been deprecated, please use method buildPorts instead.
 */
@Deprecated public List getPorts();
    public List buildPorts();
    public NetworkPolicyPort buildPort(int index);
    public NetworkPolicyPort buildFirstPort();
    public NetworkPolicyPort buildLastPort();
    public NetworkPolicyPort buildMatchingPort(io.alauda.kubernetes.api.builder.Predicate predicate);
    public A withPorts(List ports);
    public A withPorts(NetworkPolicyPort... ports);
    public Boolean hasPorts();
    public NetworkPolicyIngressRuleFluent.PortsNested addNewPort();
    public NetworkPolicyIngressRuleFluent.PortsNested addNewPortLike(NetworkPolicyPort item);
    public NetworkPolicyIngressRuleFluent.PortsNested setNewPortLike(int index,NetworkPolicyPort item);
    public NetworkPolicyIngressRuleFluent.PortsNested editPort(int index);
    public NetworkPolicyIngressRuleFluent.PortsNested editFirstPort();
    public NetworkPolicyIngressRuleFluent.PortsNested editLastPort();
    public NetworkPolicyIngressRuleFluent.PortsNested editMatchingPort(io.alauda.kubernetes.api.builder.Predicate predicate);

    public interface FromNested extends io.alauda.kubernetes.api.builder.Nested,NetworkPolicyPeerFluent>{

        
    public N and();    public N endFrom();
}
    public interface PortsNested extends io.alauda.kubernetes.api.builder.Nested,NetworkPolicyPortFluent>{

        
    public N and();    public N endPort();
}


}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy