mirror of https://github.com/jab/bidict.git
19 lines
545 B
C++
19 lines
545 B
C++
Values Must Be Hashable
|
|
+++++++++++++++++++++++
|
|
|
|
Because you must be able to look up keys by value as well as values by key,
|
|
values must also be hashable.
|
|
|
|
Attempting to insert an unhashable value will result in an error::
|
|
|
|
>>> from bidict import bidict
|
|
>>> anagrams_by_alphagram = bidict(opt=['opt', 'pot', 'top'])
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError...
|
|
|
|
In this example, using a tuple instead of a list does the trick::
|
|
|
|
>>> bidict(opt=('opt', 'pot', 'top'))
|
|
bidict({'opt': ('opt', 'pot', 'top')})
|