Category Archives: functional data structures

The set datatype implemented in XPath 3.0

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 … Continue reading

Posted in functional data structures, XPath, XPath 3.0 | 2 Comments

Part 2: The Binary Search Data Structure with XPath 3.0, Deleting a node

In the first part of this post I presented a Binary Search Tree implemented in pure XPath 3.0. Some new nice features of XPath 3.0 were shown in action and other, still missing but very important features were identified and … Continue reading

Posted in functional data structures, XPath, XPath 3.0 | Leave a comment

The Binary Search Tree Data Structure–having fun with XPath 3.0

For a long time I have wanted to play with XSLT 3.0 and XPath 3.0. Despite these being in their WD status, the new features are so powerful and overwhelming. Take just these: Higher Order Functions and the ability to … Continue reading

Posted in functional data structures, XPath, XPath 3.0, XSLT 3.0 | 15 Comments

Part 2: The Swiss Army Knife of Data Structures … in C#

Update: In a personal communication with Eric Lippert it was revealed that, in his words:   "I worked up a full implementation as well but I decided that it was too complicated to post in the blog. What I was … Continue reading

Posted in functional data structures | 3 Comments

The Swiss Army Knife of Data Structures … in C#

Actually, it is not a knife and is known under the name of Finger Tree.    Update: In a personal communication with Eric Lippert it was revealed that, in his words:   "I worked up a full implementation as well … Continue reading

Posted in functional data structures | 2 Comments