Struct NodeSet 

pub struct NodeSet { /* private fields */ }

Compact set of NUMA node IDs (up to 64 nodes). Built directly into a Linux nodemask word at mbind time. Bigger systems need a dynamic representation; that’s not yet shipped.

Implementations

impl NodeSet

pub const fn empty() -> Self

Empty set.

pub const fn single(node: u32) -> Option<Self>

Single-node set.

pub const fn with(self, node: u32) -> Option<Self>

Add a node. Returns None if node >= 64.

pub const fn mask(&self) -> u64

Bit-mask view (low 64 nodes).

pub const fn is_empty(&self) -> bool

Whether the set is empty.

pub fn max_node_plus_one(&self) -> u32

Highest node id set, plus one. 0 if the set is empty.

Informational only — the mbind path always passes mbind_maxnode (a constant 64), not this value. Exposed for callers that want to know the occupied range.

pub fn mbind_maxnode(&self) -> u32

maxnode value to pass to mbind. mbind’s maxnode is the number of bits in the nodemask; the kernel reads ceil(maxnode / bits_per_long) words. We hand the kernel a single u64, so maxnode = 64 makes it read exactly those 8 bytes — independent of how many low bits are actually set.

Trait Implementations

impl Clone for NodeSet

fn clone(&self) -> NodeSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for NodeSet

impl Debug for NodeSet

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

Formats the value using the given formatter.

impl Eq for NodeSet

impl PartialEq for NodeSet

fn eq(&self, other: &NodeSet) -> 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 StructuralPartialEq for NodeSet