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=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,4d2a71c8801ecab1 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-07-12 11:02:17 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!nntp-relay.ihug.net!ihug.co.nz!west.cox.net!cox.net!newspeer1-gui.server.ntli.net!ntli.net!newsfep2-win.server.ntli.net.POSTED!53ab2750!not-for-mail From: "chris.danx" Newsgroups: comp.lang.ada References: Subject: Re: Common sense... X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Message-ID: Date: Fri, 12 Jul 2002 19:01:40 +0100 NNTP-Posting-Host: 80.5.140.234 X-Complaints-To: abuse@ntlworld.com X-Trace: newsfep2-win.server.ntli.net 1026496933 80.5.140.234 (Fri, 12 Jul 2002 19:02:13 BST) NNTP-Posting-Date: Fri, 12 Jul 2002 19:02:13 BST Organization: ntl Cablemodem News Service Xref: archiver1.google.com comp.lang.ada:27022 Date: 2002-07-12T19:01:40+01:00 List-Id: "Simon Wright" wrote in message news:x7v3cuxnycc.fsf@pushface.org... > > Although the BCs support some concurrency, I think it's a minefield > and you'd be better off saying DON'T DO THAT! I've taken your advice, concurrency is something beyond the scope of Aqua, leaving concurrency issues to the developer who utilises Aqua in such situations. So far I'm 95% way through coding and testing a doubly linked list, the test code is approaching 1000 lines and generates ~20k of data on the lists and it's operation, while the list itself consists of 600-800 lines, most of which is comments. After that a stack, queue and dequeue will be added almost immediately (and possibly a singly linked list). Later I plan to add support for storage pools (separate ADTs with almost the same interface as the ADTs lacking storage pool support), bounded lists, stacks, queues, dequeues and a vector adt. By October, I also hope to have circular lists (and a binary tree) but there are no promises. Unfortunately I may not be able to accept any submissions of code or patches since I may use these ADTs at University and this might involve some complications (this is a foggy area, I will check with my uni to see what the policy is and report back. Any idea who I should speak to? Teaching Administrator springs to mind) Oh sod it, after all how long will it take to knock up a linked list or bst for uni work, a day or two tops; we got 2-4 weeks in second year (maybe more in third, depends), so if they don't allow their use, it's no problem I'll make new ADTs! If anyone wishes to contribute, please say so and I'll put the current sources up today or tommorrow. The code is GMGPL'ed. It'd be great if someone could work on the storage pool side as I have little or no familiarity with them and am only casually aware of them. I'll be away from Monday to Friday next week, so nothing will get done that week and things will grind to a halt sometime in August as I have exams. Regards, Chris