Struct ItemSet 

pub struct ItemSet<T> { /* private fields */ }

A dynamic, resizable collection for storing items with sorting support.

ItemSet<T> is a Vec-backed collection that provides:

• Dynamic array storage with automatic capacity management
• Efficient sorting using TimSort with custom comparers
• Iterator support for traversing items
• A completion flag for tracking collection state

This is a Rust port of the C# ItemSet class used in XPath 2.0 operations.

Implementations

impl<T> ItemSet<T>

pub fn new() -> Self

Creates a new empty ItemSet.

pub fn with_capacity(capacity: usize) -> Self

Creates a new ItemSet with the specified capacity.

pub fn len(&self) -> usize

Returns the number of items in the collection.

pub fn is_empty(&self) -> bool

Returns true if the collection is empty.

pub fn capacity(&self) -> usize

Returns the current capacity of the collection.

pub fn set_capacity(&mut self, capacity: usize)

Sets the capacity of the collection.

Panics

Panics if capacity is less than the current length.

pub fn completed(&self) -> bool

Returns true if the collection has been marked as completed.

pub fn set_completed(&mut self, value: bool)

Sets the completion flag.

pub fn get(&self, index: usize) -> Option<&T>

Returns a reference to the item at the specified index.

pub fn get_mut(&mut self, index: usize) -> Option<&mut T>

Returns a mutable reference to the item at the specified index.

pub fn add(&mut self, item: T)

Adds an item to the end of the collection.

pub fn clear(&mut self)

Removes all items from the collection.

pub fn iter(&self) -> ItemSetIter<'_, T>

Returns an iterator over the items.

pub fn iter_mut(&mut self) -> ItemSetIterMut<'_, T>

Returns a mutable iterator over the items.

pub fn as_slice(&self) -> &[T]

Returns the underlying items as a slice.

pub fn as_mut_slice(&mut self) -> &mut [T]

Returns the underlying items as a mutable slice.

impl<T: Clone> ItemSet<T>

pub fn sort_with<C: IComparer<T>>(&mut self, comparer: &C)

Sorts the items using the provided comparer.

Uses TimSort algorithm which is stable and efficient for partially sorted data.

Trait Implementations

impl<T: Clone> Clone for ItemSet<T>

fn clone(&self) -> ItemSet<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ItemSet<T>

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

Formats the value using the given formatter.

impl<T> Default for ItemSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Extend<T> for ItemSet<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> FromIterator<T> for ItemSet<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> Index<usize> for ItemSet<T>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for ItemSet<T>

fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<T> IntoIterator for ItemSet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a ItemSet<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = ItemSetIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut ItemSet<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = ItemSetIterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.