📄 binary-set-fn.mldoc
字号:
<!-- binary-set-fn.mldoc --><!-- Entities.sgml entry <!ENTITY BinarySetFn SDATA "binary-set-fn.sml"> --><!DOCTYPE ML-DOC SYSTEM><COPYRIGHT OWNER="Bell Labs, Lucent Technologies" YEAR=1998><VERSION VERID="1.0" YEAR=1998 MONTH=6 DAY=10><TITLE>The BinarySetFn functor</TITLE><INTERFACE><HEAD>The <CD/BinarySetFn/ functor</HEAD><SEEALSO> <SIGREF/ORD_KEY/ <SIGREF/ORD_SET/ <FCTREF/ListSetFn/ <FCTREF/SplaySetFn/ <SIGREF/ORD_MAP/</SEEALSO><PP>The <FCTREF NOLINK/BinarySetFn/ functor implements applicative sets onan ordered type. The resulting structure will satisfythe interface described in <SIGREF/ORD_SET/.<PP>The implementation is based on Stephen Adams' integer set code, which usesbinary trees of bounded balance.<FUNCTOR FCTID="BinarySetFn"><ID>K</ID><ID>ORD_KEY</ID> <ID>ORD_SET</FUNCTOR><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 comparisonfunction) causes the current element to be replaced by the new one.</INTERFACE>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -