Struct Node 

pub struct Node { /* private fields */ }

Information about a Kafka node.

Implementations

impl Node

pub fn new(id: i32, host: String, port: i32) -> Self

Creates a new Node with no rack and not fenced.

Arguments

• id - the node id
• host - the host name
• port - the port

pub fn with_rack(id: i32, host: String, port: i32, rack: Option<String>) -> Self

Creates a new Node with the given rack.

Arguments

• id - the node id
• host - the host name
• port - the port
• rack - the rack, or None if unknown

pub fn with_rack_is_fenced( id: i32, host: String, port: i32, rack: Option<String>, is_fenced: bool, ) -> Self

Creates a new Node with the given rack and fenced status.

Arguments

• id - the node id
• host - the host name
• port - the port
• rack - the rack, or None if unknown
• is_fenced - whether the broker is fenced

pub fn no_node() -> &'static Node

Returns a sentinel node representing no node.

pub fn is_empty(&self) -> bool

Check whether this node is empty, which may be the case if no_node() is used as a placeholder in a response payload with an error.

Returns

true if it is, false otherwise

pub fn id(&self) -> i32

Returns the node id of this node.

pub fn id_string(&self) -> &str

Returns the string representation of the node id. Typically, the integer id is used to serialize over the wire, the string representation is used as an identifier with NetworkClient code.

pub fn host(&self) -> &str

Returns the host name for this node.

pub fn port(&self) -> i32

Returns the port for this node.

pub fn has_rack(&self) -> bool

Returns true if this node has a defined rack.

pub fn rack(&self) -> Option<&str>

Returns the rack for this node.

pub fn is_fenced(&self) -> bool

Returns whether this node is fenced.

This applies to broker nodes only. For controller quorum nodes, this field is not relevant and is defined to be false.

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Node

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Node

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for Node

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Node

Java’s Node.equals first requires getClass() == obj.getClass(), so a GroupCoordinatorNode never equals a plain Node with the same fields. Rust has no subclass to compare, so id_string stands in for the class: a plain node’s is id.to_string() and a group coordinator’s is "+" + id, so for equal ids the two id_strings are equal exactly when the Java classes are. Hash leaves it out, as Java’s hashCode leaves the class out; equal values still hash equally.

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Node