AdaCGI is an Ada95 interface to the "Common Gateway Interface" (CGI). AdaCGI makes it easier to create Ada95 programs that can be invoked by World Wide Web (WWW) HTTP servers using the standard CGI interface. Using it, you can create Web applications using Ada95 to perform queries or other processing by request from a WWW user.
The ncurses (new curses) library is a freeware emulation of System V Release 4.0 curses. It uses terminfo format, supports pads and color and multiple highlights and forms characters and function-key mapping, and has all the other SYSV-curses enhancements over BSD curses. The distribution includes the library and support utilities, including a terminfo compiler tic, a decompiler infocmp, clear, tput, tset, and a termcap conversion tool captoinfo. Full manual pages are provided for the library and tools.
The Texttools packages are an ncurses-based library for the Linux console written in Ada 95. It contains more than 600 procedures and functions to create windows, draw scroll bars, handle the mouse and keyboard events, play sounds, and much more. It also provides a thick binding to Linux kernel calls. You can create a wide variety of application programs using Texttools alone.
Zephyr Basecamp is a functioning GTK frontend and PostgreSQL backend enterprise project that gives small and midsize businesses the same level of inventory, order entry, sales tracking, and accounting functionality as would be expected from commercial applications. It has interfaces for both X11/GNOME/Linux and Windows.
The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix expression parsing tools. Implementations of some lock-free shared data structures are provided.
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.