Set (Set a) like container - but more efficient?
Does a Set (Set a) like container exist already but which is represented as tree internally, eg A ` - B - C ` - D ` - X - Y which would represent ABC ABD and AXY ? If it does not what would be a nice name to create such container? Marc Weber
Sounds a bit like a Trie...
On 23 August 2014 20:42, Marc Weber
Does a Set (Set a) like container exist already but which is represented as tree internally, eg
A ` - B - C ` - D ` - X - Y
which would represent ABC ABD and AXY ? If it does not what would be a nice name to create such container?
Marc Weber _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com http://IvanMiljenovic.wordpress.com
Marc Weber
Does a Set (Set a) like container exist [...]
what do you want to do with this? In particular, what methods of the outer set are you planning to use? Do you perhaps want a disjoint-set representation? http://stackoverflow.com/questions/15691696/equivalence-classes-and-union-fi... - J.W.
Excerpts from Johannes Waldmann's message of Mon Sep 01 11:13:56 +0000 2014:
Do you perhaps want a disjoint-set representation? http://stackoverflow.com/questions/15691696/equivalence-classes-and-union-fi...
It turned out that the tree was that small that there was no need to optimize the representation - thus using Set (Set a) was just good enough. Marc Weber
participants (3)
-
Ivan Lazar Miljenovic -
Johannes Waldmann -
Marc Weber