HashTable.findIter

Finds an iterator by key.

Arguments

The

key
to lookup.

Return values

iterator
is a HashTableIterator pointing to the entry with the given key.
exists
is a condition, TRUE if an entry with the given key exists, FALSE otherwise.

Complexity

Amortized constant, 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.findIter [ it:; "value is " print it.get print LF print it a.eraseIter ] [ drop ] if a [print LF print TRUE] enum
Output:
value is { key: 19; value: "nineteen"; } { 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"; }