| Class and Description |
|---|
| TransportAddress |
| Class and Description |
|---|
| TransportAddress |
| Class and Description |
|---|
| BoundTransportAddress
A bounded transport address is a tuple of
TransportAddress, one array that represents
the addresses the transport is bound to, and the other is the published one that represents the address clients
should communicate on. |
| DummyTransportAddress |
| InetSocketTransportAddress
A transport address used for IP socket address (wraps
InetSocketAddress). |
| LocalTransportAddress |
| PortsRange.PortCallback |
| TransportAddress |
| Class and Description |
|---|
| BoundTransportAddress
A bounded transport address is a tuple of
TransportAddress, one array that represents
the addresses the transport is bound to, and the other is the published one that represents the address clients
should communicate on. |
| Class and Description |
|---|
| BoundTransportAddress
A bounded transport address is a tuple of
TransportAddress, one array that represents
the addresses the transport is bound to, and the other is the published one that represents the address clients
should communicate on. |
| Class and Description |
|---|
| BoundTransportAddress
A bounded transport address is a tuple of
TransportAddress, one array that represents
the addresses the transport is bound to, and the other is the published one that represents the address clients
should communicate on. |
| TransportAddress |
| Class and Description |
|---|
| BoundTransportAddress
A bounded transport address is a tuple of
TransportAddress, one array that represents
the addresses the transport is bound to, and the other is the published one that represents the address clients
should communicate on. |
| TransportAddress |
| Class and Description |
|---|
| BoundTransportAddress
A bounded transport address is a tuple of
TransportAddress, one array that represents
the addresses the transport is bound to, and the other is the published one that represents the address clients
should communicate on. |
| TransportAddress |
Copyright © 2009–2017. All rights reserved.