W3C home > Mailing lists > Public > public-html@w3.org > September 2007

Re: Heuristic Tests for Data Tables (Discussion)

From: Simon Pieters <simonp@opera.com>
Date: Fri, 07 Sep 2007 12:49:52 +0200
To: "Ben 'Cerbera' Millard" <cerbera@projectcerbera.com>, "James Graham" <jg307@cam.ac.uk>, "Robert Burns" <rob@robburns.com>
Cc: HTMLWG <public-html@w3.org>
Message-ID: <op.tx95peraidj3kv@hp-a0a83fcd39d2.palace.opera.no>

On Fri, 07 Sep 2007 12:38:15 +0200, Simon Pieters <simonp@opera.com> wrote:

> One way the algorithm could be specced to take into account all of the  
> headers, scope and implicit associations, is as a several-pass through  
> the table, as follows:
>
>    1. For each cell in the table that has a headers attribute, split the
>       value on spaces and for each token, if getElementById returns a TH  
> or
>       TD element that is part of the same table and isn't the same cell,
>       associate them together.
>    2. For each TH element in the table that has a scope attribute, use  
> the
>       algorithm in HTML5, ignoring the auto state.
>    3. Apply the smart colspan algorithm above.
>    4. Apply the smart rowspan algorithm.

Another idea is to imply scope="col" on header cells in <thead> (before  
step 2) so that they apply to the whole table, although we might need to  
do some more research as to whether doing so would be helpful or harmful.

-- 
Simon Pieters
Opera Software
Received on Friday, 7 September 2007 10:50:51 UTC

This archive was generated by hypermail 2.3.1 : Monday, 29 September 2014 09:38:49 UTC