From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: ANN: Simple Components for Ada v4.38. Interfacing with Julia
Date: Mon, 21 Jan 2019 18:54:37 +0100
Organization: Aioe.org NNTP Server
Message-ID: <q2510r$al3$1@gioia.aioe.org>
NNTP-Posting-Host: i065DRYuysvTI4qVnaNkyg.user.gioia.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit
X-Complaints-To: abuse@aioe.org
User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:60.0) Gecko/20100101
 Thunderbird/60.4.0
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.8.3
X-Mozilla-News-Host: news://news.aioe.org:119
Xref: reader01.eternal-september.org comp.lang.ada:55317
Date: 2019-01-21T18:54:37+01:00
List-Id: <comp.lang.ada>

The current version 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, multiple connections server/client 
designing tools and protocols implementations. It grew out of needs and 
does not pretend to be universal. Tables management and strings editing. 
The library is kept conform to the Ada 95, Ada 2005, Ada 2012 language 
standards.

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

The new version provides interfacing with Julia programming language. 
Julia is dynamically typed scripting language that deploys garbage 
collection. It can be considered as an alternative to Python. The 
bindings are dynamic, there is no overhead when Julia is not used. 
Supported are:

- Loading and interpreting Julia source code
- Calling to Julia functions from Ada
- Calling Ada from Julia (no building a relocatable library required)
- Conversion from scalar Ada types to Julia types and back
- Arrays 1D, 2D, 3D (Julia has proper arrays like Ada does)
- Named and anonymous tuples
- Catching and raising Julia exceptions
- Julia's garbage collection control

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