<INTERFACE> The <CD/BinarySetFn/ functor <SEEALSO> <SIGREF/ORD_KEY/ <SIGREF/ORD_SET/ <FCTREF/ListSetFn/ <FCTREF/SplaySetFn/ <SIGREF/ORD_MAP/ </SEEALSO> <PP> The <FCTREF NOLINK/BinarySetFn/ functor implements applicative sets on an ordered type. The resulting structure will satisfy the interface described in <SIGREF/ORD_SET/. <PP> The implementation is based on Stephen Adams' integer set code, which uses binary trees of bounded balance. <ID>K</ID><ID>ORD_KEY</ID> <ID>ORD_SET <PP> Note that adding an element to a set that already contains such an element (in the sense that both elements are considered equal by the comparison function) causes the current element to be replaced by the new one. </INTERFACE>