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: 103376,73f91c6a916c119c,start X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII Received: by 10.68.125.233 with SMTP id mt9mr15689494pbb.5.1335780577701; Mon, 30 Apr 2012 03:09:37 -0700 (PDT) Path: r9ni115368pbh.0!nntp.google.com!news1.google.com!goblin1!goblin2!goblin.stu.neva.ru!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: ANN: Simple components for Ada v3.15 Date: Mon, 30 Apr 2012 12:09:34 +0200 Organization: cbb software GmbH Message-ID: Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: Gbl624r6iuNIccy3ASy5ag.user.speranza.aioe.org Mime-Version: 1.0 X-Complaints-To: abuse@aioe.org User-Agent: 40tude_Dialog/2.0.15.1 X-Notice: Filtered by postfilter v. 0.8.2 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit Date: 2012-04-30T12:09:34+02:00 List-Id: The current version provides implementations of smart pointers, directed graphs, sets, maps, 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. Tables management and strings editing are described in separate documents see Tables and Strings edit. The library is kept conform to both Ada 95 and Ada 2005 language standards. http://www.dmitry-kazakov.de/ada/components.htm Changes to the version 3.15: - Parsers now have a mechanism to disallow an operation outside brackets; - Closing brackets can be returned back when misplaced switching to infix context. For example, it is now possible to parse expressions like f(|a|+1|x), where | is both |�|-brackets and an infix operation; - Association checks are performed on all operations and brackets. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de