RedBlackSetFn functorANSITerm structureArrayQSort structureArrayQSortFn functorAtom structureBase64 structureBinaryMapFn functorBinarySetFn functorBitArray structureBSearchFn functorCharMap structureDynamicArray structureDynamicArrayFn functorEditDistance structureFifo structureFNVHash structureFormat structureFormatComb structureGetOpt structureGraphSCCFn functorHash2TableFn functorHASH_KEY signatureHashSetFn functorHashString structureHashTable structureHashTableFn functorINTERVAL_DOMAIN signatureIntervalSetFn functorIOUtil structureKeywordFn functorMONO_PRIORITYQ signatureLibBase structureListFormat structureListMapFn functorListMergeSort structureListSetFn functorListXProd structureMonoArrayFn functorMONO_HASH_TABLE signatureORD_KEY signatureORD_MAP signatureORD_SET signatureParserComb structurePathUtil structurePropList structureQueue structureRand structureRandom structureRealOrderStats structureRedBlackMapFn functorRedBlackSetFn functorScan structureSplayMapFn functorSplaySetFn functorTimeLimit structureUnivariateStats structureURef structureUTF8 structureThe RedBlackSetFn functor provides a red-black-tree implementation of the
ORD_SET signature parameterized over the element type.
This functor is the preferred implementation of finite sets of ordered elements as it is faster than the other implementations.
functor RedBlackSetFn (K : ORD_KEY) :> ORD_SET where type Key.ord_key = K.ord_key