cangjie-std-hashmap

A HashMap in Cangjie provides efficient key-value data storage, requiring keys to implement Hashable and Equatable and values to implement Equatable. You can construct it with default or specified capacities and perform fast lookups by unique keys.

To use custom objects as HashMap keys in Cangjie, your key type must implement the Hashable and Equatable interfaces. Values must implement Equatable, and ToString is required for certain operations like string conversion.

Cangjie HashMap supports conditional removal of elements alongside single and batch deletions. You can iterate over entries and apply specific criteria to selectively remove key-value pairs from the collection.

Cangjie HashMap supports capacity management, allowing you to construct the map with a specified capacity and reserve space dynamically. This helps optimize performance when the expected number of elements is known in advance.

Cangjie HashMap supports iteration over keys, values, and entries, enabling traversal of the key-value store. You can also convert the collection elements into arrays for downstream processing or integration with other data structures.