login/register

Snip!t from collection of Alan Dix

see all channels for Alan Dix

Snip
summary

Abstract: Most texts describing data structures give imp... implementations. These are either difficult or tedious t... functional (non sideeffecting) form. This technical repo... implementation of sets in the functional subset of Stand... implementat

Implementing Sets Efficiently in a Functional Language (ResearchIndex)
http://citeseer.ist.psu.edu/162336.html

Categories

/Channels/AVL trees

[ go to category ]

For Snip

loading snip actions ...

For Page

loading url actions ...
Abstract: Most texts describing data structures give imperative implementations. These are either difficult or tedious to convert to a functional (non sideeffecting) form. This technical report describes the implementation of sets in the functional subset of Standard ML. The implementation is based on balanced binary trees. Tree balacing algorithms are usually complex. We show that this need not be the case---the trick is to abstract away from the rebalancing scheme to achieve a simple and efficient..

HTML

<b>Abstract:</b> Most texts describing data structures give imperative implementations. These are either difficult or tedious to convert to a functional (non sideeffecting) form. This technical report describes the implementation of sets in the functional subset of Standard ML. The implementation is based on balanced binary trees. Tree balacing algorithms are usually complex. We show that this need not be the case---the trick is to abstract away from the rebalancing scheme to achieve a simple and efficient..

Search Alan Dix Snips

Channels - Alan Dix