builtins.frozenset = class frozenset(object)
frozenset() -> empty frozenset object
frozenset(iterable) -> frozenset object
Build an immutable unordered collection of unique elements.
| Use Case | Command | Description |
|---|---|---|
| ๐งช Create empty frozenset | frozenset() | Creates an empty immutable set |
| ๐ฆ Create frozenset from iterable | frozenset([1,2,3]) | Creates immutable set from list |
| ๐ Check membership | x in fs | Test if element is in frozenset |
| ๐ Get size | len(fs) | Number of elements |
| ๐ Union | fs1 | fs2 | All elements in either set |
| ๐ Intersection | fs1 & fs2 | Elements in both sets |
| ๐ Difference | fs1 - fs2 | Elements in fs1 but not fs2 |
| ๐ Symmetric difference | fs1 ^ fs2 | Elements in exactly one set |
| ๐ Subset check | fs1 <= fs2 | Is fs1 subset of fs2? |
| ๐ Superset check | fs1 >= fs2 | Is fs1 superset of fs2? |
| ๐ Disjoint check | fs1.isdisjoint(fs2) | Do sets have no common elements? |
__and__(self, value, /) โ Return self&value.__contains__(...) โ x.__contains__(y) <==> y in x.__eq__(self, value, /) โ Return self==value.__ge__(self, value, /) โ Return self>=value.__getattribute__(self, name, /) โ Return getattr(self, name).__gt__(self, value, /) โ Return self>value.__hash__(self, /) โ Return hash(self).__iter__(self, /) โ Implement iter(self).__le__(self, value, /) โ Return self<=value.__len__(self, /) โ Return len(self).__lt__(self, value, /) โ Return self<value.__ne__(self, value, /) โ Return self!=value.__or__(self, value, /) โ Return self|value.__rand__(self, value, /) โ Return value&self.__reduce__(...) โ Return state information for pickling.__repr__(self, /) โ Return repr(self).__ror__(self, value, /) โ Return value|self.__rsub__(self, value, /) โ Return value-self.__rxor__(self, value, /) โ Return value^self.__sizeof__(...) โ S.__sizeof__() -> size of S in memory, in bytes__sub__(self, value, /) โ Return self-value.__xor__(self, value, /) โ Return self^value.copy(...) โ Return a shallow copy of a set.difference(...) โ Return the difference of two or more sets as a new set. (i.e. all elements that are in this set but not the others.)intersection(...) โ Return the intersection of two sets as a new set. (i.e. all elements that are in both sets.)isdisjoint(...) โ Return True if two sets have a null intersection.issubset(...) โ Report whether another set contains this set.issuperset(...) โ Report whether this set contains another set.symmetric_difference(...) โ Return the symmetric difference of two sets as a new set. (i.e. all elements that are in exactly one of the sets.)union(...) โ Return the union of sets as a new set. (i.e. all elements that are in either set.)__class_getitem__(...) from builtins.type โ See PEP 585__new__(*args, **kwargs) from builtins.type โ Create and return a new object. See help(type) for accurate signature.Generated by phpman v4.10.0-7-g98e9fd5 · Markdown · JSON · MCP Author: Che Dong Under GNU General Public License
2026-09-01 20:03 @216.73.216.239
CrawledBy Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)