The BinarySetFn functor
Author: John Reppy
Keywords: Standard ML, SML, SML/NJ Library

The SML of NJ Library
The `BinarySetFn` functor

The `BinarySetFn` functor provides a balanced-binary-tree implementation of the `ORD_SET` signature parameterized over the element type.

The original implementation was written by Stephen Adams and was based on the paper Binary Search Trees of Bounded Balance by Nievergelt and Reingold (SIAM Journal of Computing; March 1973).

It is recommended, however, that one use the `RedBlackSetFn` functor instead of `BinarySetFn`, since experimentation has shown it to be faster across the board.

## Synopsis

    functor BinarySetFn (K : ORD_KEY) :> ORD_SET where type Key.ord_key = K.ord_key

## See Also

`ORD_KEY`, `ORD_SET`, `RedBlackSetFn`, The Util Library

SML/NJ Version 110.99.9 (November 4, 2025)
Last updated 2025-11-04 15:48:25 UTC