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.
Features
- Allows matching the longest table token against the string
- Ada 95, 2005, 2012 compliant
License
GNU Library or Lesser General Public License version 3.0 (LGPLv3)Follow Tables for Ada
Other Useful Business Software
Try Google Cloud Risk-Free With $300 in Credit
Use your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Tables for Ada!