ANN: Simple components for Ada v3.7 released

[Dmitry A. Kazakov]

The current version provides implementations of smart pointers, sets, maps,
directed graphs, directed weighted graphs, stacks, tables, string editing,
unbounded arrays, expression analyzers, lock-free data structures,
synchronization primitives (events, race condition free pulse events,
arrays of events, reentrant mutexes, deadlock-free arrays of mutexes),
pseudo-random non-repeating numbers, symmetric encoding and decoding, IEEE
754 representations support; strings editing and tables management.

http://www.dmitry-kazakov.de/ada/components.htm

The focus of this release is an implementation of directed graphs (this
includes trees). The nodes of directed graphs are supported of any type
including limited and indefinite types. The directed weighted graphs are
provided as well. The weights can be of any indefinite type. Use of
weighted graphs is illustrated on the example of the suffix tree.

--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de