<!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 -- ets</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.18.3.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.18.3</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="binary " expanded="false">binary<ul>
<li><a href="binary.html">
Top of manual page
</a></li>
<li title="at-2"><a href="binary.html#at-2">at/2</a></li>
<li title="bin_to_list-1"><a href="binary.html#bin_to_list-1">bin_to_list/1</a></li>
<li title="bin_to_list-2"><a href="binary.html#bin_to_list-2">bin_to_list/2</a></li>
<li title="bin_to_list-3"><a href="binary.html#bin_to_list-3">bin_to_list/3</a></li>
<li title="compile_pattern-1"><a href="binary.html#compile_pattern-1">compile_pattern/1</a></li>
<li title="copy-1"><a href="binary.html#copy-1">copy/1</a></li>
<li title="copy-2"><a href="binary.html#copy-2">copy/2</a></li>
<li title="decode_unsigned-1"><a href="binary.html#decode_unsigned-1">decode_unsigned/1</a></li>
<li title="decode_unsigned-2"><a href="binary.html#decode_unsigned-2">decode_unsigned/2</a></li>
<li title="encode_unsigned-1"><a href="binary.html#encode_unsigned-1">encode_unsigned/1</a></li>
<li title="encode_unsigned-2"><a href="binary.html#encode_unsigned-2">encode_unsigned/2</a></li>
<li title="first-1"><a href="binary.html#first-1">first/1</a></li>
<li title="last-1"><a href="binary.html#last-1">last/1</a></li>
<li title="list_to_bin-1"><a href="binary.html#list_to_bin-1">list_to_bin/1</a></li>
<li title="longest_common_prefix-1"><a href="binary.html#longest_common_prefix-1">longest_common_prefix/1</a></li>
<li title="longest_common_suffix-1"><a href="binary.html#longest_common_suffix-1">longest_common_suffix/1</a></li>
<li title="match-2"><a href="binary.html#match-2">match/2</a></li>
<li title="match-3"><a href="binary.html#match-3">match/3</a></li>
<li title="matches-2"><a href="binary.html#matches-2">matches/2</a></li>
<li title="matches-3"><a href="binary.html#matches-3">matches/3</a></li>
<li title="part-2"><a href="binary.html#part-2">part/2</a></li>
<li title="part-3"><a href="binary.html#part-3">part/3</a></li>
<li title="referenced_byte_size-1"><a href="binary.html#referenced_byte_size-1">referenced_byte_size/1</a></li>
<li title="replace-3"><a href="binary.html#replace-3">replace/3</a></li>
<li title="replace-4"><a href="binary.html#replace-4">replace/4</a></li>
<li title="split-2"><a href="binary.html#split-2">split/2</a></li>
<li title="split-3"><a href="binary.html#split-3">split/3</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="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="iso_week_number-0"><a href="calendar.html#iso_week_number-0">iso_week_number/0</a></li>
<li title="iso_week_number-1"><a href="calendar.html#iso_week_number-1">iso_week_number/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="init_table-3"><a href="dets.html#init_table-3">init_table/3</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="table-2"><a href="dets.html#table-2">table/2</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-3"><a href="digraph.html#add_edge-3">add_edge/3</a></li>
<li title="add_edge-4"><a href="digraph.html#add_edge-4">add_edge/4</a></li>
<li title="add_edge-5"><a href="digraph.html#add_edge-5">add_edge/5</a></li>
<li title="add_vertex-1"><a href="digraph.html#add_vertex-1">add_vertex/1</a></li>
<li title="add_vertex-2"><a href="digraph.html#add_vertex-2">add_vertex/2</a></li>
<li title="add_vertex-3"><a href="digraph.html#add_vertex-3">add_vertex/3</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="subgraph-3"><a href="digraph_utils.html#subgraph-3">subgraph/3</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>
<li title="format_error-1"><a href="epp.html#format_error-1">format_error/1</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="loadscrollpos" title="ets " expanded="true">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_count-2"><a href="ets.html#select_count-2">select_count/2</a></li>
<li title="select_delete-2"><a href="ets.html#select_delete-2">select_delete/2</a></li>
<li title="select_reverse-2"><a href="ets.html#select_reverse-2">select_reverse/2</a></li>
<li title="select_reverse-3"><a href="ets.html#select_reverse-3">select_reverse/3</a></li>
<li title="select_reverse-1"><a href="ets.html#select_reverse-1">select_reverse/1</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="table-2"><a href="ets.html#table-2">table/2</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="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="lookup-2"><a href="gb_trees.html#lookup-2">lookup/2</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>
<li title="Module:format_status-2"><a href="gen_event.html#Module:format_status-2">Module:format_status/2</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-0"><a href="io.html#columns-0">columns/0</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="put_chars-2"><a href="io.html#put_chars-2">put_chars/2</a></li>
<li title="nl-0"><a href="io.html#nl-0">nl/0</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_chars-3"><a href="io.html#get_chars-3">get_chars/3</a></li>
<li title="get_line-1"><a href="io.html#get_line-1">get_line/1</a></li>
<li title="get_line-2"><a href="io.html#get_line-2">get_line/2</a></li>
<li title="getopts-0"><a href="io.html#getopts-0">getopts/0</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="setopts-2"><a href="io.html#setopts-2">setopts/2</a></li>
<li title="write-1"><a href="io.html#write-1">write/1</a></li>
<li title="write-2"><a href="io.html#write-2">write/2</a></li>
<li title="read-1"><a href="io.html#read-1">read/1</a></li>
<li title="read-2"><a href="io.html#read-2">read/2</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="fwrite-3"><a href="io.html#fwrite-3">fwrite/3</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="format-3"><a href="io.html#format-3">format/3</a></li>
<li title="fread-2"><a href="io.html#fread-2">fread/2</a></li>
<li title="fread-3"><a href="io.html#fread-3">fread/3</a></li>
<li title="rows-0"><a href="io.html#rows-0">rows/0</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_exprs-3"><a href="io.html#scan_erl_exprs-3">scan_erl_exprs/3</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="scan_erl_form-3"><a href="io.html#scan_erl_form-3">scan_erl_form/3</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_exprs-3"><a href="io.html#parse_erl_exprs-3">parse_erl_exprs/3</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>
<li title="parse_erl_form-3"><a href="io.html#parse_erl_form-3">parse_erl_form/3</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-1"><a href="proc_lib.html#init_ack-1">init_ack/1</a></li>
<li title="init_ack-2"><a href="proc_lib.html#init_ack-2">init_ack/2</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="cursor-2"><a href="qlc.html#cursor-2">cursor/2</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="eval-2"><a href="qlc.html#eval-2">eval/2</a></li>
<li title="e-1"><a href="qlc.html#e-1">e/1</a></li>
<li title="e-2"><a href="qlc.html#e-2">e/2</a></li>
<li title="fold-3"><a href="qlc.html#fold-3">fold/3</a></li>
<li title="fold-4"><a href="qlc.html#fold-4">fold/4</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="info-2"><a href="qlc.html#info-2">info/2</a></li>
<li title="keysort-2"><a href="qlc.html#keysort-2">keysort/2</a></li>
<li title="keysort-3"><a href="qlc.html#keysort-3">keysort/3</a></li>
<li title="next_answers-1"><a href="qlc.html#next_answers-1">next_answers/1</a></li>
<li title="next_answers-2"><a href="qlc.html#next_answers-2">next_answers/2</a></li>
<li title="q-1"><a href="qlc.html#q-1">q/1</a></li>
<li title="q-2"><a href="qlc.html#q-2">q/2</a></li>
<li title="sort-1"><a href="qlc.html#sort-1">sort/1</a></li>
<li title="sort-2"><a href="qlc.html#sort-2">sort/2</a></li>
<li title="string_to_handle-1"><a href="qlc.html#string_to_handle-1">string_to_handle/1</a></li>
<li title="string_to_handle-2"><a href="qlc.html#string_to_handle-2">string_to_handle/2</a></li>
<li title="string_to_handle-3"><a href="qlc.html#string_to_handle-3">string_to_handle/3</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="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="no" title="sofs " expanded="false">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="a_function-2"><a href="sofs.html#a_function-2">a_function/2</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="digraph_to_family-2"><a href="sofs.html#digraph_to_family-2">digraph_to_family/2</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-2"><a href="sofs.html#family-2">family/2</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_digraph-2"><a href="sofs.html#family_to_digraph-2">family_to_digraph/2</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_term-1"><a href="sofs.html#from_term-1">from_term/1</a></li>
<li title="from_term-2"><a href="sofs.html#from_term-2">from_term/2</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-2"><a href="sofs.html#relation-2">relation/2</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="set-2"><a href="sofs.html#set-2">set/2</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_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-2"><a href="timer.html#send_after-2">send_after/2</a></li>
<li title="send_after-3"><a href="timer.html#send_after-3">send_after/3</a></li>
<li title="kill_after-1"><a href="timer.html#kill_after-1">kill_after/1</a></li>
<li title="kill_after-2"><a href="timer.html#kill_after-2">kill_after/2</a></li>
<li title="exit_after-2"><a href="timer.html#exit_after-2">exit_after/2</a></li>
<li title="exit_after-3"><a href="timer.html#exit_after-3">exit_after/3</a></li>
<li title="apply_interval-4"><a href="timer.html#apply_interval-4">apply_interval/4</a></li>
<li title="send_interval-2"><a href="timer.html#send_interval-2">send_interval/2</a></li>
<li title="send_interval-3"><a href="timer.html#send_interval-3">send_interval/3</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-1"><a href="timer.html#tc-1">tc/1</a></li>
<li title="tc-2"><a href="timer.html#tc-2">tc/2</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="foldl-3"><a href="zip.html#foldl-3">foldl/3</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>ets</h1></center>
<h3>MODULE</h3>
<div class="REFBODY">ets</div>
<h3>MODULE SUMMARY</h3>
<div class="REFBODY">Built-In Term Storage</div>
<h3>DESCRIPTION</h3>
<div class="REFBODY"><p>
<p>This module is an interface to the Erlang built-in term storage
BIFs. These provide the ability to store very large quantities of
data in an Erlang runtime system, and to have constant access
time to the data. (In the case of <span class="code">ordered_set</span>, see below,
access time is proportional to the logarithm of the number of
objects stored).</p>
<p>Data is organized as a set of dynamic tables, which can store
tuples. Each table is created by a process. When the process
terminates, the table is automatically destroyed. Every table has
access rights set at creation.</p>
<p>Tables are divided into four different types, <span class="code">set</span>,
<span class="code">ordered_set</span>, <span class="code">bag</span> and <span class="code">duplicate_bag</span>.
A <span class="code">set</span> or <span class="code">ordered_set</span> table can only have one object
associated with each key. A <span class="code">bag</span> or <span class="code">duplicate_bag</span> can
have many objects associated with each key.</p>
<p>The number of tables stored at one Erlang node is limited.
The current default limit is approximately 1400 tables. The upper
limit can be increased by setting the environment variable
<span class="code">ERL_MAX_ETS_TABLES</span> before starting the Erlang runtime
system (i.e. with the <span class="code">-env</span> option to
<span class="code">erl</span>/<span class="code">werl</span>). The actual limit may be slightly higher
than the one specified, but never lower.</p>
<p>Note that there is no automatic garbage collection for tables.
Even if there are no references to a table from any process, it
will not automatically be destroyed unless the owner process
terminates. It can be destroyed explicitly by using
<span class="code">delete/1</span>. The default owner is the process that created the
table. Table ownership can be transferred at process termination
by using the <span class="bold_code"><a href="#heir">heir</a></span> option or explicitly
by calling <span class="bold_code"><a href="#give_away-3">give_away/3</a></span>.</p>
<p>Some implementation details:</p>
<ul>
<li>In the current implementation, every object insert and
look-up operation results in a copy of the object.</li>
<li>
<span class="code">'$end_of_table'</span> should not be used as a key since
this atom is used to mark the end of the table when using
<span class="code">first</span>/<span class="code">next</span>.</li>
</ul>
<p>Also worth noting is the subtle difference between
<strong>matching</strong> and <strong>comparing equal</strong>, which is
demonstrated by the different table types <span class="code">set</span> and
<span class="code">ordered_set</span>. Two Erlang terms <span class="code">match</span> if they are of
the same type and have the same value, so that <span class="code">1</span> matches
<span class="code">1</span>, but not <span class="code">1.0</span> (as <span class="code">1.0</span> is a <span class="code">float()</span>
and not an <span class="code">integer()</span>). Two Erlang terms <strong>compare equal</strong> if they either are of the same type and value, or if
both are numeric types and extend to the same value, so that
<span class="code">1</span> compares equal to both <span class="code">1</span> and <span class="code">1.0</span>. The
<span class="code">ordered_set</span> works on the <strong>Erlang term order</strong> and
there is no defined order between an <span class="code">integer()</span> and a
<span class="code">float()</span> that extends to the same value, hence the key
<span class="code">1</span> and the key <span class="code">1.0</span> are regarded as equal in an
<span class="code">ordered_set</span> table.</p>
</p></div>
<h3><a name="id168152">Failure</a></h3>
<div class="REFBODY">
<p>In general, the functions below will exit with reason
<span class="code">badarg</span> if any argument is of the wrong format, if the
table identifier is invalid or if the operation is denied due to
table access rights (<span class="bold_code"><a href="#protected">protected</a></span>
or <span class="bold_code"><a href="#private">private</a></span>).</p>
</div>
<h3><a name="id168184">Concurrency</a></h3>
<div class="REFBODY">
<a name="concurrency"></a>
<p>This module provides some limited support for concurrent access.
All updates to single objects are guaranteed to be both <strong>atomic</strong>
and <strong>isolated</strong>. This means that an updating operation towards
a single object will either succeed or fail completely without any
effect at all (atomicy).
Nor can any intermediate results of the update be seen by other
processes (isolation). Some functions that update several objects
state that they even guarantee atomicy and isolation for the entire
operation. In database terms the isolation level can be seen as
"serializable", as if all isolated operations were carried out serially,
one after the other in a strict order.</p>
<p>No other support is available within ETS that would guarantee
consistency between objects. However, the <span class="code">safe_fixtable/2</span>
function can be used to guarantee that a sequence of
<span class="code">first/1</span> and <span class="code">next/2</span> calls will traverse the table
without errors and that each existing object in the table is visited
exactly once, even if another process (or the same process)
simultaneously deletes or inserts objects into the table.
Nothing more is guaranteed; in particular objects that are inserted
or deleted during such a traversal may be visited once or not at all.
Functions that internally traverse over a table, like <span class="code">select</span>
and <span class="code">match</span>, will give the same guarantee as <span class="code">safe_fixtable</span>.</p>
</div>
<h3><a name="id168244">Match Specifications</a></h3>
<div class="REFBODY">
<a name="match_spec"></a>
<p>Some of the functions uses a <strong>match specification</strong>,
match_spec. A brief explanation is given in
<span class="bold_code"><a href="#select-2">select/2</a></span>. For a detailed
description, see the chapter "Match specifications in Erlang" in
<strong>ERTS User's Guide</strong>.</p>
</div>
<h3>DATA TYPES</h3>
<p><span class="bold_code"><a name="type-continuation">continuation()</a></span></p>
<div class="REFBODY"><p>
<p>Opaque continuation used by <span class="bold_code"><a href="#select-1">
<span class="code">select/1</span></a></span> and <span class="bold_code"><a href="#select-3">
<span class="code">select/3</span></a></span>.</p>
</p></div>
<p>
<span class="bold_code"><a name="type-match_spec">match_spec()</a> = [{<span class="bold_code"><a href="#type-match_pattern">match_pattern()</a></span>, [term()], [term()]}]</span><br></p>
<div class="REFBODY"><p><p>A match specification, see above.</p></p></div>
<p>
<span class="bold_code"><a name="type-match_pattern">match_pattern()</a> = atom() | tuple()</span><br></p>
<p>
<span class="bold_code"><a name="type-tab">tab()</a> = atom() | <span class="bold_code"><a href="#type-tid">tid()</a></span></span><br></p>
<p>
<span class="bold_code"><a name="type-tid">tid()</a></span><br></p>
<div class="REFBODY"><p><p>A table identifier, as returned by new/2.</p></p></div>
<h3>EXPORTS</h3>
<p><a name="all-0"><span class="bold_code">all() -> [Tab]</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns a list of all tables at the node. Named tables are
given by their names, unnamed tables are given by their
table identifiers.</p>
</p></div>
<p><a name="delete-1"><span class="bold_code">delete(Tab) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Deletes the entire table <span class="code">Tab</span>.</p>
</p></div>
<p><a name="delete-2"><span class="bold_code">delete(Tab, Key) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Deletes all objects with the key <span class="code">Key</span> from the table
<span class="code">Tab</span>.</p>
</p></div>
<p><a name="delete_all_objects-1"><span class="bold_code">delete_all_objects(Tab) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Delete all objects in the ETS table <span class="code">Tab</span>.
The operation is guaranteed to be
<span class="bold_code"><a href="#concurrency">atomic and isolated</a></span>.</p>
</p></div>
<p><a name="delete_object-2"><span class="bold_code">delete_object(Tab,Object) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Object = tuple()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Delete the exact object <span class="code">Object</span> from the ETS table,
leaving objects with the same key but other differences
(useful for type <span class="code">bag</span>). In a <span class="code">duplicate_bag</span>, all
instances of the object will be deleted.</p>
</p></div>
<p><a name="file2tab-1"></a><span class="bold_code">file2tab(Filename) -> {ok, Tab} | {error, Reason}</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Filename = <span class="bold_code"><a href="javascript:erlhref('../../../../doc/../','kernel','file.html#type-name');">file:name()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Reason = term()</span></div>
</div></p>
<div class="REFBODY"><p>
<p>Reads a file produced by <span class="bold_code"><a href="#tab2file-2">tab2file/2</a></span> or
<span class="bold_code"><a href="#tab2file-3">tab2file/3</a></span> and creates the
corresponding table <span class="code">Tab</span>.</p>
<p>Equivalent to <span class="code">file2tab(Filename, [])</span>.</p>
</p></div>
<p><a name="file2tab-2"></a><span class="bold_code">file2tab(Filename, Options) -> {ok, Tab} | {error, Reason}</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Filename = <span class="bold_code"><a href="javascript:erlhref('../../../../doc/../','kernel','file.html#type-name');">file:name()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Options = [Option]</span></div>
<div class="REFTYPES"><span class="bold_code">Option = {verify, boolean()}</span></div>
<div class="REFTYPES"><span class="bold_code">Reason = term()</span></div>
</div></p>
<div class="REFBODY"><p>
<p>Reads a file produced by <span class="bold_code"><a href="#tab2file-2">tab2file/2</a></span> or
<span class="bold_code"><a href="#tab2file-3">tab2file/3</a></span> and creates the
corresponding table <span class="code">Tab</span>.</p>
<p>The currently only supported option is <span class="code">{verify,boolean()}</span>. If
verification is turned on (by means of specifying
<span class="code">{verify,true}</span>), the function utilizes whatever
information is present in the file to assert that the
information is not damaged. How this is done depends on which
<span class="code">extended_info</span> was written using
<span class="bold_code"><a href="#tab2file-3">tab2file/3</a></span>.</p>
<p>If no <span class="code">extended_info</span> is present in the file and
<span class="code">{verify,true}</span> is specified, the number of objects
written is compared to the size of the original table when the
dump was started. This might make verification fail if the
table was
<span class="code">public</span> and objects were added or removed while the
table was dumped to file. To avoid this type of problems,
either do not verify files dumped while updated simultaneously
or use the <span class="code">{extended_info, [object_count]}</span> option to
<span class="bold_code"><a href="#tab2file-3">tab2file/3</a></span>, which
extends the information in the file with the number of objects
actually written.</p>
<p>If verification is turned on and the file was written with
the option <span class="code">{extended_info, [md5sum]}</span>, reading the file
is slower and consumes radically more CPU time than
otherwise.</p>
<p><span class="code">{verify,false}</span> is the default.</p>
</p></div>
<p><a name="first-1"><span class="bold_code">first(Tab) -> Key | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns the first key <span class="code">Key</span> in the table <span class="code">Tab</span>.
If the table is of the <span class="code">ordered_set</span> type, the first key
in Erlang term order will be returned. If the table is of any
other type, the first key according to the table's internal
order will be returned. If the table is empty,
<span class="code">'$end_of_table'</span> will be returned.</p>
<p>Use <span class="code">next/2</span> to find subsequent keys in the table.</p>
</p></div>
<p><a name="foldl-3"></a><span class="bold_code">foldl(Function, Acc0, Tab) -> Acc1</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Function = fun((Element :: term(), AccIn) -> AccOut)</span></div>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Acc0 = Acc1 = AccIn = AccOut = term()</span></div>
<div class="REFTYPES"><span class="bold_code"></span></div>
<div class="REFTYPES"><span class="bold_code"></span></div>
<div class="REFTYPES"><span class="bold_code"></span></div>
</div></p>
<div class="REFBODY"><p>
<p><span class="code">Acc0</span> is returned if the table is empty.
This function is similar to <span class="code">lists:foldl/3</span>. The order in
which the elements of the table are traversed is unspecified,
except for tables of type <span class="code">ordered_set</span>, for which they
are traversed first to last.</p>
<p>If <span class="code">Function</span> inserts objects into the table, or another
process inserts objects into the table, those objects <strong>may</strong>
(depending on key ordering) be included in the traversal.</p>
</p></div>
<p><a name="foldr-3"></a><span class="bold_code">foldr(Function, Acc0, Tab) -> Acc1</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Function = fun((Element :: term(), AccIn) -> AccOut)</span></div>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Acc0 = Acc1 = AccIn = AccOut = term()</span></div>
<div class="REFTYPES"><span class="bold_code"></span></div>
<div class="REFTYPES"><span class="bold_code"></span></div>
<div class="REFTYPES"><span class="bold_code"></span></div>
</div></p>
<div class="REFBODY"><p>
<p><span class="code">Acc0</span> is returned if the table is empty.
This function is similar to <span class="code">lists:foldr/3</span>. The order in
which the elements of the table are traversed is unspecified,
except for tables of type <span class="code">ordered_set</span>, for which they
are traversed last to first.</p>
<p>If <span class="code">Function</span> inserts objects into the table, or another
process inserts objects into the table, those objects <strong>may</strong>
(depending on key ordering) be included in the traversal.</p>
</p></div>
<p><a name="from_dets-2"></a><span class="bold_code">from_dets(Tab, DetsTab) -> true</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">DetsTab = <span class="bold_code"><a href="dets.html#type-tab_name">dets:tab_name()</a></span></span></div>
</div></p>
<div class="REFBODY"><p>
<p>Fills an already created ETS table with the objects in the
already opened Dets table named <span class="code">DetsTab</span>. The existing
objects of the ETS table are kept unless overwritten.</p>
<p>Throws a badarg error if any of the tables does not exist or the
dets table is not open.</p>
</p></div>
<p><a name="fun2ms-1"></a><span class="bold_code">fun2ms(LiteralFun) -> MatchSpec</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">LiteralFun = function()</span></div>
<div class="REFTYPES"><span class="bold_code">MatchSpec = <span class="bold_code"><a href="#type-match_spec">match_spec()</a></span></span></div>
</div></p>
<div class="REFBODY"><p>
<p>Pseudo function that by means of a <span class="code">parse_transform</span>
translates <span class="code">LiteralFun</span> typed as parameter in the
function call to a
<span class="bold_code"><a href="#match_spec">match_spec</a></span>. With
"literal" is meant that the fun needs to textually be written
as the parameter of the function, it cannot be held in a
variable which in turn is passed to the function).</p>
<p>The parse transform is implemented in the module
<span class="code">ms_transform</span> and the source <strong>must</strong> include the
file <span class="code">ms_transform.hrl</span> in STDLIB for this
pseudo function to work. Failing to include the hrl file in
the source will result in a runtime error, not a compile
time ditto. The include file is easiest included by adding
the line
<span class="code">-include_lib("stdlib/include/ms_transform.hrl").</span> to
the source file.</p>
<p>The fun is very restricted, it can take only a single
parameter (the object to match): a sole variable or a
tuple. It needs to use the <span class="code">is_</span>XXX guard tests.
Language constructs that have no representation
in a match_spec (like <span class="code">if</span>, <span class="code">case</span>, <span class="code">receive</span>
etc) are not allowed.</p>
<p>The return value is the resulting match_spec.</p>
<p>Example:</p>
<div class="example"><pre>
1> <span class="bold_code">ets:fun2ms(fun({M,N}) when N > 3 -> M end).</span>
[{{'$1','$2'},[{'>','$2',3}],['$1']}]</pre></div>
<p>Variables from the environment can be imported, so that this
works:</p>
<div class="example"><pre>
2> <span class="bold_code">X=3.</span>
3
3> <span class="bold_code">ets:fun2ms(fun({M,N}) when N > X -> M end).</span>
[{{'$1','$2'},[{'>','$2',{const,3}}],['$1']}]</pre></div>
<p>The imported variables will be replaced by match_spec
<span class="code">const</span> expressions, which is consistent with the
static scoping for Erlang funs. Local or global function
calls can not be in the guard or body of the fun however.
Calls to builtin match_spec functions of course is allowed:</p>
<div class="example"><pre>
4> <span class="bold_code">ets:fun2ms(fun({M,N}) when N > X, is_atomm(M) -> M end).</span>
Error: fun containing local Erlang function calls
('is_atomm' called in guard) cannot be translated into match_spec
{error,transform_error}
5> <span class="bold_code">ets:fun2ms(fun({M,N}) when N > X, is_atom(M) -> M end).</span>
[{{'$1','$2'},[{'>','$2',{const,3}},{is_atom,'$1'}],['$1']}]</pre></div>
<p>As can be seen by the example, the function can be called
from the shell too. The fun needs to be literally in the call
when used from the shell as well. Other means than the
parse_transform are used in the shell case, but more or less
the same restrictions apply (the exception being records,
as they are not handled by the shell).</p>
<div class="warning">
<div class="label">Warning</div>
<div class="content"><p>
<p>If the parse_transform is not applied to a module which
calls this pseudo function, the call will fail in runtime
(with a <span class="code">badarg</span>). The module <span class="code">ets</span> actually
exports a function with this name, but it should never
really be called except for when using the function in the
shell. If the <span class="code">parse_transform</span> is properly applied by
including the <span class="code">ms_transform.hrl</span> header file, compiled
code will never call the function, but the function call is
replaced by a literal match_spec.</p>
</p></div>
</div>
<p>For more information, see
<span class="bold_code"><a href="ms_transform.html#top">ms_transform(3)</a></span>.</p>
</p></div>
<p><a name="give_away-3"><span class="bold_code">give_away(Tab, Pid, GiftData) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pid = pid()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">GiftData = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Make process <span class="code">Pid</span> the new owner of table <span class="code">Tab</span>.
If successful, the message
<span class="code">{'ETS-TRANSFER',Tab,FromPid,GiftData}</span> will be sent
to the new owner.</p>
<p>The process <span class="code">Pid</span> must be alive, local and not already the
owner of the table. The calling process must be the table owner.</p>
<p>Note that <span class="code">give_away</span> does not at all affect the
<span class="bold_code"><a href="#heir">heir</a></span> option of the table. A table
owner can for example set the <span class="code">heir</span> to itself, give the table
away and then get it back in case the receiver terminates.</p>
</p></div>
<p><a name="i-0"></a><span class="bold_code">i() -> ok</span><br></p>
<div class="REFBODY"><p>
<p>Displays information about all ETS tables on tty.</p>
</p></div>
<p><a name="i-1"></a><span class="bold_code">i(Tab) -> ok</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
</div></p>
<div class="REFBODY"><p>
<p>Browses the table <span class="code">Tab</span> on tty.</p>
</p></div>
<p><a name="info-1"><span class="bold_code">info(Tab) -> [{Item, Value}] | undefined</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Item = atom(), see below</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Value = term(), see below</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns information about the table <span class="code">Tab</span> as a list of
<span class="code">{Item, Value}</span> tuples. If <span class="code">Tab</span> has the correct type
for a table identifier, but does not refer to an existing ETS
table, <span class="code">undefined</span> is returned. If <span class="code">Tab</span> is not of the
correct type, this function fails with reason <span class="code">badarg</span>.</p>
<ul>
<li>
<span class="code">Item=memory, Value=integer()</span> <br>
The number of words allocated to the table.</li>
<li>
<span class="code">Item=owner, Value=pid()</span> <br>
The pid of the owner of the table.</li>
<li>
<span class="code">Item=heir, Value=pid()|none</span> <br>
The pid of the heir of the table, or <span class="code">none</span> if no heir is set.</li>
<li>
<span class="code">Item=name, Value=atom()</span> <br>
The name of the table.</li>
<li>
<span class="code">Item=size, Value=integer()</span> <br>
The number of objects inserted in the table.</li>
<li>
<span class="code">Item=node, Value=atom()</span> <br>
The node where the table is stored. This field is no longer
meaningful as tables cannot be accessed from other nodes.</li>
<li>
<span class="code">Item=named_table, Value=true|false</span> <br>
Indicates if the table is named or not.</li>
<li>
<span class="code">Item=type, Value=set|ordered_set|bag|duplicate_bag</span> <br>
The table type.</li>
<li>
<span class="code">Item=keypos, Value=integer()</span> <br>
The key position.</li>
<li>
<span class="code">Item=protection, Value=public|protected|private</span> <br>
The table access rights.</li>
<li>
<span class="code">Item=compressed, Value=true|false</span> <br>
Indicates if the table is compressed or not.</li>
</ul>
</p></div>
<p><a name="info-2"><span class="bold_code">info(Tab, Item) -> Value | undefined</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Item, Value - see below</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns the information associated with <span class="code">Item</span> for
the table <span class="code">Tab</span>, or returns <span class="code">undefined</span> if <span class="code">Tab</span>
does not refer an existing ETS table.
If <span class="code">Tab</span> is not of the correct type, or if <span class="code">Item</span> is not
one of the allowed values, this function fails with reason <span class="code">badarg</span>.</p>
<div class="warning">
<div class="label">Warning</div>
<div class="content"><p><p>In R11B and earlier, this function would not fail but return
<span class="code">undefined</span> for invalid values for <span class="code">Item</span>.</p>
</p></div>
</div>
<p>In addition to the <span class="code">{Item,Value}</span>
pairs defined for <span class="code">info/1</span>, the following items are
allowed:</p>
<ul>
<li>
<span class="code">Item=fixed, Value=true|false</span> <br>
Indicates if the table is fixed by any process or not.</li>
<li>
<p><span class="code">Item=safe_fixed, Value={FirstFixed,Info}|false</span> <br>
</p>
<p>If the table has been fixed using <span class="code">safe_fixtable/2</span>,
the call returns a tuple where <span class="code">FirstFixed</span> is the
time when the table was first fixed by a process, which
may or may not be one of the processes it is fixed by
right now.</p>
<p><span class="code">Info</span> is a possibly empty lists of tuples
<span class="code">{Pid,RefCount}</span>, one tuple for every process the
table is fixed by right now. <span class="code">RefCount</span> is the value
of the reference counter, keeping track of how many times
the table has been fixed by the process.</p>
<p>If the table never has been fixed, the call returns
<span class="code">false</span>.</p>
</li>
<li><p><span class="code">Item=stats, Value=tuple()</span> <br>
Returns internal statistics about set, bag and duplicate_bag tables on an internal format used by OTP test suites.
Not for production use.</p></li>
</ul>
</p></div>
<p><a name="init_table-2"></a><span class="bold_code">init_table(Tab, InitFun) -> true</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">InitFun = fun((Arg) -> Res)</span></div>
<div class="REFTYPES"><span class="bold_code">Arg = read | close</span></div>
<div class="REFTYPES"><span class="bold_code">Res = end_of_input | {Objects :: [term()], InitFun} | term()</span></div>
</div></p>
<div class="REFBODY"><p>
<p>Replaces the existing objects of the table <span class="code">Tab</span> with
objects created by calling the input function <span class="code">InitFun</span>,
see below. This function is provided for compatibility with
the <span class="code">dets</span> module, it is not more efficient than filling
a table by using <span class="code">ets:insert/2</span>.
</p>
<p>When called with the argument <span class="code">read</span> the function
<span class="code">InitFun</span> is assumed to return <span class="code">end_of_input</span> when
there is no more input, or <span class="code">{Objects, Fun}</span>, where
<span class="code">Objects</span> is a list of objects and <span class="code">Fun</span> is a new
input function. Any other value Value is returned as an error
<span class="code">{error, {init_fun, Value}}</span>. Each input function will be
called exactly once, and should an error occur, the last
function is called with the argument <span class="code">close</span>, the reply
of which is ignored.</p>
<p>If the type of the table is <span class="code">set</span> and there is more
than one object with a given key, one of the objects is
chosen. This is not necessarily the last object with the given
key in the sequence of objects returned by the input
functions. This holds also for duplicated
objects stored in tables of type <span class="code">bag</span>.</p>
</p></div>
<p><a name="insert-2"><span class="bold_code">insert(Tab, ObjectOrObjects) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">ObjectOrObjects = tuple() | [tuple()]</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Inserts the object or all of the objects in the list
<span class="code">ObjectOrObjects</span> into the table <span class="code">Tab</span>.
If the table is a <span class="code">set</span> and the key of the inserted
objects <strong>matches</strong> the key of any object in the table,
the old object will be replaced. If the table is an
<span class="code">ordered_set</span> and the key of the inserted object
<strong>compares equal</strong> to the key of any object in the
table, the old object is also replaced. If the list contains
more than one object with <strong>matching</strong> keys and the table is a
<span class="code">set</span>, one will be inserted, which one is
not defined. The same thing holds for <span class="code">ordered_set</span>, but
will also happen if the keys <strong>compare equal</strong>.</p>
<p>The entire operation is guaranteed to be
<span class="bold_code"><a href="#concurrency">atomic and isolated</a></span>,
even when a list of objects is inserted.</p>
</p></div>
<p><a name="insert_new-2"><span class="bold_code">insert_new(Tab, ObjectOrObjects) -> boolean()</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">ObjectOrObjects = tuple() | [tuple()]</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>This function works exactly like <span class="code">insert/2</span>, with the
exception that instead of overwriting objects with the same
key (in the case of <span class="code">set</span> or <span class="code">ordered_set</span>) or
adding more objects with keys already existing in the table
(in the case of <span class="code">bag</span> and <span class="code">duplicate_bag</span>), it
simply returns <span class="code">false</span>. If <span class="code">ObjectOrObjects</span> is a
list, the function checks <strong>every</strong> key prior to
inserting anything. Nothing will be inserted if not
<strong>all</strong> keys present in the list are absent from the
table. Like <span class="code">insert/2</span>, the entire operation is guaranteed to be
<span class="bold_code"><a href="#concurrency">atomic and isolated</a></span>.</p>
</p></div>
<p><a name="is_compiled_ms-1"><span class="bold_code">is_compiled_ms(Term) -> boolean()</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Term = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>This function is used to check if a term is a valid
compiled <span class="bold_code"><a href="#match_spec">match_spec</a></span>.
The compiled match_spec is an opaque datatype which can
<strong>not</strong> be sent between Erlang nodes nor be stored on
disk. Any attempt to create an external representation of a
compiled match_spec will result in an empty binary
(<span class="code"><<>></span>). As an example, the following
expression:</p>
<div class="example"><pre>
ets:is_compiled_ms(ets:match_spec_compile([{'_',[],[true]}])).</pre></div>
<p>will yield <span class="code">true</span>, while the following expressions:</p>
<div class="example"><pre>
MS = ets:match_spec_compile([{'_',[],[true]}]),
Broken = binary_to_term(term_to_binary(MS)),
ets:is_compiled_ms(Broken).</pre></div>
<p>will yield false, as the variable <span class="code">Broken</span> will contain
a compiled match_spec that has passed through external
representation.</p>
<div class="note">
<div class="label">Note</div>
<div class="content"><p>
<p>The fact that compiled match_specs has no external
representation is for performance reasons. It may be subject
to change in future releases, while this interface will
still remain for backward compatibility reasons.</p>
</p></div>
</div>
</p></div>
<p><a name="last-1"><span class="bold_code">last(Tab) -> Key | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns the last key <span class="code">Key</span> according to Erlang term
order in the table <span class="code">Tab</span> of the <span class="code">ordered_set</span> type.
If the table is of any other type, the function is synonymous
to <span class="code">first/2</span>. If the table is empty,
<span class="code">'$end_of_table'</span> is returned.</p>
<p>Use <span class="code">prev/2</span> to find preceding keys in the table.</p>
</p></div>
<p><a name="lookup-2"><span class="bold_code">lookup(Tab, Key) -> [Object]</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Object = tuple()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns a list of all objects with the key <span class="code">Key</span> in
the table <span class="code">Tab</span>.</p>
<p>In the case of <span class="code">set, bag and duplicate_bag</span>, an object
is returned only if the given key <strong>matches</strong> the key
of the object in the table. If the table is an
<span class="code">ordered_set</span> however, an object is returned if the key
given <strong>compares equal</strong> to the key of an object in the
table. The difference being the same as between <span class="code">=:=</span>
and <span class="code">==</span>. As an example, one might insert an object
with the
<span class="code">integer()</span> <span class="code">1</span> as a key in an <span class="code">ordered_set</span>
and get the object returned as a result of doing a
<span class="code">lookup/2</span> with the <span class="code">float()</span> <span class="code">1.0</span> as the
key to search for.</p>
<p>If the table is of type <span class="code">set</span> or <span class="code">ordered_set</span>,
the function returns either the empty list or a list with one
element, as there cannot be more than one object with the same
key. If the table is of type <span class="code">bag</span> or
<span class="code">duplicate_bag</span>, the function returns a list of
arbitrary length.</p>
<p>Note that the time order of object insertions is preserved;
the first object inserted with the given key will be first
in the resulting list, and so on.</p>
<p>Insert and look-up times in tables of type <span class="code">set</span>,
<span class="code">bag</span> and <span class="code">duplicate_bag</span> are constant, regardless
of the size of the table. For the <span class="code">ordered_set</span>
data-type, time is proportional to the (binary) logarithm of
the number of objects.</p>
</p></div>
<p><a name="lookup_element-3"><span class="bold_code">lookup_element(Tab, Key, Pos) -> Elem</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pos = integer()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Elem = term() | [term()]</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>If the table <span class="code">Tab</span> is of type <span class="code">set</span> or
<span class="code">ordered_set</span>, the function returns the <span class="code">Pos</span>:th
element of the object with the key <span class="code">Key</span>.</p>
<p>If the table is of type <span class="code">bag</span> or <span class="code">duplicate_bag</span>,
the functions returns a list with the <span class="code">Pos</span>:th element of
every object with the key <span class="code">Key</span>.</p>
<p>If no object with the key <span class="code">Key</span> exists, the function
will exit with reason <span class="code">badarg</span>.</p>
<p>The difference between <span class="code">set</span>, <span class="code">bag</span> and
<span class="code">duplicate_bag</span> on one hand, and <span class="code">ordered_set</span> on
the other, regarding the fact that <span class="code">ordered_set</span>'s
view keys as equal when they <strong>compare equal</strong>
whereas the other table types only regard them equal when
they <strong>match</strong>, naturally holds for
<span class="code">lookup_element</span> as well as for <span class="code">lookup</span>.</p>
</p></div>
<p><a name="match-2"><span class="bold_code">match(Tab, Pattern) -> [Match]</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pattern = tuple()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Match = [term()]</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Matches the objects in the table <span class="code">Tab</span> against the
pattern <span class="code">Pattern</span>.</p>
<p>A pattern is a term that may contain:</p>
<ul>
<li>bound parts (Erlang terms),</li>
<li>
<span class="code">'_'</span> which matches any Erlang term, and</li>
<li>pattern variables: <span class="code">'$N'</span> where
<span class="code">N</span>=0,1,...</li>
</ul>
<p>The function returns a list with one element for each
matching object, where each element is an ordered list of
pattern variable bindings. An example:</p>
<div class="example"><pre>
6> <span class="bold_code">ets:match(T, '$1').</span> % Matches every object in the table
[[{rufsen,dog,7}],[{brunte,horse,5}],[{ludde,dog,5}]]
7> <span class="bold_code">ets:match(T, {'_',dog,'$1'}).</span>
[[7],[5]]
8> <span class="bold_code">ets:match(T, {'_',cow,'$1'}).</span>
[]</pre></div>
<p>If the key is specified in the pattern, the match is very
efficient. If the key is not specified, i.e. if it is a
variable or an underscore, the entire table must be searched.
The search time can be substantial if the table is very large.</p>
<p>On tables of the <span class="code">ordered_set</span> type, the result is in
the same order as in a <span class="code">first/next</span> traversal.</p>
</p></div>
<p><a name="match-3"><span class="bold_code">match(Tab, Pattern, Limit) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pattern = tuple()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Match = [term()]</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Works like <span class="code">ets:match/2</span> but only returns a limited
(<span class="code">Limit</span>) number of matching objects. The
<span class="code">Continuation</span> term can then be used in subsequent calls
to <span class="code">ets:match/1</span> to get the next chunk of matching
objects. This is a space efficient way to work on objects in a
table which is still faster than traversing the table object
by object using <span class="code">ets:first/1</span> and <span class="code">ets:next/1</span>.</p>
<p><span class="code">'$end_of_table'</span> is returned if the table is empty.</p>
</p></div>
<p><a name="match-1"><span class="bold_code">match(Continuation) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Match = [term()]</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Continues a match started with <span class="code">ets:match/3</span>. The next
chunk of the size given in the initial <span class="code">ets:match/3</span>
call is returned together with a new <span class="code">Continuation</span>
that can be used in subsequent calls to this function.</p>
<p><span class="code">'$end_of_table'</span> is returned when there are no more
objects in the table.</p>
</p></div>
<p><a name="match_delete-2"></a><span class="bold_code">match_delete(Tab, Pattern) -> true</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Pattern = <span class="bold_code"><a href="#type-match_pattern">match_pattern()</a></span></span></div>
</div></p>
<div class="REFBODY"><p>
<p>Deletes all objects which match the pattern <span class="code">Pattern</span>
from the table <span class="code">Tab</span>. See <span class="code">match/2</span> for a
description of patterns.</p>
</p></div>
<p><a name="match_object-2"><span class="bold_code">match_object(Tab, Pattern) -> [Object]</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pattern = Object = tuple()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Matches the objects in the table <span class="code">Tab</span> against the
pattern <span class="code">Pattern</span>. See <span class="code">match/2</span> for a description
of patterns. The function returns a list of all objects which
match the pattern.</p>
<p>If the key is specified in the pattern, the match is very
efficient. If the key is not specified, i.e. if it is a
variable or an underscore, the entire table must be searched.
The search time can be substantial if the table is very large.</p>
<p>On tables of the <span class="code">ordered_set</span> type, the result is in
the same order as in a <span class="code">first/next</span> traversal.</p>
</p></div>
<p><a name="match_object-3"><span class="bold_code">match_object(Tab, Pattern, Limit) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pattern = tuple()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Match = [term()]</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Works like <span class="code">ets:match_object/2</span> but only returns a
limited (<span class="code">Limit</span>) number of matching objects. The
<span class="code">Continuation</span> term can then be used in subsequent calls
to <span class="code">ets:match_object/1</span> to get the next chunk of matching
objects. This is a space efficient way to work on objects in a
table which is still faster than traversing the table object
by object using <span class="code">ets:first/1</span> and <span class="code">ets:next/1</span>.</p>
<p><span class="code">'$end_of_table'</span> is returned if the table is empty.</p>
</p></div>
<p><a name="match_object-1"><span class="bold_code">match_object(Continuation) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Match = [term()]</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Continues a match started with <span class="code">ets:match_object/3</span>.
The next chunk of the size given in the initial
<span class="code">ets:match_object/3</span> call is returned together with a
new <span class="code">Continuation</span> that can be used in subsequent calls
to this function.</p>
<p><span class="code">'$end_of_table'</span> is returned when there are no more
objects in the table.</p>
</p></div>
<p><a name="match_spec_compile-1"><span class="bold_code">match_spec_compile(MatchSpec) -> CompiledMatchSpec</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">MatchSpec = match_spec()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">CompiledMatchSpec = comp_match_spec()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>This function transforms a
<span class="bold_code"><a href="#match_spec">match_spec</a></span> into an
internal representation that can be used in subsequent calls
to <span class="code">ets:match_spec_run/2</span>. The internal representation is
opaque and can not be converted to external term format and
then back again without losing its properties (meaning it can
not be sent to a process on another node and still remain a
valid compiled match_spec, nor can it be stored on disk).
The validity of a compiled match_spec can be checked using
<span class="code">ets:is_compiled_ms/1</span>.</p>
<p>If the term <span class="code">MatchSpec</span> can not be compiled (does not
represent a valid match_spec), a <span class="code">badarg</span> fault is
thrown.</p>
<div class="note">
<div class="label">Note</div>
<div class="content"><p>
<p>This function has limited use in normal code, it is used by
Dets to perform the <span class="code">dets:select</span> operations.</p>
</p></div>
</div>
</p></div>
<p><a name="match_spec_run-2"><span class="bold_code">match_spec_run(List,CompiledMatchSpec) -> list()</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">List = [ tuple() ]</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">CompiledMatchSpec = comp_match_spec()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>This function executes the matching specified in a
compiled <span class="bold_code"><a href="#match_spec">match_spec</a></span> on
a list of tuples. The <span class="code">CompiledMatchSpec</span> term should be
the result of a call to <span class="code">ets:match_spec_compile/1</span> and
is hence the internal representation of the match_spec one
wants to use.</p>
<p>The matching will be executed on each element in <span class="code">List</span>
and the function returns a list containing all results. If an
element in <span class="code">List</span> does not match, nothing is returned
for that element. The length of the result list is therefore
equal or less than the the length of the parameter
<span class="code">List</span>. The two calls in the following example will give
the same result (but certainly not the same execution
time...):</p>
<div class="example"><pre>
Table = ets:new...
MatchSpec = ....
% The following call...
ets:match_spec_run(ets:tab2list(Table),
ets:match_spec_compile(MatchSpec)),
% ...will give the same result as the more common (and more efficient)
ets:select(Table,MatchSpec),</pre></div>
<div class="note">
<div class="label">Note</div>
<div class="content"><p>
<p>This function has limited use in normal code, it is used by
Dets to perform the <span class="code">dets:select</span> operations and by
Mnesia during transactions.</p>
</p></div>
</div>
</p></div>
<p><a name="member-2"><span class="bold_code">member(Tab, Key) -> true | false</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Works like <span class="code">lookup/2</span>, but does not return the objects.
The function returns <span class="code">true</span> if one or more elements in
the table has the key <span class="code">Key</span>, <span class="code">false</span> otherwise.</p>
</p></div>
<p><a name="new-2"><span class="bold_code">new(Name, Options) -> tid() | atom()</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Name = atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Options = [Option]</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code"> Option = Type | Access | named_table | {keypos,Pos} | {heir,pid(),HeirData} | {heir,none} | Tweaks</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code"> Type = set | ordered_set | bag | duplicate_bag</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code"> Access = public | protected | private</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code"> Tweaks = {write_concurrency,boolean()} | {read_concurrency,boolean()} | compressed</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code"> Pos = integer()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code"> HeirData = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Creates a new table and returns a table identifier which can
be used in subsequent operations. The table identifier can be
sent to other processes so that a table can be shared between
different processes within a node.</p>
<p>The parameter <span class="code">Options</span> is a list of atoms which
specifies table type, access rights, key position and if the
table is named or not. If one or more options are left out,
the default values are used. This means that not specifying
any options (<span class="code">[]</span>) is the same as specifying
<span class="code">[set, protected, {keypos,1}, {heir,none}, {write_concurrency,false}, {read_concurrency,false}]</span>.</p>
<ul>
<li>
<p><span class="code">set</span>
The table is a <span class="code">set</span> table - one key, one object,
no order among objects. This is the default table type.</p>
</li>
<li>
<p><span class="code">ordered_set</span>
The table is a <span class="code">ordered_set</span> table - one key, one
object, ordered in Erlang term order, which is the order
implied by the < and > operators. Tables of this type
have a somewhat different behavior in some situations
than tables of the other types. Most notably the
<span class="code">ordered_set</span> tables regard keys as equal when they
<strong>compare equal</strong>, not only when they match. This
means that to an <span class="code">ordered_set</span>, the
<span class="code">integer()</span> <span class="code">1</span> and the <span class="code">float()</span> <span class="code">1.0</span> are regarded as equal. This also means that the
key used to lookup an element not necessarily
<strong>matches</strong> the key in the elements returned, if
<span class="code">float()</span>'s and <span class="code">integer()</span>'s are mixed in
keys of a table.</p>
</li>
<li>
<p><span class="code">bag</span>
The table is a <span class="code">bag</span> table which can have many
objects, but only one instance of each object, per key.</p>
</li>
<li>
<p><span class="code">duplicate_bag</span>
The table is a <span class="code">duplicate_bag</span> table which can have
many objects, including multiple copies of the same
object, per key.</p>
</li>
<li>
<p><span class="code">public</span>
Any process may read or write to the table.</p>
</li>
<li>
<a name="protected"></a>
<p><span class="code">protected</span>
The owner process can read and write to the table. Other
processes can only read the table. This is the default
setting for the access rights.</p>
</li>
<li>
<a name="private"></a>
<p><span class="code">private</span>
Only the owner process can read or write to the table.</p>
</li>
<li>
<p><span class="code">named_table</span>
If this option is present, the name <span class="code">Name</span> is
associated with the table identifier. The name can then
be used instead of the table identifier in subsequent
operations.</p>
</li>
<li>
<p><span class="code">{keypos,Pos}</span>
Specfies which element in the stored tuples should be
used as key. By default, it is the first element, i.e.
<span class="code">Pos=1</span>. However, this is not always appropriate. In
particular, we do not want the first element to be the
key if we want to store Erlang records in a table.</p>
<p>Note that any tuple stored in the table must have at
least <span class="code">Pos</span> number of elements.</p>
</li>
<li>
<a name="heir"></a>
<p><span class="code">{heir,Pid,HeirData} | {heir,none}</span><br>
Set a process as heir. The heir will inherit the table if
the owner terminates. The message
<span class="code">{'ETS-TRANSFER',tid(),FromPid,HeirData}</span> will be sent to
the heir when that happens. The heir must be a local process.
Default heir is <span class="code">none</span>, which will destroy the table when
the owner terminates.</p>
</li>
<li>
<a name="new_2_write_concurrency"></a>
<p><span class="code">{write_concurrency,boolean()}</span>
Performance tuning. Default is <span class="code">false</span>, in which case an operation that
mutates (writes to) the table will obtain exclusive access,
blocking any concurrent access of the same table until finished.
If set to <span class="code">true</span>, the table is optimized towards concurrent
write access. Different objects of the same table can be mutated
(and read) by concurrent processes. This is achieved to some degree
at the expense of sequential access and concurrent reader performance.
The <span class="code">write_concurrency</span> option can be combined with the
<span class="bold_code"><a href="#new_2_read_concurrency">read_concurrency</a></span>
option. You typically want to combine these when large concurrent
read bursts and large concurrent write bursts are common (see the
documentation of the
<span class="bold_code"><a href="#new_2_read_concurrency">read_concurrency</a></span>
option for more information).
Note that this option does not change any guarantees about
<span class="bold_code"><a href="#concurrency">atomicy and isolation</a></span>.
Functions that makes such promises over several objects (like
<span class="code">insert/2</span>) will gain less (or nothing) from this option.</p>
<p>Table type <span class="code">ordered_set</span> is not affected by this option in current
implementation.</p>
</li>
<li>
<a name="new_2_read_concurrency"></a>
<p><span class="code">{read_concurrency,boolean()}</span>
Performance tuning. Default is <span class="code">false</span>. When set to
<span class="code">true</span>, the table is optimized for concurrent read
operations. When this option is enabled on a runtime system with
SMP support, read operations become much cheaper; especially on
systems with multiple physical processors. However, switching
between read and write operations becomes more expensive. You
typically want to enable this option when concurrent read
operations are much more frequent than write operations, or when
concurrent reads and writes comes in large read and write
bursts (i.e., lots of reads not interrupted by writes, and lots
of writes not interrupted by reads). You typically do
<strong>not</strong> want to enable this option when the common access
pattern is a few read operations interleaved with a few write
operations repeatedly. In this case you will get a performance
degradation by enabling this option. The <span class="code">read_concurrency</span>
option can be combined with the
<span class="bold_code"><a href="#new_2_write_concurrency">write_concurrency</a></span>
option. You typically want to combine these when large concurrent
read bursts and large concurrent write bursts are common.</p>
</li>
<li>
<a name="new_2_compressed"></a>
<p><span class="code">compressed</span>
If this option is present, the table data will be stored in a more compact format to
consume less memory. The downside is that it will make table operations slower.
Especially operations that need to inspect entire objects,
such as <span class="code">match</span> and <span class="code">select</span>, will get much slower. The key element
is not compressed in current implementation.</p>
</li>
</ul>
</p></div>
<p><a name="next-2"><span class="bold_code">next(Tab, Key1) -> Key2 | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key1 = Key2 = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns the next key <span class="code">Key2</span>, following the key
<span class="code">Key1</span> in the table <span class="code">Tab</span>. If the table is of the
<span class="code">ordered_set</span> type, the next key in Erlang term order is
returned. If the table is of any other type, the next key
according to the table's internal order is returned. If there
is no next key, <span class="code">'$end_of_table'</span> is returned.</p>
<p>Use <span class="code">first/1</span> to find the first key in the table.</p>
<p>Unless a table of type <span class="code">set</span>, <span class="code">bag</span> or
<span class="code">duplicate_bag</span> is protected using
<span class="code">safe_fixtable/2</span>, see below, a traversal may fail if
concurrent updates are made to the table. If the table is of
type <span class="code">ordered_set</span>, the function returns the next key in
order, even if the object does no longer exist.</p>
</p></div>
<p><a name="prev-2"><span class="bold_code">prev(Tab, Key1) -> Key2 | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key1 = Key2 = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Returns the previous key <span class="code">Key2</span>, preceding the key
<span class="code">Key1</span> according the Erlang term order in the table
<span class="code">Tab</span> of the <span class="code">ordered_set</span> type. If the table is of
any other type, the function is synonymous to <span class="code">next/2</span>.
If there is no previous key, <span class="code">'$end_of_table'</span> is
returned.</p>
<p>Use <span class="code">last/1</span> to find the last key in the table.</p>
</p></div>
<p><a name="rename-2"><span class="bold_code">rename(Tab, Name) -> Name</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = Name = atom()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Renames the named table <span class="code">Tab</span> to the new name
<span class="code">Name</span>. Afterwards, the old name can not be used to
access the table. Renaming an unnamed table has no effect.</p>
</p></div>
<p><a name="repair_continuation-2"></a><span class="bold_code">repair_continuation(Continuation, MatchSpec) -> Continuation</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Continuation = <span class="bold_code"><a href="#type-continuation">continuation()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">MatchSpec = <span class="bold_code"><a href="#type-match_spec">match_spec()</a></span></span></div>
</div></p>
<div class="REFBODY"><p>
<p>This function can be used to restore an opaque continuation
returned by <span class="code">ets:select/3</span> or <span class="code">ets:select/1</span> if the
continuation has passed through external term format (been
sent between nodes or stored on disk).</p>
<p>The reason for this function is that continuation terms
contain compiled match_specs and therefore will be
invalidated if converted to external term format. Given that
the original match_spec is kept intact, the continuation can
be restored, meaning it can once again be used in subsequent
<span class="code">ets:select/1</span> calls even though it has been stored on
disk or on another node.</p>
<p>As an example, the following sequence of calls will fail:</p>
<div class="example"><pre>
T=ets:new(x,[]),
...
{_,C} = ets:select(T,ets:fun2ms(fun({N,_}=A)
when (N rem 10) =:= 0 ->
A
end),10),
Broken = binary_to_term(term_to_binary(C)),
ets:select(Broken).</pre></div>
<p>...while the following sequence will work:</p>
<div class="example"><pre>
T=ets:new(x,[]),
...
MS = ets:fun2ms(fun({N,_}=A)
when (N rem 10) =:= 0 ->
A
end),
{_,C} = ets:select(T,MS,10),
Broken = binary_to_term(term_to_binary(C)),
ets:select(ets:repair_continuation(Broken,MS)).</pre></div>
<p>...as the call to <span class="code">ets:repair_continuation/2</span> will
reestablish the (deliberately) invalidated continuation
<span class="code">Broken</span>.</p>
<div class="note">
<div class="label">Note</div>
<div class="content"><p>
<p>This function is very rarely needed in application code. It
is used by Mnesia to implement distributed <span class="code">select/3</span>
and <span class="code">select/1</span> sequences. A normal application would
either use Mnesia or keep the continuation from being
converted to external format.</p>
<p>The reason for not having an external representation of a
compiled match_spec is performance. It may be subject to
change in future releases, while this interface will remain
for backward compatibility.</p>
</p></div>
</div>
</p></div>
<p><a name="safe_fixtable-2"><span class="bold_code">safe_fixtable(Tab, true|false) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Fixes a table of the <span class="code">set</span>, <span class="code">bag</span> or
<span class="code">duplicate_bag</span> table type for safe traversal.</p>
<p>A process fixes a table by calling
<span class="code">safe_fixtable(Tab,true)</span>. The table remains fixed until
the process releases it by calling
<span class="code">safe_fixtable(Tab,false)</span>, or until the process
terminates.</p>
<p>If several processes fix a table, the table will remain fixed
until all processes have released it (or terminated).
A reference counter is kept on a per process basis, and N
consecutive fixes requires N releases to actually release
the table.</p>
<p>When a table is fixed, a sequence of <span class="code">first/1</span> and
<span class="code">next/2</span> calls are guaranteed to succeed and each object in
the table will only be returned once, even if objects
are removed or inserted during the traversal.
The keys for new objects inserted during the traversal <strong>may</strong>
be returned by <span class="bold_code"><a href="#next-2">next/2</a></span>
(it depends on the internal ordering of the keys). An example:</p>
<div class="example"><pre>
clean_all_with_value(Tab,X) ->
safe_fixtable(Tab,true),
clean_all_with_value(Tab,X,ets:first(Tab)),
safe_fixtable(Tab,false).
clean_all_with_value(Tab,X,'$end_of_table') ->
true;
clean_all_with_value(Tab,X,Key) ->
case ets:lookup(Tab,Key) of
[{Key,X}] ->
ets:delete(Tab,Key);
_ ->
true
end,
clean_all_with_value(Tab,X,ets:next(Tab,Key)).</pre></div>
<p>Note that no deleted objects are actually removed from a
fixed table until it has been released. If a process fixes a
table but never releases it, the memory used by the deleted
objects will never be freed. The performance of operations on
the table will also degrade significantly.</p>
<p>Use <span class="code">info/2</span> to retrieve information about which
processes have fixed which tables. A system with a lot of
processes fixing tables may need a monitor which sends alarms
when tables have been fixed for too long.</p>
<p>Note that for tables of the <span class="code">ordered_set</span> type,
<span class="code">safe_fixtable/2</span> is not necessary as calls to
<span class="code">first/1</span> and <span class="code">next/2</span> will always succeed.</p>
</p></div>
<p><a name="select-2"><span class="bold_code">select(Tab, MatchSpec) -> [Match]</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Match = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">MatchSpec = match_spec()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Matches the objects in the table <span class="code">Tab</span> using a
<span class="bold_code"><a href="#match_spec">match_spec</a></span>. This is a
more general call than the <span class="code">ets:match/2</span> and
<span class="code">ets:match_object/2</span> calls. In its simplest forms the
match_specs look like this:</p>
<ul>
<li>MatchSpec = [MatchFunction]</li>
<li>MatchFunction = {MatchHead, [Guard], [Result]}</li>
<li>MatchHead = "Pattern as in ets:match"</li>
<li>Guard = {"Guardtest name", ...}</li>
<li>Result = "Term construct"</li>
</ul>
<p>This means that the match_spec is always a list of one or
more tuples (of arity 3). The tuples first element should be
a pattern as described in the documentation of
<span class="code">ets:match/2</span>. The second element of the tuple should
be a list of 0 or more guard tests (described below). The
third element of the tuple should be a list containing a
description of the value to actually return. In almost all
normal cases the list contains exactly one term which fully
describes the value to return for each object.</p>
<p>The return value is constructed using the "match variables"
bound in the MatchHead or using the special match variables
<span class="code">'$_'</span> (the whole matching object) and <span class="code">'$$'</span> (all
match variables in a list), so that the following
<span class="code">ets:match/2</span> expression:</p>
<div class="example"><pre>
ets:match(Tab,{'$1','$2','$3'})</pre></div>
<p>is exactly equivalent to:</p>
<div class="example"><pre>
ets:select(Tab,[{{'$1','$2','$3'},[],['$$']}])</pre></div>
<p>- and the following <span class="code">ets:match_object/2</span> call:</p>
<div class="example"><pre>
ets:match_object(Tab,{'$1','$2','$1'})</pre></div>
<p>is exactly equivalent to</p>
<div class="example"><pre>
ets:select(Tab,[{{'$1','$2','$1'},[],['$_']}])</pre></div>
<p>Composite terms can be constructed in the <span class="code">Result</span> part
either by simply writing a list, so that this code:</p>
<div class="example"><pre>
ets:select(Tab,[{{'$1','$2','$3'},[],['$$']}])</pre></div>
<p>gives the same output as:</p>
<div class="example"><pre>
ets:select(Tab,[{{'$1','$2','$3'},[],[['$1','$2','$3']]}])</pre></div>
<p>i.e. all the bound variables in the match head as a list. If
tuples are to be constructed, one has to write a tuple of
arity 1 with the single element in the tuple being the tuple
one wants to construct (as an ordinary tuple could be mistaken
for a <span class="code">Guard</span>). Therefore the following call:</p>
<div class="example"><pre>
ets:select(Tab,[{{'$1','$2','$1'},[],['$_']}])</pre></div>
<p>gives the same output as:</p>
<div class="example"><pre>
ets:select(Tab,[{{'$1','$2','$1'},[],[{{'$1','$2','$3'}}]}])</pre></div>
<p>- this syntax is equivalent to the syntax used in the trace
patterns (see
<span class="bold_code"><a href="javascript:erlhref('../../../../doc/../','runtime_tools','dbg.html');">dbg(3)</a></span>).</p>
<p>The <span class="code">Guard</span>s are constructed as tuples where the first
element is the name of the test and the rest of the elements
are the parameters of the test. To check for a specific type
(say a list) of the element bound to the match variable
<span class="code">'$1'</span>, one would write the test as
<span class="code">{is_list, '$1'}</span>. If the test fails, the object in the
table will not match and the next <span class="code">MatchFunction</span> (if
any) will be tried. Most guard tests present in Erlang can be
used, but only the new versions prefixed <span class="code">is_</span> are
allowed (like <span class="code">is_float</span>, <span class="code">is_atom</span> etc).</p>
<p>The <span class="code">Guard</span> section can also contain logic and
arithmetic operations, which are written with the same syntax
as the guard tests (prefix notation), so that a guard test
written in Erlang looking like this:</p>
<div class="example"><pre>
is_integer(X), is_integer(Y), X + Y < 4711</pre></div>
<p>is expressed like this (X replaced with '$1' and Y with
'$2'):</p>
<div class="example"><pre>
[{is_integer, '$1'}, {is_integer, '$2'}, {'<', {'+', '$1', '$2'}, 4711}]</pre></div>
<p>On tables of the <span class="code">ordered_set</span> type, objects are visited
in the same order as in a <span class="code">first/next</span>
traversal. This means that the match specification will be
executed against objects with keys in the <span class="code">first/next</span>
order and the corresponding result list will be in the order of that
execution.</p>
</p></div>
<p><a name="select-3"><span class="bold_code">select(Tab, MatchSpec, Limit) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Match = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">MatchSpec = match_spec()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Works like <span class="code">ets:select/2</span> but only returns a limited
(<span class="code">Limit</span>) number of matching objects. The
<span class="code">Continuation</span> term can then be used in subsequent calls
to <span class="code">ets:select/1</span> to get the next chunk of matching
objects. This is a space efficient way to work on objects in a
table which is still faster than traversing the table object
by object using <span class="code">ets:first/1</span> and <span class="code">ets:next/1</span>.</p>
<p><span class="code">'$end_of_table'</span> is returned if the table is empty.</p>
</p></div>
<p><a name="select-1"><span class="bold_code">select(Continuation) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Match = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Continues a match started with
<span class="code">ets:select/3</span>. The next
chunk of the size given in the initial <span class="code">ets:select/3</span>
call is returned together with a new <span class="code">Continuation</span>
that can be used in subsequent calls to this function.</p>
<p><span class="code">'$end_of_table'</span> is returned when there are no more
objects in the table.</p>
</p></div>
<p><a name="select_count-2"><span class="bold_code">select_count(Tab, MatchSpec) -> NumMatched</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Object = tuple()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">MatchSpec = match_spec()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">NumMatched = integer()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Matches the objects in the table <span class="code">Tab</span> using a
<span class="bold_code"><a href="#match_spec">match_spec</a></span>. If the
match_spec returns <span class="code">true</span> for an object, that object
considered a match and is counted. For any other result from
the match_spec the object is not considered a match and is
therefore not counted.</p>
<p>The function could be described as a <span class="code">match_delete/2</span>
that does not actually delete any elements, but only counts
them.</p>
<p>The function returns the number of objects matched.</p>
</p></div>
<p><a name="select_delete-2"><span class="bold_code">select_delete(Tab, MatchSpec) -> NumDeleted</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Object = tuple()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">MatchSpec = match_spec()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">NumDeleted = integer()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Matches the objects in the table <span class="code">Tab</span> using a
<span class="bold_code"><a href="#match_spec">match_spec</a></span>. If the
match_spec returns <span class="code">true</span> for an object, that object is
removed from the table. For any other result from the
match_spec the object is retained. This is a more general
call than the <span class="code">ets:match_delete/2</span> call.</p>
<p>The function returns the number of objects actually
deleted from the table.</p>
<div class="note">
<div class="label">Note</div>
<div class="content"><p>
<p>The <span class="code">match_spec</span> has to return the atom <span class="code">true</span> if
the object is to be deleted. No other return value will get the
object deleted, why one can not use the same match specification for
looking up elements as for deleting them.</p>
</p></div>
</div>
</p></div>
<p><a name="select_reverse-2"><span class="bold_code">select_reverse(Tab, MatchSpec) -> [Match]</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Match = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">MatchSpec = match_spec()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Works like <span class="code">select/2</span>, but returns the list in reverse
order for the <span class="code">ordered_set</span> table type. For all other table
types, the return value is identical to that of <span class="code">select/2</span>.</p>
</p></div>
<p><a name="select_reverse-3"><span class="bold_code">select_reverse(Tab, MatchSpec, Limit) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Match = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">MatchSpec = match_spec()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Works like <span class="code">select/3</span>, but for the <span class="code">ordered_set</span>
table type, traversing is done starting at the last object in
Erlang term order and moves towards the first. For all other
table types, the return value is identical to that of
<span class="code">select/3</span>.</p>
<p>Note that this is <strong>not</strong> equivalent to
reversing the result list of a <span class="code">select/3</span> call, as the result list
is not only reversed, but also contains the last <span class="code">Limit</span>
matching objects in the table, not the first.</p>
</p></div>
<p><a name="select_reverse-1"><span class="bold_code">select_reverse(Continuation) -> {[Match],Continuation} | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Match = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Continuation = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Continues a match started with
<span class="code">ets:select_reverse/3</span>. If the table is an
<span class="code">ordered_set</span>, the traversal of the table will continue
towards objects with keys earlier in the Erlang term order. The
returned list will also contain objects with keys in reverse
order.</p>
<p>For all other table types, the behaviour is exatly that of <span class="code">select/1</span>.</p>
<p>Example:</p>
<div class="example"><pre>
1> T = ets:new(x,[ordered_set]).
2> [ ets:insert(T,{N}) || N <- lists:seq(1,10) ].
...
3> {R0,C0} = ets:select_reverse(T,[{'_',[],['$_']}],4).
...
4> R0.
[{10},{9},{8},{7}]
5> {R1,C1} = ets:select_reverse(C0).
...
6> R1.
[{6},{5},{4},{3}]
7> {R2,C2} = ets:select_reverse(C1).
...
8> R2.
[{2},{1}]
9> '$end_of_table' = ets:select_reverse(C2).
...
</pre></div>
</p></div>
<p><a name="setopts-2"><span class="bold_code">setopts(Tab, Opts) -> true</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Opts = Opt | [Opt]</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Opt = {heir,pid(),HeirData} | {heir,none}</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">HeirData = term()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>Set table options. The only option that currently is allowed to be
set after the table has been created is
<span class="bold_code"><a href="#heir">heir</a></span>. The calling process must be
the table owner.</p>
</p></div>
<p><a name="slot-2"><span class="bold_code">slot(Tab, I) -> [Object] | '$end_of_table'</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">I = integer()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Object = tuple()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>This function is mostly for debugging purposes, Normally
one should use <span class="code">first/next</span> or <span class="code">last/prev</span> instead.</p>
<p>Returns all objects in the <span class="code">I</span>:th slot of the table
<span class="code">Tab</span>. A table can be traversed by repeatedly calling
the function, starting with the first slot <span class="code">I=0</span> and
ending when <span class="code">'$end_of_table'</span> is returned.
The function will fail with reason <span class="code">badarg</span> if the
<span class="code">I</span> argument is out of range.</p>
<p>Unless a table of type <span class="code">set</span>, <span class="code">bag</span> or
<span class="code">duplicate_bag</span> is protected using
<span class="code">safe_fixtable/2</span>, see above, a traversal may fail if
concurrent updates are made to the table. If the table is of
type <span class="code">ordered_set</span>, the function returns a list
containing the <span class="code">I</span>:th object in Erlang term order.</p>
</p></div>
<p><a name="tab2file-2"></a><span class="bold_code">tab2file(Tab, Filename) -> ok | {error, Reason}</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Filename = <span class="bold_code"><a href="javascript:erlhref('../../../../doc/../','kernel','file.html#type-name');">file:name()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Reason = term()</span></div>
</div></p>
<div class="REFBODY"><p>
<p>Dumps the table <span class="code">Tab</span> to the file <span class="code">Filename</span>.</p>
<p>Equivalent to <span class="code">tab2file(Tab, Filename,[])</span></p>
</p></div>
<p><a name="tab2file-3"></a><span class="bold_code">tab2file(Tab, Filename, Options) -> ok | {error, Reason}</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Filename = <span class="bold_code"><a href="javascript:erlhref('../../../../doc/../','kernel','file.html#type-name');">file:name()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Options = [Option]</span></div>
<div class="REFTYPES"><span class="bold_code">Option = {extended_info, [ExtInfo]}</span></div>
<div class="REFTYPES"><span class="bold_code">ExtInfo = md5sum | object_count</span></div>
<div class="REFTYPES"><span class="bold_code">Reason = term()</span></div>
</div></p>
<div class="REFBODY"><p>
<p>Dumps the table <span class="code">Tab</span> to the file <span class="code">Filename</span>.</p>
<p>When dumping the table, certain information about the table
is dumped to a header at the beginning of the dump. This
information contains data about the table type,
name, protection, size, version and if it's a named table. It
also contains notes about what extended information is added
to the file, which can be a count of the objects in the file
or a MD5 sum of the header and records in the file.</p>
<p>The size field in the header might not correspond to the
actual number of records in the file if the table is public
and records are added or removed from the table during
dumping. Public tables updated during dump, and that one wants
to verify when reading, needs at least one field of extended
information for the read verification process to be reliable
later.</p>
<p>The <span class="code">extended_info</span> option specifies what extra
information is written to the table dump:</p>
<dl>
<dt><strong><span class="code">object_count</span></strong></dt>
<dd><p>The number of objects actually written to the file is
noted in the file footer, why verification of file truncation
is possible even if the file was updated during
dump.</p></dd>
<dt><strong><span class="code">md5sum</span></strong></dt>
<dd><p>The header and objects in the file are checksummed using
the built in MD5 functions. The MD5 sum of all objects is
written in the file footer, so that verification while reading
will detect the slightest bitflip in the file data. Using this
costs a fair amount of CPU time.</p></dd>
</dl>
<p>Whenever the <span class="code">extended_info</span> option is used, it
results in a file not readable by versions of ets prior to
that in stdlib-1.15.1</p>
</p></div>
<p><a name="tab2list-1"></a><span class="bold_code">tab2list(Tab) -> [Object]</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Object = tuple()</span></div>
</div></p>
<div class="REFBODY"><p>
<p>Returns a list of all objects in the table <span class="code">Tab</span>.</p>
</p></div>
<p><a name="tabfile_info-1"></a><span class="bold_code">tabfile_info(Filename) -> {ok, TableInfo} | {error, Reason}</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Filename = <span class="bold_code"><a href="javascript:erlhref('../../../../doc/../','kernel','file.html#type-name');">file:name()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">TableInfo = [InfoItem]</span></div>
<div class="REFTYPES"><span class="bold_code">InfoItem = {name, atom()}<br> | {type, Type}<br> | {protection, Protection}<br> | {named_table, boolean()}<br> | {keypos, integer() >= 0}<br> | {size, integer() >= 0}<br> | {extended_info, [ExtInfo]}<br> | {version,<br> {Major :: integer() >= 0,<br> Minor :: integer() >= 0}}</span></div>
<div class="REFTYPES"><span class="bold_code">ExtInfo = md5sum | object_count</span></div>
<div class="REFTYPES"><span class="bold_code">Type = bag | duplicate_bag | ordered_set | set</span></div>
<div class="REFTYPES"><span class="bold_code">Protection = private | protected | public</span></div>
<div class="REFTYPES"><span class="bold_code">Reason = term()</span></div>
</div></p>
<div class="REFBODY"><p>
<p>Returns information about the table dumped to file by
<span class="bold_code"><a href="#tab2file-2">tab2file/2</a></span> or
<span class="bold_code"><a href="#tab2file-3">tab2file/3</a></span></p>
<p>The following items are returned:</p>
<dl>
<dt><strong>name</strong></dt>
<dd><p>The name of the dumped table. If the table was a
named table, a table with the same name cannot exist when the
table is loaded from file with
<span class="bold_code"><a href="#file2tab-2">file2tab/2</a></span>. If the table is
not saved as a named table, this field has no significance
at all when loading the table from file.</p></dd>
<dt><strong>type</strong></dt>
<dd>The ets type of the dumped table (i.e. <span class="code">set</span>, <span class="code">bag</span>,
<span class="code">duplicate_bag</span> or <span class="code">ordered_set</span>). This type will be used
when loading the table again.</dd>
<dt><strong>protection</strong></dt>
<dd>The protection of the dumped table (i.e. <span class="code">private</span>,
<span class="code">protected</span> or <span class="code">public</span>). A table loaded from the file
will get the same protection.</dd>
<dt><strong>named_table</strong></dt>
<dd>
<span class="code">true</span> if the table was a named table when dumped
to file, otherwise <span class="code">false</span>. Note that when a named table
is loaded from a file, there cannot exist a table in the
system with the same name.</dd>
<dt><strong>keypos</strong></dt>
<dd>The <span class="code">keypos</span> of the table dumped to file, which
will be used when loading the table again.</dd>
<dt><strong>size</strong></dt>
<dd>The number of objects in the table when the table dump
to file started, which in case of a <span class="code">public</span> table need
not correspond to the number of objects actually saved to the
file, as objects might have been added or deleted by another
process during table dump.</dd>
<dt><strong>extended_info</strong></dt>
<dd>The extended information written in the file footer to
allow stronger verification during table loading from file, as
specified to <span class="bold_code"><a href="#tab2file-3">tab2file/3</a></span>. Note that this
function only tells <strong>which</strong> information is present, not
the values in the file footer. The value is a list containing
one or more of the atoms <span class="code">object_count</span> and
<span class="code">md5sum</span>.</dd>
<dt><strong>version</strong></dt>
<dd>A tuple <span class="code">{Major,Minor}</span> containing the major and
minor version of the file format for ets table dumps. This
version field was added beginning with stdlib-1.5.1, files
dumped with older versions will return <span class="code">{0,0}</span> in this
field.</dd>
</dl>
<p>An error is returned if the file is inaccessible,
badly damaged or not an file produced with <span class="bold_code"><a href="#tab2file-2">tab2file/2</a></span> or <span class="bold_code"><a href="#tab2file-3">tab2file/3</a></span>.</p>
</p></div>
<p><a name="table-1"></a><span class="bold_code">table(Tab) -> QueryHandle</span><br><a name="table-2"></a><span class="bold_code">table(Tab, Options) -> QueryHandle</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">QueryHandle = <span class="bold_code"><a href="qlc.html#type-query_handle">qlc:query_handle()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Options = [Option] | Option</span></div>
<div class="REFTYPES"><span class="bold_code">Option = {n_objects, NObjects} | {traverse, TraverseMethod}</span></div>
<div class="REFTYPES"><span class="bold_code">NObjects = default | integer() >= 1</span></div>
<div class="REFTYPES"><span class="bold_code">TraverseMethod = first_next<br> | last_prev<br> | select<br> | {select, MatchSpec :: <span class="bold_code"><a href="#type-match_spec">match_spec()</a></span>}</span></div>
</div></p>
<div class="REFBODY"><p>
<p><a name="qlc_table"></a>Returns a QLC (Query List
Comprehension) query handle. The module <span class="code">qlc</span> implements
a query language aimed mainly at Mnesia but ETS tables, Dets
tables, and lists are also recognized by QLC as sources of
data. Calling <span class="code">ets:table/1,2</span> is the means to make the
ETS table <span class="code">Tab</span> usable to QLC.</p>
<p>When there are only simple restrictions on the key position
QLC uses <span class="code">ets:lookup/2</span> to look up the keys, but when
that is not possible the whole table is traversed. The
option <span class="code">traverse</span> determines how this is done:</p>
<ul>
<li>
<p><span class="code">first_next</span>. The table is traversed one key at
a time by calling <span class="code">ets:first/1</span> and
<span class="code">ets:next/2</span>.</p>
</li>
<li>
<p><span class="code">last_prev</span>. The table is traversed one key at
a time by calling <span class="code">ets:last/1</span> and
<span class="code">ets:prev/2</span>.</p>
</li>
<li>
<p><span class="code">select</span>. The table is traversed by calling
<span class="code">ets:select/3</span> and <span class="code">ets:select/1</span>. The option
<span class="code">n_objects</span> determines the number of objects
returned (the third argument of <span class="code">select/3</span>); the
default is to return <span class="code">100</span> objects at a time. The
<span class="bold_code"><a href="#match_spec">match_spec</a></span> (the
second argument of <span class="code">select/3</span>) is assembled by QLC:
simple filters are translated into equivalent match_specs
while more complicated filters have to be applied to all
objects returned by <span class="code">select/3</span> given a match_spec
that matches all objects.</p>
</li>
<li>
<p><span class="code">{select, MatchSpec}</span>. As for <span class="code">select</span>
the table is traversed by calling <span class="code">ets:select/3</span> and
<span class="code">ets:select/1</span>. The difference is that the
match_spec is explicitly given. This is how to state
match_specs that cannot easily be expressed within the
syntax provided by QLC.</p>
</li>
</ul>
<p>The following example uses an explicit match_spec to
traverse the table:</p>
<div class="example"><pre>
9> <span class="bold_code">true = ets:insert(Tab = ets:new(t, []), [{1,a},{2,b},{3,c},{4,d}]),</span>
<span class="bold_code">MS = ets:fun2ms(fun({X,Y}) when (X > 1) or (X < 5) -> {Y} end),</span>
<span class="bold_code">QH1 = ets:table(Tab, [{traverse, {select, MS}}]).</span></pre></div>
<p>An example with implicit match_spec:</p>
<div class="example"><pre>
10> <span class="bold_code">QH2 = qlc:q([{Y} || {X,Y} <- ets:table(Tab), (X > 1) or (X < 5)]).</span></pre></div>
<p>The latter example is in fact equivalent to the former which
can be verified using the function <span class="code">qlc:info/1</span>:</p>
<div class="example"><pre>
11> <span class="bold_code">qlc:info(QH1) =:= qlc:info(QH2).</span>
true</pre></div>
<p><span class="code">qlc:info/1</span> returns information about a query handle,
and in this case identical information is returned for the
two query handles.</p>
</p></div>
<p><a name="test_ms-2"></a><span class="bold_code">test_ms(Tuple, MatchSpec) -> {ok, Result} | {error, Errors}</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tuple = tuple()</span></div>
<div class="REFTYPES"><span class="bold_code">MatchSpec = <span class="bold_code"><a href="#type-match_spec">match_spec()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">Result = term()</span></div>
<div class="REFTYPES"><span class="bold_code">Errors = [{warning | error, string()}]</span></div>
</div></p>
<div class="REFBODY"><p>
<p>This function is a utility to test a
<span class="bold_code"><a href="#match_spec">match_spec</a></span> used in
calls to <span class="code">ets:select/2</span>. The function both tests
<span class="code">MatchSpec</span> for "syntactic" correctness and runs the
match_spec against the object <span class="code">Tuple</span>. If the match_spec
contains errors, the tuple <span class="code">{error, Errors}</span> is returned
where <span class="code">Errors</span> is a list of natural language
descriptions of what was wrong with the match_spec. If the
match_spec is syntactically OK, the function returns
<span class="code">{ok,Result}</span> where <span class="code">Result</span> is what would have been
the result in a real <span class="code">ets:select/2</span> call or <span class="code">false</span>
if the match_spec does not match the object <span class="code">Tuple</span>.</p>
<p>This is a useful debugging and test tool, especially when
writing complicated <span class="code">ets:select/2</span> calls.</p>
</p></div>
<p><a name="to_dets-2"></a><span class="bold_code">to_dets(Tab, DetsTab) -> DetsTab</span><br><div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES"><span class="bold_code">Tab = <span class="bold_code"><a href="#type-tab">tab()</a></span></span></div>
<div class="REFTYPES"><span class="bold_code">DetsTab = <span class="bold_code"><a href="dets.html#type-tab_name">dets:tab_name()</a></span></span></div>
</div></p>
<div class="REFBODY"><p>
<p>Fills an already created/opened Dets table with the objects
in the already opened ETS table named <span class="code">Tab</span>. The Dets
table is emptied before the objects are inserted.</p>
</p></div>
<p><a name="update_counter-3"><span class="bold_code">update_counter(Tab, Key, UpdateOp) -> Result</span></a><br><a name="update_counter-3"><span class="bold_code">update_counter(Tab, Key, [UpdateOp]) -> [Result]</span></a><br><a name="update_counter-3"><span class="bold_code">update_counter(Tab, Key, Incr) -> Result</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">UpdateOp = {Pos,Incr} | {Pos,Incr,Threshold,SetValue}</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pos = Incr = Threshold = SetValue = Result = integer()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>This function provides an efficient way to update one or more
counters, without the hassle of having to look up an object, update
the object by incrementing an element and insert the resulting object
into the table again. (The update is done atomically; i.e. no process
can access the ets table in the middle of the operation.)
</p>
<p>It will destructively update the object with key <span class="code">Key</span>
in the table <span class="code">Tab</span> by adding <span class="code">Incr</span> to the element
at the <span class="code">Pos</span>:th position. The new counter value is
returned. If no position is specified, the element directly
following the key (<span class="code"><keypos>+1</span>) is updated.</p>
<p>If a <span class="code">Threshold</span> is specified, the counter will be
reset to the value <span class="code">SetValue</span> if the following
conditions occur:</p>
<ul>
<li>The <span class="code">Incr</span> is not negative (<span class="code">>= 0</span>) and the
result would be greater than (<span class="code">></span>) <span class="code">Threshold</span>
</li>
<li>The <span class="code">Incr</span> is negative (<span class="code">< 0</span>) and the
result would be less than (<span class="code"><</span>)
<span class="code">Threshold</span>
</li>
</ul>
<p>A list of <span class="code">UpdateOp</span> can be supplied to do several update
operations within the object. The operations are carried out in the
order specified in the list. If the same counter position occurs
more than one time in the list, the corresponding counter will thus
be updated several times, each time based on the previous result.
The return value is a list of the new counter values from each
update operation in the same order as in the operation list. If an
empty list is specified, nothing is updated and an empty list is
returned. If the function should fail, no updates will be done at
all.
</p>
<p>The given Key is used to identify the object by either
<strong>matching</strong> the key of an object in a <span class="code">set</span> table,
or <strong>compare equal</strong> to the key of an object in an
<span class="code">ordered_set</span> table (see
<span class="bold_code"><a href="#lookup-2">lookup/2</a></span> and
<span class="bold_code"><a href="#new-2">new/2</a></span>
for details on the difference).</p>
<p>The function will fail with reason <span class="code">badarg</span> if:</p>
<ul>
<li>the table is not of type <span class="code">set</span> or
<span class="code">ordered_set</span>,</li>
<li>no object with the right key exists,</li>
<li>the object has the wrong arity,</li>
<li>the element to update is not an integer,</li>
<li>the element to update is also the key, or,</li>
<li>any of <span class="code">Pos</span>, <span class="code">Incr</span>, <span class="code">Threshold</span> or
<span class="code">SetValue</span> is not an integer</li>
</ul>
</p></div>
<p><a name="update_element-3"><span class="bold_code">update_element(Tab, Key, {Pos,Value}) -> true | false</span></a><br><a name="update_element-3"><span class="bold_code">update_element(Tab, Key, [{Pos,Value}]) -> true | false</span></a><br></p>
<div class="REFBODY">
<p>Types:</p>
<div class="REFTYPES">
<span class="bold_code">Tab = tid() | atom()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Key = Value = term()</span><br>
</div>
<div class="REFTYPES">
<span class="bold_code">Pos = integer()</span><br>
</div>
</div>
<div class="REFBODY"><p>
<p>This function provides an efficient way to update one or more
elements within an object, without the hassle of having to look up,
update and write back the entire object.
</p>
<p>It will destructively update the object with key <span class="code">Key</span>
in the table <span class="code">Tab</span>. The element at the <span class="code">Pos</span>:th position
will be given the value <span class="code">Value</span>. </p>
<p>A list of <span class="code">{Pos,Value}</span> can be supplied to update several
elements within the same object. If the same position occurs more
than one in the list, the last value in the list will be written. If
the list is empty or the function fails, no updates will be done at
all. The function is also atomic in the sense that other processes
can never see any intermediate results.
</p>
<p>The function returns <span class="code">true</span> if an object with the key
<span class="code">Key</span> was found, <span class="code">false</span> otherwise.
</p>
<p>The given Key is used to identify the object by either
<strong>matching</strong> the key of an object in a <span class="code">set</span> table,
or <strong>compare equal</strong> to the key of an object in an
<span class="code">ordered_set</span> table (see
<span class="bold_code"><a href="#lookup-2">lookup/2</a></span> and
<span class="bold_code"><a href="#new-2">new/2</a></span>
for details on the difference).</p>
<p>The function will fail with reason <span class="code">badarg</span> if:</p>
<ul>
<li>the table is not of type <span class="code">set</span> or
<span class="code">ordered_set</span>,</li>
<li>
<span class="code">Pos</span> is less than 1 or greater than the object
arity, or,</li>
<li>the element to update is also the key</li>
</ul>
</p></div>
</div>
<div class="footer">
<hr>
<p>Copyright © 1997-2012 Ericsson AB. All Rights Reserved.</p>
</div>
</div>
</div></body>
</html>
