Subject: Re: [xsl] sorting by comparing two nodes From: David Carlisle <davidc@xxxxxxxxx> Date: Wed, 21 Dec 2005 17:05:21 GMT |
> Yes, that's the point. but aside from the fact that the syntax doesn't allow it, if the comparison function for two points is not transitive, the answer isn't well specified (what does it mean to sort in that case?) > But computing angles is based on slow inaccurate trigonometric functions. You only need to do one division don't you? That gives the tangent which is enough once you know which quadrant you are in. You don't need arctan if you only need to order. David ________________________________________________________________________ This e-mail has been scanned for all viruses by Star. The service is powered by MessageLabs. For more information on a proactive anti-virus service working around the clock, around the globe, visit: http://www.star.net.uk ________________________________________________________________________
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] sorting by comparing two , Claus Nagel | Thread | Re: [xsl] sorting by comparing two , Claus Nagel |
[xsl] Out of Office Messages, Mulberry Technologie | Date | [xsl] unparsed-text and for-each-gr, James Cummings |
Month |