- From: Dieter Köhler <dkoehler@ix.urz.uni-heidelberg.de>
- Date: Thu, 02 Sep 1999 18:44:03 +0200
- To: "www-dom@w3.org" <www-dom@w3.org>
Consider the following very simple tree structure:
========
| root | <-- TreeWalker.current
========
| =====
|____| A |
===== =====
|____| B |
=====
To navigate this structure we use a TreeWalker whoes filter rejects
every C node. Now we use the firstChild method of the TreeWalker twice
and arive at the B node. After that we insert between the A and the B
node a C node. Now we have the following tree structure:
========
| root |
========
| =====
|____| A |
===== =====
|____| C |
===== =====
|____| B | <-- TreeWalker.current
=====
How should the TreeWalker behave when we call its parentNode method?
Similar problems may arise for the other methods of the TreeWalker. The
problems get even worse, if the tree structure is more complicate or the
root node is altered.
=====================================================================
Dieter Koehler, M. A. - dkoehler@ix.urz.uni-heidelberg.de
Huehnerstein 1, D-69121 Heidelberg, +49(0)6221-474359
"http://www.philo.de/Philosophie-Seiten": 1000+ Philosophie-Links
"http://www.philo.de/VirtualLibrary/14.de.htm": Deutsche Philo-Links
"http://www.philo.de/xml": Open XML - XML-Komponenten fuer Delphi
=====================================================================
Received on Thursday, 2 September 1999 12:45:36 UTC