From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on
	ip-172-31-65-14.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00,T_SCC_BODY_TEXT_LINE
	autolearn=ham autolearn_force=no version=3.4.6
Path: eternal-september.org!reader01.eternal-september.org!aioe.org!gvziVSQk2EC9Wog5lLNHVw.user.46.165.242.91.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: ANN: Simple Components v4.64
Date: Fri, 19 Aug 2022 11:44:16 +0200
Organization: Aioe.org NNTP Server
Message-ID: <tdnm1f$icj$1@gioia.aioe.org>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Info: gioia.aioe.org; logging-data="18835"; posting-host="gvziVSQk2EC9Wog5lLNHVw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
 Thunderbird/91.12.0
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
Xref: reader01.eternal-september.org comp.lang.ada:64207
List-Id: <comp.lang.ada>

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.

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

Changes to the previous version:

- Persistent.Memory_Pools.Streams.Generic_Float_Waveform was added to 
provide waveform implementation;
- The implementations of B-trees was modified to support tagging buckets 
of the three. For this the packages Generic_B_Tree, 
Generic_Indefinite_B_Tree, 
Persistent.Memory_Pools.Streams.Generic_External_B_Tree, 
Persistent.Memory_Pools.Streams.Generic_External_Ptr_B_Tree provide 
subprograms Get_Tag and Set_Tag;
- The package Generic_B_Tree now has additional generic formal 
parameters Tag_Type and Initial_Tag;
- Subprograms to navigate tree buckets: Get_Item, Get_Left_Child, 
Get_Left_Parent, Get_Right_Child, Get_Right_Parent, Get_Root were added 
to the implementations of B-Trees in the listed above packages;
- Functions Get_First and Get_Last were added to the implementations of 
B-Trees in the listed above packages;
- Procedures Store and Restore were added to the implementations of 
B-Trees in the listed above packages;
- The generic procedure Generic_Traverse and non-generic Travers were 
added to the implementations of B-Trees in the listed above packages to 
shallow and deep traversal of the tree items and buckets;
- Persistent.Memory_Pools lock is made reentrant;
- Image function was added to Persistent.Blocking_Files;
- Bug fix in encodings in Persistent.Blocking_Files.Transactional and 
Persistent.Memory_Pools;
- Bug fix in persistent B-tree implementations;
- Documentation extended.

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