The library provides implementations of smart pointers, directed graphs,
sets, maps, B-trees, 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, streams, persistent storage, multiple
connections server/client designing tools and protocols implementations.

See Dmitry’s project at Simple Components

The release is focused on B-trees. The B-tree represents a more performant and easy to use alternative to SQLite in Ada applications.

The release fixes bugs and adds tagging B-tree buckets with user data.
Tags can be used for effective (e.g. logarithmic) search for values rather than for keys only, e.g. for points of entering or leaving an interval of values etc.

A B-tree based implementation of waveforms (x,y) provides means to store render and analyze large sets of measurement data.

Project page on Dmitry-kazakov.de

Simple components is a library addressing:

• containers (maps, sets, unbounded arrays),
• IEEE numbers,
• lock-free containers (FIFOs, blackboards),
• numerics,
• smart pointers,
• parsers,
• persistency,
• synchronization primitives

Simple components is a library addressing:

• containers (maps, sets, unbounded arrays),
• IEEE numbers,
• lock-free containers (FIFOs, blackboards),
• numerics,
• smart pointers,
• parsers,
• persistency,
• synchronization primitives

Changes in this version 4.33 :

• GNAT Studio Community 2021 bugs worked around;
• GTK 3.24.x support