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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: a07f3367d7,4dbd98ffbac52a73,start X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news1.google.com!npeer02.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!news.glorb.com!news2.glorb.com!feeder.erje.net!newsfeed.straub-nv.de!newsfeed01.sul.t-online.de!t-online.de!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail From: "Dmitry A. Kazakov" Subject: ANN: Simple components for Ada v3.7 released Newsgroups: comp.lang.ada User-Agent: 40tude_Dialog/2.0.15.1 MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Reply-To: mailbox@dmitry-kazakov.de Organization: cbb software GmbH Date: Sat, 26 Dec 2009 12:58:51 +0100 Message-ID: NNTP-Posting-Date: 26 Dec 2009 12:58:44 CET NNTP-Posting-Host: faa4f4ba.newsspool1.arcor-online.net X-Trace: DXC=2=E@Oeihc97_A0jCfgHO6>ic==]BZ:af>4Fo<]lROoR1<`=YMgDjhg2Pha`id[ The current version provides implementations of smart pointers, sets, maps, directed graphs, directed weighted graphs, 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; strings editing and tables management. http://www.dmitry-kazakov.de/ada/components.htm The focus of this release is an implementation of directed graphs (this includes trees). The nodes of directed graphs are supported of any type including limited and indefinite types. The directed weighted graphs are provided as well. The weights can be of any indefinite type. Use of weighted graphs is illustrated on the example of the suffix tree. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de