W3C home > Mailing lists > Public > xml-dist-app@w3.org > September 2002

Re: Issue 302: Graph edges that do not terminate

From: <noah_mendelsohn@us.ibm.com>
Date: Tue, 10 Sep 2002 14:15:46 -0400
To: Jacek Kopecky <jacek@systinet.com>
Cc: Marc Hadley <marc.hadley@sun.com>, Martin Gudgin <mgudgin@microsoft.com>, XMLP Dist App <xml-dist-app@w3.org>
Message-ID: <OFAA07A4AF.A543936A-ON85256C30.0063090D@lotus.com>

I know this feels like a dumb question, but I'm confused (and I wrote some 
of the original text.)  Gudge: in you proposed resolution or resolutions, 
what is the graph structure corresponding to the seemingly simple 

        <A env:encodingStyle="...soap encoding..."> <!--struct-->

Am I right that, per the serialization rules, this is

           | A
     | Struct  |
        |    |
        |    |
       B|    |C
        |    |
       "1"  "2"

So, what I'm asking is:  do I have this right, and if so, do we have a 
coherent story about the (lack of) source of edge A?  I see that [1] has 
been updated to account for this.  Is this agreed-to?  If so, it's OK with 
me, just making sure I understand what we're doing.  Many thanks.

[1] http://www.w3.org/2000/xp/Group/2/06/LC/soap12-part2.xml#graphedges

Noah Mendelsohn                              Voice: 1-617-693-4036
IBM Corporation                                Fax: 1-617-693-8676
One Rogers Street
Cambridge, MA 02142
Received on Tuesday, 10 September 2002 14:19:30 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 23:11:52 UTC