Changes to the previous version:
The package Generic_FFT provides an implementation fast Fourier transform. The implementation supports pre-computed bit-reverse permutation and exponents to be used in multiple transformations of same vector length.
see full description on Dmitry's dev page
Implementing arbitrary precision integer/unsigned arithmetic in:
Unbounded_UnsignedsUnbounded_IntegersUnbounded_Unsigneds Primes implementing operations with prime numbersUnbounded_Unsigneds.Montgomery implementing Montgomery domain operationsStrings_Edit.Unbounded_Unsigned_EditStrings_Edit.Unbounded_Integer_EditUnbounded_Unsigneds.ParallelJob_Servers implementing servers of jobs backed by a task pool;number protocol added to Python bindings;Reply_Text and Reply_HTML in GNAT.Sockets.Connection_State_Machine.HTTP_Server modified to call Send_Body passing the Get parameter rather than skipping it when Get = FalseUUID v6 and v7 generation was added to Universally_Unique_Identifiers.UUIDs is compliant with RFC 9562, notably UUIDv7.
It’s able to generate UUIDv1 through UUIDv8 (excluding UUIDv2, which is not covered in the spec).
It can identify the version and variant of the UUIDs, as well as some other things like printing (using 'Image thanks to Ada 2022) and converting the raw values to an element array.
See full ReadMe & Sources on GitHub
This Ada library provides utilities for Unicode character strings of dynamic length.
Changes:
NB: UXS4 is now the default implementation.
Ada BFD is an Ada binding for the GNU Binutils BFD 3 library. The new version provides an Alire crate and fixes compilation issues with recent GNU binutils. You’ll also find some (very basic) notes to setup, use the library by loading a program symbol table and finding the nearest source line associated to some program address.
see VACS’s Blog
The library provides measurement unit support for Ada.
Dmitry’s Ada Project is at Units of measurement
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
AdaStudio-2022 is based on Qt-6.4.0-everywhere opensource.
includes modules : qt6ada,vtkada,qt6mdkada,qt6cvada(face recognition, QRcode detector,BARcode detection and others ) and voice recognizer.
Qt6Ada modules for Windows, Linux (Unix) are available from Google drive
See also the WebPage
AZip is a Zip archive manager.
Project on SourceForge
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
EEC GDPR compliant