pymel.util.trees.Set¶
![digraph inheritance76e16058e7 {
rankdir=TB;
ranksep=0.15;
nodesep=0.15;
size="8.0, 12.0";
"Set" [shape=box,fontname=Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans,fontsize=8,style="setlinewidth(0.5)",height=0.25];
"Sized" -> "Set" [arrowsize=0.5,style="setlinewidth(0.5)"];
"Iterable" -> "Set" [arrowsize=0.5,style="setlinewidth(0.5)"];
"Container" -> "Set" [arrowsize=0.5,style="setlinewidth(0.5)"];
"Sized" [shape=box,fontname=Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans,fontsize=8,style="setlinewidth(0.5)",height=0.25];
"Container" [shape=box,fontname=Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans,fontsize=8,style="setlinewidth(0.5)",height=0.25];
"Iterable" [shape=box,fontname=Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans,fontsize=8,style="setlinewidth(0.5)",height=0.25];
}](../../../_images/inheritance-b1c7bbf8f398bf9b3b62ec8fbc48918cbbbbbfd7.png)
- class Set¶
A set is a finite, iterable container.
This class provides concrete generic implementations of all methods except for __contains__, __iter__ and __len__.
To override the comparisons (presumably for speed, as the semantics are fixed), all you have to do is redefine __le__ and then the other operations will automatically follow suit.
- isdisjoint(other)¶