Point of view

All features

Summary

Class invariant

- capacity > 0
- capacity >= count
- cache_user.in_range(-1, count)
- cache_user > 0 implies cache_node /= Void
- cache_user > 0 implies cache_buckets.in_range(0, capacity - 1)

Overview

Minimum size for storage in number of items.

The last user's external index in range [1 .. count] (see item and valid_index for example)
may be saved in cache_user otherwise -1 to indicate that the cache is not active.

Meaningful only when cache_user is not -1.

Meaningful only when cache_user is not -1.

Create an empty set.

Create an empty set using __medium_size__ as an appropriate value to help initialization of
capacity.

Of the buckets storage area.

Number of available items in the hoard.

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

Item at the corresponding index __i__.

Make the intersection of the __Current__ set with __other__.

Copy 'other' into the current set

Manifest creation of a `HASHED_SET`.

If any, they are ready to be recycled.

Clear and add __node__ in the free_nodes list.

Recycle from free_nodes or create a new one.

There are not enough free slots: the set must grow.

Minimum index.

Maximum index.

Make the union of the __Current__ set with __other__.

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

Return the intersection of the __Current__ set with __other__.

Make the set __Current__ - __other__.

Return the set __Current__ - __other__.

Is the __Current__ set a subset of __other__?

Is the __Current__ set disjoint from __other__ ?

Is the __Current__ set equal to __other__?

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.

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.

A good prime number, large enough, and no smaller than __integer__.

effective function

{}

Largest supported code for `CHARACTER` values.

Largest supported value of type `INTEGER_8`.

Largest supported value of type `INTEGER_16`.

Largest supported value of type INTEGER/`INTEGER_32`.

Largest supported value of type INTEGER/`INTEGER_32`.

Largest supported value of type `INTEGER_64`.

Largest non-special (no NaNs nor infinity) supported value of type `REAL_32`.

Largest non-special (no NaNs nor infinity) supported value of type REAL.

Largest non-special (no NaNs nor infinity) supported value of type REAL.

Largest supported value of type `REAL_80`.

Smallest supported code for `CHARACTER` values.

Smallest supported value of type `INTEGER_8`.

Smallest supported value of type `INTEGER_16`.

Smallest supported value of type INTEGER/`INTEGER_32`.

Smallest supported value of type INTEGER/`INTEGER_32`.

Smallest supported value of type `INTEGER_64`.

Smallest non-special (no NaNs nor infinity) supported value of type `REAL_32`.

Smallest non-special (no NaNs nor infinity) supported value of type REAL.

Smallest non-special (no NaNs nor infinity) supported value of type REAL.

Number of bits in a value of type `BOOLEAN`.

Number of bits in a value of type `CHARACTER`.

Number of bits in a value of type INTEGER.

Number of bits in a value of type REAL.

Number of bits in a value of type `POINTER`.