HashTable.erase

Erases an entry by key.

Arguments

key
for the entry to erase. If there is no such key, the method has no effect.

Return values

None

Complexity

Amortized constand, O(size) in the worst case.

Example

"sl/hashTable" useFile a: HashTable; 35 "element" a.insert 0 "ZERO" a.insert 34 "element" a.insert -25 "element" a.insert 19 "nineteen" a.insert 34n8 135 a.insert 32 { a:0; b:1; } a.insert 19 a.erase a [print LF print TRUE] enum
Output:
{ key: 35; value: "element"; } { key: 0; value: "ZERO"; } { key: 32; value: { a: 0; b: 1; }; } { key: 34; value: "element"; } { key: 34; value: 135; } { key: -25; value: "element"; }