[hcoop/debian/mlton.git] / doc / guide / localhost / ObjectOrientedProgramming

<!DOCTYPE html>\r
<html lang="en">\r
<head>\r
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">\r
<meta name="generator" content="AsciiDoc 8.6.9">\r
<title>ObjectOrientedProgramming</title>\r
<link rel="stylesheet" href="./asciidoc.css" type="text/css">\r
<link rel="stylesheet" href="./pygments.css" type="text/css">\r
\r
\r
<script type="text/javascript" src="./asciidoc.js"></script>\r
<script type="text/javascript">\r
/*<![CDATA[*/\r
asciidoc.install();\r
/*]]>*/\r
</script>\r
<link rel="stylesheet" href="./mlton.css" type="text/css">\r
</head>\r
<body class="article">\r
<div id="banner">\r
<div id="banner-home">\r
<a href="./Home">MLton 20180207</a>\r
</div>\r
</div>\r
<div id="header">\r
<h1>ObjectOrientedProgramming</h1>\r
</div>\r
<div id="content">\r
<div id="preamble">\r
<div class="sectionbody">\r
<div class="paragraph"><p><a href="StandardML">Standard ML</a> does not have explicit support for\r
object-oriented programming.  Here are some papers that show how to\r
express certain object-oriented concepts in SML.</p></div>\r
<div class="ulist"><ul>\r
<li>\r
<p>\r
<a href="References#Berthomieu00"> OO Programming styles in ML</a>\r
</p>\r
</li>\r
<li>\r
<p>\r
<a href="References#ThorupTofte94"> Object-oriented programming and Standard ML</a>\r
</p>\r
</li>\r
<li>\r
<p>\r
<a href="References#LarsenNiss04"> mGTK: An SML binding of Gtk+</a>\r
</p>\r
</li>\r
<li>\r
<p>\r
<a href="References#FluetPucella06"> Phantom Types and Subtyping</a>\r
</p>\r
</li>\r
</ul></div>\r
<div class="paragraph"><p>The question of OO programming in SML comes up every now and then.\r
The following discusses a simple object-oriented (OO) programming\r
technique in Standard ML.  The reader is assumed to be able to read\r
Java and SML code.</p></div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_motivation">Motivation</h2>\r
<div class="sectionbody">\r
<div class="paragraph"><p>SML doesn&#8217;t provide subtyping, but it does provide parametric\r
polymorphism, which can be used to encode some forms of subtyping.\r
Most articles on OO programming in SML concentrate on such encoding\r
techniques.  While those techniques are interesting&#8201;&#8212;&#8201;and it is\r
recommended to read such articles&#8201;&#8212;&#8201;and sometimes useful, it seems\r
that basically all OO gurus agree that (deep) subtyping (or\r
inheritance) hierarchies aren&#8217;t as practical as they were thought to\r
be in the early OO days.  "Good", flexible, "OO" designs tend to have\r
a flat structure</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>         Interface\r
             ^\r
             |\r
- - -+-------+-------+- - -\r
     |       |       |\r
   ImplA   ImplB   ImplC</pre>\r
</div></div>\r
<div class="paragraph"><p>and deep inheritance hierarchies</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>ClassA\r
  ^\r
  |\r
ClassB\r
  ^\r
  |\r
ClassC\r
  ^\r
  |</pre>\r
</div></div>\r
<div class="paragraph"><p>tend to be signs of design mistakes.  There are good underlying\r
reasons for this, but a thorough discussion is not in the scope of\r
this article.  However, the point is that perhaps the encoding of\r
subtyping is not as important as one might believe.  In the following\r
we ignore subtyping and rather concentrate on a very simple and basic\r
dynamic dispatch technique.</p></div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_dynamic_dispatch_using_a_recursive_record_of_functions">Dynamic Dispatch Using a Recursive Record of Functions</h2>\r
<div class="sectionbody">\r
<div class="paragraph"><p>Quite simply, the basic idea is to implement a "virtual function\r
table" using a record that is wrapped inside a (possibly recursive)\r
datatype.  Let&#8217;s first take a look at a simple concrete example.</p></div>\r
<div class="paragraph"><p>Consider the following Java interface:</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>public interface Counter {\r
  public void inc();\r
  public int get();\r
}</pre>\r
</div></div>\r
<div class="paragraph"><p>We can translate the <span class="monospaced">Counter</span> interface to SML as follows:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">datatype</span><span class="w"> </span><span class="n">counter</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">Counter</span><span class="w"> </span><span class="k">of</span><span class="w"> </span><span class="p">{</span><span class="n">inc</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">unit</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">unit</span><span class="p">,</span><span class="w"> </span><span class="n">get</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">unit</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">int</span><span class="p">}</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>Each value of type <span class="monospaced">counter</span> can be thought of as an object that\r
responds to two messages <span class="monospaced">inc</span> and <span class="monospaced">get</span>.  To actually send messages\r
to a counter, it is useful to define auxiliary functions</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">local</span><span class="w"></span>\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">mk</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="p">(</span><span class="n">Counter</span><span class="w"> </span><span class="n">t</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">()</span><span class="w"></span>\r
<span class="k">in</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">cGet</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">mk</span><span class="p">#</span><span class="n">get</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">cInc</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">mk</span><span class="p">#</span><span class="n">inc</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>that basically extract the "function table" <span class="monospaced">t</span> from a counter object\r
and then select the specified method <span class="monospaced">m</span> from the table.</p></div>\r
<div class="paragraph"><p>Let&#8217;s then implement a simple function that increments a counter until a\r
given maximum is reached:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">fun</span><span class="w"> </span><span class="n">incUpto</span><span class="w"> </span><span class="n">counter</span><span class="w"> </span><span class="n">max</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">while</span><span class="w"> </span><span class="n">cGet</span><span class="w"> </span><span class="n">counter</span><span class="w"> </span><span class="n">&lt;</span><span class="w"> </span><span class="n">max</span><span class="w"> </span><span class="k">do</span><span class="w"> </span><span class="n">cInc</span><span class="w"> </span><span class="n">counter</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>You can easily verify that the above code compiles even without any\r
concrete implementation of a counter, thus it is clear that it doesn&#8217;t\r
depend on a particular counter implementation.</p></div>\r
<div class="paragraph"><p>Let&#8217;s then implement a couple of counters.  First consider the\r
following Java class implementing the <span class="monospaced">Counter</span> interface given earlier.</p></div>\r
<div class="listingblock">\r
<div class="content monospaced">\r
<pre>public class BasicCounter implements Counter {\r
  private int cnt;\r
  public BasicCounter(int initialCnt) { this.cnt = initialCnt; }\r
  public void inc() { this.cnt += 1; }\r
  public int get() { return this.cnt; }\r
}</pre>\r
</div></div>\r
<div class="paragraph"><p>We can translate the above to SML as follows:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">fun</span><span class="w"> </span><span class="n">newBasicCounter</span><span class="w"> </span><span class="n">initialCnt</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">let</span><span class="w"></span>\r
<span class="w">       </span><span class="k">val</span><span class="w"> </span><span class="n">cnt</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">ref</span><span class="w"> </span><span class="n">initialCnt</span><span class="w"></span>\r
<span class="w">    </span><span class="k">in</span><span class="w"></span>\r
<span class="w">       </span><span class="n">Counter</span><span class="w"> </span><span class="p">{</span><span class="n">inc</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">cnt</span><span class="w"> </span><span class="n">:=</span><span class="w"> </span><span class="n">!cnt</span><span class="w"> </span><span class="n">+</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"></span>\r
<span class="w">                </span><span class="n">get</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">!cnt</span><span class="p">}</span><span class="w"></span>\r
<span class="w">    </span><span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The SML function <span class="monospaced">newBasicCounter</span> can be described as a constructor\r
function for counter objects of the <span class="monospaced">BasicCounter</span> "class".  We can\r
also have other counter implementations.  Here is the constructor for\r
a counter decorator that logs messages:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">fun</span><span class="w"> </span><span class="n">newLoggedCounter</span><span class="w"> </span><span class="n">counter</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">    </span><span class="n">Counter</span><span class="w"> </span><span class="p">{</span><span class="n">inc</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">print</span><span class="w"> </span><span class="s">&quot;inc</span><span class="se">\n</span><span class="s">&quot;</span><span class="w"> </span><span class="p">;</span><span class="w"> </span><span class="n">cInc</span><span class="w"> </span><span class="n">counter</span><span class="p">),</span><span class="w"></span>\r
<span class="w">             </span><span class="n">get</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">print</span><span class="w"> </span><span class="s">&quot;get</span><span class="se">\n</span><span class="s">&quot;</span><span class="w"> </span><span class="p">;</span><span class="w"> </span><span class="n">cGet</span><span class="w"> </span><span class="n">counter</span><span class="p">)}</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The <span class="monospaced">incUpto</span> function works just as well with objects of either\r
class:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">val</span><span class="w"> </span><span class="n">aCounter</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">newBasicCounter</span><span class="w"> </span><span class="mi">0</span><span class="w"></span>\r
<span class="k">val</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">incUpto</span><span class="w"> </span><span class="n">aCounter</span><span class="w"> </span><span class="mi">5</span><span class="w"></span>\r
<span class="k">val</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">print</span><span class="w"> </span><span class="p">(</span><span class="n">Int</span><span class="p">.</span><span class="n">toString</span><span class="w"> </span><span class="p">(</span><span class="n">cGet</span><span class="w"> </span><span class="n">aCounter</span><span class="p">)</span><span class="w"> </span><span class="n">^</span><span class="s">&quot;</span><span class="se">\n</span><span class="s">&quot;</span><span class="p">)</span><span class="w"></span>\r
\r
<span class="k">val</span><span class="w"> </span><span class="n">aCounter</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">newLoggedCounter</span><span class="w"> </span><span class="p">(</span><span class="n">newBasicCounter</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"></span>\r
<span class="k">val</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">incUpto</span><span class="w"> </span><span class="n">aCounter</span><span class="w"> </span><span class="mi">5</span><span class="w"></span>\r
<span class="k">val</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">print</span><span class="w"> </span><span class="p">(</span><span class="n">Int</span><span class="p">.</span><span class="n">toString</span><span class="w"> </span><span class="p">(</span><span class="n">cGet</span><span class="w"> </span><span class="n">aCounter</span><span class="p">)</span><span class="w"> </span><span class="n">^</span><span class="s">&quot;</span><span class="se">\n</span><span class="s">&quot;</span><span class="p">)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>In general, a dynamic dispatch interface is represented as a record\r
type wrapped inside a datatype.  Each field of the record corresponds\r
to a public method or field of the object:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">datatype</span><span class="w"> </span><span class="n">interface</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">   </span><span class="n">Interface</span><span class="w"> </span><span class="k">of</span><span class="w"> </span><span class="p">{</span><span class="n">method</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">t1</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">t2</span><span class="p">,</span><span class="w"></span>\r
<span class="w">                 </span><span class="n">immutableField</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">t</span><span class="p">,</span><span class="w"></span>\r
<span class="w">                 </span><span class="n">mutableField</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="n">ref</span><span class="p">}</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The reason for wrapping the record inside a datatype is that records,\r
in SML, can not be recursive.  However, SML datatypes can be\r
recursive.  A record wrapped in a datatype can contain fields that\r
contain the datatype.  For example, an interface such as <span class="monospaced">Cloneable</span></p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">datatype</span><span class="w"> </span><span class="n">cloneable</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">Cloneable</span><span class="w"> </span><span class="k">of</span><span class="w"> </span><span class="p">{</span><span class="n">clone</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">unit</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">cloneable</span><span class="p">}</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>can be represented using recursive datatypes.</p></div>\r
<div class="paragraph"><p>Like in OO languages, interfaces are abstract and can not be\r
instantiated to produce objects.  To be able to instantiate objects,\r
the constructors of a concrete class are needed.  In SML, we can\r
implement constructors as simple functions from arbitrary arguments to\r
values of the interface type.  Such a constructor function can\r
encapsulate arbitrary private state and functions using lexical\r
closure.  It is also easy to share implementations of methods between\r
two or more constructors.</p></div>\r
<div class="paragraph"><p>While the <span class="monospaced">Counter</span> example is rather trivial, it should not be\r
difficult to see that this technique quite simply doesn&#8217;t require a huge\r
amount of extra verbiage and is more than usable in practice.</p></div>\r
</div>\r
</div>\r
<div class="sect1">\r
<h2 id="_sml_modules_and_dynamic_dispatch">SML Modules and Dynamic Dispatch</h2>\r
<div class="sectionbody">\r
<div class="paragraph"><p>One might wonder about how SML modules and the dynamic dispatch\r
technique work together.  Let&#8217;s investigate!  Let&#8217;s use a simple\r
dispenser framework as a concrete example.  (Note that this isn&#8217;t\r
intended to be an introduction to the SML module system.)</p></div>\r
<div class="sect2">\r
<h3 id="_programming_with_sml_modules">Programming with SML Modules</h3>\r
<div class="paragraph"><p>Using SML signatures we can specify abstract data types (ADTs) such as\r
dispensers.  Here is a signature for an "abstract" functional (as\r
opposed to imperative) dispenser:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">signature</span><span class="w"> </span><span class="n">ABSTRACT_DISPENSER</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">sig</span><span class="w"></span>\r
<span class="w">   </span><span class="k">type</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">isEmpty</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">bool</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">push</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">*</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">pop</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">&#39;a</span><span class="w"> </span><span class="n">*</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="p">)</span><span class="w"> </span><span class="n">option</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The term "abstract" in the name of the signature refers to the fact that\r
the signature gives no way to instantiate a dispenser.  It has nothing to\r
do with the concept of abstract data types.</p></div>\r
<div class="paragraph"><p>Using SML functors we can write "generic" algorithms that manipulate\r
dispensers of an unknown type.  Here are a couple of very simple\r
algorithms:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">functor</span><span class="w"> </span><span class="n">DispenserAlgs</span><span class="w"> </span><span class="p">(</span><span class="n">D</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">ABSTRACT_DISPENSER</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">struct</span><span class="w"></span>\r
<span class="w">   </span><span class="k">open</span><span class="w"> </span><span class="n">D</span><span class="w"></span>\r
\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">pushAll</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">foldl</span><span class="w"> </span><span class="n">push</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="n">xs</span><span class="w"></span>\r
\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">popAll</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">let</span><span class="w"></span>\r
<span class="w">          </span><span class="k">fun</span><span class="w"> </span><span class="n">lp</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">NONE</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">rev</span><span class="w"> </span><span class="n">xs</span><span class="w"></span>\r
<span class="w">            </span><span class="p">|</span><span class="w"> </span><span class="n">lp</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">SOME</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="p">))</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">lp</span><span class="w"> </span><span class="p">(</span><span class="n">x::xs</span><span class="p">,</span><span class="w"> </span><span class="n">pop</span><span class="w"> </span><span class="n">d</span><span class="p">)</span><span class="w"></span>\r
<span class="w">       </span><span class="k">in</span><span class="w"></span>\r
<span class="w">          </span><span class="n">lp</span><span class="w"> </span><span class="p">([],</span><span class="w"> </span><span class="n">pop</span><span class="w"> </span><span class="n">d</span><span class="p">)</span><span class="w"></span>\r
<span class="w">       </span><span class="k">end</span><span class="w"></span>\r
\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">cp</span><span class="w"> </span><span class="p">(</span><span class="n">from</span><span class="p">,</span><span class="w"> </span><span class="n">to</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">pushAll</span><span class="w"> </span><span class="p">(</span><span class="n">popAll</span><span class="w"> </span><span class="n">from</span><span class="p">,</span><span class="w"> </span><span class="n">to</span><span class="p">)</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>As one can easily verify, the above compiles even without any concrete\r
dispenser structure.  Functors essentially provide a form a static\r
dispatch that one can use to break compile-time dependencies.</p></div>\r
<div class="paragraph"><p>We can also give a signature for a concrete dispenser</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">signature</span><span class="w"> </span><span class="n">DISPENSER</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">sig</span><span class="w"></span>\r
<span class="w">   </span><span class="k">include</span><span class="w"> </span><span class="n">ABSTRACT_DISPENSER</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">empty</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>and write any number of concrete structures implementing the signature.\r
For example, we could implement stacks</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">Stack</span><span class="w"> </span><span class="p">:&gt;</span><span class="w"> </span><span class="n">DISPENSER</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">struct</span><span class="w"></span>\r
<span class="w">   </span><span class="k">type</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">list</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">empty</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="p">[]</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">isEmpty</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">null</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">push</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">op</span><span class="w"> </span><span class="n">::</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">pop</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">List</span><span class="p">.</span><span class="n">getItem</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>and queues</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">Queue</span><span class="w"> </span><span class="p">:&gt;</span><span class="w"> </span><span class="n">DISPENSER</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">struct</span><span class="w"></span>\r
<span class="w">   </span><span class="k">datatype</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="k">of</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">list</span><span class="w"> </span><span class="n">*</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">list</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">empty</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="p">([],</span><span class="w"> </span><span class="p">[])</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">isEmpty</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="p">([],</span><span class="w"> </span><span class="p">_)</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">true</span><span class="w"> </span><span class="p">|</span><span class="w"> </span><span class="p">_</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">false</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">normalize</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">([],</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">rev</span><span class="w"> </span><span class="n">ys</span><span class="p">,</span><span class="w"> </span><span class="p">[])</span><span class="w"> </span><span class="p">|</span><span class="w"> </span><span class="n">q</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">q</span><span class="w"></span>\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">push</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">ys</span><span class="p">))</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="p">(</span><span class="n">normalize</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">y::ys</span><span class="p">))</span><span class="w"></span>\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">pop</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">(</span><span class="n">T</span><span class="w"> </span><span class="p">(</span><span class="n">x::xs</span><span class="p">,</span><span class="w"> </span><span class="n">ys</span><span class="p">))</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">SOME</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">T</span><span class="w"> </span><span class="p">(</span><span class="n">normalize</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">ys</span><span class="p">)))</span><span class="w"> </span><span class="p">|</span><span class="w"> </span><span class="p">_</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">NONE</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>One can now write code that uses either the <span class="monospaced">Stack</span> or the <span class="monospaced">Queue</span>\r
dispenser.  One can also instantiate the previously defined functor to\r
create functions for manipulating dispensers of a type:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">S</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">DispenserAlgs</span><span class="w"> </span><span class="p">(</span><span class="n">Stack</span><span class="p">)</span><span class="w"></span>\r
<span class="k">val</span><span class="w"> </span><span class="p">[</span><span class="mi">4</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">S</span><span class="p">.</span><span class="n">popAll</span><span class="w"> </span><span class="p">(</span><span class="n">S</span><span class="p">.</span><span class="n">pushAll</span><span class="w"> </span><span class="p">([</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],</span><span class="w"> </span><span class="n">Stack</span><span class="p">.</span><span class="n">empty</span><span class="p">))</span><span class="w"></span>\r
\r
<span class="k">structure</span><span class="w"> </span><span class="n">Q</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">DispenserAlgs</span><span class="w"> </span><span class="p">(</span><span class="n">Queue</span><span class="p">)</span><span class="w"></span>\r
<span class="k">val</span><span class="w"> </span><span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">]</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">Q</span><span class="p">.</span><span class="n">popAll</span><span class="w"> </span><span class="p">(</span><span class="n">Q</span><span class="p">.</span><span class="n">pushAll</span><span class="w"> </span><span class="p">([</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">],</span><span class="w"> </span><span class="n">Queue</span><span class="p">.</span><span class="n">empty</span><span class="p">))</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>There is no dynamic dispatch involved at the module level in SML.  An\r
attempt to do dynamic dispatch</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">val</span><span class="w"> </span><span class="n">q</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">Q</span><span class="p">.</span><span class="n">push</span><span class="w"> </span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">Stack</span><span class="p">.</span><span class="n">empty</span><span class="p">)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>will give a type error.</p></div>\r
</div>\r
<div class="sect2">\r
<h3 id="_combining_sml_modules_and_dynamic_dispatch">Combining SML Modules and Dynamic Dispatch</h3>\r
<div class="paragraph"><p>Let&#8217;s then combine SML modules and the dynamic dispatch technique\r
introduced in this article.  First we define an interface for\r
dispensers:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">Dispenser</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">struct</span><span class="w"></span>\r
<span class="w">   </span><span class="k">datatype</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">      </span><span class="n">I</span><span class="w"> </span><span class="k">of</span><span class="w"> </span><span class="p">{</span><span class="n">isEmpty</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">unit</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">bool</span><span class="p">,</span><span class="w"></span>\r
<span class="w">            </span><span class="n">push</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="p">,</span><span class="w"></span>\r
<span class="w">            </span><span class="n">pop</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">unit</span><span class="w"> </span><span class="p">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">&#39;a</span><span class="w"> </span><span class="n">*</span><span class="w"> </span><span class="n">&#39;a</span><span class="w"> </span><span class="n">t</span><span class="p">)</span><span class="w"> </span><span class="n">option</span><span class="p">}</span><span class="w"></span>\r
\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">O</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="p">(</span><span class="n">I</span><span class="w"> </span><span class="n">t</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="n">t</span><span class="w"></span>\r
\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">isEmpty</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">O</span><span class="p">#</span><span class="n">isEmpty</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">()</span><span class="w"></span>\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">push</span><span class="w"> </span><span class="p">(</span><span class="n">v</span><span class="p">,</span><span class="w"> </span><span class="n">t</span><span class="p">)</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">O</span><span class="p">#</span><span class="n">push</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="n">v</span><span class="w"></span>\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">pop</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">O</span><span class="p">#</span><span class="n">pop</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="p">()</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The <span class="monospaced">Dispenser</span> module, which we can think of as an interface for\r
dispensers, implements the <span class="monospaced">ABSTRACT_DISPENSER</span> signature using\r
the dynamic dispatch technique, but we leave the signature ascription\r
until later.</p></div>\r
<div class="paragraph"><p>Then we define a <span class="monospaced">DispenserClass</span> functor that makes a "class" out of\r
a given dispenser module:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">functor</span><span class="w"> </span><span class="n">DispenserClass</span><span class="w"> </span><span class="p">(</span><span class="n">D</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">DISPENSER</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">DISPENSER</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">struct</span><span class="w"></span>\r
<span class="w">   </span><span class="k">open</span><span class="w"> </span><span class="n">Dispenser</span><span class="w"></span>\r
\r
<span class="w">   </span><span class="k">fun</span><span class="w"> </span><span class="n">make</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">       </span><span class="n">I</span><span class="w"> </span><span class="p">{</span><span class="n">isEmpty</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">D</span><span class="p">.</span><span class="n">isEmpty</span><span class="w"> </span><span class="n">d</span><span class="p">,</span><span class="w"></span>\r
<span class="w">          </span><span class="n">push</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">make</span><span class="w"> </span><span class="p">(</span><span class="n">D</span><span class="p">.</span><span class="n">push</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="p">)),</span><span class="w"></span>\r
<span class="w">          </span><span class="n">pop</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"></span>\r
<span class="w">                   </span><span class="k">case</span><span class="w"> </span><span class="n">D</span><span class="p">.</span><span class="n">pop</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="k">of</span><span class="w"></span>\r
<span class="w">                      </span><span class="n">NONE</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">NONE</span><span class="w"></span>\r
<span class="w">                    </span><span class="p">|</span><span class="w"> </span><span class="n">SOME</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="p">)</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">SOME</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">make</span><span class="w"> </span><span class="n">d</span><span class="p">)}</span><span class="w"></span>\r
\r
<span class="w">   </span><span class="k">val</span><span class="w"> </span><span class="n">empty</span><span class="w"> </span><span class="p">=</span><span class="w"></span>\r
<span class="w">       </span><span class="n">I</span><span class="w"> </span><span class="p">{</span><span class="n">isEmpty</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">true</span><span class="p">,</span><span class="w"></span>\r
<span class="w">          </span><span class="n">push</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">make</span><span class="w"> </span><span class="p">(</span><span class="n">D</span><span class="p">.</span><span class="n">push</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">D</span><span class="p">.</span><span class="n">empty</span><span class="p">)),</span><span class="w"></span>\r
<span class="w">          </span><span class="n">pop</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="k">fn</span><span class="w"> </span><span class="p">()</span><span class="w"> </span><span class="p">=&gt;</span><span class="w"> </span><span class="n">NONE</span><span class="p">}</span><span class="w"></span>\r
<span class="k">end</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>Finally we seal the <span class="monospaced">Dispenser</span> module:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">Dispenser</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="n">ABSTRACT_DISPENSER</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">Dispenser</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>This isn&#8217;t necessary for type safety, because the unsealed <span class="monospaced">Dispenser</span>\r
module does not allow one to break encapsulation, but makes sure that\r
only the <span class="monospaced">DispenserClass</span> functor can create dispenser classes\r
(because the constructor <span class="monospaced">Dispenser.I</span> is no longer accessible).</p></div>\r
<div class="paragraph"><p>Using the <span class="monospaced">DispenserClass</span> functor we can turn any concrete dispenser\r
module into a dispenser class:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">StackClass</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">DispenserClass</span><span class="w"> </span><span class="p">(</span><span class="n">Stack</span><span class="p">)</span><span class="w"></span>\r
<span class="k">structure</span><span class="w"> </span><span class="n">QueueClass</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">DispenserClass</span><span class="w"> </span><span class="p">(</span><span class="n">Queue</span><span class="p">)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>Each dispenser class implements the same dynamic dispatch interface\r
and the <span class="monospaced">ABSTRACT_DISPENSER</span> -signature.</p></div>\r
<div class="paragraph"><p>Because the dynamic dispatch <span class="monospaced">Dispenser</span> module implements the\r
<span class="monospaced">ABSTRACT_DISPENSER</span>-signature, we can use it to instantiate the\r
<span class="monospaced">DispenserAlgs</span>-functor:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">structure</span><span class="w"> </span><span class="n">D</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">DispenserAlgs</span><span class="w"> </span><span class="p">(</span><span class="n">Dispenser</span><span class="p">)</span><span class="w"></span>\r
</pre></div></div></div>\r
<div class="paragraph"><p>The resulting <span class="monospaced">D</span> module, like the <span class="monospaced">Dispenser</span> module, works with\r
any dispenser class and uses dynamic dispatch:</p></div>\r
<div class="listingblock">\r
<div class="content"><div class="highlight"><pre><span class="k">val</span><span class="w"> </span><span class="p">[</span><span class="mi">4</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">D</span><span class="p">.</span><span class="n">popAll</span><span class="w"> </span><span class="p">(</span><span class="n">D</span><span class="p">.</span><span class="n">pushAll</span><span class="w"> </span><span class="p">([</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">],</span><span class="w"> </span><span class="n">StackClass</span><span class="p">.</span><span class="n">empty</span><span class="p">))</span><span class="w"></span>\r
<span class="k">val</span><span class="w"> </span><span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">]</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="n">D</span><span class="p">.</span><span class="n">popAll</span><span class="w"> </span><span class="p">(</span><span class="n">D</span><span class="p">.</span><span class="n">pushAll</span><span class="w"> </span><span class="p">([</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">4</span><span class="p">],</span><span class="w"> </span><span class="n">QueueClass</span><span class="p">.</span><span class="n">empty</span><span class="p">))</span><span class="w"></span>\r
</pre></div></div></div>\r
</div>\r
</div>\r
</div>\r
</div>\r
<div id="footnotes"><hr></div>\r
<div id="footer">\r
<div id="footer-text">\r
</div>\r
<div id="footer-badges">\r
</div>\r
</div>\r
</body>\r
</html>\r