Undoable Sets are analogous to Undoable Lists and Undoable Dictionaries, but implement sets.
Overview
The framework provides one class for undoable sets:
UndoableSet<T>
: A Set of Document Nodes where all operations on the set are undoable.
Undoable sets are implemented using a balanced binary search tree where the hash codes of the entries are used to order the elements. Adding, removing or checking for containment has a logarithmic time cost.
Implementation Pattern
Refer to Undoable Lists.