- From: <bugzilla@jessica.w3.org>
- Date: Fri, 05 Oct 2012 22:32:21 +0000
- To: public-webapps-bugzilla@w3.org
https://www.w3.org/Bugs/Public/show_bug.cgi?id=18513
--- Comment #13 from Dimitri Glazkov <dglazkov@chromium.org> 2012-10-05 22:32:21 UTC ---
For the tree structure:
A--[SrA]
| |
B +-C-----[SrC]
| |
+-<D> +--E-----[SrE]
| |
+-<F> +--G-----[SrH]
| |
+-<I> +--<J>
Where all insertion points select "B", we should have the following ancestors
list:
B <D> <F> <I> <J> [SrH] G [SrE] E [SrC] C [SrA] A
It's easy to arrive at <D>. Now, in order to determine <F>, we need to know
both:
1) <D>, the node for which we're determining the parent
2) B, the node that is being reprojected.
To summarize, we need the node that is being projected as the second argument
for the adjusted parent parent algorithm.
--
Configure bugmail: https://www.w3.org/Bugs/Public/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are the QA contact for the bug.
Received on Friday, 5 October 2012 22:32:22 UTC