It feels like overkill to walk the tree for each change. I kind of want to do a sprintf(). I am wondering if I can fetch the element by the technically duplicate id and change the node value and id to something else, before appending it to the tree with the original node (where the duplicate id could conflict).
Posted in Programming
Copyright 2002–2011 Artific Consulting LLC.
Unless otherwise noted, content is licensed for reuse under the Creative Commons Attribution-ShareAlike 3.0 License. Please read and understand the license before repurposing content from this site.