Struct TreeNodeCollection 

pub struct TreeNodeCollection { /* private fields */ }

The children of a TreeNode: a read-only list of nodes that is filled the first time it is used (its count, an item, an enumeration or a subscription to its changes), and then follows the tree it shows.

The kinds of the original (the collections of the logical and visual trees, of a group of top levels, of an application, and the empty one) derive from it; here they implement TreeNodeCollectionImpl, which the collection holds.

Implementations

impl TreeNodeCollection

pub fn new( owner: Weak<TreeNode>, kind: Box<dyn TreeNodeCollectionImpl>, ) -> Rc<Self>

TreeNodeCollection(TreeNode owner): a collection of the children of owner, of the kind kind.

pub fn empty() -> Rc<TreeNodeCollection>

static readonly internal TreeNodeCollection Empty: the collection of the nodes without children (one per thread).

pub fn get(&self, index: usize) -> Rc<TreeNode>

this[int index]: the node at index.

Panics

Panics when index is out of range.

pub fn count(&self) -> usize

Count: the number of nodes.

pub fn owner(&self) -> Option<Rc<TreeNode>>

Owner: the node whose children the collection holds; None for the empty collection, and once the node is gone.

pub fn dispose(&self)

Dispose(): the override of the kind of the collection.

pub fn base_dispose(&self)

The base implementation of Dispose(): disposes the nodes, if the collection was ever filled.

pub fn is_initialized(&self) -> bool

Whether the collection was filled: whether its nodes exist. A collection is filled the first time it is used (its count, an item, an enumeration or a subscription to its changes); the tree pages ask for the children of a node when its row is shown or expanded.

pub fn to_vec(&self) -> Vec<Rc<TreeNode>>

GetEnumerator(): the nodes, as they are now.

pub fn contains(&self, node: &Rc<TreeNode>) -> bool

IList.Contains(object).

pub fn index_of(&self, node: &Rc<TreeNode>) -> i32

IList.IndexOf(object): the index of node, or -1.

Trait Implementations

impl IFerroReadOnlyList<Rc<TreeNode>> for TreeNodeCollection

fn count(&self) -> usize

The number of items in the list.

fn get(&self, index: usize) -> Rc<TreeNode>

The item at index. Panics if out of range.

fn snapshot(&self) -> Rc<Vec<Rc<TreeNode>>>

The items, as a snapshot that stays unchanged if the list is modified (enumeration).

fn add_collection_changed( &self, handler: Rc<CollectionChangedHandler<Rc<TreeNode>>>, ) -> u64

Subscribes to changes. Returns a token for remove_collection_changed.

fn remove_collection_changed(&self, token: u64) -> bool

Unsubscribes a handler.

impl IItemsList for TreeNodeCollection

The collection as the items of an items control (the untyped IList of the original, which the tree view reads).

fn count(&self) -> usize

The number of items.

fn get_at(&self, index: usize) -> Option<BoxedValue>

The item at index. Panics if out of range.

fn index_of(&self, item: &Option<BoxedValue>) -> i32

The index of the first item equal to item, or -1.

fn is_notifying(&self) -> bool

Whether the list notifies of changes.

fn add_collection_changed( &self, handler: Rc<ItemsChangedHandler>, ) -> Option<u64>

Subscribes to changes. Returns the token for remove_collection_changed, or None if the list does not notify.

fn remove_collection_changed(&self, token: u64)

Unsubscribes a handler.

fn as_any(&self) -> &dyn Any

The collection as Any, to get back to the typed collection.

fn key_index_mapping(&self) -> Option<&dyn IKeyIndexMapping>

The unique keys of the items, if the list provides them (IKeyIndexMapping); None by default. An index is never a key: a list without keys has none.

fn identity(&self) -> Option<usize>

The identity of the collection, for a list that is a handle to a collection (a FerroList): two handles to one collection are the same collection. None for a list that is the collection itself, whose identity is its address.

impl INotifyCollectionChanged for TreeNodeCollection

fn collection_changed(&self) -> &Event<CollectionChange>

CollectionChanged: subscribing fills the collection.

impl INotifyPropertyChanged for TreeNodeCollection

fn property_changed(&self) -> &Event<str>

PropertyChanged: subscribing fills the collection.

fn as_notify_property_changing(&self) -> Option<&dyn INotifyPropertyChanging>

The object as INotifyPropertyChanging, when it also raises the event of a property that is about to change; None by default.

impl MarkupTyped for TreeNodeCollection

const MARKUP: &'static MarkupType

The markup metadata of the type.

impl ModelCollection<TreeNode> for TreeNodeCollection

fn count(&self) -> usize

The number of models.

fn get(&self, index: usize) -> Rc<TreeNode>

The model at index.

fn index_of(&self, model: &Rc<TreeNode>) -> Option<usize>

The index of model, compared by identity (the reference’s IList.IndexOf of a reference type that does not override Equals).

fn add_collection_changed( &self, handler: Rc<ModelsChangedHandler<TreeNode>>, ) -> Option<u64>

Subscribes to the changes of the collection; None when it does not raise any (a collection that is not INotifyCollectionChanged).

fn remove_collection_changed(&self, token: u64)

Removes a subscription of add_collection_changed.

fn is_notifying(&self) -> bool

Whether the collection raises change notifications.

fn to_vec(&self) -> Vec<Rc<TreeNode>>

The models, in order.

fn as_mutable(&self) -> Option<&dyn MutableModelCollection<M>>

The mutable list behind the collection (IList that is not read only), for the moves of drag and drop.

impl PartialEq for TreeNodeCollection

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

Equality operator ==.

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

Inequality operator !=.