Hi,
We used getNextSibling earlier in Ultrawebtree to traverse through.
Please confirm if get_nextNode is the equivalent functionality for getNextSibling in Webdatatree?
If not, please let us know asap which function needs to be used.
Note - We found that get_nextNode works in linear fashion (fetches the next node till it reaches the last one), and getNextSibling works in circular fashion. ( goes in round to fetch the nodes). please confirm.
Its very critical. please help.
Hello Jeevitha,
Thank you for contacting Infragistics!
get_nextNode is the equivalent of getNextSibling, as you can see from the following documentation it is expected to give you the next sibling node of the current node. And if it is the last node in the collection null is returned instead:
http://help.infragistics.com/doc/ASPNET/2014.2/CLR4.0/?page=WebDataTree~Infragistics.Web.UI.Node~nextNode.html
So what you are seeing is the expected behavior. You can use the following to get the previous node:
http://help.infragistics.com/Help/Doc/ASPNET/2014.2/CLR4.0/html/WebDataTree~Infragistics.Web.UI.Node~previousNode.html
or the parent node:
http://help.infragistics.com/Help/Doc/ASPNET/2014.2/CLR4.0/html/WebDataTree~Infragistics.Web.UI.Node~parentNode.html
Please let me know if you have any further questions concerning this matter.
Hi Mike,
Thanks for the info.
Currently, Iam trying to search 'node' using get_nextNode. When it reaches the last node, get_nextNode returns null and the search ends.
Could you please provide me a sample, wherein the search the continous or cyclic. When it reaches the last node, the search should again start from the beginning of the webdatatree.
Expecting ur reply at the earliest.