muprocdurham.pcfg.PrettySet

class muprocdurham.pcfg.PrettySet(*args, empty='∅', compact=True, left='{', right='}', **kwargs)

Bases: set

Public Methods:

__init__(*args[, empty, compact, left, right])
__str__()	Return str(self).
__repr__()	Return repr(self).

Inherited from set

__repr__()	Return repr(self).
__getattribute__(name, /)	Return getattr(self, name).
__lt__(value, /)	Return self<value.
__le__(value, /)	Return self<=value.
__eq__(value, /)	Return self==value.
__ne__(value, /)	Return self!=value.
__gt__(value, /)	Return self>value.
__ge__(value, /)	Return self>=value.
__iter__()	Implement iter(self).
__init__(*args, **kwargs)
__sub__(value, /)	Return self-value.
__rsub__(value, /)	Return value-self.
__and__(value, /)	Return self&value.
__rand__(value, /)	Return value&self.
__xor__(value, /)	Return self^value.
__rxor__(value, /)	Return value^self.
__or__(value, /)	Return self|value.
__ror__(value, /)	Return value|self.
__isub__(value, /)	Return self-=value.
__iand__(value, /)	Return self&=value.
__ixor__(value, /)	Return self^=value.
__ior__(value, /)	Return self|=value.
__len__()	Return len(self).
__contains__	x.__contains__(y) <==> y in x.
add	Add an element to a set.
clear	Remove all elements from this set.
copy	Return a shallow copy of a set.
discard	Remove an element from a set if it is a member.
difference	Return the difference of two or more sets as a new set.
difference_update	Remove all elements of another set from this set.
intersection	Return the intersection of two sets as a new set.
intersection_update	Update a set with the intersection of itself and another.
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.
pop	Remove and return an arbitrary set element.
__reduce__	Return state information for pickling.
remove	Remove an element from a set; it must be a member.
__sizeof__()
symmetric_difference	Return the symmetric difference of two sets as a new set.
symmetric_difference_update	Update a set with the symmetric difference of itself and another.
union	Return the union of sets as a new set.
update	Update a set with the union of itself and others.
__class_getitem__	See PEP 585

---

__and__(value, /)

Return self&value.

__annotations__ = {}

__class_getitem__()

See PEP 585

__contains__()

x.__contains__(y) <==> y in x.

__dict__ = mappingproxy({'__module__': 'muprocdurham.pcfg', '__init__': <function PrettySet.__init__>, '__str__': <function PrettySet.__str__>, '__repr__': <function PrettySet.__repr__>, '__dict__': <attribute '__dict__' of 'PrettySet' objects>, '__doc__': None, '__annotations__': {}})

__eq__(value, /)

Return self==value.

__ge__(value, /)

Return self>=value.

__getattribute__(name, /)

Return getattr(self, name).

__gt__(value, /)

Return self>value.

__hash__ = None

__iand__(value, /)

Return self&=value.

__init__(*args, empty='∅', compact=True, left='{', right='}', **kwargs)

__ior__(value, /)

Return self|=value.

__isub__(value, /)

Return self-=value.

__iter__()

Implement iter(self).

__ixor__(value, /)

Return self^=value.

__le__(value, /)

Return self<=value.

__len__()

Return len(self).

__lt__(value, /)

Return self<value.

__module__ = 'muprocdurham.pcfg'

__ne__(value, /)

Return self!=value.

__new__(**kwargs)

__or__(value, /)

Return self|value.

__rand__(value, /)

Return value&self.

__reduce__()

Return state information for pickling.

__repr__()

Return repr(self).

__ror__(value, /)

Return value|self.

__rsub__(value, /)

Return value-self.

__rxor__(value, /)

Return value^self.

__sizeof__() → size of S in memory, in bytes

__str__()

Return str(self).

__sub__(value, /)

Return self-value.

__xor__(value, /)

Return self^value.

add()

Add an element to a set.

This has no effect if the element is already present.

clear()

Remove all elements from this set.

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.)

difference_update()

Remove all elements of another set from this set.

discard()

Remove an element from a set if it is a member.

If the element is not a member, do nothing.

intersection()

Return the intersection of two sets as a new set.

(i.e. all elements that are in both sets.)

intersection_update()

Update a set with the intersection of itself and another.

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.

pop()

Remove and return an arbitrary set element. Raises KeyError if the set is empty.

remove()

Remove an element from a set; it must be a member.

If the element is not a member, raise a KeyError.

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.)

symmetric_difference_update()

Update a set with the symmetric difference of itself and another.

union()

Return the union of sets as a new set.

(i.e. all elements that are in either set.)

update()

Update a set with the union of itself and others.