|CC:||garfieldnate [...] gmail.com|
Thank you for this module. I love it! In my application I need a hash where keys are nodes. Such a hash can be created (since objects can be stringified into keys), but it doesn't work right because nodes are only comparable using the isSameNode method. Querying the hash with a node object I get later may not find the entry. I would like a unique_key method (any name is fine) that would return a value usable in such a hash. I noticed that the implementation of isSameNode just does 'self == onode' (line 5009 of LibXML.xs), so I thought that identical nodes had the same address, and that the address should be usable as a unique ID. So I tried just doing 0+$node, but that didn't work right (a number comes back, nodes that would return true from isSameNode didn't have matching numbers). Without such a method, I will have to keep an extra index somewhere and call isSameNode over and over again.