<html><head> <link rel="stylesheet" href="style.css" type="text/css"> <meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type"> <link rel="Start" href="index.html"> <link title="Index of types" rel=Appendix href="index_types.html"> <link title="Index of exceptions" rel=Appendix href="index_exceptions.html"> <link title="Index of values" rel=Appendix href="index_values.html"> <link title="Index of modules" rel=Appendix href="index_modules.html"> <link title="Index of module types" rel=Appendix href="index_module_types.html"> <link title="Async_print" rel="Chapter" href="Async_print.html"> <link title="Async_sys" rel="Chapter" href="Async_sys.html"> <link title="Epoll_file_descr_watcher" rel="Chapter" href="Epoll_file_descr_watcher.html"> <link title="Fd" rel="Chapter" href="Fd.html"> <link title="Fd_by_descr" rel="Chapter" href="Fd_by_descr.html"> <link title="File_descr_watcher_intf" rel="Chapter" href="File_descr_watcher_intf.html"> <link title="Import" rel="Chapter" href="Import.html"> <link title="Interruptor" rel="Chapter" href="Interruptor.html"> <link title="In_thread" rel="Chapter" href="In_thread.html"> <link title="Io_stats" rel="Chapter" href="Io_stats.html"> <link title="Process" rel="Chapter" href="Process.html"> <link title="Raw_fd" rel="Chapter" href="Raw_fd.html"> <link title="Raw_scheduler" rel="Chapter" href="Raw_scheduler.html"> <link title="Raw_signal_manager" rel="Chapter" href="Raw_signal_manager.html"> <link title="Reader" rel="Chapter" href="Reader.html"> <link title="Read_write" rel="Chapter" href="Read_write.html"> <link title="Scheduler" rel="Chapter" href="Scheduler.html"> <link title="Select_file_descr_watcher" rel="Chapter" href="Select_file_descr_watcher.html"> <link title="Shutdown" rel="Chapter" href="Shutdown.html"> <link title="Signal" rel="Chapter" href="Signal.html"> <link title="Signal_manager" rel="Chapter" href="Signal_manager.html"> <link title="Std" rel="Chapter" href="Std.html"> <link title="Syscall" rel="Chapter" href="Syscall.html"> <link title="Thread_pool" rel="Chapter" href="Thread_pool.html"> <link title="Thread_safe" rel="Chapter" href="Thread_safe.html"> <link title="Thread_safe_pipe" rel="Chapter" href="Thread_safe_pipe.html"> <link title="Unix_syscalls" rel="Chapter" href="Unix_syscalls.html"> <link title="Writer" rel="Chapter" href="Writer.html"><title>Unix_syscalls.Inet_addr</title> </head> <body> <code class="code"><span class="keyword">sig</span><br> <span class="keyword">type</span> t = <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Unix</span>.<span class="constructor">Inet_addr</span>.t<br> <span class="keyword">val</span> ( >= ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( <= ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( = ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( > ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( < ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( <> ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> equal : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> min : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> max : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> ascending : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> descending : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> between : t <span class="keywordsign">-></span> low:t <span class="keywordsign">-></span> high:t <span class="keywordsign">-></span> bool<br> <span class="keyword">module</span> <span class="constructor">Replace_polymorphic_compare</span> :<br> <span class="keyword">sig</span><br> <span class="keyword">val</span> ( >= ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( <= ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( = ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( > ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( < ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> ( <> ) : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> equal : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> min : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> max : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> _squelch_unused_module_warning_ : unit<br> <span class="keyword">end</span><br> <span class="keyword">type</span> comparator<br> <span class="keyword">val</span> comparator : (t, comparator) <span class="constructor">Core</span>.<span class="constructor">Comparator</span>.t<br> <span class="keyword">val</span> validate_lbound :<br> min:t <span class="constructor">Core</span>.<span class="constructor">Comparable_intf</span>.bound <span class="keywordsign">-></span> t <span class="constructor">Core</span>.<span class="constructor">Validate</span>.check<br> <span class="keyword">val</span> validate_ubound :<br> max:t <span class="constructor">Core</span>.<span class="constructor">Comparable_intf</span>.bound <span class="keywordsign">-></span> t <span class="constructor">Core</span>.<span class="constructor">Validate</span>.check<br> <span class="keyword">val</span> validate_bound :<br> min:t <span class="constructor">Core</span>.<span class="constructor">Comparable_intf</span>.bound <span class="keywordsign">-></span><br> max:t <span class="constructor">Core</span>.<span class="constructor">Comparable_intf</span>.bound <span class="keywordsign">-></span> t <span class="constructor">Core</span>.<span class="constructor">Validate</span>.check<br> <span class="keyword">module</span> <span class="constructor">Map</span> :<br> <span class="keyword">sig</span><br> <span class="keyword">module</span> <span class="constructor">Key</span> :<br> <span class="keyword">sig</span><br> <span class="keyword">type</span> t = t<br> <span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> t_of_sexp : <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> sexp_of_t : t <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t<br> <span class="keyword">type</span> comparator = comparator<br> <span class="keyword">val</span> comparator : (t, comparator) <span class="constructor">Core</span>.<span class="constructor">Comparator</span>.t_<br> <span class="keyword">end</span><br> <span class="keyword">module</span> <span class="constructor">Tree</span> :<br> <span class="keyword">sig</span><br> <span class="keyword">type</span> <span class="keywordsign">'</span>a t = (<span class="constructor">Key</span>.t, <span class="keywordsign">'</span>a, <span class="constructor">Key</span>.comparator) <span class="constructor">Core</span>.<span class="constructor">Core_map</span>.<span class="constructor">Tree</span>.t<br> <span class="keyword">val</span> empty : <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> singleton : <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> of_alist :<br> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> [ <span class="keywordsign">`</span><span class="constructor">Duplicate_key</span> <span class="keyword">of</span> <span class="constructor">Key</span>.t <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Ok</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a t ]<br> <span class="keyword">val</span> of_alist_exn : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> of_alist_multi : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> <span class="keywordsign">'</span>a list t<br> <span class="keyword">val</span> of_alist_fold :<br> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> of_sorted_array : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) array <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="constructor">Core</span>.<span class="constructor">Or_error</span>.t<br> <span class="keyword">val</span> of_sorted_array_unchecked : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) array <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> of_tree : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> invariants : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> is_empty : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> length : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> add : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> add_multi : <span class="keywordsign">'</span>a list t <span class="keywordsign">-></span> key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a list t<br> <span class="keyword">val</span> change : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="keywordsign">'</span>a option <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> find : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option<br> <span class="keyword">val</span> find_exn : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br> <span class="keyword">val</span> remove : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> mem : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> iter : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> unit<br> <span class="keyword">val</span> iter2 :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>b t <span class="keywordsign">-></span><br> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span><br> data:[ <span class="keywordsign">`</span><span class="constructor">Both</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a * <span class="keywordsign">'</span>b <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b ] <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span><br> unit<br> <span class="keyword">val</span> map : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> mapi : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> fold :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> fold_right :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> filter : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> filter_map : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> filter_mapi :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> compare_direct : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> int) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> equal : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> keys : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t list<br> <span class="keyword">val</span> data : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a list<br> <span class="keyword">val</span> to_alist : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list<br> <span class="keyword">val</span> validate :<br> name:(<span class="constructor">Key</span>.t <span class="keywordsign">-></span> string) <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>a <span class="constructor">Core</span>.<span class="constructor">Validate</span>.check <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="constructor">Core</span>.<span class="constructor">Validate</span>.check<br> <span class="keyword">val</span> merge :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>b t <span class="keywordsign">-></span><br> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span><br> [ <span class="keywordsign">`</span><span class="constructor">Both</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a * <span class="keywordsign">'</span>b <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b ] <span class="keywordsign">-></span> <span class="keywordsign">'</span>c option) <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>c t<br> <span class="keyword">val</span> symmetric_diff :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> data_equal:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span><br> (<span class="constructor">Key</span>.t * [ <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Unequal</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a * <span class="keywordsign">'</span>a ])<br> list<br> <span class="keyword">val</span> min_elt : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> min_elt_exn : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a<br> <span class="keyword">val</span> max_elt : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> max_elt_exn : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a<br> <span class="keyword">val</span> for_all : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> exists : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> fold_range_inclusive :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> min:<span class="constructor">Key</span>.t <span class="keywordsign">-></span><br> max:<span class="constructor">Key</span>.t <span class="keywordsign">-></span><br> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> range_to_alist :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> min:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> max:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list<br> <span class="keyword">val</span> prev_key : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> next_key : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> rank : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> int option<br> <span class="keyword">val</span> to_tree : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> t_of_sexp : (<span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> sexp_of_t : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t<br> <span class="keyword">end</span><br> <span class="keyword">type</span> <span class="keywordsign">'</span>a t = (<span class="constructor">Key</span>.t, <span class="keywordsign">'</span>a, <span class="constructor">Key</span>.comparator) <span class="constructor">Core</span>.<span class="constructor">Core_map</span>.t<br> <span class="keyword">val</span> empty : <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> singleton : <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> of_alist :<br> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> [ <span class="keywordsign">`</span><span class="constructor">Duplicate_key</span> <span class="keyword">of</span> <span class="constructor">Key</span>.t <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Ok</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a t ]<br> <span class="keyword">val</span> of_alist_exn : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> of_alist_multi : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> <span class="keywordsign">'</span>a list t<br> <span class="keyword">val</span> of_alist_fold :<br> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> of_sorted_array : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) array <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="constructor">Core</span>.<span class="constructor">Or_error</span>.t<br> <span class="keyword">val</span> of_sorted_array_unchecked : (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) array <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> of_tree : <span class="keywordsign">'</span>a <span class="constructor">Tree</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> invariants : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> is_empty : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> length : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> add : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> add_multi : <span class="keywordsign">'</span>a list t <span class="keywordsign">-></span> key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a list t<br> <span class="keyword">val</span> change : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="keywordsign">'</span>a option <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> find : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option<br> <span class="keyword">val</span> find_exn : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br> <span class="keyword">val</span> remove : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> mem : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> iter : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> unit<br> <span class="keyword">val</span> iter2 :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>b t <span class="keywordsign">-></span><br> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span><br> data:[ <span class="keywordsign">`</span><span class="constructor">Both</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a * <span class="keywordsign">'</span>b <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b ] <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span><br> unit<br> <span class="keyword">val</span> map : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> mapi : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> fold :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> fold_right :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> filter : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> filter_map : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> filter_mapi : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br> <span class="keyword">val</span> compare_direct : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> int) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> equal : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> keys : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t list<br> <span class="keyword">val</span> data : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a list<br> <span class="keyword">val</span> to_alist : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list<br> <span class="keyword">val</span> validate :<br> name:(<span class="constructor">Key</span>.t <span class="keywordsign">-></span> string) <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>a <span class="constructor">Core</span>.<span class="constructor">Validate</span>.check <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="constructor">Core</span>.<span class="constructor">Validate</span>.check<br> <span class="keyword">val</span> merge :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>b t <span class="keywordsign">-></span><br> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span><br> [ <span class="keywordsign">`</span><span class="constructor">Both</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a * <span class="keywordsign">'</span>b <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b ] <span class="keywordsign">-></span> <span class="keywordsign">'</span>c option) <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>c t<br> <span class="keyword">val</span> symmetric_diff :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> data_equal:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span><br> (<span class="constructor">Key</span>.t * [ <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Unequal</span> <span class="keyword">of</span> <span class="keywordsign">'</span>a * <span class="keywordsign">'</span>a ]) list<br> <span class="keyword">val</span> min_elt : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> min_elt_exn : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a<br> <span class="keyword">val</span> max_elt : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> max_elt_exn : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a<br> <span class="keyword">val</span> for_all : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> exists : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> fold_range_inclusive :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span><br> min:<span class="constructor">Key</span>.t <span class="keywordsign">-></span><br> max:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(key:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> data:<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> range_to_alist :<br> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> min:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> max:<span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) list<br> <span class="keyword">val</span> prev_key : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> next_key : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> (<span class="constructor">Key</span>.t * <span class="keywordsign">'</span>a) option<br> <span class="keyword">val</span> rank : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Key</span>.t <span class="keywordsign">-></span> int option<br> <span class="keyword">val</span> to_tree : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="constructor">Tree</span>.t<br> <span class="keyword">val</span> t_of_sexp : (<span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br> <span class="keyword">val</span> sexp_of_t : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t<br> <span class="keyword">val</span> compare : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> int) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> int<br> <span class="keyword">end</span><br> <span class="keyword">module</span> <span class="constructor">Set</span> :<br> <span class="keyword">sig</span><br> <span class="keyword">module</span> <span class="constructor">Elt</span> :<br> <span class="keyword">sig</span><br> <span class="keyword">type</span> t = t<br> <span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> t_of_sexp : <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> sexp_of_t : t <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t<br> <span class="keyword">type</span> comparator = comparator<br> <span class="keyword">val</span> comparator : (t, comparator) <span class="constructor">Core</span>.<span class="constructor">Comparator</span>.t_<br> <span class="keyword">end</span><br> <span class="keyword">module</span> <span class="constructor">Tree</span> :<br> <span class="keyword">sig</span><br> <span class="keyword">type</span> t = (<span class="constructor">Elt</span>.t, <span class="constructor">Elt</span>.comparator) <span class="constructor">Core</span>.<span class="constructor">Core_set</span>.<span class="constructor">Tree</span>.t<br> <span class="keyword">val</span> length : t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> is_empty : t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> iter : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> unit<br> <span class="keyword">val</span> fold :<br> t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>accum <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>accum <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>accum) <span class="keywordsign">-></span> <span class="keywordsign">'</span>accum<br> <span class="keyword">val</span> exists : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> for_all : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> count : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> find : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> find_map : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option<br> <span class="keyword">val</span> to_list : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t list<br> <span class="keyword">val</span> to_array : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t array<br> <span class="keyword">val</span> invariants : t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> mem : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> add : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> remove : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> union : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> inter : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> diff : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> compare_direct : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> equal : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> subset : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> fold_until :<br> t <span class="keywordsign">-></span><br> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span><br> f:(<span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> [ <span class="keywordsign">`</span><span class="constructor">Continue</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Stop</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b ]) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> fold_right : t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> iter2 :<br> t <span class="keywordsign">-></span><br> t <span class="keywordsign">-></span><br> f:([ <span class="keywordsign">`</span><span class="constructor">Both</span> <span class="keyword">of</span> <span class="constructor">Elt</span>.t * <span class="constructor">Elt</span>.t <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="constructor">Elt</span>.t <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="constructor">Elt</span>.t ] <span class="keywordsign">-></span><br> unit) <span class="keywordsign">-></span><br> unit<br> <span class="keyword">val</span> filter : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> partition_tf : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t * t<br> <span class="keyword">val</span> elements : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t list<br> <span class="keyword">val</span> min_elt : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> min_elt_exn : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> max_elt : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> max_elt_exn : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> choose : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> choose_exn : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> split : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t * bool * t<br> <span class="keyword">val</span> group_by : t <span class="keywordsign">-></span> equiv:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t list<br> <span class="keyword">val</span> find_exn : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> find_index : t <span class="keywordsign">-></span> int <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> remove_index : t <span class="keywordsign">-></span> int <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> to_tree : t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> empty : t<br> <span class="keyword">val</span> singleton : <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> union_list : t list <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_list : <span class="constructor">Elt</span>.t list <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_array : <span class="constructor">Elt</span>.t array <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_sorted_array : <span class="constructor">Elt</span>.t array <span class="keywordsign">-></span> t <span class="constructor">Core</span>.<span class="constructor">Or_error</span>.t<br> <span class="keyword">val</span> of_sorted_array_unchecked : <span class="constructor">Elt</span>.t array <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> stable_dedup_list : <span class="constructor">Elt</span>.t list <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t list<br> <span class="keyword">val</span> map : (<span class="keywordsign">'</span>a, <span class="keywordsign">'</span>b) <span class="constructor">Core</span>.<span class="constructor">Core_set</span>.<span class="constructor">Tree</span>.t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t) <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> filter_map :<br> (<span class="keywordsign">'</span>a, <span class="keywordsign">'</span>b) <span class="constructor">Core</span>.<span class="constructor">Core_set</span>.<span class="constructor">Tree</span>.t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option) <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_tree : t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> t_of_sexp : <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> sexp_of_t : t <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t<br> <span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">end</span><br> <span class="keyword">type</span> t = (<span class="constructor">Elt</span>.t, <span class="constructor">Elt</span>.comparator) <span class="constructor">Core</span>.<span class="constructor">Core_set</span>.t<br> <span class="keyword">val</span> length : t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> is_empty : t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> iter : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> unit<br> <span class="keyword">val</span> fold : t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>accum <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>accum <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>accum) <span class="keywordsign">-></span> <span class="keywordsign">'</span>accum<br> <span class="keyword">val</span> exists : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> for_all : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> count : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> find : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> find_map : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option<br> <span class="keyword">val</span> to_list : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t list<br> <span class="keyword">val</span> to_array : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t array<br> <span class="keyword">val</span> invariants : t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> mem : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> add : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> remove : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> union : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> inter : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> diff : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> compare_direct : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> equal : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> subset : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br> <span class="keyword">val</span> fold_until :<br> t <span class="keywordsign">-></span><br> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> [ <span class="keywordsign">`</span><span class="constructor">Continue</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Stop</span> <span class="keyword">of</span> <span class="keywordsign">'</span>b ]) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> fold_right : t <span class="keywordsign">-></span> init:<span class="keywordsign">'</span>b <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br> <span class="keyword">val</span> iter2 :<br> t <span class="keywordsign">-></span><br> t <span class="keywordsign">-></span><br> f:([ <span class="keywordsign">`</span><span class="constructor">Both</span> <span class="keyword">of</span> <span class="constructor">Elt</span>.t * <span class="constructor">Elt</span>.t <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Left</span> <span class="keyword">of</span> <span class="constructor">Elt</span>.t <span class="keywordsign">|</span> <span class="keywordsign">`</span><span class="constructor">Right</span> <span class="keyword">of</span> <span class="constructor">Elt</span>.t ] <span class="keywordsign">-></span><br> unit) <span class="keywordsign">-></span><br> unit<br> <span class="keyword">val</span> filter : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> partition_tf : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t * t<br> <span class="keyword">val</span> elements : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t list<br> <span class="keyword">val</span> min_elt : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> min_elt_exn : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> max_elt : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> max_elt_exn : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> choose : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> choose_exn : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> split : t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t * bool * t<br> <span class="keyword">val</span> group_by : t <span class="keywordsign">-></span> equiv:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t list<br> <span class="keyword">val</span> find_exn : t <span class="keywordsign">-></span> f:(<span class="constructor">Elt</span>.t <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t<br> <span class="keyword">val</span> find_index : t <span class="keywordsign">-></span> int <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option<br> <span class="keyword">val</span> remove_index : t <span class="keywordsign">-></span> int <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> to_tree : t <span class="keywordsign">-></span> <span class="constructor">Tree</span>.t<br> <span class="keyword">val</span> empty : t<br> <span class="keyword">val</span> singleton : <span class="constructor">Elt</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> union_list : t list <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_list : <span class="constructor">Elt</span>.t list <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_array : <span class="constructor">Elt</span>.t array <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_sorted_array : <span class="constructor">Elt</span>.t array <span class="keywordsign">-></span> t <span class="constructor">Core</span>.<span class="constructor">Or_error</span>.t<br> <span class="keyword">val</span> of_sorted_array_unchecked : <span class="constructor">Elt</span>.t array <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> stable_dedup_list : <span class="constructor">Elt</span>.t list <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t list<br> <span class="keyword">val</span> map : (<span class="keywordsign">'</span>a, <span class="keywordsign">'</span>b) <span class="constructor">Core</span>.<span class="constructor">Core_set</span>.t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t) <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> filter_map :<br> (<span class="keywordsign">'</span>a, <span class="keywordsign">'</span>b) <span class="constructor">Core</span>.<span class="constructor">Core_set</span>.t <span class="keywordsign">-></span> f:(<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="constructor">Elt</span>.t option) <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> of_tree : <span class="constructor">Tree</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> t_of_sexp : <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> t<br> <span class="keyword">val</span> sexp_of_t : t <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t<br> <span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br> <span class="keyword">end</span><br> <span class="keyword">val</span> of_string : string <span class="keywordsign">-></span> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t<br> <span class="keyword">val</span> to_string : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="keywordsign">-></span> string<br> <span class="keyword">val</span> bind_any : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t<br> <span class="keyword">val</span> bind_any_inet6 : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t<br> <span class="keyword">val</span> localhost : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t<br> <span class="keyword">val</span> localhost_inet6 : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t<br> <span class="keyword">val</span> of_string_or_getbyname :<br> string <span class="keywordsign">-></span> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Import</span>.<span class="constructor">Deferred</span>.t<br> <span class="keyword">val</span> compare : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="keywordsign">-></span> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="keywordsign">-></span> int<br> <span class="keyword">val</span> t_of_sexp : <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t <span class="keywordsign">-></span> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t<br> <span class="keyword">val</span> sexp_of_t : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="keywordsign">-></span> <span class="constructor">Sexplib</span>.<span class="constructor">Sexp</span>.t<br> <span class="keyword">val</span> bin_t : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Type_class</span>.t<br> <span class="keyword">val</span> bin_read_t : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Read_ml</span>.reader<br> <span class="keyword">val</span> bin_read_t_ :<br> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Unsafe_read_c</span>.reader<br> <span class="keyword">val</span> bin_read_t__ :<br> (int <span class="keywordsign">-></span> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t) <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Unsafe_read_c</span>.reader<br> <span class="keyword">val</span> bin_reader_t :<br> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Type_class</span>.reader<br> <span class="keyword">val</span> bin_size_t : <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Size</span>.sizer<br> <span class="keyword">val</span> bin_write_t :<br> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Write_ml</span>.writer<br> <span class="keyword">val</span> bin_write_t_ :<br> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Unsafe_write_c</span>.writer<br> <span class="keyword">val</span> bin_writer_t :<br> <span class="constructor">Unix_syscalls</span>.<span class="constructor">Inet_addr</span>.t <span class="constructor">Core</span>.<span class="constructor">Std</span>.<span class="constructor">Bin_prot</span>.<span class="constructor">Type_class</span>.writer<br> <span class="keyword">end</span></code></body></html>
