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
Orchestrate Your AI Agents with Zenflow
Zenflow orchestrates AI agents like a real engineering system. With parallel execution, spec-driven workflows, and deep multi-repo understanding, agents plan, implement, test, and verify end-to-end. Upgrade to AI workflows that work the way your team does.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Tables for Ada!