But the thing which would be most valuable would be a purely functional version of Judy.
The general technique for trees is well known. Basically you have to make new copies of the path to an modification, each modification. But the unchanged branches remain shared. On insertion Judy would probably perform badly compared to other tree designs. But the lookup and scan times are so fast, it would be a viable functional array. Functional arrays are the Holy Grail. The lack of them is the single biggest technical obstacle to the adoption of functional programming. -- john skaller [email protected] http://felix-lang.org ------------------------------------------------------------------------------ Monitor your physical, virtual and cloud infrastructure from a single web console. Get in-depth insight into apps, servers, databases, vmware, SAP, cloud infrastructure, etc. Download 30-day Free Trial. Pricing starts from $795 for 25 servers or applications! http://p.sf.net/sfu/zoho_dev2dev_nov _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
