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

RE: >Subject: RE: node comparision for equality:

Subject: RE: >Subject: RE: node comparision for equality: Message-ID: <448F3BD6.605
From: "uppaluri satyaprasad" <uppaluris@xxxxxxxxxxx>
Date: Tue, 20 Jun 2006 01:09:52 -0400
subject re
uppaluri satyaprasad wrote:
however i need to also test if
BusPartnerCodeValue (i.e. D06001 here) and BusPartnerCodeTypeCode (i.e. 00003) are equal in two nodes within BPPLCode.
if these two values are equal, the BPPLCode nodes are equal and i shall process only one node.
we can ignore ProductLevel/ProductLevelCode here.

This looks like the "select distinct" problem, which you can solve
with an approach described here:
 http://jenitennison.com/xslt/grouping/index.xml
Use grouping by content, using
concat(BusPartnerCodeType/BusPartnerCodeTypeCode,':',BusPartnerCodeValue)
as key indicator.
(unfortunately, http://jenitennison.com/xslt/unique.xml is a stub).

J.Pietschmann




Hi Pietschmann, Thank you for your help.

I managed to get my problem fixed using  Muenchian method as advised
by you.

I have one more related question. i want to find no of those
distinct nodes (same business rule as above)
when I try to use the keys it will give me the count of the nodes in
the entire document.
however i need to find the count of the unique nodes inside each
BPPLCode.


thanks in advance


Satya

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-2011 All Rights Reserved.