ISSUE-626: text alt computation statements on recursion are unclear

clarifying text alt recursion

text alt computation statements on recursion are unclear

State:
CLOSED
Product:
ARIA 1.1 Name Computation
Raised by:
James Craig
Opened on:
2013-10-16
Description:
This line in the text alt computation:

"in other words, aria-labelledby is not recursive when referenced from another element,"

…makes it sound like aria-labelledby is only recursive one-level deep, where [my understanding of] the intention is that it's infinitely recursive until the point where it references an element that has already been referenced in this labelledby cycle. Need to verify the rest of the group agrees and then update the prose to be clear.
Related Actions Items:
No related actions
Related emails:
No related emails

Related notes:

See action 1474.

Richard Schwerdtfeger, 7 Jul 2014, 18:33:51

See Action 1474

Richard Schwerdtfeger, 7 Jul 2014, 18:35:24

the text has been reworded to clearly stop the recursion after the first aria-labelledby. This has been like this since 2009 and for ARIA 1.1 we will leave this with the limitation on recursion.

Here is the text: if computing a name ,… and the current node is not already part of an aria-labelledby traversal.

Here is the link: https://rawgit.com/w3c/aria/master/accname-aam/accname-aam.html#step2B

Consequently, this is now closed.

Richard Schwerdtfeger, 4 Apr 2017, 19:51:53

Display change log ATOM feed


Joanmarie Diggs <jdiggs@igalia.com>, James Nurthen <nurthen@adobe.com>, Chairs, Michael Cooper <cooper@w3.org>, Ruoxi Ran <ran@w3.org>, Staff Contacts
Tracker: documentation, (configuration for this group), originally developed by Dean Jackson, is developed and maintained by the Systems Team <w3t-sys@w3.org>.
$Id: index.php,v 1.326 2018/10/13 17:29:51 vivien Exp $