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.
|Tags||Software Development Compilers Libraries Text Processing|
|Operating Systems||OS Independent|
Release Notes: Compiled and tested with GNAT 4.9 (Ada 2012).
Release Notes: Fedora and Debian packages are provided for both 32- and 64-bit architectures.
Release Notes: This release adds Fedora and Debian packages.
Release Notes: Locate operations were added to the Tables and Tables.Names packages. The difference from Find and Get is that they return the offset to the found item.
Release Notes: A minor bug has been fixed in case-insensitive tables. A variant of case-insensitive tables in UTF-8 encoding is documented here (the implementation of is provided within Simple Components for Ada project, because it requires UTF-8 support).