Contribution: FSets
Finite Sets overs Ordered Types
Authors
- Jean-Christophe Filliâtre
- Pierre Letouzey
Description
This contribution contains several implementations of finite sets over arbitrary ordered types using functors. Currently, there are 3 implementations: sorted lists, red-black trees and AVLs.
Keywords
finite sets, sorted lists, balanced trees, red black trees, avl, functors, data structures
Available files
- FSets.PrecedenceGraph.PrecedenceGraph.html
- FSets.MultiSetsEq.html
- FSets.FMapListEq.html
- FSets.MapFunction.html
- FSets.FSetList0.html
- FSets.FSetAVL_dep.html
- FSets.MSetFullAVL.html
- FSets.demo_msets.html
- FSets.FSetListEq.html
- FSets.FSetAVL0.html
- FSets.FSetAVL_prog.html
- FSets.FSetRBT.html
- FSets.MSetAVL_test.html
- FSets.extract.html
- FSets.FSetAVL_test.html
- FSets.FSetFullAVL.html
- FSets.demo.html
- FSets.PowerSet.html
- FSets.UsualFacts.html
- FSets.MultiSets.html
