Download of tables.ads (tables.ads ( external link: SF.net): 11,411 bytes) will begin shortly. If not so, click link on the left.
This library provides an implementation of tables indexed by strings. The binary search is used for names of known length. It is also possible to search a table for names of unknown length, i.e. to parse a string using some table. Table elements can be of any private type. Key- insensitive tables are supported.
