Hi Neil,
> That Hashtable's primary purpose is this: consider the situation in which
> schema A imports schema B, and schema B imports schema C, but A and C have
> no relationship. Then point 4 of QName resolution from 3.15.4 of the
> Schema Structures spec implies that no component from A can reference
> anything from C. Thus, when the handler gets a request from a traverser
> working on one of A's components, it must have a way to know which of the
> potentially many schemas that it knows about may be legitimately referred
> to by that component. And of course fDependencyMap provides as handy a way
> as any to make sure we traverse everything we're supposed to.
>
The above point is clear.
I couldn't figure out (or rather visualize) how mutual <include>s are handled.
That is, a situation where A <include>s B and B inturn <include>s A.
I found that in the current XSDHandler, fTraversed vector is declared for this
purpose but it is used to store schemas which are completely traversed. Since it
a depth-first traversal, it becomes a circular reference.
Any insight into this will be useful.
Pavani
--
Pavani Mukthipudi
Sun Microsystems Inc.
Phone: 080 - 2298989 Extn: 87390
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
