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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,10c78c43cdc75c4,start X-Google-Attributes: gid103376,public From: Vincent Marciante Subject: Update: The Original Booch Components Date: 2000/11/27 Message-ID: <3A232B4B.170@li.net>#1/1 X-Deja-AN: 698509814 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=us-ascii X-Complaints-To: abuse@verio.net X-Trace: iad-read.news.verio.net 975383398 209.139.0.90 (Tue, 28 Nov 2000 03:49:58 GMT) Organization: Verio MIME-Version: 1.0 NNTP-Posting-Date: Tue, 28 Nov 2000 03:49:58 GMT Newsgroups: comp.lang.ada Date: 2000-11-27T00:00:00+00:00 List-Id: A link to The Original Ada83 Booch Components now exists on the projects page of the Adapower site http://www.adapower.com/lab along with a link to a chat area for comments on proposals and discussion of other related topics. More importantly, another slightly different way to correct "Defect 1" (regarding the unbounded string components) has been proposed and is now available. In addition, the code for the two proposals is now available for both the Ada 83 version and the Ada 95 version of the components. One of these proposals or some other proposal that anyone submits soon will be finalized by January and will then be released as the official corrections. Any comments regarding the either the defect correction proposals or the unrelated, iteration proposal described on the original Booch main page, will be most appreciated. For those new to Ada, the original Booch components are a set of components that provide definitions of non-tagged, generic structures and tools that work with those structures. The basic stuctures provided are: stacks; strings (sequences of any type, not just characters); rings (circular queues); priority or nonpriority, balking or nonbalking queues and deques; discrete or simple, cached or noncached maps; simple or discrete bags and sets; singly or doubly linked lists; binary and arbitrarily branching trees and directed or undirected and graphs. The tools provide: filters, pipes, sorting, searching and pattern matching procedures, along with helper utilities that work with the previously mentioned structures. Because they are covered by the same license as the GNAT runtime library, they may be utilized in proprietary software under certain specified circumstances. Vincent Marciante