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=-2.9 required=5.0 tests=BAYES_00,MAILING_LIST_MULTI autolearn=unavailable autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,cda33fc7f63c2885 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-01-07 16:51:03 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!colt.net!newsfeed.icl.net!opentransit.net!wanadoo.fr!freenix!enst!enst.fr!not-for-mail From: "Steven Deller" Newsgroups: comp.lang.ada Subject: RE: list strawman Date: Mon, 7 Jan 2002 19:48:44 -0500 Organization: ENST, France Sender: comp.lang.ada-admin@ada.eu.org Message-ID: Reply-To: comp.lang.ada@ada.eu.org NNTP-Posting-Host: marvin.enst.fr Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit X-Trace: avanie.enst.fr 1010451062 47093 137.194.161.2 (8 Jan 2002 00:51:02 GMT) X-Complaints-To: usenet@enst.fr NNTP-Posting-Date: Tue, 8 Jan 2002 00:51:02 +0000 (UTC) To: Return-Path: X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook, Build 10.0.2627 Importance: Normal In-Reply-To: X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org X-Mailman-Version: 2.0.6 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: comp.lang.ada mail<->news gateway List-Unsubscribe: , Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org Xref: archiver1.google.com comp.lang.ada:18631 Date: 2002-01-07T19:48:44-05:00 Rather than implement the package, I have worked at taking the spec and using it to in other code (I like to see how a package stands up to usage before implementing it :-)). I found I could NOT implement a simple quicksort with the package as defined, at least not with any efficiency. What was missing was a simple way to split a list into two lists at the point of an iterator. That seems to me to be a fundamental flaw in the interface. Yes, I know sorting is predefined in the interface, but as there is only ONE sort predefined, I'd think users might want to implement their own sort. (Not to mention I think including sorting in a fundamental list package to be questionable -- though I can't see how to also include a "insert sorted" function without the concept of sortedness, so maybe it makes sense.) Wouldn't it be useful to add a procedure that takes an iterator and returns a new list, with the list where the iterator was pointing now truncated to a shorter list? (That is, it returns two lists, one of which is implicitly referred to by the iterator.) Regards, Steve