Re: Ordered union of sequences

Am 08.04.2010 um 17:28 schrieb Vladimir Nesterovsky:

>>> > There is an arbitrary number of sequences, sometimes
>>> containing items
>>> > with the same name:
>>> >
>>> > (k, o, p, c, f)
>>> > (d, e, f, g)
>>> > (k, f, z, o)
>>> > (a, b, c, d)
>>> >
>>> > I want to create a master sequence which contains every item once,
>>> > preserving the original order.
>>>
>>> Doesn't xsl:for-each-group over combined sequence solves the problem?
>>
>> No, it puts groups in order of first appearance, which would put f before
d.
>
> How this is different from proposed solution:
> (a, b, k, o, p, c, d, e, f, z, g)
> where o appears before z?
>
> Whether the answer should contain a minimal number of inconsistencies?

Vladimir,

What would be your xsl:for-each-group sort key, something similar to Gerrits
solution?

- Michael

--
_______________________________________________________________
Michael M|ller-Hillebrand: Dokumentations-Technologie
Adobe Certified Expert, FrameMaker
Lvsungen und Training, FrameScript, XML/XSL, Unicode
Blog: http://cap-studio.de/ - Tel. +49 (9131) 28747