Struct NodeSet

Source

pub struct NodeSet { /* private fields */ }

Expand description

A set of cluster node names supporting range notation like node[1-100].

§Examples

use consortium::node_set::NodeSet;

let ns = NodeSet::parse("node[1-5,10]").unwrap();
assert_eq!(ns.len(), 6);
assert!(ns.contains("node3"));
assert!(!ns.contains("node7"));

Implementations§

Source §

impl NodeSet

Source

pub fn new() -> Self

Create an empty NodeSet.

Source

pub fn parse(pattern: &str) -> Result<Self>

Parse a node set from a string like "node[1-10,15],other[001-050]".

Source

pub fn parse_with_autostep(pattern: &str, autostep: Option<u32>) -> Result<Self>

Parse with explicit autostep setting.

Source

pub fn len(&self) -> usize

Number of individual nodes in the set.

Source

pub fn is_empty(&self) -> bool

Whether the set is empty.

Source

pub fn contains(&self, node: &str) -> bool

Check if a specific node name is in the set.

Source

pub fn update(&mut self, other: &NodeSet)

Update (union) this nodeset with another.

Source

pub fn update_str(&mut self, pattern: &str) -> Result<()>

Update from a string pattern.

Source

pub fn union(&self, other: &NodeSet) -> NodeSet

Return the union of this nodeset and another.

Source

pub fn intersection_update(&mut self, other: &NodeSet)

Intersection update: keep only elements in both.

Source

pub fn intersection(&self, other: &NodeSet) -> NodeSet

Return the intersection of this nodeset and another.

Source

pub fn difference_update(&mut self, other: &NodeSet)

Difference update: remove elements of other from self.

Source

pub fn difference(&self, other: &NodeSet) -> NodeSet

Return the difference of this nodeset and another.

Source

pub fn symmetric_difference_update(&mut self, other: &NodeSet)

Symmetric difference update.

Source

pub fn symmetric_difference(&self, other: &NodeSet) -> NodeSet

Return the symmetric difference of this nodeset and another.

Source

pub fn clear(&mut self)

Clear all nodes from this set.

Source

pub fn iter(&self) -> impl Iterator<Item = String> + '_

Iterate all individual node names in sorted order.

Source

pub fn index(&self, name: &str) -> Option<usize>

Return the zero-based position of the node name when iterating over this nodeset, or None if the node is not present.

This is the list-like index() method (upstream commit 484d230): the reverse operation of NodeSet::get. Zero-padding is significant (prune003 matches, prune3 does not).

use consortium::node_set::NodeSet;

let ns = NodeSet::parse("node[0-9,20]").unwrap();
assert_eq!(ns.index("node20"), Some(10));
assert_eq!(ns.index("node42"), None);

Source

pub fn get(&self, index: i64) -> Option<String>

Return the node at position index in iteration order. Negative index counts from the end, like Python’s nodeset[index]. Returns None when out of range (Python raises IndexError).

Source

pub fn slice( &self, start: Option<i64>, stop: Option<i64>, step: i64, ) -> Result<NodeSet>

Python-style slice nodeset[start:stop:step] over iteration order, returned as a new nodeset. start/stop may be negative (counted from the end); a negative step is only allowed with no start and no stop (mirroring NodeSet._extractslice). Stepped slices span multiple patterns exactly like upstream (commit 1b2509b).

use consortium::node_set::NodeSet;

let ns = NodeSet::parse("stone[1-9],wood[1-9]").unwrap();
assert_eq!(ns.slice(None, None, 2).unwrap().to_string(),
           "stone[1,3,5,7,9],wood[2,4,6,8]");

Source