Set#

This module implements mathematical sets using hashtables.

type Set

An opaque type of supertype Struct.

inline __as ( cls T )

inline __countof ( self )

fn __drop ( self )

inline __rin ( ... )

inline __tobool ( self )

inline __typecall ( cls opts... )

fn clear ( self )

fn discard ( self key )

Erases a key -> value association from the map; if the map does not contain this key, nothing happens.

fn dump ( self )

fn get ( self key )

Returns the value associated with key or raises an error.

fn getdefault ( self key value )

Returns the value associated with key or value if the map does not contain the key.

fn in? ( self key )

fn insert ( self key )

Inserts a new key into set.

fn pop ( self )

Discards an arbitrary key from the set and returns the discarded key.

fn terseness ( self )

Computes the hashmap load as a normal between 0.0 and 1.0.