jflowers
07-03-2003, 06:07 AM
I want to walk up the node tree in a set of deeply nested tables from a starting point of interest. Each time I reach a TD element I want to delete any 'next siblings' (TD elements to the right) thus removing any content to the right of my walk.
I think I have to do this from the parent TR element (currNode.parentNode.deleteCell(#)) but I don't know how to determine the index of the current TD to know that # is greater.
Can anyone show me a reference or a code snippet about how to do this?
Thanks.
I think I have to do this from the parent TR element (currNode.parentNode.deleteCell(#)) but I don't know how to determine the index of the current TD to know that # is greater.
Can anyone show me a reference or a code snippet about how to do this?
Thanks.