From mboxrd@z Thu Jan 1 00:00:00 1970 Path: main.gmane.org!not-for-mail From: prj@po.cwru.edu (Paul Jarc) Newsgroups: gmane.lisp.guile.user Subject: sorting by a partial order Date: Tue, 29 Oct 2002 15:33:59 -0500 Organization: What did you have in mind? A short, blunt, human pyramid? Sender: guile-user-admin@gnu.org Message-ID: NNTP-Posting-Host: main.gmane.org Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: main.gmane.org 1035924793 32038 80.91.224.249 (29 Oct 2002 20:53:13 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Tue, 29 Oct 2002 20:53:13 +0000 (UTC) Return-path: Original-Received: from monty-python.gnu.org ([199.232.76.173]) by main.gmane.org with esmtp (Exim 3.35 #1 (Debian)) id 186d9k-0007eM-00 for ; Tue, 29 Oct 2002 21:40:08 +0100 Original-Received: from localhost ([127.0.0.1] helo=monty-python.gnu.org) by monty-python.gnu.org with esmtp (Exim 4.10) id 186d56-0007oO-00; Tue, 29 Oct 2002 15:35:20 -0500 Original-Received: from list by monty-python.gnu.org with tmda-scanned (Exim 4.10) id 186d3r-0007Cp-00 for guile-user@gnu.org; Tue, 29 Oct 2002 15:34:03 -0500 Original-Received: from mail by monty-python.gnu.org with spam-scanned (Exim 4.10) id 186d3o-0007Af-00 for guile-user@gnu.org; Tue, 29 Oct 2002 15:34:02 -0500 Original-Received: from multivac.student.cwru.edu ([129.22.96.25] helo=multivac.cwru.edu) by monty-python.gnu.org with smtp (Exim 4.10) id 186d3o-0007AP-00 for guile-user@gnu.org; Tue, 29 Oct 2002 15:34:00 -0500 Original-Received: (qmail 25180 invoked by uid 500); 29 Oct 2002 20:34:22 -0000 Original-To: guile-user@gnu.org Mail-Copies-To: nobody Mail-Followup-To: guile-user@gnu.org Original-Lines: 17 User-Agent: Gnus/5.090008 (Oort Gnus v0.08) Emacs/21.2 (i686-pc-linux-gnu) Errors-To: guile-user-admin@gnu.org X-BeenThere: guile-user@gnu.org X-Mailman-Version: 2.0.11 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: General Guile related discussions List-Unsubscribe: , List-Archive: Xref: main.gmane.org gmane.lisp.guile.user:1301 X-Report-Spam: http://spam.gmane.org/gmane.lisp.guile.user:1301 I have a two-place predicate that defines a partial order (i.e., it is possible that neither is A less than B nor is B less than A). I want to sort a sequence of items according to that predicate, so that if A occurs before B in the result, then B is not less than A according to the predicate. * Can sort, stable-sort, sort-list, etc., deal with a partial order for the less procedure, or must it be a full ordering? * How do these procedures behave if, by mistake, the ordering predicate (consistently) returns contradictory results? (A is less than B, and B is less than A.) * My predicate is actually not quite a partial order because it is not transitive. Is there any existing code for constructing the transitive closure of a relation? TIA paul _______________________________________________ Guile-user mailing list Guile-user@gnu.org http://mail.gnu.org/mailman/listinfo/guile-user