Re: Junit-type Framework for XSLT 2 Functions and Tem
I am accustomed to the lazy evaluation style of Haskell, where passing parameters of infinite length is something natural, like: take 5 [1,2 ..] takes the first 5 elements of the infinite list of natural numbers. yes so in this case I was sugesting starting with [1,2 ..] then first applying mapping a function from the natural numbers to strings that writes the number as a unicode string by writing it using a using unicode characters to represent the "digits" digits 0 to hex 10FFFF. that gives you the (lazily constructed) sequence of all unicode strings. Then filter that sequence using a function from string to boolean that is true if the string is a valid xml file. this could all be written in haskell. Of course the algorithm is totally impractical although it could be made more practical by having a more sensible sequence of initial strings. even the impractical algorithm has some use though, it proves that the sequence that you ask for does indeed exist. Of course if the set of documents were in 1-1 correspondence with the real numbers rather than just the naturals, you would never be able to order them into a sequence. 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 ________________________________________________________________________
PURCHASE STYLUS STUDIO ONLINE TODAY!
Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!
Download The World's Best XML IDE!
Accelerate XML development with our award-winning XML IDE - Download a free trial today!
Subscribe in XML format