[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Evaluating relational expressions

Subject: Evaluating relational expressions
From: "Streng, Jonathan D. (LNG)" <Jonathan.Streng@xxxxxxxxxxxxxx>
Date: Mon, 29 Oct 2001 12:04:08 -0500
jonathan streng
> "Hello World!"
> On pg. 391 of Michael Kay's book, "XSLT Programmer's Reference," a table
> is
> shown which uses min() & max() to help evaluate the expression M < N, when
> M
> & N are both node sets. This expression is stated to be true when min(M) <
> max(N), yet, to me, this seems backwards. It seems more reasonable to say
> M
> < N is true when max(M) < min(N), the reverse of how the evaluation is
> stated in the book.  For example is:
> 
> min({*1*,2,3,4,5}) < max({4,6,8,10,*12*}) = true?
> or
> max({1,2,3,4,*5*}) < min({*4*,6,8,10,12}) = false?
> 
> min({*1*,2,3,4,5}) < max({7,9,11,13,*15*}) = true?
> or
> max({1,2,3,4,*5*}) < min({*7*,9,11,13,15}) = true?
> 
> min({*4*,6,8,10,12}) < max({1,2,3,4,*5*}) = true?
> or
> max({4,6,8,10,*12*}) < min({*1*,2,3,4,5}) = false?
> 
> min({*7*,9,11,13,15}) < max({1,2,3,4,*5*}) = false?
> or
> max({7,9,11,13,*15*}) < min({*1*,2,3,4,5}) = false?
> 
> Any thoughts on this would be greatly appreciated! Thanks!
> 
> Jonathan Streng

 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list


Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.