Simple components for Ada v3.17

If you’re in need of smart pointers, directed graphs, sets, maps, 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 or IEEE 754 representations support, then Dmitry Kazakov’s Simple components library might be just what you need. It’s up to version 3.17 now, and with the version comes the following changes:

  • This release provides generic sets and maps of discrete types based on ranges of elements and keys. Differently to the standard implementation these allows very large sets and maps.
  • Set complement operation was added to the generic set packages
  • Deep equality operation was added to the generic map packages.

You can read the full release announcement here.

Leave a Reply