IkeTrafficSelector

Kotlin |Java

class IkeTrafficSelector

kotlin.Any
↳	android.net.ipsec.ike.IkeTrafficSelector

IkeTrafficSelector represents a Traffic Selector of a Child Session.

Traffic Selectors specify addresses that are acceptable within the IPsec SA.

Callers can propose IkeTrafficSelectors when building a ChildSessionParams and receive the negotiated IkeTrafficSelectors via a ChildSessionConfiguration.

Summary

Public constructors
`IkeTrafficSelector(startPort: Int, endPort: Int, startingAddress: InetAddress, endingAddress: InetAddress)` Construct an instance of `IkeTrafficSelector` for negotiating a Child Session.

Public methods
Boolean	`equals(other: Any?)` Indicates whether some other object is "equal to" this one.
Int	`hashCode()` Returns a hash code value for the object.

Properties
Int	`endPort` The largest port number allowed by this Traffic Selector.
InetAddress	`endingAddress` The largest address included in this Traffic Selector.
Int	`startPort` The smallest port number allowed by this Traffic Selector.
InetAddress	`startingAddress` The smallest address included in this Traffic Selector.

Public constructors

IkeTrafficSelector

Added in API level 31

IkeTrafficSelector(
    startPort: Int, 
    endPort: Int, 
    startingAddress: InetAddress, 
    endingAddress: InetAddress)

Construct an instance of IkeTrafficSelector for negotiating a Child Session.

Android platform does not support port-based routing. The port range negotiation is only informational.

Parameters
`startPort`	Int: the smallest port number allowed by this Traffic Selector.
`endPort`	Int: the largest port number allowed by this Traffic Selector.
`startingAddress`	InetAddress: the smallest address included in this Traffic Selector. This value cannot be `null`.
`endingAddress`	InetAddress: the largest address included in this Traffic Selector. This value cannot be `null`.

Public methods

equals

Added in API level 31

fun equals(other: Any?): Boolean

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

Parameters
`obj`	the reference object with which to compare.

Return
`Boolean`	`true` if this object is the same as the obj argument; `false` otherwise.

hashCode

Added in API level 31

fun hashCode(): Int

Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.