A string↔integer bimap. Assigns dense ids (0, 1, 2, …) in first-seen
order; lookups are O(1) both directions. Grows monotonically — there is
no removal, matching machine semantics (states and actions are fixed
after construction; late interning only happens for never-matching
lookups such as hook registrations naming unknown states).
A string↔integer bimap. Assigns dense ids (0, 1, 2, …) in first-seen order; lookups are O(1) both directions. Grows monotonically — there is no removal, matching machine semantics (states and actions are fixed after construction; late interning only happens for never-matching lookups such as hook registrations naming unknown states).
Example
See
pair_key