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

Re: following-sibling problem

Subject: Re: following-sibling problem
From: Bruce D'Arcus <bdarcus@xxxxxxxxxxxxx>
Date: Wed, 27 Oct 2004 09:50:21 -0400
Re:  following-sibling problem
On Oct 27, 2004, at 9:43 AM, David Carlisle wrote:

each level 1 element checks if the immediately following thing is a
level 2 and if it is it starts a list and then processes that level 2.
a level 2 node has to process itself then process any immediately
following level 2 so the end result is that any consecutive sequence of
level 2s ends up in the list started on the level 1

I needed to remove the [1] on the apply-templates (because otherwise I only get the first bullet), and then I end up with duplicates again:

            <h2>Heading</h2>
            <ul>
               <li class="level1">Bullet 1a<ul>
                     <li class="level2">Bullet 3</li>
                     <li class="level2">Bullet 2a - a quote</li>
                     <li class="level2">Bullet 2b</li>
                  </ul>
               </li>
               <li class="level1">Bullet 1b<ul>
                     <li class="level2">Bullet 2a - a quote</li>
                     <li class="level2">Bullet 2b</li>
                  </ul>
               </li>
            </ul>

Bruce

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.