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

Re: distinct moves problem

Subject: Re: distinct moves problem
From: Dimitre Novatchev <dnovatchev@xxxxxxxxx>
Date: Wed, 9 Jan 2002 04:35:13 -0800 (PST)
how many moves problem
--- "Ahmad J. Reeves" <ahmad@xxxxxxxxxxxxxx> wrote:
> Hi Dimitre and all,
> 
> I've just noticed that the list generated doesnt allow
> for the fact that an individual may return to the same room
> after he has left it. Rather it lists, I think, all of the
> unique rooms he has passed through. 
 
Hi Ahmad,
 I really thought that you wanted the number of distinct rooms visited. I do not
understand completely what do you mean by "distinct moves", e.g. how many distinct
moves will a character have performed if he visited the following rooms in document
order:

 45040
 45030
 45020
 45020
 45020
 45040 
 45040 

Also, it is not clear that document order is the same as chronological order, and
there's no date/time information in the xml files you provided.

In case these are precisely defined, there should be an appropriate solution.

Cheers,
Dimitre Novatchev.


__________________________________________________
Do You Yahoo!?
Send your FREE holiday greetings online!
http://greetings.yahoo.com

 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.