The set datatype implemented in XPath 3.0

(Dimitre Novatchev) In my previous two posts I introduced the binary search tree datatype, implemented in XPath 3.0. In most cases the binary search tree operations find, insert and delete have efficiency of O(log(d)) and the print/serialize operation is O(N*log(d)), where d is the maximum depth of

Read More - Register for Free Membership