HashTable.find

Finds a value by key.

Arguments

The

to lookup.

Return values

found by the key, empty if the key is not found.
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 91 a.find print "," print print LF print 19 a.find print "," print print
Output: