Re: explosion when invisible element count is large
Re: explosion when invisible element count is large
- Subject: Re: explosion when invisible element count is large
- From: Mike Engber <email@hidden>
- Date: Thu, 25 Jan 2007 09:18:18 -0800
On Jan 24, 2007, at 6:59 PM, Ian Archer wrote:
Hmm ... is it wrong to assume that children are sorted according to
visibility?
In general, there are no guarantees made about the order of the
children.
AXList would be an exception in that the child order corresponds to
the visual list order - which could be up-down or left-right.
So, for AXLists your technique should be OK.
-ME
I was thinking of applying a binary search technique, where I find the
start by searching for the first visible element in the array using
BST and similarly to find the last index, then to grab that range.
This system wouldn't work if visibility is arbitrary along the array.
Anyone know this one?
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Accessibility-dev mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden