Point of view

All features

Summary

Overview

Remove item __e__ from the set: the mathematical definition of
removing from a set is followed.

Same job as remove, but uses basic __=__ for comparison.

Empty the current set (is_empty is True after that call).

Minimum index.

Maximum index.

Item at the corresponding index __i__.

Make the union of the __Current__ set with __other__.

Return the union of the __Current__ set with __other__.

Make the intersection of the __Current__ set with __other__.

Make the intersection of the __Current__ set with __other__.

Return the intersection of the __Current__ set with __other__.

Is the __Current__ set a subset of __other__?

Is the __Current__ set disjoint from __other__ ?

Manifest creation of a `SET`.

Apply __action__ to every item of __Current__.

Do all items satisfy __test__?

Does at least one item satisfy __test__?

Aggregate all the elements starting from the initial value.

Append terse printable representation of current object in tagged_out_memory.

Number of available items in the hoard.

Apply __action__ to every item of __Current__.

True when __i__ is valid (i.e., inside actual bounds).

In order to avoid run-time type errors, feature safe_equal calls is_equal only when
__e1__ and __e2__ have exactly the same dynamic type.

HASHED_SETandAVL_SET.