<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> <html xmlns:fn="http://www.w3.org/2005/02/xpath-functions"> <head> <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> <link rel="stylesheet" href="../../../../doc/otp_doc.css" type="text/css"> <title>Erlang -- sofs</title> </head> <body bgcolor="white" text="#000000" link="#0000ff" vlink="#ff00ff" alink="#ff0000"><div id="container"> <script id="js" type="text/javascript" language="JavaScript" src="../../../../doc/js/flipmenu/flipmenu.js"></script><script id="js2" type="text/javascript" src="../../../../doc/js/erlresolvelinks.js"></script><script language="JavaScript" type="text/javascript"> <!-- function getWinHeight() { var myHeight = 0; if( typeof( window.innerHeight ) == 'number' ) { //Non-IE myHeight = window.innerHeight; } else if( document.documentElement && ( document.documentElement.clientWidth || document.documentElement.clientHeight ) ) { //IE 6+ in 'standards compliant mode' myHeight = document.documentElement.clientHeight; } else if( document.body && ( document.body.clientWidth || document.body.clientHeight ) ) { //IE 4 compatible myHeight = document.body.clientHeight; } return myHeight; } function setscrollpos() { var objf=document.getElementById('loadscrollpos'); document.getElementById("leftnav").scrollTop = objf.offsetTop - getWinHeight()/2; } function addEvent(obj, evType, fn){ if (obj.addEventListener){ obj.addEventListener(evType, fn, true); return true; } else if (obj.attachEvent){ var r = obj.attachEvent("on"+evType, fn); return r; } else { return false; } } addEvent(window, 'load', setscrollpos); //--></script><div id="leftnav"><div class="innertube"> <img alt="Erlang logo" src="../../../../doc/erlang-logo.png"><br><small><a href="users_guide.html">User's Guide</a><br><a href="index.html">Reference Manual</a><br><a href="release_notes.html">Release Notes</a><br><a href="../pdf/stdlib-1.16.5.pdf">PDF</a><br><a href="../../../../doc/index.html">Top</a></small><p><strong>STDLIB</strong><br><strong>Reference Manual</strong><br><small>Version 1.16.5</small></p> <br><a href="javascript:openAllFlips()">Expand All</a><br><a href="javascript:closeAllFlips()">Contract All</a><p><small><strong>Table of Contents</strong></small></p> <ul class="flipMenu"> <li title="STDLIB (App)"><a href="STDLIB_app.html">STDLIB (App) </a></li> <li id="no" title="array " expanded="false">array<ul> <li><a href="array.html"> Top of manual page </a></li> <li title="default-1"><a href="array.html#default-1">default/1</a></li> <li title="fix-1"><a href="array.html#fix-1">fix/1</a></li> <li title="foldl-3"><a href="array.html#foldl-3">foldl/3</a></li> <li title="foldr-3"><a href="array.html#foldr-3">foldr/3</a></li> <li title="from_list-1"><a href="array.html#from_list-1">from_list/1</a></li> <li title="from_list-2"><a href="array.html#from_list-2">from_list/2</a></li> <li title="from_orddict-1"><a href="array.html#from_orddict-1">from_orddict/1</a></li> <li title="from_orddict-2"><a href="array.html#from_orddict-2">from_orddict/2</a></li> <li title="get-2"><a href="array.html#get-2">get/2</a></li> <li title="is_array-1"><a href="array.html#is_array-1">is_array/1</a></li> <li title="is_fix-1"><a href="array.html#is_fix-1">is_fix/1</a></li> <li title="map-2"><a href="array.html#map-2">map/2</a></li> <li title="new-0"><a href="array.html#new-0">new/0</a></li> <li title="new-1"><a href="array.html#new-1">new/1</a></li> <li title="new-2"><a href="array.html#new-2">new/2</a></li> <li title="relax-1"><a href="array.html#relax-1">relax/1</a></li> <li title="reset-2"><a href="array.html#reset-2">reset/2</a></li> <li title="resize-1"><a href="array.html#resize-1">resize/1</a></li> <li title="resize-2"><a href="array.html#resize-2">resize/2</a></li> <li title="set-3"><a href="array.html#set-3">set/3</a></li> <li title="size-1"><a href="array.html#size-1">size/1</a></li> <li title="sparse_foldl-3"><a href="array.html#sparse_foldl-3">sparse_foldl/3</a></li> <li title="sparse_foldr-3"><a href="array.html#sparse_foldr-3">sparse_foldr/3</a></li> <li title="sparse_map-2"><a href="array.html#sparse_map-2">sparse_map/2</a></li> <li title="sparse_size-1"><a href="array.html#sparse_size-1">sparse_size/1</a></li> <li title="sparse_to_list-1"><a href="array.html#sparse_to_list-1">sparse_to_list/1</a></li> <li title="sparse_to_orddict-1"><a href="array.html#sparse_to_orddict-1">sparse_to_orddict/1</a></li> <li title="to_list-1"><a href="array.html#to_list-1">to_list/1</a></li> <li title="to_orddict-1"><a href="array.html#to_orddict-1">to_orddict/1</a></li> </ul> </li> <li id="no" title="base64 " expanded="false">base64<ul> <li><a href="base64.html"> Top of manual page </a></li> <li title="encode-1"><a href="base64.html#encode-1">encode/1</a></li> <li title="encode_to_string-1"><a href="base64.html#encode_to_string-1">encode_to_string/1</a></li> <li title="decode-1"><a href="base64.html#decode-1">decode/1</a></li> <li title="decode_to_string-1"><a href="base64.html#decode_to_string-1">decode_to_string/1</a></li> <li title="mime_decode-1"><a href="base64.html#mime_decode-1">mime_decode/1</a></li> <li title="mime_decode_to_string-1"><a href="base64.html#mime_decode_to_string-1">mime_decode_to_string/1</a></li> </ul> </li> <li id="no" title="beam_lib " expanded="false">beam_lib<ul> <li><a href="beam_lib.html"> Top of manual page </a></li> <li title="chunks-2"><a href="beam_lib.html#chunks-2">chunks/2</a></li> <li title="chunks-3"><a href="beam_lib.html#chunks-3">chunks/3</a></li> <li title="version-1"><a href="beam_lib.html#version-1">version/1</a></li> <li title="md5-1"><a href="beam_lib.html#md5-1">md5/1</a></li> <li title="info-1"><a href="beam_lib.html#info-1">info/1</a></li> <li title="cmp-2"><a href="beam_lib.html#cmp-2">cmp/2</a></li> <li title="cmp_dirs-2"><a href="beam_lib.html#cmp_dirs-2">cmp_dirs/2</a></li> <li title="diff_dirs-2"><a href="beam_lib.html#diff_dirs-2">diff_dirs/2</a></li> <li title="strip-1"><a href="beam_lib.html#strip-1">strip/1</a></li> <li title="strip_files-1"><a href="beam_lib.html#strip_files-1">strip_files/1</a></li> <li title="strip_release-1"><a href="beam_lib.html#strip_release-1">strip_release/1</a></li> <li title="format_error-1"><a href="beam_lib.html#format_error-1">format_error/1</a></li> <li title="crypto_key_fun-1"><a href="beam_lib.html#crypto_key_fun-1">crypto_key_fun/1</a></li> <li title="clear_crypto_key_fun-0"><a href="beam_lib.html#clear_crypto_key_fun-0">clear_crypto_key_fun/0</a></li> </ul> </li> <li id="no" title="c " expanded="false">c<ul> <li><a href="c.html"> Top of manual page </a></li> <li title="bt-1"><a href="c.html#bt-1">bt/1</a></li> <li title="c-1"><a href="c.html#c-1">c/1</a></li> <li title="c-2"><a href="c.html#c-2">c/2</a></li> <li title="cd-1"><a href="c.html#cd-1">cd/1</a></li> <li title="flush-0"><a href="c.html#flush-0">flush/0</a></li> <li title="help-0"><a href="c.html#help-0">help/0</a></li> <li title="i-0"><a href="c.html#i-0">i/0</a></li> <li title="ni-0"><a href="c.html#ni-0">ni/0</a></li> <li title="i-3"><a href="c.html#i-3">i/3</a></li> <li title="l-1"><a href="c.html#l-1">l/1</a></li> <li title="lc-1"><a href="c.html#lc-1">lc/1</a></li> <li title="ls-0"><a href="c.html#ls-0">ls/0</a></li> <li title="ls-1"><a href="c.html#ls-1">ls/1</a></li> <li title="m-0"><a href="c.html#m-0">m/0</a></li> <li title="m-1"><a href="c.html#m-1">m/1</a></li> <li title="memory-0"><a href="c.html#memory-0">memory/0</a></li> <li title="memory-1"><a href="c.html#memory-1">memory/1</a></li> <li title="memory-1"><a href="c.html#memory-1">memory/1</a></li> <li title="nc-1"><a href="c.html#nc-1">nc/1</a></li> <li title="nc-2"><a href="c.html#nc-2">nc/2</a></li> <li title="nl-1"><a href="c.html#nl-1">nl/1</a></li> <li title="pid-3"><a href="c.html#pid-3">pid/3</a></li> <li title="pwd-0"><a href="c.html#pwd-0">pwd/0</a></li> <li title="q-0"><a href="c.html#q-0">q/0</a></li> <li title="regs-0"><a href="c.html#regs-0">regs/0</a></li> <li title="nregs-0"><a href="c.html#nregs-0">nregs/0</a></li> <li title="xm-1"><a href="c.html#xm-1">xm/1</a></li> <li title="y-1"><a href="c.html#y-1">y/1</a></li> <li title="y-2"><a href="c.html#y-2">y/2</a></li> </ul> </li> <li id="no" title="calendar " expanded="false">calendar<ul> <li><a href="calendar.html"> Top of manual page </a></li> <li title="date_to_gregorian_days-1"><a href="calendar.html#date_to_gregorian_days-1">date_to_gregorian_days/1</a></li> <li title="date_to_gregorian_days-3"><a href="calendar.html#date_to_gregorian_days-3">date_to_gregorian_days/3</a></li> <li title="datetime_to_gregorian_seconds-1"><a href="calendar.html#datetime_to_gregorian_seconds-1">datetime_to_gregorian_seconds/1</a></li> <li title="day_of_the_week-1"><a href="calendar.html#day_of_the_week-1">day_of_the_week/1</a></li> <li title="day_of_the_week-3"><a href="calendar.html#day_of_the_week-3">day_of_the_week/3</a></li> <li title="gregorian_days_to_date-1"><a href="calendar.html#gregorian_days_to_date-1">gregorian_days_to_date/1</a></li> <li title="gregorian_seconds_to_datetime-1"><a href="calendar.html#gregorian_seconds_to_datetime-1">gregorian_seconds_to_datetime/1</a></li> <li title="is_leap_year-1"><a href="calendar.html#is_leap_year-1">is_leap_year/1</a></li> <li title="last_day_of_the_month-2"><a href="calendar.html#last_day_of_the_month-2">last_day_of_the_month/2</a></li> <li title="local_time-0"><a href="calendar.html#local_time-0">local_time/0</a></li> <li title="local_time_to_universal_time-1"><a href="calendar.html#local_time_to_universal_time-1">local_time_to_universal_time/1</a></li> <li title="local_time_to_universal_time_dst-1"><a href="calendar.html#local_time_to_universal_time_dst-1">local_time_to_universal_time_dst/1</a></li> <li title="now_to_local_time-1"><a href="calendar.html#now_to_local_time-1">now_to_local_time/1</a></li> <li title="now_to_universal_time-1"><a href="calendar.html#now_to_universal_time-1">now_to_universal_time/1</a></li> <li title="now_to_datetime-1"><a href="calendar.html#now_to_datetime-1">now_to_datetime/1</a></li> <li title="seconds_to_daystime-1"><a href="calendar.html#seconds_to_daystime-1">seconds_to_daystime/1</a></li> <li title="seconds_to_time-1"><a href="calendar.html#seconds_to_time-1">seconds_to_time/1</a></li> <li title="time_difference-2"><a href="calendar.html#time_difference-2">time_difference/2</a></li> <li title="time_to_seconds-1"><a href="calendar.html#time_to_seconds-1">time_to_seconds/1</a></li> <li title="universal_time-0"><a href="calendar.html#universal_time-0">universal_time/0</a></li> <li title="universal_time_to_local_time-1"><a href="calendar.html#universal_time_to_local_time-1">universal_time_to_local_time/1</a></li> <li title="valid_date-1"><a href="calendar.html#valid_date-1">valid_date/1</a></li> <li title="valid_date-3"><a href="calendar.html#valid_date-3">valid_date/3</a></li> </ul> </li> <li id="no" title="dets " expanded="false">dets<ul> <li><a href="dets.html"> Top of manual page </a></li> <li title="all-0"><a href="dets.html#all-0">all/0</a></li> <li title="bchunk-2"><a href="dets.html#bchunk-2">bchunk/2</a></li> <li title="close-1"><a href="dets.html#close-1">close/1</a></li> <li title="delete-2"><a href="dets.html#delete-2">delete/2</a></li> <li title="delete_all_objects-1"><a href="dets.html#delete_all_objects-1">delete_all_objects/1</a></li> <li title="delete_object-2"><a href="dets.html#delete_object-2">delete_object/2</a></li> <li title="first-1"><a href="dets.html#first-1">first/1</a></li> <li title="foldl-3"><a href="dets.html#foldl-3">foldl/3</a></li> <li title="foldr-3"><a href="dets.html#foldr-3">foldr/3</a></li> <li title="from_ets-2"><a href="dets.html#from_ets-2">from_ets/2</a></li> <li title="info-1"><a href="dets.html#info-1">info/1</a></li> <li title="info-2"><a href="dets.html#info-2">info/2</a></li> <li title="init_table-2"><a href="dets.html#init_table-2">init_table/2</a></li> <li title="insert-2"><a href="dets.html#insert-2">insert/2</a></li> <li title="insert_new-2"><a href="dets.html#insert_new-2">insert_new/2</a></li> <li title="is_compatible_bchunk_format-2"><a href="dets.html#is_compatible_bchunk_format-2">is_compatible_bchunk_format/2</a></li> <li title="is_dets_file-1"><a href="dets.html#is_dets_file-1">is_dets_file/1</a></li> <li title="lookup-2"><a href="dets.html#lookup-2">lookup/2</a></li> <li title="match-1"><a href="dets.html#match-1">match/1</a></li> <li title="match-2"><a href="dets.html#match-2">match/2</a></li> <li title="match-3"><a href="dets.html#match-3">match/3</a></li> <li title="match_delete-2"><a href="dets.html#match_delete-2">match_delete/2</a></li> <li title="match_object-1"><a href="dets.html#match_object-1">match_object/1</a></li> <li title="match_object-2"><a href="dets.html#match_object-2">match_object/2</a></li> <li title="match_object-3"><a href="dets.html#match_object-3">match_object/3</a></li> <li title="member-2"><a href="dets.html#member-2">member/2</a></li> <li title="next-2"><a href="dets.html#next-2">next/2</a></li> <li title="open_file-1"><a href="dets.html#open_file-1">open_file/1</a></li> <li title="open_file-2"><a href="dets.html#open_file-2">open_file/2</a></li> <li title="pid2name-1"><a href="dets.html#pid2name-1">pid2name/1</a></li> <li title="repair_continuation-2"><a href="dets.html#repair_continuation-2">repair_continuation/2</a></li> <li title="safe_fixtable-2"><a href="dets.html#safe_fixtable-2">safe_fixtable/2</a></li> <li title="select-1"><a href="dets.html#select-1">select/1</a></li> <li title="select-2"><a href="dets.html#select-2">select/2</a></li> <li title="select-3"><a href="dets.html#select-3">select/3</a></li> <li title="select_delete-2"><a href="dets.html#select_delete-2">select_delete/2</a></li> <li title="slot-2"><a href="dets.html#slot-2">slot/2</a></li> <li title="sync-1"><a href="dets.html#sync-1">sync/1</a></li> <li title="table-1"><a href="dets.html#table-1">table/1</a></li> <li title="to_ets-2"><a href="dets.html#to_ets-2">to_ets/2</a></li> <li title="traverse-2"><a href="dets.html#traverse-2">traverse/2</a></li> <li title="update_counter-3"><a href="dets.html#update_counter-3">update_counter/3</a></li> </ul> </li> <li id="no" title="dict " expanded="false">dict<ul> <li><a href="dict.html"> Top of manual page </a></li> <li title="append-3"><a href="dict.html#append-3">append/3</a></li> <li title="append_list-3"><a href="dict.html#append_list-3">append_list/3</a></li> <li title="erase-2"><a href="dict.html#erase-2">erase/2</a></li> <li title="fetch-2"><a href="dict.html#fetch-2">fetch/2</a></li> <li title="fetch_keys-1"><a href="dict.html#fetch_keys-1">fetch_keys/1</a></li> <li title="filter-2"><a href="dict.html#filter-2">filter/2</a></li> <li title="find-2"><a href="dict.html#find-2">find/2</a></li> <li title="fold-3"><a href="dict.html#fold-3">fold/3</a></li> <li title="from_list-1"><a href="dict.html#from_list-1">from_list/1</a></li> <li title="is_key-2"><a href="dict.html#is_key-2">is_key/2</a></li> <li title="map-2"><a href="dict.html#map-2">map/2</a></li> <li title="merge-3"><a href="dict.html#merge-3">merge/3</a></li> <li title="new-0"><a href="dict.html#new-0">new/0</a></li> <li title="size-1"><a href="dict.html#size-1">size/1</a></li> <li title="store-3"><a href="dict.html#store-3">store/3</a></li> <li title="to_list-1"><a href="dict.html#to_list-1">to_list/1</a></li> <li title="update-3"><a href="dict.html#update-3">update/3</a></li> <li title="update-4"><a href="dict.html#update-4">update/4</a></li> <li title="update_counter-3"><a href="dict.html#update_counter-3">update_counter/3</a></li> </ul> </li> <li id="no" title="digraph " expanded="false">digraph<ul> <li><a href="digraph.html"> Top of manual page </a></li> <li title="add_edge-5"><a href="digraph.html#add_edge-5">add_edge/5</a></li> <li title="add_edge-4"><a href="digraph.html#add_edge-4">add_edge/4</a></li> <li title="add_edge-3"><a href="digraph.html#add_edge-3">add_edge/3</a></li> <li title="add_vertex-3"><a href="digraph.html#add_vertex-3">add_vertex/3</a></li> <li title="add_vertex-2"><a href="digraph.html#add_vertex-2">add_vertex/2</a></li> <li title="add_vertex-1"><a href="digraph.html#add_vertex-1">add_vertex/1</a></li> <li title="del_edge-2"><a href="digraph.html#del_edge-2">del_edge/2</a></li> <li title="del_edges-2"><a href="digraph.html#del_edges-2">del_edges/2</a></li> <li title="del_path-3"><a href="digraph.html#del_path-3">del_path/3</a></li> <li title="del_vertex-2"><a href="digraph.html#del_vertex-2">del_vertex/2</a></li> <li title="del_vertices-2"><a href="digraph.html#del_vertices-2">del_vertices/2</a></li> <li title="delete-1"><a href="digraph.html#delete-1">delete/1</a></li> <li title="edge-2"><a href="digraph.html#edge-2">edge/2</a></li> <li title="edges-1"><a href="digraph.html#edges-1">edges/1</a></li> <li title="edges-2"><a href="digraph.html#edges-2">edges/2</a></li> <li title="get_cycle-2"><a href="digraph.html#get_cycle-2">get_cycle/2</a></li> <li title="get_path-3"><a href="digraph.html#get_path-3">get_path/3</a></li> <li title="get_short_cycle-2"><a href="digraph.html#get_short_cycle-2">get_short_cycle/2</a></li> <li title="get_short_path-3"><a href="digraph.html#get_short_path-3">get_short_path/3</a></li> <li title="in_degree-2"><a href="digraph.html#in_degree-2">in_degree/2</a></li> <li title="in_edges-2"><a href="digraph.html#in_edges-2">in_edges/2</a></li> <li title="in_neighbours-2"><a href="digraph.html#in_neighbours-2">in_neighbours/2</a></li> <li title="info-1"><a href="digraph.html#info-1">info/1</a></li> <li title="new-0"><a href="digraph.html#new-0">new/0</a></li> <li title="new-1"><a href="digraph.html#new-1">new/1</a></li> <li title="no_edges-1"><a href="digraph.html#no_edges-1">no_edges/1</a></li> <li title="no_vertices-1"><a href="digraph.html#no_vertices-1">no_vertices/1</a></li> <li title="out_degree-2"><a href="digraph.html#out_degree-2">out_degree/2</a></li> <li title="out_edges-2"><a href="digraph.html#out_edges-2">out_edges/2</a></li> <li title="out_neighbours-2"><a href="digraph.html#out_neighbours-2">out_neighbours/2</a></li> <li title="vertex-2"><a href="digraph.html#vertex-2">vertex/2</a></li> <li title="vertices-1"><a href="digraph.html#vertices-1">vertices/1</a></li> </ul> </li> <li id="no" title="digraph_utils " expanded="false">digraph_utils<ul> <li><a href="digraph_utils.html"> Top of manual page </a></li> <li title="arborescence_root-1"><a href="digraph_utils.html#arborescence_root-1">arborescence_root/1</a></li> <li title="components-1"><a href="digraph_utils.html#components-1">components/1</a></li> <li title="condensation-1"><a href="digraph_utils.html#condensation-1">condensation/1</a></li> <li title="cyclic_strong_components-1"><a href="digraph_utils.html#cyclic_strong_components-1">cyclic_strong_components/1</a></li> <li title="is_acyclic-1"><a href="digraph_utils.html#is_acyclic-1">is_acyclic/1</a></li> <li title="is_arborescence-1"><a href="digraph_utils.html#is_arborescence-1">is_arborescence/1</a></li> <li title="is_tree-1"><a href="digraph_utils.html#is_tree-1">is_tree/1</a></li> <li title="loop_vertices-1"><a href="digraph_utils.html#loop_vertices-1">loop_vertices/1</a></li> <li title="postorder-1"><a href="digraph_utils.html#postorder-1">postorder/1</a></li> <li title="preorder-1"><a href="digraph_utils.html#preorder-1">preorder/1</a></li> <li title="reachable-2"><a href="digraph_utils.html#reachable-2">reachable/2</a></li> <li title="reachable_neighbours-2"><a href="digraph_utils.html#reachable_neighbours-2">reachable_neighbours/2</a></li> <li title="reaching-2"><a href="digraph_utils.html#reaching-2">reaching/2</a></li> <li title="reaching_neighbours-2"><a href="digraph_utils.html#reaching_neighbours-2">reaching_neighbours/2</a></li> <li title="strong_components-1"><a href="digraph_utils.html#strong_components-1">strong_components/1</a></li> <li title="subgraph-2"><a href="digraph_utils.html#subgraph-2">subgraph/2</a></li> <li title="topsort-1"><a href="digraph_utils.html#topsort-1">topsort/1</a></li> </ul> </li> <li id="no" title="epp " expanded="false">epp<ul> <li><a href="epp.html"> Top of manual page </a></li> <li title="open-2"><a href="epp.html#open-2">open/2</a></li> <li title="open-3"><a href="epp.html#open-3">open/3</a></li> <li title="close-1"><a href="epp.html#close-1">close/1</a></li> <li title="parse_erl_form-1"><a href="epp.html#parse_erl_form-1">parse_erl_form/1</a></li> <li title="parse_file-3"><a href="epp.html#parse_file-3">parse_file/3</a></li> </ul> </li> <li id="no" title="erl_eval " expanded="false">erl_eval<ul> <li><a href="erl_eval.html"> Top of manual page </a></li> <li title="exprs-2"><a href="erl_eval.html#exprs-2">exprs/2</a></li> <li title="exprs-3"><a href="erl_eval.html#exprs-3">exprs/3</a></li> <li title="exprs-4"><a href="erl_eval.html#exprs-4">exprs/4</a></li> <li title="expr-2"><a href="erl_eval.html#expr-2">expr/2</a></li> <li title="expr-3"><a href="erl_eval.html#expr-3">expr/3</a></li> <li title="expr-4"><a href="erl_eval.html#expr-4">expr/4</a></li> <li title="expr-5"><a href="erl_eval.html#expr-5">expr/5</a></li> <li title="expr_list-2"><a href="erl_eval.html#expr_list-2">expr_list/2</a></li> <li title="expr_list-3"><a href="erl_eval.html#expr_list-3">expr_list/3</a></li> <li title="expr_list-4"><a href="erl_eval.html#expr_list-4">expr_list/4</a></li> <li title="new_bindings-0"><a href="erl_eval.html#new_bindings-0">new_bindings/0</a></li> <li title="bindings-1"><a href="erl_eval.html#bindings-1">bindings/1</a></li> <li title="binding-2"><a href="erl_eval.html#binding-2">binding/2</a></li> <li title="add_binding-3"><a href="erl_eval.html#add_binding-3">add_binding/3</a></li> <li title="del_binding-2"><a href="erl_eval.html#del_binding-2">del_binding/2</a></li> </ul> </li> <li id="no" title="erl_expand_records " expanded="false">erl_expand_records<ul> <li><a href="erl_expand_records.html"> Top of manual page </a></li> <li title="module-2"><a href="erl_expand_records.html#module-2">module/2</a></li> </ul> </li> <li id="no" title="erl_id_trans " expanded="false">erl_id_trans<ul> <li><a href="erl_id_trans.html"> Top of manual page </a></li> <li title="parse_transform-2"><a href="erl_id_trans.html#parse_transform-2">parse_transform/2</a></li> </ul> </li> <li id="no" title="erl_internal " expanded="false">erl_internal<ul> <li><a href="erl_internal.html"> Top of manual page </a></li> <li title="bif-2"><a href="erl_internal.html#bif-2">bif/2</a></li> <li title="guard_bif-2"><a href="erl_internal.html#guard_bif-2">guard_bif/2</a></li> <li title="type_test-2"><a href="erl_internal.html#type_test-2">type_test/2</a></li> <li title="arith_op-2"><a href="erl_internal.html#arith_op-2">arith_op/2</a></li> <li title="bool_op-2"><a href="erl_internal.html#bool_op-2">bool_op/2</a></li> <li title="comp_op-2"><a href="erl_internal.html#comp_op-2">comp_op/2</a></li> <li title="list_op-2"><a href="erl_internal.html#list_op-2">list_op/2</a></li> <li title="send_op-2"><a href="erl_internal.html#send_op-2">send_op/2</a></li> <li title="op_type-2"><a href="erl_internal.html#op_type-2">op_type/2</a></li> </ul> </li> <li id="no" title="erl_lint " expanded="false">erl_lint<ul> <li><a href="erl_lint.html"> Top of manual page </a></li> <li title="module-1"><a href="erl_lint.html#module-1">module/1</a></li> <li title="module-2"><a href="erl_lint.html#module-2">module/2</a></li> <li title="module-3"><a href="erl_lint.html#module-3">module/3</a></li> <li title="is_guard_test-1"><a href="erl_lint.html#is_guard_test-1">is_guard_test/1</a></li> <li title="format_error-1"><a href="erl_lint.html#format_error-1">format_error/1</a></li> </ul> </li> <li id="no" title="erl_parse " expanded="false">erl_parse<ul> <li><a href="erl_parse.html"> Top of manual page </a></li> <li title="parse_form-1"><a href="erl_parse.html#parse_form-1">parse_form/1</a></li> <li title="parse_exprs-1"><a href="erl_parse.html#parse_exprs-1">parse_exprs/1</a></li> <li title="parse_term-1"><a href="erl_parse.html#parse_term-1">parse_term/1</a></li> <li title="format_error-1"><a href="erl_parse.html#format_error-1">format_error/1</a></li> <li title="tokens-1"><a href="erl_parse.html#tokens-1">tokens/1</a></li> <li title="tokens-2"><a href="erl_parse.html#tokens-2">tokens/2</a></li> <li title="normalise-1"><a href="erl_parse.html#normalise-1">normalise/1</a></li> <li title="abstract-1"><a href="erl_parse.html#abstract-1">abstract/1</a></li> </ul> </li> <li id="no" title="erl_pp " expanded="false">erl_pp<ul> <li><a href="erl_pp.html"> Top of manual page </a></li> <li title="form-1"><a href="erl_pp.html#form-1">form/1</a></li> <li title="form-2"><a href="erl_pp.html#form-2">form/2</a></li> <li title="attribute-1"><a href="erl_pp.html#attribute-1">attribute/1</a></li> <li title="attribute-2"><a href="erl_pp.html#attribute-2">attribute/2</a></li> <li title="function-1"><a href="erl_pp.html#function-1">function/1</a></li> <li title="function-2"><a href="erl_pp.html#function-2">function/2</a></li> <li title="guard-1"><a href="erl_pp.html#guard-1">guard/1</a></li> <li title="guard-2"><a href="erl_pp.html#guard-2">guard/2</a></li> <li title="exprs-1"><a href="erl_pp.html#exprs-1">exprs/1</a></li> <li title="exprs-2"><a href="erl_pp.html#exprs-2">exprs/2</a></li> <li title="exprs-3"><a href="erl_pp.html#exprs-3">exprs/3</a></li> <li title="expr-1"><a href="erl_pp.html#expr-1">expr/1</a></li> <li title="expr-2"><a href="erl_pp.html#expr-2">expr/2</a></li> <li title="expr-3"><a href="erl_pp.html#expr-3">expr/3</a></li> <li title="expr-4"><a href="erl_pp.html#expr-4">expr/4</a></li> </ul> </li> <li id="no" title="erl_scan " expanded="false">erl_scan<ul> <li><a href="erl_scan.html"> Top of manual page </a></li> <li title="string-1"><a href="erl_scan.html#string-1">string/1</a></li> <li title="string-2"><a href="erl_scan.html#string-2">string/2</a></li> <li title="string-3"><a href="erl_scan.html#string-3">string/3</a></li> <li title="tokens-3"><a href="erl_scan.html#tokens-3">tokens/3</a></li> <li title="tokens-4"><a href="erl_scan.html#tokens-4">tokens/4</a></li> <li title="reserved_word-1"><a href="erl_scan.html#reserved_word-1">reserved_word/1</a></li> <li title="token_info-1"><a href="erl_scan.html#token_info-1">token_info/1</a></li> <li title="token_info-2"><a href="erl_scan.html#token_info-2">token_info/2</a></li> <li title="attributes_info-1"><a href="erl_scan.html#attributes_info-1">attributes_info/1</a></li> <li title="attributes_info-2"><a href="erl_scan.html#attributes_info-2">attributes_info/2</a></li> <li title="set_attribute-3"><a href="erl_scan.html#set_attribute-3">set_attribute/3</a></li> <li title="format_error-1"><a href="erl_scan.html#format_error-1">format_error/1</a></li> </ul> </li> <li id="no" title="erl_tar " expanded="false">erl_tar<ul> <li><a href="erl_tar.html"> Top of manual page </a></li> <li title="add-3"><a href="erl_tar.html#add-3">add/3</a></li> <li title="add-4"><a href="erl_tar.html#add-4">add/4</a></li> <li title="close-1"><a href="erl_tar.html#close-1">close/1</a></li> <li title="create-2"><a href="erl_tar.html#create-2">create/2</a></li> <li title="create-3"><a href="erl_tar.html#create-3">create/3</a></li> <li title="extract-1"><a href="erl_tar.html#extract-1">extract/1</a></li> <li title="extract-2"><a href="erl_tar.html#extract-2">extract/2</a></li> <li title="format_error-1"><a href="erl_tar.html#format_error-1">format_error/1</a></li> <li title="open-2"><a href="erl_tar.html#open-2">open/2</a></li> <li title="table-1"><a href="erl_tar.html#table-1">table/1</a></li> <li title="table-2"><a href="erl_tar.html#table-2">table/2</a></li> <li title="t-1"><a href="erl_tar.html#t-1">t/1</a></li> <li title="tt-1"><a href="erl_tar.html#tt-1">tt/1</a></li> </ul> </li> <li id="no" title="ets " expanded="false">ets<ul> <li><a href="ets.html"> Top of manual page </a></li> <li title="all-0"><a href="ets.html#all-0">all/0</a></li> <li title="delete-1"><a href="ets.html#delete-1">delete/1</a></li> <li title="delete-2"><a href="ets.html#delete-2">delete/2</a></li> <li title="delete_all_objects-1"><a href="ets.html#delete_all_objects-1">delete_all_objects/1</a></li> <li title="delete_object-2"><a href="ets.html#delete_object-2">delete_object/2</a></li> <li title="file2tab-1"><a href="ets.html#file2tab-1">file2tab/1</a></li> <li title="file2tab-2"><a href="ets.html#file2tab-2">file2tab/2</a></li> <li title="first-1"><a href="ets.html#first-1">first/1</a></li> <li title="foldl-3"><a href="ets.html#foldl-3">foldl/3</a></li> <li title="foldr-3"><a href="ets.html#foldr-3">foldr/3</a></li> <li title="from_dets-2"><a href="ets.html#from_dets-2">from_dets/2</a></li> <li title="fun2ms-1"><a href="ets.html#fun2ms-1">fun2ms/1</a></li> <li title="give_away-3"><a href="ets.html#give_away-3">give_away/3</a></li> <li title="i-0"><a href="ets.html#i-0">i/0</a></li> <li title="i-1"><a href="ets.html#i-1">i/1</a></li> <li title="info-1"><a href="ets.html#info-1">info/1</a></li> <li title="info-2"><a href="ets.html#info-2">info/2</a></li> <li title="init_table-2"><a href="ets.html#init_table-2">init_table/2</a></li> <li title="insert-2"><a href="ets.html#insert-2">insert/2</a></li> <li title="insert_new-2"><a href="ets.html#insert_new-2">insert_new/2</a></li> <li title="is_compiled_ms-1"><a href="ets.html#is_compiled_ms-1">is_compiled_ms/1</a></li> <li title="last-1"><a href="ets.html#last-1">last/1</a></li> <li title="lookup-2"><a href="ets.html#lookup-2">lookup/2</a></li> <li title="lookup_element-3"><a href="ets.html#lookup_element-3">lookup_element/3</a></li> <li title="match-2"><a href="ets.html#match-2">match/2</a></li> <li title="match-3"><a href="ets.html#match-3">match/3</a></li> <li title="match-1"><a href="ets.html#match-1">match/1</a></li> <li title="match_delete-2"><a href="ets.html#match_delete-2">match_delete/2</a></li> <li title="match_object-2"><a href="ets.html#match_object-2">match_object/2</a></li> <li title="match_object-3"><a href="ets.html#match_object-3">match_object/3</a></li> <li title="match_object-1"><a href="ets.html#match_object-1">match_object/1</a></li> <li title="match_spec_compile-1"><a href="ets.html#match_spec_compile-1">match_spec_compile/1</a></li> <li title="match_spec_run-2"><a href="ets.html#match_spec_run-2">match_spec_run/2</a></li> <li title="member-2"><a href="ets.html#member-2">member/2</a></li> <li title="new-2"><a href="ets.html#new-2">new/2</a></li> <li title="next-2"><a href="ets.html#next-2">next/2</a></li> <li title="prev-2"><a href="ets.html#prev-2">prev/2</a></li> <li title="rename-2"><a href="ets.html#rename-2">rename/2</a></li> <li title="repair_continuation-2"><a href="ets.html#repair_continuation-2">repair_continuation/2</a></li> <li title="safe_fixtable-2"><a href="ets.html#safe_fixtable-2">safe_fixtable/2</a></li> <li title="select-2"><a href="ets.html#select-2">select/2</a></li> <li title="select-3"><a href="ets.html#select-3">select/3</a></li> <li title="select-1"><a href="ets.html#select-1">select/1</a></li> <li title="select_delete-2"><a href="ets.html#select_delete-2">select_delete/2</a></li> <li title="select_count-2"><a href="ets.html#select_count-2">select_count/2</a></li> <li title="setopts-2"><a href="ets.html#setopts-2">setopts/2</a></li> <li title="slot-2"><a href="ets.html#slot-2">slot/2</a></li> <li title="tab2file-2"><a href="ets.html#tab2file-2">tab2file/2</a></li> <li title="tab2file-3"><a href="ets.html#tab2file-3">tab2file/3</a></li> <li title="tab2list-1"><a href="ets.html#tab2list-1">tab2list/1</a></li> <li title="tabfile_info-1"><a href="ets.html#tabfile_info-1">tabfile_info/1</a></li> <li title="table-1"><a href="ets.html#table-1">table/1</a></li> <li title="test_ms-2"><a href="ets.html#test_ms-2">test_ms/2</a></li> <li title="to_dets-2"><a href="ets.html#to_dets-2">to_dets/2</a></li> <li title="update_counter-3"><a href="ets.html#update_counter-3">update_counter/3</a></li> <li title="update_counter-3"><a href="ets.html#update_counter-3">update_counter/3</a></li> <li title="update_counter-3"><a href="ets.html#update_counter-3">update_counter/3</a></li> <li title="update_element-3"><a href="ets.html#update_element-3">update_element/3</a></li> <li title="update_element-3"><a href="ets.html#update_element-3">update_element/3</a></li> </ul> </li> <li id="no" title="file_sorter " expanded="false">file_sorter<ul> <li><a href="file_sorter.html"> Top of manual page </a></li> <li title="sort-1"><a href="file_sorter.html#sort-1">sort/1</a></li> <li title="sort-2"><a href="file_sorter.html#sort-2">sort/2</a></li> <li title="sort-3"><a href="file_sorter.html#sort-3">sort/3</a></li> <li title="keysort-2"><a href="file_sorter.html#keysort-2">keysort/2</a></li> <li title="keysort-3"><a href="file_sorter.html#keysort-3">keysort/3</a></li> <li title="keysort-4"><a href="file_sorter.html#keysort-4">keysort/4</a></li> <li title="merge-2"><a href="file_sorter.html#merge-2">merge/2</a></li> <li title="merge-3"><a href="file_sorter.html#merge-3">merge/3</a></li> <li title="keymerge-3"><a href="file_sorter.html#keymerge-3">keymerge/3</a></li> <li title="keymerge-4"><a href="file_sorter.html#keymerge-4">keymerge/4</a></li> <li title="check-1"><a href="file_sorter.html#check-1">check/1</a></li> <li title="check-2"><a href="file_sorter.html#check-2">check/2</a></li> <li title="keycheck-2"><a href="file_sorter.html#keycheck-2">keycheck/2</a></li> <li title="keycheck-3"><a href="file_sorter.html#keycheck-3">keycheck/3</a></li> </ul> </li> <li id="no" title="filelib " expanded="false">filelib<ul> <li><a href="filelib.html"> Top of manual page </a></li> <li title="ensure_dir-1"><a href="filelib.html#ensure_dir-1">ensure_dir/1</a></li> <li title="file_size-1"><a href="filelib.html#file_size-1">file_size/1</a></li> <li title="fold_files-5"><a href="filelib.html#fold_files-5">fold_files/5</a></li> <li title="is_dir-1"><a href="filelib.html#is_dir-1">is_dir/1</a></li> <li title="is_file-1"><a href="filelib.html#is_file-1">is_file/1</a></li> <li title="is_regular-1"><a href="filelib.html#is_regular-1">is_regular/1</a></li> <li title="last_modified-1"><a href="filelib.html#last_modified-1">last_modified/1</a></li> <li title="wildcard-1"><a href="filelib.html#wildcard-1">wildcard/1</a></li> <li title="wildcard-2"><a href="filelib.html#wildcard-2">wildcard/2</a></li> </ul> </li> <li id="no" title="filename " expanded="false">filename<ul> <li><a href="filename.html"> Top of manual page </a></li> <li title="absname-1"><a href="filename.html#absname-1">absname/1</a></li> <li title="absname-2"><a href="filename.html#absname-2">absname/2</a></li> <li title="absname_join-2"><a href="filename.html#absname_join-2">absname_join/2</a></li> <li title="basename-1"><a href="filename.html#basename-1">basename/1</a></li> <li title="basename-2"><a href="filename.html#basename-2">basename/2</a></li> <li title="dirname-1"><a href="filename.html#dirname-1">dirname/1</a></li> <li title="extension-1"><a href="filename.html#extension-1">extension/1</a></li> <li title="flatten-1"><a href="filename.html#flatten-1">flatten/1</a></li> <li title="join-1"><a href="filename.html#join-1">join/1</a></li> <li title="join-2"><a href="filename.html#join-2">join/2</a></li> <li title="nativename-1"><a href="filename.html#nativename-1">nativename/1</a></li> <li title="pathtype-1"><a href="filename.html#pathtype-1">pathtype/1</a></li> <li title="rootname-1"><a href="filename.html#rootname-1">rootname/1</a></li> <li title="rootname-2"><a href="filename.html#rootname-2">rootname/2</a></li> <li title="split-1"><a href="filename.html#split-1">split/1</a></li> <li title="find_src-1"><a href="filename.html#find_src-1">find_src/1</a></li> <li title="find_src-2"><a href="filename.html#find_src-2">find_src/2</a></li> </ul> </li> <li id="no" title="gb_sets " expanded="false">gb_sets<ul> <li><a href="gb_sets.html"> Top of manual page </a></li> <li title="add-2"><a href="gb_sets.html#add-2">add/2</a></li> <li title="add_element-2"><a href="gb_sets.html#add_element-2">add_element/2</a></li> <li title="balance-1"><a href="gb_sets.html#balance-1">balance/1</a></li> <li title="delete-2"><a href="gb_sets.html#delete-2">delete/2</a></li> <li title="delete_any-2"><a href="gb_sets.html#delete_any-2">delete_any/2</a></li> <li title="del_element-2"><a href="gb_sets.html#del_element-2">del_element/2</a></li> <li title="difference-2"><a href="gb_sets.html#difference-2">difference/2</a></li> <li title="subtract-2"><a href="gb_sets.html#subtract-2">subtract/2</a></li> <li title="empty-0"><a href="gb_sets.html#empty-0">empty/0</a></li> <li title="new-0"><a href="gb_sets.html#new-0">new/0</a></li> <li title="filter-2"><a href="gb_sets.html#filter-2">filter/2</a></li> <li title="fold-3"><a href="gb_sets.html#fold-3">fold/3</a></li> <li title="from_list-1"><a href="gb_sets.html#from_list-1">from_list/1</a></li> <li title="from_ordset-1"><a href="gb_sets.html#from_ordset-1">from_ordset/1</a></li> <li title="insert-2"><a href="gb_sets.html#insert-2">insert/2</a></li> <li title="intersection-2"><a href="gb_sets.html#intersection-2">intersection/2</a></li> <li title="intersection-1"><a href="gb_sets.html#intersection-1">intersection/1</a></li> <li title="is_disjoint-2"><a href="gb_sets.html#is_disjoint-2">is_disjoint/2</a></li> <li title="is_empty-1"><a href="gb_sets.html#is_empty-1">is_empty/1</a></li> <li title="is_member-2"><a href="gb_sets.html#is_member-2">is_member/2</a></li> <li title="is_element-2"><a href="gb_sets.html#is_element-2">is_element/2</a></li> <li title="is_set-1"><a href="gb_sets.html#is_set-1">is_set/1</a></li> <li title="is_subset-2"><a href="gb_sets.html#is_subset-2">is_subset/2</a></li> <li title="iterator-1"><a href="gb_sets.html#iterator-1">iterator/1</a></li> <li title="largest-1"><a href="gb_sets.html#largest-1">largest/1</a></li> <li title="next-1"><a href="gb_sets.html#next-1">next/1</a></li> <li title="singleton-1"><a href="gb_sets.html#singleton-1">singleton/1</a></li> <li title="size-1"><a href="gb_sets.html#size-1">size/1</a></li> <li title="smallest-1"><a href="gb_sets.html#smallest-1">smallest/1</a></li> <li title="take_largest-1"><a href="gb_sets.html#take_largest-1">take_largest/1</a></li> <li title="take_smallest-1"><a href="gb_sets.html#take_smallest-1">take_smallest/1</a></li> <li title="to_list-1"><a href="gb_sets.html#to_list-1">to_list/1</a></li> <li title="union-2"><a href="gb_sets.html#union-2">union/2</a></li> <li title="union-1"><a href="gb_sets.html#union-1">union/1</a></li> </ul> </li> <li id="no" title="gb_trees " expanded="false">gb_trees<ul> <li><a href="gb_trees.html"> Top of manual page </a></li> <li title="balance-1"><a href="gb_trees.html#balance-1">balance/1</a></li> <li title="delete-2"><a href="gb_trees.html#delete-2">delete/2</a></li> <li title="delete_any-2"><a href="gb_trees.html#delete_any-2">delete_any/2</a></li> <li title="empty-0"><a href="gb_trees.html#empty-0">empty/0</a></li> <li title="enter-3"><a href="gb_trees.html#enter-3">enter/3</a></li> <li title="from_orddict-1"><a href="gb_trees.html#from_orddict-1">from_orddict/1</a></li> <li title="get-2"><a href="gb_trees.html#get-2">get/2</a></li> <li title="lookup-2"><a href="gb_trees.html#lookup-2">lookup/2</a></li> <li title="insert-3"><a href="gb_trees.html#insert-3">insert/3</a></li> <li title="is_defined-2"><a href="gb_trees.html#is_defined-2">is_defined/2</a></li> <li title="is_empty-1"><a href="gb_trees.html#is_empty-1">is_empty/1</a></li> <li title="iterator-1"><a href="gb_trees.html#iterator-1">iterator/1</a></li> <li title="keys-1"><a href="gb_trees.html#keys-1">keys/1</a></li> <li title="largest-1"><a href="gb_trees.html#largest-1">largest/1</a></li> <li title="map-2"><a href="gb_trees.html#map-2">map/2</a></li> <li title="next-1"><a href="gb_trees.html#next-1">next/1</a></li> <li title="size-1"><a href="gb_trees.html#size-1">size/1</a></li> <li title="smallest-1"><a href="gb_trees.html#smallest-1">smallest/1</a></li> <li title="take_largest-1"><a href="gb_trees.html#take_largest-1">take_largest/1</a></li> <li title="take_smallest-1"><a href="gb_trees.html#take_smallest-1">take_smallest/1</a></li> <li title="to_list-1"><a href="gb_trees.html#to_list-1">to_list/1</a></li> <li title="update-3"><a href="gb_trees.html#update-3">update/3</a></li> <li title="values-1"><a href="gb_trees.html#values-1">values/1</a></li> </ul> </li> <li id="no" title="gen_event " expanded="false">gen_event<ul> <li><a href="gen_event.html"> Top of manual page </a></li> <li title="start_link-0"><a href="gen_event.html#start_link-0">start_link/0</a></li> <li title="start_link-1"><a href="gen_event.html#start_link-1">start_link/1</a></li> <li title="start-0"><a href="gen_event.html#start-0">start/0</a></li> <li title="start-1"><a href="gen_event.html#start-1">start/1</a></li> <li title="add_handler-3"><a href="gen_event.html#add_handler-3">add_handler/3</a></li> <li title="add_sup_handler-3"><a href="gen_event.html#add_sup_handler-3">add_sup_handler/3</a></li> <li title="notify-2"><a href="gen_event.html#notify-2">notify/2</a></li> <li title="sync_notify-2"><a href="gen_event.html#sync_notify-2">sync_notify/2</a></li> <li title="call-3"><a href="gen_event.html#call-3">call/3</a></li> <li title="call-4"><a href="gen_event.html#call-4">call/4</a></li> <li title="delete_handler-3"><a href="gen_event.html#delete_handler-3">delete_handler/3</a></li> <li title="swap_handler-3"><a href="gen_event.html#swap_handler-3">swap_handler/3</a></li> <li title="swap_sup_handler-3"><a href="gen_event.html#swap_sup_handler-3">swap_sup_handler/3</a></li> <li title="which_handlers-1"><a href="gen_event.html#which_handlers-1">which_handlers/1</a></li> <li title="stop-1"><a href="gen_event.html#stop-1">stop/1</a></li> <li title="Module:init-1"><a href="gen_event.html#Module:init-1">Module:init/1</a></li> <li title="Module:handle_event-2"><a href="gen_event.html#Module:handle_event-2">Module:handle_event/2</a></li> <li title="Module:handle_call-2"><a href="gen_event.html#Module:handle_call-2">Module:handle_call/2</a></li> <li title="Module:handle_info-2"><a href="gen_event.html#Module:handle_info-2">Module:handle_info/2</a></li> <li title="Module:terminate-2"><a href="gen_event.html#Module:terminate-2">Module:terminate/2</a></li> <li title="Module:code_change-3"><a href="gen_event.html#Module:code_change-3">Module:code_change/3</a></li> </ul> </li> <li id="no" title="gen_fsm " expanded="false">gen_fsm<ul> <li><a href="gen_fsm.html"> Top of manual page </a></li> <li title="start_link-3"><a href="gen_fsm.html#start_link-3">start_link/3</a></li> <li title="start_link-4"><a href="gen_fsm.html#start_link-4">start_link/4</a></li> <li title="start-3"><a href="gen_fsm.html#start-3">start/3</a></li> <li title="start-4"><a href="gen_fsm.html#start-4">start/4</a></li> <li title="send_event-2"><a href="gen_fsm.html#send_event-2">send_event/2</a></li> <li title="send_all_state_event-2"><a href="gen_fsm.html#send_all_state_event-2">send_all_state_event/2</a></li> <li title="sync_send_event-2"><a href="gen_fsm.html#sync_send_event-2">sync_send_event/2</a></li> <li title="sync_send_event-3"><a href="gen_fsm.html#sync_send_event-3">sync_send_event/3</a></li> <li title="sync_send_all_state_event-2"><a href="gen_fsm.html#sync_send_all_state_event-2">sync_send_all_state_event/2</a></li> <li title="sync_send_all_state_event-3"><a href="gen_fsm.html#sync_send_all_state_event-3">sync_send_all_state_event/3</a></li> <li title="reply-2"><a href="gen_fsm.html#reply-2">reply/2</a></li> <li title="send_event_after-2"><a href="gen_fsm.html#send_event_after-2">send_event_after/2</a></li> <li title="start_timer-2"><a href="gen_fsm.html#start_timer-2">start_timer/2</a></li> <li title="cancel_timer-1"><a href="gen_fsm.html#cancel_timer-1">cancel_timer/1</a></li> <li title="enter_loop-4"><a href="gen_fsm.html#enter_loop-4">enter_loop/4</a></li> <li title="enter_loop-5"><a href="gen_fsm.html#enter_loop-5">enter_loop/5</a></li> <li title="enter_loop-5"><a href="gen_fsm.html#enter_loop-5">enter_loop/5</a></li> <li title="enter_loop-6"><a href="gen_fsm.html#enter_loop-6">enter_loop/6</a></li> <li title="Module:init-1"><a href="gen_fsm.html#Module:init-1">Module:init/1</a></li> <li title="Module:StateName-2"><a href="gen_fsm.html#Module:StateName-2">Module:StateName/2</a></li> <li title="Module:handle_event-3"><a href="gen_fsm.html#Module:handle_event-3">Module:handle_event/3</a></li> <li title="Module:StateName-3"><a href="gen_fsm.html#Module:StateName-3">Module:StateName/3</a></li> <li title="Module:handle_sync_event-4"><a href="gen_fsm.html#Module:handle_sync_event-4">Module:handle_sync_event/4</a></li> <li title="Module:handle_info-3"><a href="gen_fsm.html#Module:handle_info-3">Module:handle_info/3</a></li> <li title="Module:terminate-3"><a href="gen_fsm.html#Module:terminate-3">Module:terminate/3</a></li> <li title="Module:code_change-4"><a href="gen_fsm.html#Module:code_change-4">Module:code_change/4</a></li> <li title="Module:format_status-2"><a href="gen_fsm.html#Module:format_status-2">Module:format_status/2</a></li> </ul> </li> <li id="no" title="gen_server " expanded="false">gen_server<ul> <li><a href="gen_server.html"> Top of manual page </a></li> <li title="start_link-3"><a href="gen_server.html#start_link-3">start_link/3</a></li> <li title="start_link-4"><a href="gen_server.html#start_link-4">start_link/4</a></li> <li title="start-3"><a href="gen_server.html#start-3">start/3</a></li> <li title="start-4"><a href="gen_server.html#start-4">start/4</a></li> <li title="call-2"><a href="gen_server.html#call-2">call/2</a></li> <li title="call-3"><a href="gen_server.html#call-3">call/3</a></li> <li title="multi_call-2"><a href="gen_server.html#multi_call-2">multi_call/2</a></li> <li title="multi_call-3"><a href="gen_server.html#multi_call-3">multi_call/3</a></li> <li title="multi_call-4"><a href="gen_server.html#multi_call-4">multi_call/4</a></li> <li title="cast-2"><a href="gen_server.html#cast-2">cast/2</a></li> <li title="abcast-2"><a href="gen_server.html#abcast-2">abcast/2</a></li> <li title="abcast-3"><a href="gen_server.html#abcast-3">abcast/3</a></li> <li title="reply-2"><a href="gen_server.html#reply-2">reply/2</a></li> <li title="enter_loop-3"><a href="gen_server.html#enter_loop-3">enter_loop/3</a></li> <li title="enter_loop-4"><a href="gen_server.html#enter_loop-4">enter_loop/4</a></li> <li title="enter_loop-4"><a href="gen_server.html#enter_loop-4">enter_loop/4</a></li> <li title="enter_loop-5"><a href="gen_server.html#enter_loop-5">enter_loop/5</a></li> <li title="Module:init-1"><a href="gen_server.html#Module:init-1">Module:init/1</a></li> <li title="Module:handle_call-3"><a href="gen_server.html#Module:handle_call-3">Module:handle_call/3</a></li> <li title="Module:handle_cast-2"><a href="gen_server.html#Module:handle_cast-2">Module:handle_cast/2</a></li> <li title="Module:handle_info-2"><a href="gen_server.html#Module:handle_info-2">Module:handle_info/2</a></li> <li title="Module:terminate-2"><a href="gen_server.html#Module:terminate-2">Module:terminate/2</a></li> <li title="Module:code_change-3"><a href="gen_server.html#Module:code_change-3">Module:code_change/3</a></li> <li title="Module:format_status-2"><a href="gen_server.html#Module:format_status-2">Module:format_status/2</a></li> </ul> </li> <li id="no" title="io " expanded="false">io<ul> <li><a href="io.html"> Top of manual page </a></li> <li title="columns-1"><a href="io.html#columns-1">columns/1</a></li> <li title="put_chars-1"><a href="io.html#put_chars-1">put_chars/1</a></li> <li title="nl-1"><a href="io.html#nl-1">nl/1</a></li> <li title="get_chars-2"><a href="io.html#get_chars-2">get_chars/2</a></li> <li title="get_line-1"><a href="io.html#get_line-1">get_line/1</a></li> <li title="getopts-1"><a href="io.html#getopts-1">getopts/1</a></li> <li title="setopts-1"><a href="io.html#setopts-1">setopts/1</a></li> <li title="write-1"><a href="io.html#write-1">write/1</a></li> <li title="read-1"><a href="io.html#read-1">read/1</a></li> <li title="read-3"><a href="io.html#read-3">read/3</a></li> <li title="fwrite-1"><a href="io.html#fwrite-1">fwrite/1</a></li> <li title="fwrite-2"><a href="io.html#fwrite-2">fwrite/2</a></li> <li title="format-1"><a href="io.html#format-1">format/1</a></li> <li title="format-2"><a href="io.html#format-2">format/2</a></li> <li title="fread-2"><a href="io.html#fread-2">fread/2</a></li> <li title="rows-1"><a href="io.html#rows-1">rows/1</a></li> <li title="scan_erl_exprs-1"><a href="io.html#scan_erl_exprs-1">scan_erl_exprs/1</a></li> <li title="scan_erl_exprs-2"><a href="io.html#scan_erl_exprs-2">scan_erl_exprs/2</a></li> <li title="scan_erl_form-1"><a href="io.html#scan_erl_form-1">scan_erl_form/1</a></li> <li title="scan_erl_form-2"><a href="io.html#scan_erl_form-2">scan_erl_form/2</a></li> <li title="parse_erl_exprs-1"><a href="io.html#parse_erl_exprs-1">parse_erl_exprs/1</a></li> <li title="parse_erl_exprs-2"><a href="io.html#parse_erl_exprs-2">parse_erl_exprs/2</a></li> <li title="parse_erl_form-1"><a href="io.html#parse_erl_form-1">parse_erl_form/1</a></li> <li title="parse_erl_form-2"><a href="io.html#parse_erl_form-2">parse_erl_form/2</a></li> </ul> </li> <li id="no" title="io_lib " expanded="false">io_lib<ul> <li><a href="io_lib.html"> Top of manual page </a></li> <li title="nl-0"><a href="io_lib.html#nl-0">nl/0</a></li> <li title="write-1"><a href="io_lib.html#write-1">write/1</a></li> <li title="write-2"><a href="io_lib.html#write-2">write/2</a></li> <li title="print-1"><a href="io_lib.html#print-1">print/1</a></li> <li title="print-4"><a href="io_lib.html#print-4">print/4</a></li> <li title="fwrite-2"><a href="io_lib.html#fwrite-2">fwrite/2</a></li> <li title="format-2"><a href="io_lib.html#format-2">format/2</a></li> <li title="fread-2"><a href="io_lib.html#fread-2">fread/2</a></li> <li title="fread-3"><a href="io_lib.html#fread-3">fread/3</a></li> <li title="write_atom-1"><a href="io_lib.html#write_atom-1">write_atom/1</a></li> <li title="write_string-1"><a href="io_lib.html#write_string-1">write_string/1</a></li> <li title="write_char-1"><a href="io_lib.html#write_char-1">write_char/1</a></li> <li title="indentation-2"><a href="io_lib.html#indentation-2">indentation/2</a></li> <li title="char_list-1"><a href="io_lib.html#char_list-1">char_list/1</a></li> <li title="deep_char_list-1"><a href="io_lib.html#deep_char_list-1">deep_char_list/1</a></li> <li title="printable_list-1"><a href="io_lib.html#printable_list-1">printable_list/1</a></li> </ul> </li> <li id="no" title="lib " expanded="false">lib<ul> <li><a href="lib.html"> Top of manual page </a></li> <li title="flush_receive-0"><a href="lib.html#flush_receive-0">flush_receive/0</a></li> <li title="error_message-2"><a href="lib.html#error_message-2">error_message/2</a></li> <li title="progname-0"><a href="lib.html#progname-0">progname/0</a></li> <li title="nonl-1"><a href="lib.html#nonl-1">nonl/1</a></li> <li title="send-2"><a href="lib.html#send-2">send/2</a></li> <li title="sendw-2"><a href="lib.html#sendw-2">sendw/2</a></li> </ul> </li> <li id="no" title="lists " expanded="false">lists<ul> <li><a href="lists.html"> Top of manual page </a></li> <li title="all-2"><a href="lists.html#all-2">all/2</a></li> <li title="any-2"><a href="lists.html#any-2">any/2</a></li> <li title="append-1"><a href="lists.html#append-1">append/1</a></li> <li title="append-2"><a href="lists.html#append-2">append/2</a></li> <li title="concat-1"><a href="lists.html#concat-1">concat/1</a></li> <li title="delete-2"><a href="lists.html#delete-2">delete/2</a></li> <li title="dropwhile-2"><a href="lists.html#dropwhile-2">dropwhile/2</a></li> <li title="duplicate-2"><a href="lists.html#duplicate-2">duplicate/2</a></li> <li title="filter-2"><a href="lists.html#filter-2">filter/2</a></li> <li title="flatlength-1"><a href="lists.html#flatlength-1">flatlength/1</a></li> <li title="flatmap-2"><a href="lists.html#flatmap-2">flatmap/2</a></li> <li title="flatten-1"><a href="lists.html#flatten-1">flatten/1</a></li> <li title="flatten-2"><a href="lists.html#flatten-2">flatten/2</a></li> <li title="foldl-3"><a href="lists.html#foldl-3">foldl/3</a></li> <li title="foldr-3"><a href="lists.html#foldr-3">foldr/3</a></li> <li title="foreach-2"><a href="lists.html#foreach-2">foreach/2</a></li> <li title="keydelete-3"><a href="lists.html#keydelete-3">keydelete/3</a></li> <li title="keyfind-3"><a href="lists.html#keyfind-3">keyfind/3</a></li> <li title="keymap-3"><a href="lists.html#keymap-3">keymap/3</a></li> <li title="keymember-3"><a href="lists.html#keymember-3">keymember/3</a></li> <li title="keymerge-3"><a href="lists.html#keymerge-3">keymerge/3</a></li> <li title="keyreplace-4"><a href="lists.html#keyreplace-4">keyreplace/4</a></li> <li title="keysearch-3"><a href="lists.html#keysearch-3">keysearch/3</a></li> <li title="keysort-2"><a href="lists.html#keysort-2">keysort/2</a></li> <li title="keystore-4"><a href="lists.html#keystore-4">keystore/4</a></li> <li title="keytake-3"><a href="lists.html#keytake-3">keytake/3</a></li> <li title="last-1"><a href="lists.html#last-1">last/1</a></li> <li title="map-2"><a href="lists.html#map-2">map/2</a></li> <li title="mapfoldl-3"><a href="lists.html#mapfoldl-3">mapfoldl/3</a></li> <li title="mapfoldr-3"><a href="lists.html#mapfoldr-3">mapfoldr/3</a></li> <li title="max-1"><a href="lists.html#max-1">max/1</a></li> <li title="member-2"><a href="lists.html#member-2">member/2</a></li> <li title="merge-1"><a href="lists.html#merge-1">merge/1</a></li> <li title="merge-2"><a href="lists.html#merge-2">merge/2</a></li> <li title="merge-3"><a href="lists.html#merge-3">merge/3</a></li> <li title="merge3-3"><a href="lists.html#merge3-3">merge3/3</a></li> <li title="min-1"><a href="lists.html#min-1">min/1</a></li> <li title="nth-2"><a href="lists.html#nth-2">nth/2</a></li> <li title="nthtail-2"><a href="lists.html#nthtail-2">nthtail/2</a></li> <li title="partition-2"><a href="lists.html#partition-2">partition/2</a></li> <li title="prefix-2"><a href="lists.html#prefix-2">prefix/2</a></li> <li title="reverse-1"><a href="lists.html#reverse-1">reverse/1</a></li> <li title="reverse-2"><a href="lists.html#reverse-2">reverse/2</a></li> <li title="seq-2"><a href="lists.html#seq-2">seq/2</a></li> <li title="seq-3"><a href="lists.html#seq-3">seq/3</a></li> <li title="sort-1"><a href="lists.html#sort-1">sort/1</a></li> <li title="sort-2"><a href="lists.html#sort-2">sort/2</a></li> <li title="split-2"><a href="lists.html#split-2">split/2</a></li> <li title="splitwith-2"><a href="lists.html#splitwith-2">splitwith/2</a></li> <li title="sublist-2"><a href="lists.html#sublist-2">sublist/2</a></li> <li title="sublist-3"><a href="lists.html#sublist-3">sublist/3</a></li> <li title="subtract-2"><a href="lists.html#subtract-2">subtract/2</a></li> <li title="suffix-2"><a href="lists.html#suffix-2">suffix/2</a></li> <li title="sum-1"><a href="lists.html#sum-1">sum/1</a></li> <li title="takewhile-2"><a href="lists.html#takewhile-2">takewhile/2</a></li> <li title="ukeymerge-3"><a href="lists.html#ukeymerge-3">ukeymerge/3</a></li> <li title="ukeysort-2"><a href="lists.html#ukeysort-2">ukeysort/2</a></li> <li title="umerge-1"><a href="lists.html#umerge-1">umerge/1</a></li> <li title="umerge-2"><a href="lists.html#umerge-2">umerge/2</a></li> <li title="umerge-3"><a href="lists.html#umerge-3">umerge/3</a></li> <li title="umerge3-3"><a href="lists.html#umerge3-3">umerge3/3</a></li> <li title="unzip-1"><a href="lists.html#unzip-1">unzip/1</a></li> <li title="unzip3-1"><a href="lists.html#unzip3-1">unzip3/1</a></li> <li title="usort-1"><a href="lists.html#usort-1">usort/1</a></li> <li title="usort-2"><a href="lists.html#usort-2">usort/2</a></li> <li title="zip-2"><a href="lists.html#zip-2">zip/2</a></li> <li title="zip3-3"><a href="lists.html#zip3-3">zip3/3</a></li> <li title="zipwith-3"><a href="lists.html#zipwith-3">zipwith/3</a></li> <li title="zipwith3-4"><a href="lists.html#zipwith3-4">zipwith3/4</a></li> </ul> </li> <li id="no" title="log_mf_h " expanded="false">log_mf_h<ul> <li><a href="log_mf_h.html"> Top of manual page </a></li> <li title="init-3"><a href="log_mf_h.html#init-3">init/3</a></li> <li title="init-4"><a href="log_mf_h.html#init-4">init/4</a></li> </ul> </li> <li id="no" title="math " expanded="false">math<ul> <li><a href="math.html"> Top of manual page </a></li> <li title="pi-0"><a href="math.html#pi-0">pi/0</a></li> <li title="sin-1"><a href="math.html#sin-1">sin/1</a></li> <li title="cos-1"><a href="math.html#cos-1">cos/1</a></li> <li title="tan-1"><a href="math.html#tan-1">tan/1</a></li> <li title="asin-1"><a href="math.html#asin-1">asin/1</a></li> <li title="acos-1"><a href="math.html#acos-1">acos/1</a></li> <li title="atan-1"><a href="math.html#atan-1">atan/1</a></li> <li title="atan2-2"><a href="math.html#atan2-2">atan2/2</a></li> <li title="sinh-1"><a href="math.html#sinh-1">sinh/1</a></li> <li title="cosh-1"><a href="math.html#cosh-1">cosh/1</a></li> <li title="tanh-1"><a href="math.html#tanh-1">tanh/1</a></li> <li title="asinh-1"><a href="math.html#asinh-1">asinh/1</a></li> <li title="acosh-1"><a href="math.html#acosh-1">acosh/1</a></li> <li title="atanh-1"><a href="math.html#atanh-1">atanh/1</a></li> <li title="exp-1"><a href="math.html#exp-1">exp/1</a></li> <li title="log-1"><a href="math.html#log-1">log/1</a></li> <li title="log10-1"><a href="math.html#log10-1">log10/1</a></li> <li title="pow-2"><a href="math.html#pow-2">pow/2</a></li> <li title="sqrt-1"><a href="math.html#sqrt-1">sqrt/1</a></li> <li title="erf-1"><a href="math.html#erf-1">erf/1</a></li> <li title="erfc-1"><a href="math.html#erfc-1">erfc/1</a></li> </ul> </li> <li id="no" title="ms_transform " expanded="false">ms_transform<ul> <li><a href="ms_transform.html"> Top of manual page </a></li> <li title="parse_transform-2"><a href="ms_transform.html#parse_transform-2">parse_transform/2</a></li> <li title="transform_from_shell-3"><a href="ms_transform.html#transform_from_shell-3">transform_from_shell/3</a></li> <li title="format_error-1"><a href="ms_transform.html#format_error-1">format_error/1</a></li> </ul> </li> <li id="no" title="orddict " expanded="false">orddict<ul> <li><a href="orddict.html"> Top of manual page </a></li> <li title="append-3"><a href="orddict.html#append-3">append/3</a></li> <li title="append_list-3"><a href="orddict.html#append_list-3">append_list/3</a></li> <li title="erase-2"><a href="orddict.html#erase-2">erase/2</a></li> <li title="fetch-2"><a href="orddict.html#fetch-2">fetch/2</a></li> <li title="fetch_keys-1"><a href="orddict.html#fetch_keys-1">fetch_keys/1</a></li> <li title="filter-2"><a href="orddict.html#filter-2">filter/2</a></li> <li title="find-2"><a href="orddict.html#find-2">find/2</a></li> <li title="fold-3"><a href="orddict.html#fold-3">fold/3</a></li> <li title="from_list-1"><a href="orddict.html#from_list-1">from_list/1</a></li> <li title="is_key-2"><a href="orddict.html#is_key-2">is_key/2</a></li> <li title="map-2"><a href="orddict.html#map-2">map/2</a></li> <li title="merge-3"><a href="orddict.html#merge-3">merge/3</a></li> <li title="new-0"><a href="orddict.html#new-0">new/0</a></li> <li title="size-1"><a href="orddict.html#size-1">size/1</a></li> <li title="store-3"><a href="orddict.html#store-3">store/3</a></li> <li title="to_list-1"><a href="orddict.html#to_list-1">to_list/1</a></li> <li title="update-3"><a href="orddict.html#update-3">update/3</a></li> <li title="update-4"><a href="orddict.html#update-4">update/4</a></li> <li title="update_counter-3"><a href="orddict.html#update_counter-3">update_counter/3</a></li> </ul> </li> <li id="no" title="ordsets " expanded="false">ordsets<ul> <li><a href="ordsets.html"> Top of manual page </a></li> <li title="new-0"><a href="ordsets.html#new-0">new/0</a></li> <li title="is_set-1"><a href="ordsets.html#is_set-1">is_set/1</a></li> <li title="size-1"><a href="ordsets.html#size-1">size/1</a></li> <li title="to_list-1"><a href="ordsets.html#to_list-1">to_list/1</a></li> <li title="from_list-1"><a href="ordsets.html#from_list-1">from_list/1</a></li> <li title="is_element-2"><a href="ordsets.html#is_element-2">is_element/2</a></li> <li title="add_element-2"><a href="ordsets.html#add_element-2">add_element/2</a></li> <li title="del_element-2"><a href="ordsets.html#del_element-2">del_element/2</a></li> <li title="union-2"><a href="ordsets.html#union-2">union/2</a></li> <li title="union-1"><a href="ordsets.html#union-1">union/1</a></li> <li title="intersection-2"><a href="ordsets.html#intersection-2">intersection/2</a></li> <li title="intersection-1"><a href="ordsets.html#intersection-1">intersection/1</a></li> <li title="is_disjoint-2"><a href="ordsets.html#is_disjoint-2">is_disjoint/2</a></li> <li title="subtract-2"><a href="ordsets.html#subtract-2">subtract/2</a></li> <li title="is_subset-2"><a href="ordsets.html#is_subset-2">is_subset/2</a></li> <li title="fold-3"><a href="ordsets.html#fold-3">fold/3</a></li> <li title="filter-2"><a href="ordsets.html#filter-2">filter/2</a></li> </ul> </li> <li id="no" title="pg " expanded="false">pg<ul> <li><a href="pg.html"> Top of manual page </a></li> <li title="create-1"><a href="pg.html#create-1">create/1</a></li> <li title="create-2"><a href="pg.html#create-2">create/2</a></li> <li title="join-2"><a href="pg.html#join-2">join/2</a></li> <li title="send-2"><a href="pg.html#send-2">send/2</a></li> <li title="esend-2"><a href="pg.html#esend-2">esend/2</a></li> <li title="members-1"><a href="pg.html#members-1">members/1</a></li> </ul> </li> <li id="no" title="pool " expanded="false">pool<ul> <li><a href="pool.html"> Top of manual page </a></li> <li title="start-1"><a href="pool.html#start-1">start/1</a></li> <li title="start-2"><a href="pool.html#start-2">start/2</a></li> <li title="attach-1"><a href="pool.html#attach-1">attach/1</a></li> <li title="stop-0"><a href="pool.html#stop-0">stop/0</a></li> <li title="get_nodes-0"><a href="pool.html#get_nodes-0">get_nodes/0</a></li> <li title="pspawn-3"><a href="pool.html#pspawn-3">pspawn/3</a></li> <li title="pspawn_link-3"><a href="pool.html#pspawn_link-3">pspawn_link/3</a></li> <li title="get_node-0"><a href="pool.html#get_node-0">get_node/0</a></li> </ul> </li> <li id="no" title="proc_lib " expanded="false">proc_lib<ul> <li><a href="proc_lib.html"> Top of manual page </a></li> <li title="spawn-1"><a href="proc_lib.html#spawn-1">spawn/1</a></li> <li title="spawn-2"><a href="proc_lib.html#spawn-2">spawn/2</a></li> <li title="spawn-3"><a href="proc_lib.html#spawn-3">spawn/3</a></li> <li title="spawn-4"><a href="proc_lib.html#spawn-4">spawn/4</a></li> <li title="spawn_link-1"><a href="proc_lib.html#spawn_link-1">spawn_link/1</a></li> <li title="spawn_link-2"><a href="proc_lib.html#spawn_link-2">spawn_link/2</a></li> <li title="spawn_link-3"><a href="proc_lib.html#spawn_link-3">spawn_link/3</a></li> <li title="spawn_link-4"><a href="proc_lib.html#spawn_link-4">spawn_link/4</a></li> <li title="spawn_opt-2"><a href="proc_lib.html#spawn_opt-2">spawn_opt/2</a></li> <li title="spawn_opt-3"><a href="proc_lib.html#spawn_opt-3">spawn_opt/3</a></li> <li title="spawn_opt-4"><a href="proc_lib.html#spawn_opt-4">spawn_opt/4</a></li> <li title="spawn_opt-5"><a href="proc_lib.html#spawn_opt-5">spawn_opt/5</a></li> <li title="start-3"><a href="proc_lib.html#start-3">start/3</a></li> <li title="start-4"><a href="proc_lib.html#start-4">start/4</a></li> <li title="start-5"><a href="proc_lib.html#start-5">start/5</a></li> <li title="start_link-3"><a href="proc_lib.html#start_link-3">start_link/3</a></li> <li title="start_link-4"><a href="proc_lib.html#start_link-4">start_link/4</a></li> <li title="start_link-5"><a href="proc_lib.html#start_link-5">start_link/5</a></li> <li title="init_ack-2"><a href="proc_lib.html#init_ack-2">init_ack/2</a></li> <li title="init_ack-1"><a href="proc_lib.html#init_ack-1">init_ack/1</a></li> <li title="format-1"><a href="proc_lib.html#format-1">format/1</a></li> <li title="initial_call-1"><a href="proc_lib.html#initial_call-1">initial_call/1</a></li> <li title="translate_initial_call-1"><a href="proc_lib.html#translate_initial_call-1">translate_initial_call/1</a></li> <li title="hibernate-3"><a href="proc_lib.html#hibernate-3">hibernate/3</a></li> </ul> </li> <li id="no" title="proplists " expanded="false">proplists<ul> <li><a href="proplists.html"> Top of manual page </a></li> <li title="append_values-2"><a href="proplists.html#append_values-2">append_values/2</a></li> <li title="compact-1"><a href="proplists.html#compact-1">compact/1</a></li> <li title="delete-2"><a href="proplists.html#delete-2">delete/2</a></li> <li title="expand-2"><a href="proplists.html#expand-2">expand/2</a></li> <li title="get_all_values-2"><a href="proplists.html#get_all_values-2">get_all_values/2</a></li> <li title="get_bool-2"><a href="proplists.html#get_bool-2">get_bool/2</a></li> <li title="get_keys-1"><a href="proplists.html#get_keys-1">get_keys/1</a></li> <li title="get_value-2"><a href="proplists.html#get_value-2">get_value/2</a></li> <li title="get_value-3"><a href="proplists.html#get_value-3">get_value/3</a></li> <li title="is_defined-2"><a href="proplists.html#is_defined-2">is_defined/2</a></li> <li title="lookup-2"><a href="proplists.html#lookup-2">lookup/2</a></li> <li title="lookup_all-2"><a href="proplists.html#lookup_all-2">lookup_all/2</a></li> <li title="normalize-2"><a href="proplists.html#normalize-2">normalize/2</a></li> <li title="property-1"><a href="proplists.html#property-1">property/1</a></li> <li title="property-2"><a href="proplists.html#property-2">property/2</a></li> <li title="split-2"><a href="proplists.html#split-2">split/2</a></li> <li title="substitute_aliases-2"><a href="proplists.html#substitute_aliases-2">substitute_aliases/2</a></li> <li title="substitute_negations-2"><a href="proplists.html#substitute_negations-2">substitute_negations/2</a></li> <li title="unfold-1"><a href="proplists.html#unfold-1">unfold/1</a></li> </ul> </li> <li id="no" title="qlc " expanded="false">qlc<ul> <li><a href="qlc.html"> Top of manual page </a></li> <li title="append-1"><a href="qlc.html#append-1">append/1</a></li> <li title="append-2"><a href="qlc.html#append-2">append/2</a></li> <li title="cursor-1"><a href="qlc.html#cursor-1">cursor/1</a></li> <li title="delete_cursor-1"><a href="qlc.html#delete_cursor-1">delete_cursor/1</a></li> <li title="eval-1"><a href="qlc.html#eval-1">eval/1</a></li> <li title="e-1"><a href="qlc.html#e-1">e/1</a></li> <li title="fold-3"><a href="qlc.html#fold-3">fold/3</a></li> <li title="format_error-1"><a href="qlc.html#format_error-1">format_error/1</a></li> <li title="info-1"><a href="qlc.html#info-1">info/1</a></li> <li title="keysort-2"><a href="qlc.html#keysort-2">keysort/2</a></li> <li title="next_answers-1"><a href="qlc.html#next_answers-1">next_answers/1</a></li> <li title="q-1"><a href="qlc.html#q-1">q/1</a></li> <li title="sort-1"><a href="qlc.html#sort-1">sort/1</a></li> <li title="string_to_handle-1"><a href="qlc.html#string_to_handle-1">string_to_handle/1</a></li> <li title="table-2"><a href="qlc.html#table-2">table/2</a></li> </ul> </li> <li id="no" title="queue " expanded="false">queue<ul> <li><a href="queue.html"> Top of manual page </a></li> <li title="new-0"><a href="queue.html#new-0">new/0</a></li> <li title="is_queue-1"><a href="queue.html#is_queue-1">is_queue/1</a></li> <li title="is_empty-1"><a href="queue.html#is_empty-1">is_empty/1</a></li> <li title="len-1"><a href="queue.html#len-1">len/1</a></li> <li title="in-2"><a href="queue.html#in-2">in/2</a></li> <li title="in_r-2"><a href="queue.html#in_r-2">in_r/2</a></li> <li title="out-1"><a href="queue.html#out-1">out/1</a></li> <li title="out_r-1"><a href="queue.html#out_r-1">out_r/1</a></li> <li title="from_list-1"><a href="queue.html#from_list-1">from_list/1</a></li> <li title="to_list-1"><a href="queue.html#to_list-1">to_list/1</a></li> <li title="reverse-1"><a href="queue.html#reverse-1">reverse/1</a></li> <li title="split-2"><a href="queue.html#split-2">split/2</a></li> <li title="join-2"><a href="queue.html#join-2">join/2</a></li> <li title="filter-2"><a href="queue.html#filter-2">filter/2</a></li> <li title="member-2"><a href="queue.html#member-2">member/2</a></li> <li title="get-1"><a href="queue.html#get-1">get/1</a></li> <li title="get_r-1"><a href="queue.html#get_r-1">get_r/1</a></li> <li title="drop-1"><a href="queue.html#drop-1">drop/1</a></li> <li title="drop_r-1"><a href="queue.html#drop_r-1">drop_r/1</a></li> <li title="peek-1"><a href="queue.html#peek-1">peek/1</a></li> <li title="peek_r-1"><a href="queue.html#peek_r-1">peek_r/1</a></li> <li title="cons-2"><a href="queue.html#cons-2">cons/2</a></li> <li title="head-1"><a href="queue.html#head-1">head/1</a></li> <li title="tail-1"><a href="queue.html#tail-1">tail/1</a></li> <li title="snoc-2"><a href="queue.html#snoc-2">snoc/2</a></li> <li title="daeh-1"><a href="queue.html#daeh-1">daeh/1</a></li> <li title="last-1"><a href="queue.html#last-1">last/1</a></li> <li title="liat-1"><a href="queue.html#liat-1">liat/1</a></li> <li title="init-1"><a href="queue.html#init-1">init/1</a></li> <li title="lait-1"><a href="queue.html#lait-1">lait/1</a></li> </ul> </li> <li id="no" title="random " expanded="false">random<ul> <li><a href="random.html"> Top of manual page </a></li> <li title="seed-0"><a href="random.html#seed-0">seed/0</a></li> <li title="seed-3"><a href="random.html#seed-3">seed/3</a></li> <li title="seed-1"><a href="random.html#seed-1">seed/1</a></li> <li title="seed0-0"><a href="random.html#seed0-0">seed0/0</a></li> <li title="uniform-0"><a href="random.html#uniform-0">uniform/0</a></li> <li title="uniform-1"><a href="random.html#uniform-1">uniform/1</a></li> <li title="uniform_s-1"><a href="random.html#uniform_s-1">uniform_s/1</a></li> <li title="uniform_s-2"><a href="random.html#uniform_s-2">uniform_s/2</a></li> </ul> </li> <li id="no" title="re " expanded="false">re<ul> <li><a href="re.html"> Top of manual page </a></li> <li title="compile-1"><a href="re.html#compile-1">compile/1</a></li> <li title="compile-2"><a href="re.html#compile-2">compile/2</a></li> <li title="run-2"><a href="re.html#run-2">run/2</a></li> <li title="run-3"><a href="re.html#run-3">run/3</a></li> <li title="replace-3"><a href="re.html#replace-3">replace/3</a></li> <li title="replace-4"><a href="re.html#replace-4">replace/4</a></li> <li title="split-2"><a href="re.html#split-2">split/2</a></li> <li title="split-3"><a href="re.html#split-3">split/3</a></li> </ul> </li> <li id="no" title="regexp " expanded="false">regexp<ul> <li><a href="regexp.html"> Top of manual page </a></li> <li title="match-2"><a href="regexp.html#match-2">match/2</a></li> <li title="first_match-2"><a href="regexp.html#first_match-2">first_match/2</a></li> <li title="matches-2"><a href="regexp.html#matches-2">matches/2</a></li> <li title="sub-3"><a href="regexp.html#sub-3">sub/3</a></li> <li title="gsub-3"><a href="regexp.html#gsub-3">gsub/3</a></li> <li title="split-2"><a href="regexp.html#split-2">split/2</a></li> <li title="sh_to_awk-1"><a href="regexp.html#sh_to_awk-1">sh_to_awk/1</a></li> <li title="parse-1"><a href="regexp.html#parse-1">parse/1</a></li> <li title="format_error-1"><a href="regexp.html#format_error-1">format_error/1</a></li> </ul> </li> <li id="no" title="sets " expanded="false">sets<ul> <li><a href="sets.html"> Top of manual page </a></li> <li title="new-0"><a href="sets.html#new-0">new/0</a></li> <li title="is_set-1"><a href="sets.html#is_set-1">is_set/1</a></li> <li title="size-1"><a href="sets.html#size-1">size/1</a></li> <li title="to_list-1"><a href="sets.html#to_list-1">to_list/1</a></li> <li title="from_list-1"><a href="sets.html#from_list-1">from_list/1</a></li> <li title="is_element-2"><a href="sets.html#is_element-2">is_element/2</a></li> <li title="add_element-2"><a href="sets.html#add_element-2">add_element/2</a></li> <li title="del_element-2"><a href="sets.html#del_element-2">del_element/2</a></li> <li title="union-2"><a href="sets.html#union-2">union/2</a></li> <li title="union-1"><a href="sets.html#union-1">union/1</a></li> <li title="intersection-2"><a href="sets.html#intersection-2">intersection/2</a></li> <li title="intersection-1"><a href="sets.html#intersection-1">intersection/1</a></li> <li title="is_disjoint-2"><a href="sets.html#is_disjoint-2">is_disjoint/2</a></li> <li title="subtract-2"><a href="sets.html#subtract-2">subtract/2</a></li> <li title="is_subset-2"><a href="sets.html#is_subset-2">is_subset/2</a></li> <li title="fold-3"><a href="sets.html#fold-3">fold/3</a></li> <li title="filter-2"><a href="sets.html#filter-2">filter/2</a></li> </ul> </li> <li id="no" title="shell " expanded="false">shell<ul> <li><a href="shell.html"> Top of manual page </a></li> <li title="history-1"><a href="shell.html#history-1">history/1</a></li> <li title="results-1"><a href="shell.html#results-1">results/1</a></li> <li title="catch_exception-1"><a href="shell.html#catch_exception-1">catch_exception/1</a></li> <li title="prompt_func-1"><a href="shell.html#prompt_func-1">prompt_func/1</a></li> <li title="start_restricted-1"><a href="shell.html#start_restricted-1">start_restricted/1</a></li> <li title="stop_restricted-0"><a href="shell.html#stop_restricted-0">stop_restricted/0</a></li> </ul> </li> <li title="shell_default"><a href="shell_default.html">shell_default</a></li> <li id="no" title="slave " expanded="false">slave<ul> <li><a href="slave.html"> Top of manual page </a></li> <li title="start-1"><a href="slave.html#start-1">start/1</a></li> <li title="start-2"><a href="slave.html#start-2">start/2</a></li> <li title="start-3"><a href="slave.html#start-3">start/3</a></li> <li title="start_link-1"><a href="slave.html#start_link-1">start_link/1</a></li> <li title="start_link-2"><a href="slave.html#start_link-2">start_link/2</a></li> <li title="start_link-3"><a href="slave.html#start_link-3">start_link/3</a></li> <li title="stop-1"><a href="slave.html#stop-1">stop/1</a></li> <li title="pseudo-1"><a href="slave.html#pseudo-1">pseudo/1</a></li> <li title="pseudo-2"><a href="slave.html#pseudo-2">pseudo/2</a></li> <li title="relay-1"><a href="slave.html#relay-1">relay/1</a></li> </ul> </li> <li id="loadscrollpos" title="sofs " expanded="true">sofs<ul> <li><a href="sofs.html"> Top of manual page </a></li> <li title="a_function-1"><a href="sofs.html#a_function-1">a_function/1</a></li> <li title="canonical_relation-1"><a href="sofs.html#canonical_relation-1">canonical_relation/1</a></li> <li title="composite-2"><a href="sofs.html#composite-2">composite/2</a></li> <li title="constant_function-2"><a href="sofs.html#constant_function-2">constant_function/2</a></li> <li title="converse-1"><a href="sofs.html#converse-1">converse/1</a></li> <li title="difference-2"><a href="sofs.html#difference-2">difference/2</a></li> <li title="digraph_to_family-1"><a href="sofs.html#digraph_to_family-1">digraph_to_family/1</a></li> <li title="domain-1"><a href="sofs.html#domain-1">domain/1</a></li> <li title="drestriction-2"><a href="sofs.html#drestriction-2">drestriction/2</a></li> <li title="drestriction-3"><a href="sofs.html#drestriction-3">drestriction/3</a></li> <li title="empty_set-0"><a href="sofs.html#empty_set-0">empty_set/0</a></li> <li title="extension-3"><a href="sofs.html#extension-3">extension/3</a></li> <li title="family-1"><a href="sofs.html#family-1">family/1</a></li> <li title="family_difference-2"><a href="sofs.html#family_difference-2">family_difference/2</a></li> <li title="family_domain-1"><a href="sofs.html#family_domain-1">family_domain/1</a></li> <li title="family_field-1"><a href="sofs.html#family_field-1">family_field/1</a></li> <li title="family_intersection-1"><a href="sofs.html#family_intersection-1">family_intersection/1</a></li> <li title="family_intersection-2"><a href="sofs.html#family_intersection-2">family_intersection/2</a></li> <li title="family_projection-2"><a href="sofs.html#family_projection-2">family_projection/2</a></li> <li title="family_range-1"><a href="sofs.html#family_range-1">family_range/1</a></li> <li title="family_specification-2"><a href="sofs.html#family_specification-2">family_specification/2</a></li> <li title="family_to_digraph-1"><a href="sofs.html#family_to_digraph-1">family_to_digraph/1</a></li> <li title="family_to_relation-1"><a href="sofs.html#family_to_relation-1">family_to_relation/1</a></li> <li title="family_union-1"><a href="sofs.html#family_union-1">family_union/1</a></li> <li title="family_union-2"><a href="sofs.html#family_union-2">family_union/2</a></li> <li title="field-1"><a href="sofs.html#field-1">field/1</a></li> <li title="from_external-2"><a href="sofs.html#from_external-2">from_external/2</a></li> <li title="from_sets-1"><a href="sofs.html#from_sets-1">from_sets/1</a></li> <li title="from_sets-1"><a href="sofs.html#from_sets-1">from_sets/1</a></li> <li title="from_term-1"><a href="sofs.html#from_term-1">from_term/1</a></li> <li title="image-2"><a href="sofs.html#image-2">image/2</a></li> <li title="intersection-1"><a href="sofs.html#intersection-1">intersection/1</a></li> <li title="intersection-2"><a href="sofs.html#intersection-2">intersection/2</a></li> <li title="intersection_of_family-1"><a href="sofs.html#intersection_of_family-1">intersection_of_family/1</a></li> <li title="inverse-1"><a href="sofs.html#inverse-1">inverse/1</a></li> <li title="inverse_image-2"><a href="sofs.html#inverse_image-2">inverse_image/2</a></li> <li title="is_a_function-1"><a href="sofs.html#is_a_function-1">is_a_function/1</a></li> <li title="is_disjoint-2"><a href="sofs.html#is_disjoint-2">is_disjoint/2</a></li> <li title="is_empty_set-1"><a href="sofs.html#is_empty_set-1">is_empty_set/1</a></li> <li title="is_equal-2"><a href="sofs.html#is_equal-2">is_equal/2</a></li> <li title="is_set-1"><a href="sofs.html#is_set-1">is_set/1</a></li> <li title="is_sofs_set-1"><a href="sofs.html#is_sofs_set-1">is_sofs_set/1</a></li> <li title="is_subset-2"><a href="sofs.html#is_subset-2">is_subset/2</a></li> <li title="is_type-1"><a href="sofs.html#is_type-1">is_type/1</a></li> <li title="join-4"><a href="sofs.html#join-4">join/4</a></li> <li title="multiple_relative_product-2"><a href="sofs.html#multiple_relative_product-2">multiple_relative_product/2</a></li> <li title="no_elements-1"><a href="sofs.html#no_elements-1">no_elements/1</a></li> <li title="partition-1"><a href="sofs.html#partition-1">partition/1</a></li> <li title="partition-2"><a href="sofs.html#partition-2">partition/2</a></li> <li title="partition-3"><a href="sofs.html#partition-3">partition/3</a></li> <li title="partition_family-2"><a href="sofs.html#partition_family-2">partition_family/2</a></li> <li title="product-1"><a href="sofs.html#product-1">product/1</a></li> <li title="product-2"><a href="sofs.html#product-2">product/2</a></li> <li title="projection-2"><a href="sofs.html#projection-2">projection/2</a></li> <li title="range-1"><a href="sofs.html#range-1">range/1</a></li> <li title="relation-1"><a href="sofs.html#relation-1">relation/1</a></li> <li title="relation_to_family-1"><a href="sofs.html#relation_to_family-1">relation_to_family/1</a></li> <li title="relative_product-1"><a href="sofs.html#relative_product-1">relative_product/1</a></li> <li title="relative_product-2"><a href="sofs.html#relative_product-2">relative_product/2</a></li> <li title="relative_product1-2"><a href="sofs.html#relative_product1-2">relative_product1/2</a></li> <li title="restriction-2"><a href="sofs.html#restriction-2">restriction/2</a></li> <li title="restriction-3"><a href="sofs.html#restriction-3">restriction/3</a></li> <li title="set-1"><a href="sofs.html#set-1">set/1</a></li> <li title="specification-2"><a href="sofs.html#specification-2">specification/2</a></li> <li title="strict_relation-1"><a href="sofs.html#strict_relation-1">strict_relation/1</a></li> <li title="substitution-2"><a href="sofs.html#substitution-2">substitution/2</a></li> <li title="symdiff-2"><a href="sofs.html#symdiff-2">symdiff/2</a></li> <li title="symmetric_partition-2"><a href="sofs.html#symmetric_partition-2">symmetric_partition/2</a></li> <li title="to_external-1"><a href="sofs.html#to_external-1">to_external/1</a></li> <li title="to_sets-1"><a href="sofs.html#to_sets-1">to_sets/1</a></li> <li title="type-1"><a href="sofs.html#type-1">type/1</a></li> <li title="union-1"><a href="sofs.html#union-1">union/1</a></li> <li title="union-2"><a href="sofs.html#union-2">union/2</a></li> <li title="union_of_family-1"><a href="sofs.html#union_of_family-1">union_of_family/1</a></li> <li title="weak_relation-1"><a href="sofs.html#weak_relation-1">weak_relation/1</a></li> </ul> </li> <li id="no" title="string " expanded="false">string<ul> <li><a href="string.html"> Top of manual page </a></li> <li title="len-1"><a href="string.html#len-1">len/1</a></li> <li title="equal-2"><a href="string.html#equal-2">equal/2</a></li> <li title="concat-2"><a href="string.html#concat-2">concat/2</a></li> <li title="chr-2"><a href="string.html#chr-2">chr/2</a></li> <li title="rchr-2"><a href="string.html#rchr-2">rchr/2</a></li> <li title="str-2"><a href="string.html#str-2">str/2</a></li> <li title="rstr-2"><a href="string.html#rstr-2">rstr/2</a></li> <li title="span-2"><a href="string.html#span-2">span/2</a></li> <li title="cspan-2"><a href="string.html#cspan-2">cspan/2</a></li> <li title="substr-2"><a href="string.html#substr-2">substr/2</a></li> <li title="substr-3"><a href="string.html#substr-3">substr/3</a></li> <li title="tokens-2"><a href="string.html#tokens-2">tokens/2</a></li> <li title="join-2"><a href="string.html#join-2">join/2</a></li> <li title="chars-2"><a href="string.html#chars-2">chars/2</a></li> <li title="chars-3"><a href="string.html#chars-3">chars/3</a></li> <li title="copies-2"><a href="string.html#copies-2">copies/2</a></li> <li title="words-1"><a href="string.html#words-1">words/1</a></li> <li title="words-2"><a href="string.html#words-2">words/2</a></li> <li title="sub_word-2"><a href="string.html#sub_word-2">sub_word/2</a></li> <li title="sub_word-3"><a href="string.html#sub_word-3">sub_word/3</a></li> <li title="strip-1"><a href="string.html#strip-1">strip/1</a></li> <li title="strip-2"><a href="string.html#strip-2">strip/2</a></li> <li title="strip-3"><a href="string.html#strip-3">strip/3</a></li> <li title="left-2"><a href="string.html#left-2">left/2</a></li> <li title="left-3"><a href="string.html#left-3">left/3</a></li> <li title="right-2"><a href="string.html#right-2">right/2</a></li> <li title="right-3"><a href="string.html#right-3">right/3</a></li> <li title="centre-2"><a href="string.html#centre-2">centre/2</a></li> <li title="centre-3"><a href="string.html#centre-3">centre/3</a></li> <li title="sub_string-2"><a href="string.html#sub_string-2">sub_string/2</a></li> <li title="sub_string-3"><a href="string.html#sub_string-3">sub_string/3</a></li> <li title="to_float-1"><a href="string.html#to_float-1">to_float/1</a></li> <li title="to_integer-1"><a href="string.html#to_integer-1">to_integer/1</a></li> <li title="to_lower-1"><a href="string.html#to_lower-1">to_lower/1</a></li> <li title="to_lower-1"><a href="string.html#to_lower-1">to_lower/1</a></li> <li title="to_upper-1"><a href="string.html#to_upper-1">to_upper/1</a></li> <li title="to_upper-1"><a href="string.html#to_upper-1">to_upper/1</a></li> </ul> </li> <li id="no" title="supervisor " expanded="false">supervisor<ul> <li><a href="supervisor.html"> Top of manual page </a></li> <li title="start_link-2"><a href="supervisor.html#start_link-2">start_link/2</a></li> <li title="start_link-3"><a href="supervisor.html#start_link-3">start_link/3</a></li> <li title="start_child-2"><a href="supervisor.html#start_child-2">start_child/2</a></li> <li title="terminate_child-2"><a href="supervisor.html#terminate_child-2">terminate_child/2</a></li> <li title="delete_child-2"><a href="supervisor.html#delete_child-2">delete_child/2</a></li> <li title="restart_child-2"><a href="supervisor.html#restart_child-2">restart_child/2</a></li> <li title="which_children-1"><a href="supervisor.html#which_children-1">which_children/1</a></li> <li title="count_children-1"><a href="supervisor.html#count_children-1">count_children/1</a></li> <li title="check_childspecs-1"><a href="supervisor.html#check_childspecs-1">check_childspecs/1</a></li> <li title="Module:init-1"><a href="supervisor.html#Module:init-1">Module:init/1</a></li> </ul> </li> <li id="no" title="supervisor_bridge " expanded="false">supervisor_bridge<ul> <li><a href="supervisor_bridge.html"> Top of manual page </a></li> <li title="start_link-2"><a href="supervisor_bridge.html#start_link-2">start_link/2</a></li> <li title="start_link-3"><a href="supervisor_bridge.html#start_link-3">start_link/3</a></li> <li title="Module:init-1"><a href="supervisor_bridge.html#Module:init-1">Module:init/1</a></li> <li title="Module:terminate-2"><a href="supervisor_bridge.html#Module:terminate-2">Module:terminate/2</a></li> </ul> </li> <li id="no" title="sys " expanded="false">sys<ul> <li><a href="sys.html"> Top of manual page </a></li> <li title="log-2"><a href="sys.html#log-2">log/2</a></li> <li title="log-3"><a href="sys.html#log-3">log/3</a></li> <li title="log_to_file-2"><a href="sys.html#log_to_file-2">log_to_file/2</a></li> <li title="log_to_file-3"><a href="sys.html#log_to_file-3">log_to_file/3</a></li> <li title="statistics-2"><a href="sys.html#statistics-2">statistics/2</a></li> <li title="statistics-3"><a href="sys.html#statistics-3">statistics/3</a></li> <li title="trace-2"><a href="sys.html#trace-2">trace/2</a></li> <li title="trace-3"><a href="sys.html#trace-3">trace/3</a></li> <li title="no_debug-1"><a href="sys.html#no_debug-1">no_debug/1</a></li> <li title="no_debug-2"><a href="sys.html#no_debug-2">no_debug/2</a></li> <li title="suspend-1"><a href="sys.html#suspend-1">suspend/1</a></li> <li title="suspend-2"><a href="sys.html#suspend-2">suspend/2</a></li> <li title="resume-1"><a href="sys.html#resume-1">resume/1</a></li> <li title="resume-2"><a href="sys.html#resume-2">resume/2</a></li> <li title="change_code-4"><a href="sys.html#change_code-4">change_code/4</a></li> <li title="change_code-5"><a href="sys.html#change_code-5">change_code/5</a></li> <li title="get_status-1"><a href="sys.html#get_status-1">get_status/1</a></li> <li title="get_status-2"><a href="sys.html#get_status-2">get_status/2</a></li> <li title="install-2"><a href="sys.html#install-2">install/2</a></li> <li title="install-3"><a href="sys.html#install-3">install/3</a></li> <li title="remove-2"><a href="sys.html#remove-2">remove/2</a></li> <li title="remove-3"><a href="sys.html#remove-3">remove/3</a></li> <li title="debug_options-1"><a href="sys.html#debug_options-1">debug_options/1</a></li> <li title="get_debug-3"><a href="sys.html#get_debug-3">get_debug/3</a></li> <li title="handle_debug-4"><a href="sys.html#handle_debug-4">handle_debug/4</a></li> <li title="handle_system_msg-6"><a href="sys.html#handle_system_msg-6">handle_system_msg/6</a></li> <li title="print_log-1"><a href="sys.html#print_log-1">print_log/1</a></li> <li title="Mod:system_continue-3"><a href="sys.html#Mod:system_continue-3">Mod:system_continue/3</a></li> <li title="Mod:system_terminate-4"><a href="sys.html#Mod:system_terminate-4">Mod:system_terminate/4</a></li> <li title="Mod:system_code_change-4"><a href="sys.html#Mod:system_code_change-4">Mod:system_code_change/4</a></li> </ul> </li> <li id="no" title="timer " expanded="false">timer<ul> <li><a href="timer.html"> Top of manual page </a></li> <li title="start-0"><a href="timer.html#start-0">start/0</a></li> <li title="apply_after-4"><a href="timer.html#apply_after-4">apply_after/4</a></li> <li title="send_after-3"><a href="timer.html#send_after-3">send_after/3</a></li> <li title="send_after-2"><a href="timer.html#send_after-2">send_after/2</a></li> <li title="exit_after-3"><a href="timer.html#exit_after-3">exit_after/3</a></li> <li title="exit_after-2"><a href="timer.html#exit_after-2">exit_after/2</a></li> <li title="kill_after-2"><a href="timer.html#kill_after-2">kill_after/2</a></li> <li title="kill_after-1"><a href="timer.html#kill_after-1">kill_after/1</a></li> <li title="apply_interval-4"><a href="timer.html#apply_interval-4">apply_interval/4</a></li> <li title="send_interval-3"><a href="timer.html#send_interval-3">send_interval/3</a></li> <li title="send_interval-2"><a href="timer.html#send_interval-2">send_interval/2</a></li> <li title="cancel-1"><a href="timer.html#cancel-1">cancel/1</a></li> <li title="sleep-1"><a href="timer.html#sleep-1">sleep/1</a></li> <li title="tc-3"><a href="timer.html#tc-3">tc/3</a></li> <li title="now_diff-2"><a href="timer.html#now_diff-2">now_diff/2</a></li> <li title="seconds-1"><a href="timer.html#seconds-1">seconds/1</a></li> <li title="minutes-1"><a href="timer.html#minutes-1">minutes/1</a></li> <li title="hours-1"><a href="timer.html#hours-1">hours/1</a></li> <li title="hms-3"><a href="timer.html#hms-3">hms/3</a></li> </ul> </li> <li id="no" title="unicode " expanded="false">unicode<ul> <li><a href="unicode.html"> Top of manual page </a></li> <li title="bom_to_encoding-1"><a href="unicode.html#bom_to_encoding-1">bom_to_encoding/1</a></li> <li title="characters_to_list-1"><a href="unicode.html#characters_to_list-1">characters_to_list/1</a></li> <li title="characters_to_list-2"><a href="unicode.html#characters_to_list-2">characters_to_list/2</a></li> <li title="characters_to_binary-1"><a href="unicode.html#characters_to_binary-1">characters_to_binary/1</a></li> <li title="characters_to_binary-2"><a href="unicode.html#characters_to_binary-2">characters_to_binary/2</a></li> <li title="characters_to_binary-3"><a href="unicode.html#characters_to_binary-3">characters_to_binary/3</a></li> <li title="encoding_to_bom-1"><a href="unicode.html#encoding_to_bom-1">encoding_to_bom/1</a></li> </ul> </li> <li id="no" title="win32reg " expanded="false">win32reg<ul> <li><a href="win32reg.html"> Top of manual page </a></li> <li title="change_key-2"><a href="win32reg.html#change_key-2">change_key/2</a></li> <li title="change_key_create-2"><a href="win32reg.html#change_key_create-2">change_key_create/2</a></li> <li title="close-1"><a href="win32reg.html#close-1">close/1</a></li> <li title="current_key-1"><a href="win32reg.html#current_key-1">current_key/1</a></li> <li title="delete_key-1"><a href="win32reg.html#delete_key-1">delete_key/1</a></li> <li title="delete_value-2"><a href="win32reg.html#delete_value-2">delete_value/2</a></li> <li title="expand-1"><a href="win32reg.html#expand-1">expand/1</a></li> <li title="format_error-1"><a href="win32reg.html#format_error-1">format_error/1</a></li> <li title="open-1"><a href="win32reg.html#open-1">open/1</a></li> <li title="set_value-3"><a href="win32reg.html#set_value-3">set_value/3</a></li> <li title="sub_keys-1"><a href="win32reg.html#sub_keys-1">sub_keys/1</a></li> <li title="value-2"><a href="win32reg.html#value-2">value/2</a></li> <li title="values-1"><a href="win32reg.html#values-1">values/1</a></li> </ul> </li> <li id="no" title="zip " expanded="false">zip<ul> <li><a href="zip.html"> Top of manual page </a></li> <li title="zip-2"><a href="zip.html#zip-2">zip/2</a></li> <li title="zip-3"><a href="zip.html#zip-3">zip/3</a></li> <li title="create-2"><a href="zip.html#create-2">create/2</a></li> <li title="create-3"><a href="zip.html#create-3">create/3</a></li> <li title="unzip-1"><a href="zip.html#unzip-1">unzip/1</a></li> <li title="unzip-2"><a href="zip.html#unzip-2">unzip/2</a></li> <li title="extract-1"><a href="zip.html#extract-1">extract/1</a></li> <li title="extract-2"><a href="zip.html#extract-2">extract/2</a></li> <li title="list_dir-1"><a href="zip.html#list_dir-1">list_dir/1</a></li> <li title="list_dir-2"><a href="zip.html#list_dir-2">list_dir/2</a></li> <li title="table-1"><a href="zip.html#table-1">table/1</a></li> <li title="table-2"><a href="zip.html#table-2">table/2</a></li> <li title="t-1"><a href="zip.html#t-1">t/1</a></li> <li title="tt-1"><a href="zip.html#tt-1">tt/1</a></li> <li title="zip_open-1"><a href="zip.html#zip_open-1">zip_open/1</a></li> <li title="zip_open-2"><a href="zip.html#zip_open-2">zip_open/2</a></li> <li title="zip_list_dir-1"><a href="zip.html#zip_list_dir-1">zip_list_dir/1</a></li> <li title="zip_get-1"><a href="zip.html#zip_get-1">zip_get/1</a></li> <li title="zip_get-2"><a href="zip.html#zip_get-2">zip_get/2</a></li> <li title="zip_close-1"><a href="zip.html#zip_close-1">zip_close/1</a></li> </ul> </li> </ul> </div></div> <div id="content"> <div class="innertube"> <!-- refpage --><center><h1>sofs</h1></center> <h3>MODULE</h3> <div class="REFBODY">sofs</div> <h3>MODULE SUMMARY</h3> <div class="REFBODY">Functions for Manipulating Sets of Sets</div> <h3>DESCRIPTION</h3> <div class="REFBODY"><p> <p>The <span class="code">sofs</span> module implements operations on finite sets and relations represented as sets. Intuitively, a set is a collection of elements; every element belongs to the set, and the set contains every element.</p> <p>Given a set A and a sentence S(x), where x is a free variable, a new set B whose elements are exactly those elements of A for which S(x) holds can be formed, this is denoted B = {x in A : S(x)}. Sentences are expressed using the logical operators "for some" (or "there exists"), "for all", "and", "or", "not". If the existence of a set containing all the specified elements is known (as will always be the case in this module), we write B = {x : S(x)}. </p> <p>The <strong>unordered set</strong> containing the elements a, b and c is denoted {a, b, c}. This notation is not to be confused with tuples. The <strong>ordered pair</strong> of a and b, with first <strong>coordinate</strong> a and second coordinate b, is denoted (a, b). An ordered pair is an <strong>ordered set</strong> of two elements. In this module ordered sets can contain one, two or more elements, and parentheses are used to enclose the elements. Unordered sets and ordered sets are orthogonal, again in this module; there is no unordered set equal to any ordered set.</p> <p>The set that contains no elements is called the <strong>empty set</strong>. If two sets A and B contain the same elements, then A is <a name="equal"></a><strong>equal</strong> to B, denoted A = B. Two ordered sets are equal if they contain the same number of elements and have equal elements at each coordinate. If a set A contains all elements that B contains, then B is a <a name="subset"></a><strong>subset</strong> of A. The <a name="union"></a><strong>union</strong> of two sets A and B is the smallest set that contains all elements of A and all elements of B. The <a name="intersection"></a><strong>intersection</strong> of two sets A and B is the set that contains all elements of A that belong to B. Two sets are <a name="disjoint"></a><strong>disjoint</strong> if their intersection is the empty set. The <a name="difference"></a><strong>difference</strong> of two sets A and B is the set that contains all elements of A that do not belong to B. The <a name="symmetric_difference"></a><strong>symmetric difference</strong> of two sets is the set that contains those element that belong to either of the two sets, but not both. The <a name="union_n"></a><strong>union</strong> of a collection of sets is the smallest set that contains all the elements that belong to at least one set of the collection. The <a name="intersection_n"></a><strong>intersection</strong> of a non-empty collection of sets is the set that contains all elements that belong to every set of the collection.</p> <p>The <a name="Cartesian_product"></a><strong>Cartesian product</strong> of two sets X and Y, denoted X × Y, is the set {a : a = (x, y) for some x in X and for some y in Y}. A <a name="relation"></a><strong>relation</strong> is a subset of X × Y. Let R be a relation. The fact that (x, y) belongs to R is written as x R y. Since relations are sets, the definitions of the last paragraph (subset, union, and so on) apply to relations as well. The <a name="domain"></a><strong>domain</strong> of R is the set {x : x R y for some y in Y}. The <a name="range"></a><strong>range</strong> of R is the set {y : x R y for some x in X}. The <a name="converse"></a><strong>converse</strong> of R is the set {a : a = (y, x) for some (x, y) in R}. If A is a subset of X, then the <a name="image"></a><strong>image</strong> of A under R is the set {y : x R y for some x in A}, and if B is a subset of Y, then the <a name="inverse_image"></a><strong>inverse image</strong> of B is the set {x : x R y for some y in B}. If R is a relation from X to Y and S is a relation from Y to Z, then the <a name="relative_product"></a><strong>relative product</strong> of R and S is the relation T from X to Z defined so that x T z if and only if there exists an element y in Y such that x R y and y S z. The <a name="restriction"></a><strong>restriction</strong> of R to A is the set S defined so that x S y if and only if there exists an element x in A such that x R y. If S is a restriction of R to A, then R is an <a name="extension"></a><strong>extension</strong> of S to X. If X = Y then we call R a relation <strong>in</strong> X. The <a name="field"></a><strong>field</strong> of a relation R in X is the union of the domain of R and the range of R. If R is a relation in X, and if S is defined so that x S y if x R y and not x = y, then S is the <a name="strict_relation"></a><strong>strict</strong> relation corresponding to R, and vice versa, if S is a relation in X, and if R is defined so that x R y if x S y or x = y, then R is the <a name="weak_relation"></a><strong>weak</strong> relation corresponding to S. A relation R in X is <strong>reflexive</strong> if x R x for every element x of X; it is <strong>symmetric</strong> if x R y implies that y R x; and it is <strong>transitive</strong> if x R y and y R z imply that x R z.</p> <p>A <a name="function"></a><strong>function</strong> F is a relation, a subset of X × Y, such that the domain of F is equal to X and such that for every x in X there is a unique element y in Y with (x, y) in F. The latter condition can be formulated as follows: if x F y and x F z then y = z. In this module, it will not be required that the domain of F be equal to X for a relation to be considered a function. Instead of writing (x, y) in F or x F y, we write F(x) = y when F is a function, and say that F maps x onto y, or that the value of F at x is y. Since functions are relations, the definitions of the last paragraph (domain, range, and so on) apply to functions as well. If the converse of a function F is a function F', then F' is called the <a name="inverse"></a><strong>inverse</strong> of F. The relative product of two functions F1 and F2 is called the <a name="composite"></a><strong>composite</strong> of F1 and F2 if the range of F1 is a subset of the domain of F2. </p> <p>Sometimes, when the range of a function is more important than the function itself, the function is called a <strong>family</strong>. The domain of a family is called the <strong>index set</strong>, and the range is called the <strong>indexed set</strong>. If x is a family from I to X, then x[i] denotes the value of the function at index i. The notation "a family in X" is used for such a family. When the indexed set is a set of subsets of a set X, then we call x a <a name="family"></a><strong>family of subsets</strong> of X. If x is a family of subsets of X, then the union of the range of x is called the <strong>union of the family</strong> x. If x is non-empty (the index set is non-empty), the <strong>intersection of the family</strong> x is the intersection of the range of x. In this module, the only families that will be considered are families of subsets of some set X; in the following the word "family" will be used for such families of subsets.</p> <p>A <a name="partition"></a><strong>partition</strong> of a set X is a collection S of non-empty subsets of X whose union is X and whose elements are pairwise disjoint. A relation in a set is an <strong>equivalence relation</strong> if it is reflexive, symmetric and transitive. If R is an equivalence relation in X, and x is an element of X, the <a name="equivalence_class"></a><strong>equivalence class</strong> of x with respect to R is the set of all those elements y of X for which x R y holds. The equivalence classes constitute a partitioning of X. Conversely, if C is a partition of X, then the relation that holds for any two elements of X if they belong to the same equivalence class, is an equivalence relation induced by the partition C. If R is an equivalence relation in X, then the <a name="canonical_map"></a><strong>canonical map</strong> is the function that maps every element of X onto its equivalence class. </p> <p>Relations as defined above (as sets of ordered pairs) will from now on be referred to as <strong>binary relations</strong>. We call a set of ordered sets (x[1], ..., x[n]) an <strong>(n-ary) relation</strong>, and say that the relation is a subset of the <a name="Cartesian_product_tuple"></a>Cartesian product X[1] × ... × X[n] where x[i] is an element of X[i], 1 <= i <= n. The <a name="projection"></a><strong>projection</strong> of an n-ary relation R onto coordinate i is the set {x[i] : (x[1], ..., x[i], ..., x[n]) in R for some x[j] in X[j], 1 <= j <= n and not i = j}. The projections of a binary relation R onto the first and second coordinates are the domain and the range of R respectively. The relative product of binary relations can be generalized to n-ary relations as follows. Let TR be an ordered set (R[1], ..., R[n]) of binary relations from X to Y[i] and S a binary relation from (Y[1] × ... × Y[n]) to Z. The <a name="tuple_relative_product"></a><strong>relative product</strong> of TR and S is the binary relation T from X to Z defined so that x T z if and only if there exists an element y[i] in Y[i] for each 1 <= i <= n such that x R[i] y[i] and (y[1], ..., y[n]) S z. Now let TR be a an ordered set (R[1], ..., R[n]) of binary relations from X[i] to Y[i] and S a subset of X[1] × ... × X[n]. The <a name="multiple_relative_product"></a><strong>multiple relative product</strong> of TR and and S is defined to be the set {z : z = ((x[1], ..., x[n]), (y[1],...,y[n])) for some (x[1], ..., x[n]) in S and for some (x[i], y[i]) in R[i], 1 <= i <= n}. The <a name="natural_join"></a><strong>natural join</strong> of an n-ary relation R and an m-ary relation S on coordinate i and j is defined to be the set {z : z = (x[1], ..., x[n], y[1], ..., y[j-1], y[j+1], ..., y[m]) for some (x[1], ..., x[n]) in R and for some (y[1], ..., y[m]) in S such that x[i] = y[j]}.</p> <p><a name="sets_definition"></a>The sets recognized by this module will be represented by elements of the relation Sets, defined as the smallest set such that:</p> <ul> <li>for every atom T except '_' and for every term X, (T, X) belongs to Sets (<strong>atomic sets</strong>); </li> <li>(['_'], []) belongs to Sets (the <strong>untyped empty set</strong>); </li> <li>for every tuple T = {T[1], ..., T[n]} and for every tuple X = {X[1], ..., X[n]}, if (T[i], X[i]) belongs to Sets for every 1 <= i <= n then (T, X) belongs to Sets (<strong>ordered sets</strong>); </li> <li>for every term T, if X is the empty list or a non-empty sorted list [X[1], ..., X[n]] without duplicates such that (T, X[i]) belongs to Sets for every 1 <= i <= n, then ([T], X) belongs to Sets (<strong>typed unordered sets</strong>).</li> </ul> <p>An <a name="external_set"></a><strong>external set</strong> is an element of the range of Sets. A <a name="type"></a><strong>type</strong> is an element of the domain of Sets. If S is an element (T, X) of Sets, then T is a <a name="valid_type"></a><strong>valid type</strong> of X, T is the type of S, and X is the external set of S. <span class="bold_code"><a href="#from_term">from_term/2</a></span> creates a set from a type and an Erlang term turned into an external set.</p> <p>The actual sets represented by Sets are the elements of the range of the function Set from Sets to Erlang terms and sets of Erlang terms:</p> <ul> <li>Set(T,Term) = Term, where T is an atom;</li> <li>Set({T[1], ..., T[n]}, {X[1], ..., X[n]}) = (Set(T[1], X[1]), ..., Set(T[n], X[n]));</li> <li>Set([T], [X[1], ..., X[n]]) = {Set(T, X[1]), ..., Set(T, X[n])};</li> <li>Set([T], []) = {}.</li> </ul> <p>When there is no risk of confusion, elements of Sets will be identified with the sets they represent. For instance, if U is the result of calling <span class="code">union/2</span> with S1 and S2 as arguments, then U is said to be the union of S1 and S2. A more precise formulation would be that Set(U) is the union of Set(S1) and Set(S2).</p> <p>The types are used to implement the various conditions that sets need to fulfill. As an example, consider the relative product of two sets R and S, and recall that the relative product of R and S is defined if R is a binary relation to Y and S is a binary relation from Y. The function that implements the relative product, <span class="bold_code"><a href="#relprod_impl">relative_product/2</a></span>, checks that the arguments represent binary relations by matching [{A,B}] against the type of the first argument (Arg1 say), and [{C,D}] against the type of the second argument (Arg2 say). The fact that [{A,B}] matches the type of Arg1 is to be interpreted as Arg1 representing a binary relation from X to Y, where X is defined as all sets Set(x) for some element x in Sets the type of which is A, and similarly for Y. In the same way Arg2 is interpreted as representing a binary relation from W to Z. Finally it is checked that B matches C, which is sufficient to ensure that W is equal to Y. The untyped empty set is handled separately: its type, ['_'], matches the type of any unordered set.</p> <p>A few functions of this module (<span class="code">drestriction/3</span>, <span class="code">family_projection/2</span>, <span class="code">partition/2</span>, <span class="code">partition_family/2</span>, <span class="code">projection/2</span>, <span class="code">restriction/3</span>, <span class="code">substitution/2</span>) accept an Erlang function as a means to modify each element of a given unordered set. Such a function, called SetFun in the following, can be specified as a functional object (fun), a tuple <span class="code">{external, Fun}</span>, or an integer. If SetFun is specified as a fun, the fun is applied to each element of the given set and the return value is assumed to be a set. If SetFun is specified as a tuple <span class="code">{external, Fun}</span>, Fun is applied to the external set of each element of the given set and the return value is assumed to be an external set. Selecting the elements of an unordered set as external sets and assembling a new unordered set from a list of external sets is in the present implementation more efficient than modifying each element as a set. However, this optimization can only be utilized when the elements of the unordered set are atomic or ordered sets. It must also be the case that the type of the elements matches some clause of Fun (the type of the created set is the result of applying Fun to the type of the given set), and that Fun does nothing but selecting, duplicating or rearranging parts of the elements. Specifying a SetFun as an integer I is equivalent to specifying <span class="code">{external, fun(X) -> element(I, X) end}</span>, but is to be preferred since it makes it possible to handle this case even more efficiently. Examples of SetFuns:</p> <div class="example"><pre> {sofs, union} fun(S) -> sofs:partition(1, S) end {external, fun(A) -> A end} {external, fun({A,_,C}) -> {C,A} end} {external, fun({_,{_,C}}) -> C end} {external, fun({_,{_,{_,E}=C}}) -> {E,{E,C}} end} 2</pre></div> <p>The order in which a SetFun is applied to the elements of an unordered set is not specified, and may change in future versions of sofs.</p> <p>The execution time of the functions of this module is dominated by the time it takes to sort lists. When no sorting is needed, the execution time is in the worst case proportional to the sum of the sizes of the input arguments and the returned value. A few functions execute in constant time: <span class="code">from_external</span>, <span class="code">is_empty_set</span>, <span class="code">is_set</span>, <span class="code">is_sofs_set</span>, <span class="code">to_external</span>, <span class="code">type</span>.</p> <p>The functions of this module exit the process with a <span class="code">badarg</span>, <span class="code">bad_function</span>, or <span class="code">type_mismatch</span> message when given badly formed arguments or sets the types of which are not compatible.</p> <p>When comparing external sets the operator <span class="code">==/2</span> is used.</p> <p><strong>Types</strong></p> <div class="example"><pre> anyset() = - an unordered, ordered or atomic set - binary_relation() = - a binary relation - bool() = true | false external_set() = - an external set - family() = - a family (of subsets) - function() = - a function - ordset() = - an ordered set - relation() = - an n-ary relation - set() = - an unordered set - set_of_sets() = - an unordered set of set() - set_fun() = integer() >= 1 | {external, fun(external_set()) -> external_set()} | fun(anyset()) -> anyset() spec_fun() = {external, fun(external_set()) -> bool()} | fun(anyset()) -> bool() type() = - a type - </pre></div> </p></div> <h3>EXPORTS</h3> <p><a name="a_function-1"><span class="bold_code">a_function(Tuples [, Type]) -> Function</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Function = function()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Tuples = [tuple()]</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = type()</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates a <span class="bold_code"><a href="#function">function</a></span>. <span class="code">a_function(F, T)</span> is equivalent to <span class="code">from_term(F, T)</span>, if the result is a function. If no <span class="bold_code"><a href="#type">type</a></span> is explicitly given, <span class="code">[{atom, atom}]</span> is used as type of the function.</p> </p></div> <p><a name="canonical_relation-1"><span class="bold_code">canonical_relation(SetOfSets) -> BinRel</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">SetOfSets = set_of_sets()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the binary relation containing the elements (E, Set) such that Set belongs to SetOfSets and E belongs to Set. If SetOfSets is a <span class="bold_code"><a href="#partition">partition</a></span> of a set X and R is the equivalence relation in X induced by SetOfSets, then the returned relation is the <span class="bold_code"><a href="#canonical_map">canonical map</a></span> from X onto the equivalence classes with respect to R.</p> <div class="example"><pre> 1> <span class="bold_code">Ss = sofs:from_term([[a,b],[b,c]]),</span> <span class="bold_code">CR = sofs:canonical_relation(Ss),</span> <span class="bold_code">sofs:to_external(CR).</span> [{a,[a,b]},{b,[a,b]},{b,[b,c]},{c,[b,c]}]</pre></div> </p></div> <p><a name="composite-2"><span class="bold_code">composite(Function1, Function2) -> Function3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Function1 = Function2 = Function3 = function()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#composite">composite</a></span> of the functions Function1 and Function2.</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:a_function([{a,1},{b,2},{c,2}]),</span> <span class="bold_code">F2 = sofs:a_function([{1,x},{2,y},{3,z}]),</span> <span class="bold_code">F = sofs:composite(F1, F2),</span> <span class="bold_code">sofs:to_external(F).</span> [{a,x},{b,y},{c,y}]</pre></div> </p></div> <p><a name="constant_function-2"><span class="bold_code">constant_function(Set, AnySet) -> Function</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Function = function()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates the <span class="bold_code"><a href="#function">function</a></span> that maps each element of the set Set onto AnySet.</p> <div class="example"><pre> 1> <span class="bold_code">S = sofs:set([a,b]),</span> <span class="bold_code">E = sofs:from_term(1),</span> <span class="bold_code">R = sofs:constant_function(S, E),</span> <span class="bold_code">sofs:to_external(R).</span> [{a,1},{b,1}]</pre></div> </p></div> <p><a name="converse-1"><span class="bold_code">converse(BinRel1) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#converse">converse</a></span> of the binary relation BinRel1.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,a},{2,b},{3,a}]),</span> <span class="bold_code">R2 = sofs:converse(R1),</span> <span class="bold_code">sofs:to_external(R2).</span> [{a,1},{a,3},{b,2}]</pre></div> </p></div> <p><a name="difference-2"><span class="bold_code">difference(Set1, Set2) -> Set3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#difference">difference</a></span> of the sets Set1 and Set2.</p> </p></div> <p><a name="digraph_to_family-1"><span class="bold_code">digraph_to_family(Graph [, Type]) -> Family</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Graph = digraph() - see digraph(3) -</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = type()</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates a <span class="bold_code"><a href="#family">family</a></span> from the directed graph Graph. Each vertex a of Graph is represented by a pair (a, {b[1], ..., b[n]}) where the b[i]'s are the out-neighbours of a. If no type is explicitly given, [{atom, [atom]}] is used as type of the family. It is assumed that Type is a <span class="bold_code"><a href="#valid_type">valid type</a></span> of the external set of the family.</p> <p>If G is a directed graph, it holds that the vertices and edges of G are the same as the vertices and edges of <span class="code">family_to_digraph(digraph_to_family(G))</span>.</p> </p></div> <p><a name="domain-1"><span class="bold_code">domain(BinRel) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#domain">domain</a></span> of the binary relation BinRel.</p> <div class="example"><pre> 1> <span class="bold_code">R = sofs:relation([{1,a},{1,b},{2,b},{2,c}]),</span> <span class="bold_code">S = sofs:domain(R),</span> <span class="bold_code">sofs:to_external(S).</span> [1,2]</pre></div> </p></div> <p><a name="drestriction-2"><span class="bold_code">drestriction(BinRel1, Set) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the difference between the binary relation BinRel1 and the <span class="bold_code"><a href="#restriction">restriction</a></span> of BinRel1 to Set.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,a},{2,b},{3,c}]),</span> <span class="bold_code">S = sofs:set([2,4,6]),</span> <span class="bold_code">R2 = sofs:drestriction(R1, S),</span> <span class="bold_code">sofs:to_external(R2).</span> [{1,a},{3,c}]</pre></div> <p><span class="code">drestriction(R, S)</span> is equivalent to <span class="code">difference(R, restriction(R, S))</span>.</p> </p></div> <p><a name="drestriction-3"><span class="bold_code">drestriction(SetFun, Set1, Set2) -> Set3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns a subset of Set1 containing those elements that do not yield an element in Set2 as the result of applying SetFun.</p> <div class="example"><pre> 1> <span class="bold_code">SetFun = {external, fun({_A,B,C}) -> {B,C} end},</span> <span class="bold_code">R1 = sofs:relation([{a,aa,1},{b,bb,2},{c,cc,3}]),</span> <span class="bold_code">R2 = sofs:relation([{bb,2},{cc,3},{dd,4}]),</span> <span class="bold_code">R3 = sofs:drestriction(SetFun, R1, R2),</span> <span class="bold_code">sofs:to_external(R3).</span> [{a,aa,1}]</pre></div> <p><span class="code">drestriction(F, S1, S2)</span> is equivalent to <span class="code">difference(S1, restriction(F, S1, S2))</span>.</p> </p></div> <p><a name="empty_set-0"><span class="bold_code">empty_set() -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#sets_definition">untyped empty set</a></span>. <span class="code">empty_set()</span> is equivalent to <span class="code">from_term([], ['_'])</span>.</p> </p></div> <p><a name="extension-3"><span class="bold_code">extension(BinRel1, Set, AnySet) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#extension">extension</a></span> of BinRel1 such that for each element E in Set that does not belong to the <span class="bold_code"><a href="#domain">domain</a></span> of BinRel1, BinRel2 contains the pair (E, AnySet).</p> <div class="example"><pre> 1> <span class="bold_code">S = sofs:set([b,c]),</span> <span class="bold_code">A = sofs:empty_set(),</span> <span class="bold_code">R = sofs:family([{a,[1,2]},{b,[3]}]),</span> <span class="bold_code">X = sofs:extension(R, S, A),</span> <span class="bold_code">sofs:to_external(X).</span> [{a,[1,2]},{b,[3]},{c,[]}]</pre></div> </p></div> <p><a name="family-1"><span class="bold_code">family(Tuples [, Type]) -> Family</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Tuples = [tuple()]</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = type()</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates a <span class="bold_code"><a href="#family">family of subsets</a></span>. <span class="code">family(F, T)</span> is equivalent to <span class="code">from_term(F, T)</span>, if the result is a family. If no <span class="bold_code"><a href="#type">type</a></span> is explicitly given, <span class="code">[{atom, [atom]}]</span> is used as type of the family.</p> </p></div> <p><a name="family_difference-2"><span class="bold_code">family_difference(Family1, Family2) -> Family3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = Family3 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 and Family2 are <span class="bold_code"><a href="#family">families</a></span>, then Family3 is the family such that the index set is equal to the index set of Family1, and Family3[i] is the difference between Family1[i] and Family2[i] if Family2 maps i, Family1[i] otherwise.</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:family([{a,[1,2]},{b,[3,4]}]),</span> <span class="bold_code">F2 = sofs:family([{b,[4,5]},{c,[6,7]}]),</span> <span class="bold_code">F3 = sofs:family_difference(F1, F2),</span> <span class="bold_code">sofs:to_external(F3).</span> [{a,[1,2]},{b,[3]}]</pre></div> </p></div> <p><a name="family_domain-1"><span class="bold_code">family_domain(Family1) -> Family2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 is a <span class="bold_code"><a href="#family">family</a></span> and Family1[i] is a binary relation for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the <span class="bold_code"><a href="#domain">domain</a></span> of Family1[i].</p> <div class="example"><pre> 1> <span class="bold_code">FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),</span> <span class="bold_code">F = sofs:family_domain(FR),</span> <span class="bold_code">sofs:to_external(F).</span> [{a,[1,2,3]},{b,[]},{c,[4,5]}]</pre></div> </p></div> <p><a name="family_field-1"><span class="bold_code">family_field(Family1) -> Family2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 is a <span class="bold_code"><a href="#family">family</a></span> and Family1[i] is a binary relation for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the <span class="bold_code"><a href="#field">field</a></span> of Family1[i].</p> <div class="example"><pre> 1> <span class="bold_code">FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),</span> <span class="bold_code">F = sofs:family_field(FR),</span> <span class="bold_code">sofs:to_external(F).</span> [{a,[1,2,3,a,b,c]},{b,[]},{c,[4,5,d,e]}]</pre></div> <p><span class="code">family_field(Family1)</span> is equivalent to <span class="code">family_union(family_domain(Family1), family_range(Family1))</span>.</p> </p></div> <p><a name="family_intersection-1"><span class="bold_code">family_intersection(Family1) -> Family2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 is a <span class="bold_code"><a href="#family">family</a></span> and Family1[i] is a set of sets for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the <span class="bold_code"><a href="#intersection_n">intersection</a></span> of Family1[i].</p> <p>If Family1[i] is an empty set for some i, then the process exits with a <span class="code">badarg</span> message.</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:from_term([{a,[[1,2,3],[2,3,4]]},{b,[[x,y,z],[x,y]]}]),</span> <span class="bold_code">F2 = sofs:family_intersection(F1),</span> <span class="bold_code">sofs:to_external(F2).</span> [{a,[2,3]},{b,[x,y]}]</pre></div> </p></div> <p><a name="family_intersection-2"><span class="bold_code">family_intersection(Family1, Family2) -> Family3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = Family3 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 and Family2 are <span class="bold_code"><a href="#family">families</a></span>, then Family3 is the family such that the index set is the intersection of Family1's and Family2's index sets, and Family3[i] is the intersection of Family1[i] and Family2[i].</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:family([{a,[1,2]},{b,[3,4]},{c,[5,6]}]),</span> <span class="bold_code">F2 = sofs:family([{b,[4,5]},{c,[7,8]},{d,[9,10]}]),</span> <span class="bold_code">F3 = sofs:family_intersection(F1, F2),</span> <span class="bold_code">sofs:to_external(F3).</span> [{b,[4]},{c,[]}]</pre></div> </p></div> <p><a name="family_projection-2"><span class="bold_code">family_projection(SetFun, Family1) -> Family2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 is a <span class="bold_code"><a href="#family">family</a></span> then Family2 is the family with the same index set as Family1 such that Family2[i] is the result of calling SetFun with Family1[i] as argument.</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:from_term([{a,[[1,2],[2,3]]},{b,[[]]}]),</span> <span class="bold_code">F2 = sofs:family_projection({sofs, union}, F1),</span> <span class="bold_code">sofs:to_external(F2).</span> [{a,[1,2,3]},{b,[]}]</pre></div> </p></div> <p><a name="family_range-1"><span class="bold_code">family_range(Family1) -> Family2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 is a <span class="bold_code"><a href="#family">family</a></span> and Family1[i] is a binary relation for every i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the <span class="bold_code"><a href="#range">range</a></span> of Family1[i].</p> <div class="example"><pre> 1> <span class="bold_code">FR = sofs:from_term([{a,[{1,a},{2,b},{3,c}]},{b,[]},{c,[{4,d},{5,e}]}]),</span> <span class="bold_code">F = sofs:family_range(FR),</span> <span class="bold_code">sofs:to_external(F).</span> [{a,[a,b,c]},{b,[]},{c,[d,e]}]</pre></div> </p></div> <p><a name="family_specification-2"><span class="bold_code">family_specification(Fun, Family1) -> Family2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Fun = spec_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 is a <span class="bold_code"><a href="#family">family</a></span>, then Family2 is the <span class="bold_code"><a href="#restriction">restriction</a></span> of Family1 to those elements i of the index set for which Fun applied to Family1[i] returns <span class="code">true</span>. If Fun is a tuple <span class="code">{external, Fun2}</span>, Fun2 is applied to the <span class="bold_code"><a href="#external_set">external set</a></span> of Family1[i], otherwise Fun is applied to Family1[i].</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:family([{a,[1,2,3]},{b,[1,2]},{c,[1]}]),</span> <span class="bold_code">SpecFun = fun(S) -> sofs:no_elements(S) =:= 2 end,</span> <span class="bold_code">F2 = sofs:family_specification(SpecFun, F1),</span> <span class="bold_code">sofs:to_external(F2).</span> [{b,[1,2]}]</pre></div> </p></div> <p><a name="family_to_digraph-1"><span class="bold_code">family_to_digraph(Family [, GraphType]) -> Graph</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Graph = digraph()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">GraphType = - see digraph(3) -</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates a directed graph from the <span class="bold_code"><a href="#family">family</a></span> Family. For each pair (a, {b[1], ..., b[n]}) of Family, the vertex a as well the edges (a, b[i]) for 1 <= i <= n are added to a newly created directed graph.</p> <p>If no graph type is given, <span class="code">digraph:new/1</span> is used for creating the directed graph, otherwise the GraphType argument is passed on as second argument to <span class="code">digraph:new/2</span>.</p> <p>It F is a family, it holds that F is a subset of <span class="code">digraph_to_family(family_to_digraph(F), type(F))</span>. Equality holds if <span class="code">union_of_family(F)</span> is a subset of <span class="code">domain(F)</span>.</p> <p>Creating a cycle in an acyclic graph exits the process with a <span class="code">cyclic</span> message.</p> </p></div> <p><a name="family_to_relation-1"><span class="bold_code">family_to_relation(Family) -> BinRel</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family is a <span class="bold_code"><a href="#family">family</a></span>, then BinRel is the binary relation containing all pairs (i, x) such that i belongs to the index set of Family and x belongs to Family[i].</p> <div class="example"><pre> 1> <span class="bold_code">F = sofs:family([{a,[]}, {b,[1]}, {c,[2,3]}]),</span> <span class="bold_code">R = sofs:family_to_relation(F),</span> <span class="bold_code">sofs:to_external(R).</span> [{b,1},{c,2},{c,3}]</pre></div> </p></div> <p><a name="family_union-1"><span class="bold_code">family_union(Family1) -> Family2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 is a <span class="bold_code"><a href="#family">family</a></span> and Family1[i] is a set of sets for each i in the index set of Family1, then Family2 is the family with the same index set as Family1 such that Family2[i] is the <span class="bold_code"><a href="#union_n">union</a></span> of Family1[i].</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:from_term([{a,[[1,2],[2,3]]},{b,[[]]}]),</span> <span class="bold_code">F2 = sofs:family_union(F1),</span> <span class="bold_code">sofs:to_external(F2).</span> [{a,[1,2,3]},{b,[]}]</pre></div> <p><span class="code">family_union(F)</span> is equivalent to <span class="code">family_projection({sofs,union}, F)</span>.</p> </p></div> <p><a name="family_union-2"><span class="bold_code">family_union(Family1, Family2) -> Family3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family1 = Family2 = Family3 = family()</span><br> </div> </div> <div class="REFBODY"><p> <p>If Family1 and Family2 are <span class="bold_code"><a href="#family">families</a></span>, then Family3 is the family such that the index set is the union of Family1's and Family2's index sets, and Family3[i] is the union of Family1[i] and Family2[i] if both maps i, Family1[i] or Family2[i] otherwise.</p> <div class="example"><pre> 1> <span class="bold_code">F1 = sofs:family([{a,[1,2]},{b,[3,4]},{c,[5,6]}]),</span> <span class="bold_code">F2 = sofs:family([{b,[4,5]},{c,[7,8]},{d,[9,10]}]),</span> <span class="bold_code">F3 = sofs:family_union(F1, F2),</span> <span class="bold_code">sofs:to_external(F3).</span> [{a,[1,2]},{b,[3,4,5]},{c,[5,6,7,8]},{d,[9,10]}]</pre></div> </p></div> <p><a name="field-1"><span class="bold_code">field(BinRel) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#field">field</a></span> of the binary relation BinRel.</p> <div class="example"><pre> 1> <span class="bold_code">R = sofs:relation([{1,a},{1,b},{2,b},{2,c}]),</span> <span class="bold_code">S = sofs:field(R),</span> <span class="bold_code">sofs:to_external(S).</span> [1,2,a,b,c]</pre></div> <p><span class="code">field(R)</span> is equivalent to <span class="code">union(domain(R), range(R))</span>.</p> </p></div> <p><a name="from_external-2"><span class="bold_code">from_external(ExternalSet, Type) -> AnySet</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">ExternalSet = external_set()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = type()</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates a set from the <span class="bold_code"><a href="#external_set">external set</a></span> ExternalSet and the <span class="bold_code"><a href="#type">type</a></span> Type. It is assumed that Type is a <span class="bold_code"><a href="#valid_type">valid type</a></span> of ExternalSet.</p> </p></div> <p><a name="from_sets-1"><span class="bold_code">from_sets(ListOfSets) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">ListOfSets = [anyset()]</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#sets_definition">unordered set</a></span> containing the sets of the list ListOfSets.</p> <div class="example"><pre> 1> <span class="bold_code">S1 = sofs:relation([{a,1},{b,2}]),</span> <span class="bold_code">S2 = sofs:relation([{x,3},{y,4}]),</span> <span class="bold_code">S = sofs:from_sets([S1,S2]),</span> <span class="bold_code">sofs:to_external(S).</span> [[{a,1},{b,2}],[{x,3},{y,4}]]</pre></div> </p></div> <p><a name="from_sets-1"><span class="bold_code">from_sets(TupleOfSets) -> Ordset</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Ordset = ordset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">TupleOfSets = tuple-of(anyset())</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#sets_definition">ordered set</a></span> containing the sets of the non-empty tuple TupleOfSets.</p> </p></div> <p><a name="from_term-1"><span class="bold_code">from_term(Term [, Type]) -> AnySet</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Term = term()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = type()</span><br> </div> </div> <div class="REFBODY"><p> <p><a name="from_term"></a>Creates an element of <span class="bold_code"><a href="#sets_definition">Sets</a></span> by traversing the term Term, sorting lists, removing duplicates and deriving or verifying a <span class="bold_code"><a href="#valid_type">valid type</a></span> for the so obtained external set. An explicitly given <span class="bold_code"><a href="#type">type</a></span> Type can be used to limit the depth of the traversal; an atomic type stops the traversal, as demonstrated by this example where "foo" and {"foo"} are left unmodified:</p> <div class="example"><pre> 1> <span class="bold_code">S = sofs:from_term([{{"foo"},[1,1]},{"foo",[2,2]}], [{atom,[atom]}]),</span> <span class="bold_code">sofs:to_external(S).</span> [{{"foo"},[1]},{"foo",[2]}]</pre></div> <p><span class="code">from_term</span> can be used for creating atomic or ordered sets. The only purpose of such a set is that of later building unordered sets since all functions in this module that <strong>do</strong> anything operate on unordered sets. Creating unordered sets from a collection of ordered sets may be the way to go if the ordered sets are big and one does not want to waste heap by rebuilding the elements of the unordered set. An example showing that a set can be built "layer by layer":</p> <div class="example"><pre> 1> <span class="bold_code">A = sofs:from_term(a),</span> <span class="bold_code">S = sofs:set([1,2,3]),</span> <span class="bold_code">P1 = sofs:from_sets({A,S}),</span> <span class="bold_code">P2 = sofs:from_term({b,[6,5,4]}),</span> <span class="bold_code">Ss = sofs:from_sets([P1,P2]),</span> <span class="bold_code">sofs:to_external(Ss).</span> [{a,[1,2,3]},{b,[4,5,6]}]</pre></div> <p>Other functions that create sets are <span class="code">from_external/2</span> and <span class="code">from_sets/1</span>. Special cases of <span class="code">from_term/2</span> are <span class="code">a_function/1,2</span>, <span class="code">empty_set/0</span>, <span class="code">family/1,2</span>, <span class="code">relation/1,2</span>, and <span class="code">set/1,2</span>.</p> </p></div> <p><a name="image-2"><span class="bold_code">image(BinRel, Set1) -> Set2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#image">image</a></span> of the set Set1 under the binary relation BinRel.</p> <div class="example"><pre> 1> <span class="bold_code">R = sofs:relation([{1,a},{2,b},{2,c},{3,d}]),</span> <span class="bold_code">S1 = sofs:set([1,2]),</span> <span class="bold_code">S2 = sofs:image(R, S1),</span> <span class="bold_code">sofs:to_external(S2).</span> [a,b,c]</pre></div> </p></div> <p><a name="intersection-1"><span class="bold_code">intersection(SetOfSets) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">SetOfSets = set_of_sets()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#intersection_n">intersection</a></span> of the set of sets SetOfSets.</p> <p>Intersecting an empty set of sets exits the process with a <span class="code">badarg</span> message.</p> </p></div> <p><a name="intersection-2"><span class="bold_code">intersection(Set1, Set2) -> Set3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#intersection">intersection</a></span> of Set1 and Set2.</p> </p></div> <p><a name="intersection_of_family-1"><span class="bold_code">intersection_of_family(Family) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the intersection of the <span class="bold_code"><a href="#family">family</a></span> Family.</p> <p>Intersecting an empty family exits the process with a <span class="code">badarg</span> message.</p> <div class="example"><pre> 1> <span class="bold_code">F = sofs:family([{a,[0,2,4]},{b,[0,1,2]},{c,[2,3]}]),</span> <span class="bold_code">S = sofs:intersection_of_family(F),</span> <span class="bold_code">sofs:to_external(S).</span> [2]</pre></div> </p></div> <p><a name="inverse-1"><span class="bold_code">inverse(Function1) -> Function2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Function1 = Function2 = function()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#inverse">inverse</a></span> of the function Function1.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,a},{2,b},{3,c}]),</span> <span class="bold_code">R2 = sofs:inverse(R1),</span> <span class="bold_code">sofs:to_external(R2).</span> [{a,1},{b,2},{c,3}]</pre></div> </p></div> <p><a name="inverse_image-2"><span class="bold_code">inverse_image(BinRel, Set1) -> Set2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#inverse_image">inverse image</a></span> of Set1 under the binary relation BinRel.</p> <div class="example"><pre> 1> <span class="bold_code">R = sofs:relation([{1,a},{2,b},{2,c},{3,d}]),</span> <span class="bold_code">S1 = sofs:set([c,d,e]),</span> <span class="bold_code">S2 = sofs:inverse_image(R, S1),</span> <span class="bold_code">sofs:to_external(S2).</span> [2,3]</pre></div> </p></div> <p><a name="is_a_function-1"><span class="bold_code">is_a_function(BinRel) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if the binary relation BinRel is a <span class="bold_code"><a href="#function">function</a></span> or the untyped empty set, <span class="code">false</span> otherwise.</p> </p></div> <p><a name="is_disjoint-2"><span class="bold_code">is_disjoint(Set1, Set2) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if Set1 and Set2 are <span class="bold_code"><a href="#disjoint">disjoint</a></span>, <span class="code">false</span> otherwise.</p> </p></div> <p><a name="is_empty_set-1"><span class="bold_code">is_empty_set(AnySet) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if Set is an empty unordered set, <span class="code">false</span> otherwise.</p> </p></div> <p><a name="is_equal-2"><span class="bold_code">is_equal(AnySet1, AnySet2) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">AnySet1 = AnySet2 = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if the AnySet1 and AnySet2 are <span class="bold_code"><a href="#equal">equal</a></span>, <span class="code">false</span> otherwise. This example shows that <span class="code">==/2</span> is used when comparing sets for equality:</p> <div class="example"><pre> 1> <span class="bold_code">S1 = sofs:set([1.0]),</span> <span class="bold_code">S2 = sofs:set([1]),</span> <span class="bold_code">sofs:is_equal(S1, S2).</span> true</pre></div> </p></div> <p><a name="is_set-1"><span class="bold_code">is_set(AnySet) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if AnySet is an <span class="bold_code"><a href="#sets_definition">unordered set</a></span>, and <span class="code">false</span> if AnySet is an ordered set or an atomic set.</p> </p></div> <p><a name="is_sofs_set-1"><span class="bold_code">is_sofs_set(Term) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Term = term()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if Term is an <span class="bold_code"><a href="#sets_definition">unordered set</a></span>, an ordered set or an atomic set, <span class="code">false</span> otherwise.</p> </p></div> <p><a name="is_subset-2"><span class="bold_code">is_subset(Set1, Set2) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if Set1 is a <span class="bold_code"><a href="#subset">subset</a></span> of Set2, <span class="code">false</span> otherwise.</p> </p></div> <p><a name="is_type-1"><span class="bold_code">is_type(Term) -> Bool</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Bool = bool()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Term = term()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns <span class="code">true</span> if the term Term is a <span class="bold_code"><a href="#type">type</a></span>.</p> </p></div> <p><a name="join-4"><span class="bold_code">join(Relation1, I, Relation2, J) -> Relation3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Relation1 = Relation2 = Relation3 = relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">I = J = integer() > 0</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#natural_join">natural join</a></span> of the relations Relation1 and Relation2 on coordinates I and J.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{a,x,1},{b,y,2}]),</span> <span class="bold_code">R2 = sofs:relation([{1,f,g},{1,h,i},{2,3,4}]),</span> <span class="bold_code">J = sofs:join(R1, 3, R2, 1),</span> <span class="bold_code">sofs:to_external(J).</span> [{a,x,1,f,g},{a,x,1,h,i},{b,y,2,3,4}]</pre></div> </p></div> <p><a name="multiple_relative_product-2"><span class="bold_code">multiple_relative_product(TupleOfBinRels, BinRel1) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">TupleOfBinRels = tuple-of(BinRel)</span><br> </div> <div class="REFTYPES"> <span class="bold_code">BinRel = BinRel1 = BinRel2 = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>If TupleOfBinRels is a non-empty tuple {R[1], ..., R[n]} of binary relations and BinRel1 is a binary relation, then BinRel2 is the <span class="bold_code"><a href="#multiple_relative_product">multiple relative product</a></span> of the ordered set (R[i], ..., R[n]) and BinRel1.</p> <div class="example"><pre> 1> <span class="bold_code">Ri = sofs:relation([{a,1},{b,2},{c,3}]),</span> <span class="bold_code">R = sofs:relation([{a,b},{b,c},{c,a}]),</span> <span class="bold_code">MP = sofs:multiple_relative_product({Ri, Ri}, R),</span> <span class="bold_code">sofs:to_external(sofs:range(MP)).</span> [{1,2},{2,3},{3,1}]</pre></div> </p></div> <p><a name="no_elements-1"><span class="bold_code">no_elements(ASet) -> NoElements</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">ASet = set() | ordset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">NoElements = integer() >= 0 </span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the number of elements of the ordered or unordered set ASet.</p> </p></div> <p><a name="partition-1"><span class="bold_code">partition(SetOfSets) -> Partition</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetOfSets = set_of_sets()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Partition = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#partition">partition</a></span> of the union of the set of sets SetOfSets such that two elements are considered equal if they belong to the same elements of SetOfSets.</p> <div class="example"><pre> 1> <span class="bold_code">Sets1 = sofs:from_term([[a,b,c],[d,e,f],[g,h,i]]),</span> <span class="bold_code">Sets2 = sofs:from_term([[b,c,d],[e,f,g],[h,i,j]]),</span> <span class="bold_code">P = sofs:partition(sofs:union(Sets1, Sets2)),</span> <span class="bold_code">sofs:to_external(P).</span> [[a],[b,c],[d],[e,f],[g],[h,i],[j]]</pre></div> </p></div> <p><a name="partition-2"><span class="bold_code">partition(SetFun, Set) -> Partition</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Partition = set()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#partition">partition</a></span> of Set such that two elements are considered equal if the results of applying SetFun are equal.</p> <div class="example"><pre> 1> <span class="bold_code">Ss = sofs:from_term([[a],[b],[c,d],[e,f]]),</span> <span class="bold_code">SetFun = fun(S) -> sofs:from_term(sofs:no_elements(S)) end,</span> <span class="bold_code">P = sofs:partition(SetFun, Ss),</span> <span class="bold_code">sofs:to_external(P).</span> [[[a],[b]],[[c,d],[e,f]]]</pre></div> </p></div> <p><a name="partition-3"><span class="bold_code">partition(SetFun, Set1, Set2) -> {Set3, Set4}</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = Set4 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns a pair of sets that, regarded as constituting a set, forms a <span class="bold_code"><a href="#partition">partition</a></span> of Set1. If the result of applying SetFun to an element of Set1 yields an element in Set2, the element belongs to Set3, otherwise the element belongs to Set4.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,a},{2,b},{3,c}]),</span> <span class="bold_code">S = sofs:set([2,4,6]),</span> <span class="bold_code">{R2,R3} = sofs:partition(1, R1, S),</span> <span class="bold_code">{sofs:to_external(R2),sofs:to_external(R3)}.</span> {[{2,b}],[{1,a},{3,c}]}</pre></div> <p><span class="code">partition(F, S1, S2)</span> is equivalent to <span class="code">{restriction(F, S1, S2), drestriction(F, S1, S2)}</span>.</p> </p></div> <p><a name="partition_family-2"><span class="bold_code">partition_family(SetFun, Set) -> Family</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#family">family</a></span> Family where the indexed set is a <span class="bold_code"><a href="#partition">partition</a></span> of Set such that two elements are considered equal if the results of applying SetFun are the same value i. This i is the index that Family maps onto the <span class="bold_code"><a href="#equivalence_class">equivalence class</a></span>.</p> <div class="example"><pre> 1> <span class="bold_code">S = sofs:relation([{a,a,a,a},{a,a,b,b},{a,b,b,b}]),</span> <span class="bold_code">SetFun = {external, fun({A,_,C,_}) -> {A,C} end},</span> <span class="bold_code">F = sofs:partition_family(SetFun, S),</span> <span class="bold_code">sofs:to_external(F).</span> [{{a,a},[{a,a,a,a}]},{{a,b},[{a,a,b,b},{a,b,b,b}]}]</pre></div> </p></div> <p><a name="product-1"><span class="bold_code">product(TupleOfSets) -> Relation</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Relation = relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">TupleOfSets = tuple-of(set())</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#Cartesian_product_tuple">Cartesian product</a></span> of the non-empty tuple of sets TupleOfSets. If (x[1], ..., x[n]) is an element of the n-ary relation Relation, then x[i] is drawn from element i of TupleOfSets.</p> <div class="example"><pre> 1> <span class="bold_code">S1 = sofs:set([a,b]),</span> <span class="bold_code">S2 = sofs:set([1,2]),</span> <span class="bold_code">S3 = sofs:set([x,y]),</span> <span class="bold_code">P3 = sofs:product({S1,S2,S3}),</span> <span class="bold_code">sofs:to_external(P3).</span> [{a,1,x},{a,1,y},{a,2,x},{a,2,y},{b,1,x},{b,1,y},{b,2,x},{b,2,y}]</pre></div> </p></div> <p><a name="product-2"><span class="bold_code">product(Set1, Set2) -> BinRel</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#Cartesian_product">Cartesian product</a></span> of Set1 and Set2.</p> <div class="example"><pre> 1> <span class="bold_code">S1 = sofs:set([1,2]),</span> <span class="bold_code">S2 = sofs:set([a,b]),</span> <span class="bold_code">R = sofs:product(S1, S2),</span> <span class="bold_code">sofs:to_external(R).</span> [{1,a},{1,b},{2,a},{2,b}]</pre></div> <p><span class="code">product(S1, S2)</span> is equivalent to <span class="code">product({S1, S2})</span>.</p> </p></div> <p><a name="projection-2"><span class="bold_code">projection(SetFun, Set1) -> Set2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the set created by substituting each element of Set1 by the result of applying SetFun to the element.</p> <p>If SetFun is a number i >= 1 and Set1 is a relation, then the returned set is the <span class="bold_code"><a href="#projection">projection</a></span> of Set1 onto coordinate i.</p> <div class="example"><pre> 1> <span class="bold_code">S1 = sofs:from_term([{1,a},{2,b},{3,a}]),</span> <span class="bold_code">S2 = sofs:projection(2, S1),</span> <span class="bold_code">sofs:to_external(S2).</span> [a,b]</pre></div> </p></div> <p><a name="range-1"><span class="bold_code">range(BinRel) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#range">range</a></span> of the binary relation BinRel.</p> <div class="example"><pre> 1> <span class="bold_code">R = sofs:relation([{1,a},{1,b},{2,b},{2,c}]),</span> <span class="bold_code">S = sofs:range(R),</span> <span class="bold_code">sofs:to_external(S).</span> [a,b,c]</pre></div> </p></div> <p><a name="relation-1"><span class="bold_code">relation(Tuples [, Type]) -> Relation</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">N = integer()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = N | type()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Relation = relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Tuples = [tuple()]</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates a <span class="bold_code"><a href="#relation">relation</a></span>. <span class="code">relation(R, T)</span> is equivalent to <span class="code">from_term(R, T)</span>, if T is a <span class="bold_code"><a href="#type">type</a></span> and the result is a relation. If Type is an integer N, then <span class="code">[{atom, ..., atom}])</span>, where the size of the tuple is N, is used as type of the relation. If no type is explicitly given, the size of the first tuple of Tuples is used if there is such a tuple. <span class="code">relation([])</span> is equivalent to <span class="code">relation([], 2)</span>.</p> </p></div> <p><a name="relation_to_family-1"><span class="bold_code">relation_to_family(BinRel) -> Family</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">BinRel = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#family">family</a></span> Family such that the index set is equal to the <span class="bold_code"><a href="#domain">domain</a></span> of the binary relation BinRel, and Family[i] is the <span class="bold_code"><a href="#image">image</a></span> of the set of i under BinRel.</p> <div class="example"><pre> 1> <span class="bold_code">R = sofs:relation([{b,1},{c,2},{c,3}]),</span> <span class="bold_code">F = sofs:relation_to_family(R),</span> <span class="bold_code">sofs:to_external(F).</span> [{b,[1]},{c,[2,3]}]</pre></div> </p></div> <p><a name="relative_product-1"><span class="bold_code">relative_product(TupleOfBinRels [, BinRel1]) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">TupleOfBinRels = tuple-of(BinRel)</span><br> </div> <div class="REFTYPES"> <span class="bold_code">BinRel = BinRel1 = BinRel2 = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>If TupleOfBinRels is a non-empty tuple {R[1], ..., R[n]} of binary relations and BinRel1 is a binary relation, then BinRel2 is the <span class="bold_code"><a href="#tuple_relative_product">relative product</a></span> of the ordered set (R[i], ..., R[n]) and BinRel1.</p> <p>If BinRel1 is omitted, the relation of equality between the elements of the <span class="bold_code"><a href="#Cartesian_product_tuple">Cartesian product</a></span> of the ranges of R[i], range R[1] × ... × range R[n], is used instead (intuitively, nothing is "lost").</p> <div class="example"><pre> 1> <span class="bold_code">TR = sofs:relation([{1,a},{1,aa},{2,b}]),</span> <span class="bold_code">R1 = sofs:relation([{1,u},{2,v},{3,c}]),</span> <span class="bold_code">R2 = sofs:relative_product({TR, R1}),</span> <span class="bold_code">sofs:to_external(R2).</span> [{1,{a,u}},{1,{aa,u}},{2,{b,v}}]</pre></div> <p>Note that <span class="code">relative_product({R1}, R2)</span> is different from <span class="code">relative_product(R1, R2)</span>; the tuple of one element is not identified with the element itself.</p> </p></div> <p><a name="relative_product-2"><span class="bold_code">relative_product(BinRel1, BinRel2) -> BinRel3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = BinRel3 = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p><a name="relprod_impl"></a>Returns the <span class="bold_code"><a href="#relative_product">relative product</a></span> of the binary relations BinRel1 and BinRel2.</p> </p></div> <p><a name="relative_product1-2"><span class="bold_code">relative_product1(BinRel1, BinRel2) -> BinRel3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = BinRel3 = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#relative_product">relative product</a></span> of the <span class="bold_code"><a href="#converse">converse</a></span> of the binary relation BinRel1 and the binary relation BinRel2.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,a},{1,aa},{2,b}]),</span> <span class="bold_code">R2 = sofs:relation([{1,u},{2,v},{3,c}]),</span> <span class="bold_code">R3 = sofs:relative_product1(R1, R2),</span> <span class="bold_code">sofs:to_external(R3).</span> [{a,u},{aa,u},{b,v}]</pre></div> <p><span class="code">relative_product1(R1, R2)</span> is equivalent to <span class="code">relative_product(converse(R1), R2)</span>.</p> </p></div> <p><a name="restriction-2"><span class="bold_code">restriction(BinRel1, Set) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = binary_relation()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#restriction">restriction</a></span> of the binary relation BinRel1 to Set.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,a},{2,b},{3,c}]),</span> <span class="bold_code">S = sofs:set([1,2,4]),</span> <span class="bold_code">R2 = sofs:restriction(R1, S),</span> <span class="bold_code">sofs:to_external(R2).</span> [{1,a},{2,b}]</pre></div> </p></div> <p><a name="restriction-3"><span class="bold_code">restriction(SetFun, Set1, Set2) -> Set3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns a subset of Set1 containing those elements that yield an element in Set2 as the result of applying SetFun.</p> <div class="example"><pre> 1> <span class="bold_code">S1 = sofs:relation([{1,a},{2,b},{3,c}]),</span> <span class="bold_code">S2 = sofs:set([b,c,d]),</span> <span class="bold_code">S3 = sofs:restriction(2, S1, S2),</span> <span class="bold_code">sofs:to_external(S3).</span> [{2,b},{3,c}]</pre></div> </p></div> <p><a name="set-1"><span class="bold_code">set(Terms [, Type]) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Terms = [term()]</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = type()</span><br> </div> </div> <div class="REFBODY"><p> <p>Creates an <span class="bold_code"><a href="#sets_definition">unordered set</a></span>. <span class="code">set(L, T)</span> is equivalent to <span class="code">from_term(L, T)</span>, if the result is an unordered set. If no <span class="bold_code"><a href="#type">type</a></span> is explicitly given, <span class="code">[atom]</span> is used as type of the set.</p> </p></div> <p><a name="specification-2"><span class="bold_code">specification(Fun, Set1) -> Set2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Fun = spec_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the set containing every element of Set1 for which Fun returns <span class="code">true</span>. If Fun is a tuple <span class="code">{external, Fun2}</span>, Fun2 is applied to the <span class="bold_code"><a href="#external_set">external set</a></span> of each element, otherwise Fun is applied to each element.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{a,1},{b,2}]),</span> <span class="bold_code">R2 = sofs:relation([{x,1},{x,2},{y,3}]),</span> <span class="bold_code">S1 = sofs:from_sets([R1,R2]),</span> <span class="bold_code">S2 = sofs:specification({sofs,is_a_function}, S1),</span> <span class="bold_code">sofs:to_external(S2).</span> [[{a,1},{b,2}]]</pre></div> </p></div> <p><a name="strict_relation-1"><span class="bold_code">strict_relation(BinRel1) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#strict_relation">strict relation</a></span> corresponding to the binary relation BinRel1.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,1},{1,2},{2,1},{2,2}]),</span> <span class="bold_code">R2 = sofs:strict_relation(R1),</span> <span class="bold_code">sofs:to_external(R2).</span> [{1,2},{2,1}]</pre></div> </p></div> <p><a name="substitution-2"><span class="bold_code">substitution(SetFun, Set1) -> Set2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">SetFun = set_fun()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns a function, the domain of which is Set1. The value of an element of the domain is the result of applying SetFun to the element.</p> <div class="example"><pre> 1> <span class="bold_code">L = [{a,1},{b,2}].</span> [{a,1},{b,2}] 2> <span class="bold_code">sofs:to_external(sofs:projection(1,sofs:relation(L))).</span> [a,b] 3> <span class="bold_code">sofs:to_external(sofs:substitution(1,sofs:relation(L))).</span> [{{a,1},a},{{b,2},b}] 4> <span class="bold_code">SetFun = {external, fun({A,_}=E) -> {E,A} end},</span> <span class="bold_code">sofs:to_external(sofs:projection(SetFun,sofs:relation(L))).</span> [{{a,1},a},{{b,2},b}]</pre></div> <p>The relation of equality between the elements of {a,b,c}:</p> <div class="example"><pre> 1> <span class="bold_code">I = sofs:substitution(fun(A) -> A end, sofs:set([a,b,c])),</span> <span class="bold_code">sofs:to_external(I).</span> [{a,a},{b,b},{c,c}]</pre></div> <p>Let SetOfSets be a set of sets and BinRel a binary relation. The function that maps each element Set of SetOfSets onto the <span class="bold_code"><a href="#image">image</a></span> of Set under BinRel is returned by this function:</p> <div class="example"><pre> images(SetOfSets, BinRel) -> Fun = fun(Set) -> sofs:image(BinRel, Set) end, sofs:substitution(Fun, SetOfSets).</pre></div> <p>Here might be the place to reveal something that was more or less stated before, namely that external unordered sets are represented as sorted lists. As a consequence, creating the image of a set under a relation R may traverse all elements of R (to that comes the sorting of results, the image). In <span class="code">images/2</span>, BinRel will be traversed once for each element of SetOfSets, which may take too long. The following efficient function could be used instead under the assumption that the image of each element of SetOfSets under BinRel is non-empty:</p> <div class="example"><pre> images2(SetOfSets, BinRel) -> CR = sofs:canonical_relation(SetOfSets), R = sofs:relative_product1(CR, BinRel), sofs:relation_to_family(R).</pre></div> </p></div> <p><a name="symdiff-2"><span class="bold_code">symdiff(Set1, Set2) -> Set3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#symmetric_difference">symmetric difference</a></span> (or the Boolean sum) of Set1 and Set2.</p> <div class="example"><pre> 1> <span class="bold_code">S1 = sofs:set([1,2,3]),</span> <span class="bold_code">S2 = sofs:set([2,3,4]),</span> <span class="bold_code">P = sofs:symdiff(S1, S2),</span> <span class="bold_code">sofs:to_external(P).</span> [1,4]</pre></div> </p></div> <p><a name="symmetric_partition-2"><span class="bold_code">symmetric_partition(Set1, Set2) -> {Set3, Set4, Set5}</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = Set4 = Set5 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns a triple of sets: Set3 contains the elements of Set1 that do not belong to Set2; Set4 contains the elements of Set1 that belong to Set2; Set5 contains the elements of Set2 that do not belong to Set1.</p> </p></div> <p><a name="to_external-1"><span class="bold_code">to_external(AnySet) -> ExternalSet</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">ExternalSet = external_set()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#external_set">external set</a></span> of an atomic, ordered or unordered set.</p> </p></div> <p><a name="to_sets-1"><span class="bold_code">to_sets(ASet) -> Sets</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">ASet = set() | ordset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Sets = tuple_of(AnySet) | [AnySet]</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the elements of the ordered set ASet as a tuple of sets, and the elements of the unordered set ASet as a sorted list of sets without duplicates.</p> </p></div> <p><a name="type-1"><span class="bold_code">type(AnySet) -> Type</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">AnySet = anyset()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Type = type()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#type">type</a></span> of an atomic, ordered or unordered set.</p> </p></div> <p><a name="union-1"><span class="bold_code">union(SetOfSets) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">SetOfSets = set_of_sets()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#union_n">union</a></span> of the set of sets SetOfSets.</p> </p></div> <p><a name="union-2"><span class="bold_code">union(Set1, Set2) -> Set3</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Set1 = Set2 = Set3 = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the <span class="bold_code"><a href="#union">union</a></span> of Set1 and Set2.</p> </p></div> <p><a name="union_of_family-1"><span class="bold_code">union_of_family(Family) -> Set</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">Family = family()</span><br> </div> <div class="REFTYPES"> <span class="bold_code">Set = set()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns the union of the <span class="bold_code"><a href="#family">family</a></span> Family.</p> <div class="example"><pre> 1> <span class="bold_code">F = sofs:family([{a,[0,2,4]},{b,[0,1,2]},{c,[2,3]}]),</span> <span class="bold_code">S = sofs:union_of_family(F),</span> <span class="bold_code">sofs:to_external(S).</span> [0,1,2,3,4]</pre></div> </p></div> <p><a name="weak_relation-1"><span class="bold_code">weak_relation(BinRel1) -> BinRel2</span></a><br></p> <div class="REFBODY"> <p>Types:</p> <div class="REFTYPES"> <span class="bold_code">BinRel1 = BinRel2 = binary_relation()</span><br> </div> </div> <div class="REFBODY"><p> <p>Returns a subset S of the <span class="bold_code"><a href="#weak_relation">weak relation</a></span> W corresponding to the binary relation BinRel1. Let F be the <span class="bold_code"><a href="#field">field</a></span> of BinRel1. The subset S is defined so that x S y if x W y for some x in F and for some y in F.</p> <div class="example"><pre> 1> <span class="bold_code">R1 = sofs:relation([{1,1},{1,2},{3,1}]),</span> <span class="bold_code">R2 = sofs:weak_relation(R1),</span> <span class="bold_code">sofs:to_external(R2).</span> [{1,1},{1,2},{2,2},{3,1},{3,3}]</pre></div> </p></div> <h3><a name="id2426020">See Also</a></h3> <div class="REFBODY"> <p><span class="bold_code"><a href="dict.html">dict(3)</a></span>, <span class="bold_code"><a href="digraph.html">digraph(3)</a></span>, <span class="bold_code"><a href="orddict.html">orddict(3)</a></span>, <span class="bold_code"><a href="ordsets.html">ordsets(3)</a></span>, <span class="bold_code"><a href="sets.html">sets(3)</a></span></p> </div> </div> <div class="footer"> <hr> <p>Copyright © 1997-2010 Ericsson AB. All Rights Reserved.</p> </div> </div> </div></body> </html>