ifhub/inform7
1
0
Fork 0
mirror of https://github.com/ganelson/inform.git synced 2024-07-16 22:14:23 +03:00
Code Issues Projects Releases Wiki Activity
inform7/docs/inter-module/2-it.html

516 lines
84 KiB
HTML
Raw Normal View History

Recast inter tree structure wholesale
2019-07-24 22:29:29 +03:00
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<title>1/im</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta http-equiv="Content-Language" content="en-gb">
<link href="inweb.css" rel="stylesheet" rev="stylesheet" type="text/css">
</head>
<body>
<!--Weave of '2/it' generated by 7-->
<ul class="crumbs"><li><a href="../webs.html">&#9733;</a></li><li><a href="index.html">inter</a></li><li><a href="index.html#2">Chapter 2: Interoperability</a></li><li><b>Inter Trees</b></li></ul><p class="purpose">To manage tree structures of inter code, and manage the movement of nodes within these trees.</p>
<p class="inwebparagraph"><a id="SP1"></a><b>&#167;1. </b></p>
<pre class="display">
<span class="reserved">typedef</span><span class="plain"> </span><span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree</span><span class="plain"> {</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_warehouse</span><span class="plain"> *</span><span class="identifier">housed</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">root_node</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_package</span><span class="plain"> *</span><span class="identifier">root_package</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_package</span><span class="plain"> *</span><span class="identifier">main_package</span><span class="plain">;</span>
<span class="identifier">MEMORY_MANAGEMENT</span>
<span class="plain">} </span><span class="reserved">inter_tree</span><span class="plain">;</span>
<span class="reserved">typedef</span><span class="plain"> </span><span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> {</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">tree</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_package</span><span class="plain"> *</span><span class="identifier">package</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">parent_itn</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">first_child_itn</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">last_child_itn</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">previous_itn</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">next_itn</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">warehouse_floor_space</span><span class="plain"> </span><span class="identifier">W</span><span class="plain">;</span>
<span class="plain">} </span><span class="reserved">inter_tree_node</span><span class="plain">;</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">The structure inter_tree is accessed in 2/bkm and here.</p>
<p class="endnote">The structure inter_tree_node is accessed in 2/in, 2/st, 2/pck, 2/sym, 2/bkm, 2/iibf, 2/iitf, 2/vi, 2/idt, 3/dfn, 4/tmc, 4/tvc, 4/tpc, 4/tlc, 4/tac, 4/tpc2, 4/tpc3, 4/tkc, 4/tdc, 4/tvc2, 4/tcc2, 4/trc, 4/tic, 4/tpc4, 4/tpc5, 4/tpc6, 4/tpc7, 5/tlc, 5/tlc2, 5/tic, 5/trc, 5/tvc, 5/tlc3, 5/tcc, 5/tec, 5/trc2, 5/tcc2, 5/tsc and here.</p>
<p class="inwebparagraph"><a id="SP2"></a><b>&#167;2. </b></p>
<pre class="display">
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::new_node</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain">, </span><span class="reserved">warehouse_floor_space</span><span class="plain"> </span><span class="identifier">W</span><span class="plain">) {</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">itn</span><span class="plain"> = </span><span class="identifier">CREATE</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain">);</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;tree</span><span class="plain"> = </span><span class="identifier">I</span><span class="plain">;</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;package</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;parent_itn</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;last_child_itn</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;previous_itn</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">itn</span><span class="plain">-</span><span class="element">&gt;W</span><span class="plain"> = </span><span class="identifier">W</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::new</span><span class="plain">(</span><span class="reserved">void</span><span class="plain">) {</span>
<span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain"> = </span><span class="identifier">CREATE</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain">);</span>
<span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;main_package</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain"> = </span><span class="functiontext">Inter::Warehouse::new</span><span class="plain">();</span>
<span class="constant">inter_t</span><span class="plain"> </span><span class="identifier">N</span><span class="plain"> = </span><span class="functiontext">Inter::Warehouse::create_symbols_table</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain">);</span>
<span class="reserved">inter_symbols_table</span><span class="plain"> *</span><span class="identifier">globals</span><span class="plain"> = </span><span class="functiontext">Inter::Warehouse::get_symbols_table</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain">, </span><span class="identifier">N</span><span class="plain">);</span>
<span class="constant">inter_t</span><span class="plain"> </span><span class="identifier">root_package_ID</span><span class="plain"> = </span><span class="functiontext">Inter::Warehouse::create_package</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain">, </span><span class="identifier">I</span><span class="plain">);</span>
<span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_package</span><span class="plain"> = </span><span class="functiontext">Inter::Warehouse::get_package</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain">, </span><span class="identifier">root_package_ID</span><span class="plain">);</span>
<span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_node</span><span class="plain"> = </span><span class="functiontext">Inter::Node::root_frame</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain">, </span><span class="identifier">I</span><span class="plain">);</span>
<span class="functiontext">Inter::Packages::make_rootlike</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_package</span><span class="plain">);</span>
<span class="functiontext">Inter::Packages::set_scope</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_package</span><span class="plain">, </span><span class="identifier">globals</span><span class="plain">);</span>
<span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_node</span><span class="plain">-</span><span class="element">&gt;package</span><span class="plain"> = </span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_package</span><span class="plain">;</span>
<span class="functiontext">Inter::Warehouse::attribute_resource</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain">, </span><span class="identifier">N</span><span class="plain">, </span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_package</span><span class="plain">);</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">I</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_package</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::root_package</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">I</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_package</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_package</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::main_package</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">I</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;main_package</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::set_main_package</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain">, </span><span class="reserved">inter_package</span><span class="plain"> *</span><span class="identifier">M</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">I</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"no tree"</span><span class="plain">);</span>
<span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;main_package</span><span class="plain"> = </span><span class="identifier">M</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_warehouse</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::warehouse</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain">) {</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;housed</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_symbols_table</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::global_scope</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain">) {</span>
<span class="reserved">return</span><span class="plain"> </span><span class="functiontext">Inter::Packages::scope</span><span class="plain">(</span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_package</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::previous</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;previous_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">V</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain">) </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;previous_itn</span><span class="plain"> = </span><span class="identifier">V</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::next</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">V</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain">) </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain"> = </span><span class="identifier">V</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::first_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::set_first_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">V</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain">) </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain"> = </span><span class="identifier">V</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::second_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::third_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::fourth_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::fifth_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::sixth_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;first_child_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">P</span><span class="plain"> = </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;next_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::last_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;last_child_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::set_last_child</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">V</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain">) </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;last_child_itn</span><span class="plain"> = </span><span class="identifier">V</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="functiontext">Inter::Tree::parent</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="reserved">return</span><span class="plain"> </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;parent_itn</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::set_parent</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">V</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain">) </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;parent_itn</span><span class="plain"> = </span><span class="identifier">V</span><span class="plain">;</span>
<span class="plain">}</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">The function Inter::Tree::new_node is used in 2/tw (<a href="2-tw.html#SP3">&#167;3</a>).</p>
<p class="endnote">The function Inter::Tree::new appears nowhere else.</p>
<p class="endnote">The function Inter::Tree::root_package is used in 2/iibf (<a href="2-iibf.html#SP1_4">&#167;1.4</a>), 3/dfn (<a href="3-dfn.html#SP4">&#167;4</a>).</p>
<p class="endnote">The function Inter::Tree::main_package is used in <a href="#SP4">&#167;4</a>, 2/st (<a href="2-st.html#SP4">&#167;4</a>), 2/pck (<a href="2-pck.html#SP3">&#167;3</a>).</p>
<p class="endnote">The function Inter::Tree::set_main_package is used in 2/pck (<a href="2-pck.html#SP3">&#167;3</a>).</p>
<p class="endnote">The function Inter::Tree::warehouse is used in 2/in (<a href="2-in.html#SP4">&#167;4</a>), 2/pck (<a href="2-pck.html#SP3">&#167;3</a>), 2/sym (<a href="2-sym.html#SP4">&#167;4</a>), 2/bkm (<a href="2-bkm.html#SP1">&#167;1</a>), 2/iibf (<a href="2-iibf.html#SP1">&#167;1</a>, <a href="2-iibf.html#SP1_1">&#167;1.1</a>), 2/idt (<a href="2-idt.html#SP3">&#167;3</a>), 3/dfn (<a href="3-dfn.html#SP4">&#167;4</a>).</p>
<p class="endnote">The function Inter::Tree::global_scope is used in 2/in (<a href="2-in.html#SP3">&#167;3</a>), 2/st (<a href="2-st.html#SP8">&#167;8</a>, <a href="2-st.html#SP9">&#167;9</a>, <a href="2-st.html#SP11">&#167;11</a>), 2/bkm (<a href="2-bkm.html#SP1">&#167;1</a>), 2/iibf (<a href="2-iibf.html#SP1_4">&#167;1.4</a>), 4/tpc3 (<a href="4-tpc3.html#SP2">&#167;2</a>), 5/tic (<a href="5-tic.html#SP2">&#167;2</a>).</p>
<p class="endnote">The function Inter::Tree::previous is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_5">&#167;3.5</a>.</p>
<p class="endnote">The function Inter::Tree::set_previous is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_2">&#167;3.2</a>, <a href="#SP3_3">&#167;3.3</a>, <a href="#SP3_4">&#167;3.4</a>, <a href="#SP3_5">&#167;3.5</a>.</p>
<p class="endnote">The function Inter::Tree::next is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_4">&#167;3.4</a>, <a href="#SP4">&#167;4</a>.</p>
<p class="endnote">The function Inter::Tree::set_next is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_2">&#167;3.2</a>, <a href="#SP3_3">&#167;3.3</a>, <a href="#SP3_4">&#167;3.4</a>, <a href="#SP3_5">&#167;3.5</a>.</p>
<p class="endnote">The function Inter::Tree::first_child is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_2">&#167;3.2</a>, <a href="#SP3_5">&#167;3.5</a>, <a href="#SP4">&#167;4</a>.</p>
<p class="endnote">The function Inter::Tree::set_first_child is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_2">&#167;3.2</a>, <a href="#SP3_3">&#167;3.3</a>, <a href="#SP3_5">&#167;3.5</a>.</p>
<p class="endnote">The function Inter::Tree::second_child appears nowhere else.</p>
<p class="endnote">The function Inter::Tree::third_child appears nowhere else.</p>
<p class="endnote">The function Inter::Tree::fourth_child appears nowhere else.</p>
<p class="endnote">The function Inter::Tree::fifth_child appears nowhere else.</p>
<p class="endnote">The function Inter::Tree::sixth_child appears nowhere else.</p>
<p class="endnote">The function Inter::Tree::last_child is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_3">&#167;3.3</a>, <a href="#SP3_4">&#167;3.4</a>, 2/bkm (<a href="2-bkm.html#SP1">&#167;1</a>).</p>
<p class="endnote">The function Inter::Tree::set_last_child is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_2">&#167;3.2</a>, <a href="#SP3_3">&#167;3.3</a>, <a href="#SP3_4">&#167;3.4</a>.</p>
<p class="endnote">The function Inter::Tree::parent is used in <a href="#SP3">&#167;3</a>, <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_4">&#167;3.4</a>, <a href="#SP3_5">&#167;3.5</a>, 2/in (<a href="2-in.html#SP6">&#167;6</a>), 2/pck (<a href="2-pck.html#SP3">&#167;3</a>), 2/ie (<a href="2-ie.html#SP2">&#167;2</a>).</p>
<p class="endnote">The function Inter::Tree::set_parent is used in <a href="#SP3_1">&#167;3.1</a>, <a href="#SP3_2">&#167;3.2</a>, <a href="#SP3_3">&#167;3.3</a>, <a href="#SP3_4">&#167;3.4</a>, <a href="#SP3_5">&#167;3.5</a>.</p>
<p class="inwebparagraph"><a id="SP3"></a><b>&#167;3. </b></p>
<pre class="display">
<span class="reserved">int</span><span class="plain"> </span><span class="identifier">trace_inter_insertion</span><span class="plain"> = </span><span class="identifier">FALSE</span><span class="plain">;</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::insert_node</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">, </span><span class="reserved">inter_bookmark</span><span class="plain"> *</span><span class="identifier">at</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"no frame to insert"</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">at</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"nowhere to insert"</span><span class="plain">);</span>
<span class="reserved">inter_package</span><span class="plain"> *</span><span class="identifier">pack</span><span class="plain"> = </span><span class="functiontext">Inter::Bookmarks::package</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">);</span>
<span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">I</span><span class="plain"> = </span><span class="identifier">pack</span><span class="plain">-</span><span class="element">&gt;stored_in</span><span class="plain">;</span>
<span class="identifier">LOGIF</span><span class="plain">(</span><span class="identifier">INTER_FRAMES</span><span class="plain">, </span><span class="string">"Insert frame %F\</span><span class="plain">n</span><span class="string">"</span><span class="plain">, *</span><span class="identifier">F</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">trace_inter_insertion</span><span class="plain">) </span><span class="functiontext">Inter::Defn::write_construct_text</span><span class="plain">(</span><span class="identifier">DL</span><span class="plain">, </span><span class="identifier">F</span><span class="plain">);</span>
<span class="constant">inter_t</span><span class="plain"> </span><span class="identifier">F_level</span><span class="plain"> = </span><span class="identifier">F</span><span class="plain">-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">LEVEL_IFLD</span><span class="plain">];</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F_level</span><span class="plain"> == 0) {</span>
<span class="functiontext">Inter::Tree::place</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="constant">AS_LAST_CHILD_OF_ICPLACEMENT</span><span class="plain">, </span><span class="identifier">I</span><span class="plain">-</span><span class="element">&gt;root_node</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> ((</span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">) == </span><span class="constant">AFTER_ICPLACEMENT</span><span class="plain">) ||</span>
<span class="plain">(</span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">) == </span><span class="constant">IMMEDIATELY_AFTER_ICPLACEMENT</span><span class="plain">)) {</span>
<span class="functiontext">Inter::Bookmarks::set_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">, </span><span class="identifier">F</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="plain">} </span><span class="reserved">else</span><span class="plain"> {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">) == </span><span class="constant">NOWHERE_ICPLACEMENT</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"bad wrt"</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> ((</span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">) == </span><span class="constant">AFTER_ICPLACEMENT</span><span class="plain">) ||</span>
<span class="plain">(</span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">) == </span><span class="constant">IMMEDIATELY_AFTER_ICPLACEMENT</span><span class="plain">)) {</span>
<span class="reserved">while</span><span class="plain"> (</span><span class="identifier">F_level</span><span class="plain"> &lt; </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">)-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">LEVEL_IFLD</span><span class="plain">]) {</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">R</span><span class="plain"> = </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">);</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">PR</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::parent</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">PR</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"bubbled up out of tree"</span><span class="plain">);</span>
<span class="functiontext">Inter::Bookmarks::set_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">, </span><span class="identifier">PR</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F_level</span><span class="plain"> &gt; </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">)-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">LEVEL_IFLD</span><span class="plain">] + 1) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"bubbled down off of tree"</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F_level</span><span class="plain"> == </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">)-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">LEVEL_IFLD</span><span class="plain">] + 1) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">) == </span><span class="constant">IMMEDIATELY_AFTER_ICPLACEMENT</span><span class="plain">) {</span>
<span class="functiontext">Inter::Tree::place</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="constant">AS_FIRST_CHILD_OF_ICPLACEMENT</span><span class="plain">, </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">));</span>
<span class="functiontext">Inter::Bookmarks::set_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">, </span><span class="constant">AFTER_ICPLACEMENT</span><span class="plain">);</span>
<span class="plain">} </span><span class="reserved">else</span><span class="plain"> {</span>
<span class="functiontext">Inter::Tree::place</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="constant">AS_LAST_CHILD_OF_ICPLACEMENT</span><span class="plain">, </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">));</span>
<span class="plain">}</span>
<span class="plain">} </span><span class="reserved">else</span><span class="plain"> {</span>
<span class="functiontext">Inter::Tree::place</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="constant">AFTER_ICPLACEMENT</span><span class="plain">, </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">));</span>
<span class="plain">}</span>
<span class="functiontext">Inter::Bookmarks::set_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">, </span><span class="identifier">F</span><span class="plain">);</span>
<span class="reserved">return</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="functiontext">Inter::Tree::place</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">), </span><span class="functiontext">Inter::Bookmarks::get_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">));</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="functiontext">Inter::Bookmarks::get_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">) == </span><span class="constant">AS_FIRST_CHILD_OF_ICPLACEMENT</span><span class="plain">) {</span>
<span class="functiontext">Inter::Bookmarks::set_ref</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">, </span><span class="identifier">F</span><span class="plain">);</span>
<span class="functiontext">Inter::Bookmarks::set_placement</span><span class="plain">(</span><span class="identifier">at</span><span class="plain">, </span><span class="constant">AFTER_ICPLACEMENT</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="plain">}</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::remove_node</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain">) {</span>
<span class="functiontext">Inter::Tree::place</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">, </span><span class="constant">NOWHERE_ICPLACEMENT</span><span class="plain">, </span><span class="identifier">NULL</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::place</span><span class="plain">(</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">C</span><span class="plain">, </span><span class="reserved">int</span><span class="plain"> </span><span class="identifier">how</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">R</span><span class="plain">) {</span>
&lt;<span class="cwebmacro">Extricate C from its current tree position</span> <span class="cwebmacronumber">3.1</span>&gt;<span class="plain">;</span>
<span class="reserved">switch</span><span class="plain"> (</span><span class="identifier">how</span><span class="plain">) {</span>
<span class="reserved">case</span><span class="plain"> </span><span class="constant">NOWHERE_ICPLACEMENT</span><span class="plain">:</span>
<span class="reserved">return</span><span class="plain">;</span>
<span class="reserved">case</span><span class="plain"> </span><span class="constant">AS_FIRST_CHILD_OF_ICPLACEMENT</span><span class="plain">:</span>
&lt;<span class="cwebmacro">Make C the first child of R</span> <span class="cwebmacronumber">3.2</span>&gt;<span class="plain">;</span>
<span class="reserved">break</span><span class="plain">;</span>
<span class="reserved">case</span><span class="plain"> </span><span class="constant">AS_LAST_CHILD_OF_ICPLACEMENT</span><span class="plain">:</span>
&lt;<span class="cwebmacro">Make C the last child of R</span> <span class="cwebmacronumber">3.3</span>&gt;<span class="plain">;</span>
<span class="reserved">break</span><span class="plain">;</span>
<span class="reserved">case</span><span class="plain"> </span><span class="constant">AFTER_ICPLACEMENT</span><span class="plain">:</span>
<span class="reserved">case</span><span class="plain"> </span><span class="constant">IMMEDIATELY_AFTER_ICPLACEMENT</span><span class="plain">:</span>
&lt;<span class="cwebmacro">Insert C after R</span> <span class="cwebmacronumber">3.4</span>&gt;<span class="plain">;</span>
<span class="reserved">break</span><span class="plain">;</span>
<span class="reserved">case</span><span class="plain"> </span><span class="constant">BEFORE_ICPLACEMENT</span><span class="plain">:</span>
&lt;<span class="cwebmacro">Insert C before R</span> <span class="cwebmacronumber">3.5</span>&gt;<span class="plain">;</span>
<span class="reserved">break</span><span class="plain">;</span>
<span class="reserved">default</span><span class="plain">:</span>
<span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"unimplemented"</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="plain">}</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">The function Inter::Tree::insert_node is used in 2/iibf (<a href="2-iibf.html#SP1_6">&#167;1.6</a>), 4/tnc (<a href="4-tnc.html#SP1">&#167;1</a>), 4/tcc (<a href="4-tcc.html#SP1">&#167;1</a>), 4/tmc (<a href="4-tmc.html#SP2">&#167;2</a>), 4/tvc (<a href="4-tvc.html#SP2">&#167;2</a>), 4/tpc (<a href="4-tpc.html#SP2">&#167;2</a>), 4/tlc (<a href="4-tlc.html#SP2">&#167;2</a>), 4/tac (<a href="4-tac.html#SP2">&#167;2</a>), 4/tpc2 (<a href="4-tpc2.html#SP2">&#167;2</a>), 4/tpc3 (<a href="4-tpc3.html#SP2">&#167;2</a>), 4/tkc (<a href="4-tkc.html#SP2">&#167;2</a>), 4/tdc (<a href="4-tdc.html#SP2">&#167;2</a>), 4/tvc2 (<a href="4-tvc2.html#SP2">&#167;2</a>), 4/tcc2 (<a href="4-tcc2.html#SP2">&#167;2</a>), 4/trc (<a href="4-trc.html#SP2">&#167;2</a>), 4/tic (<a href="4-tic.html#SP2">&#167;2</a>), 4/tpc4 (<a href="4-tpc4.html#SP2">&#167;2</a>), 4/tpc5 (<a href="4-tpc5.html#SP2">&#167;2</a>), 4/tpc6 (<a href="4-tpc6.html#SP2">&#167;2</a>), 4/tpc7 (<a href="4-tpc7.html#SP2">&#167;2</a>), 5/tlc (<a href="5-tlc.html#SP2">&#167;2</a>), 5/tlc2 (<a href="5-tlc2.html#SP2">&#167;2</a>), 5/tic (<a href="5-tic.html#SP2">&#167;2</a>), 5/trc (<a href="5-trc.html#SP2">&#167;2</a>), 5/tvc (<a href="5-tvc.html#SP2">&#167;2</a>), 5/tlc3 (<a href="5-tlc3.html#SP2">&#167;2</a>), 5/tcc (<a href="5-tcc.html#SP2">&#167;2</a>), 5/tec (<a href="5-tec.html#SP2">&#167;2</a>), 5/trc2 (<a href="5-trc2.html#SP2">&#167;2</a>), 5/tcc2 (<a href="5-tcc2.html#SP2">&#167;2</a>), 5/tsc (<a href="5-tsc.html#SP2">&#167;2</a>).</p>
<p class="endnote">The function Inter::Tree::remove_node is used in 2/sym (<a href="2-sym.html#SP4">&#167;4</a>).</p>
<p class="endnote">The function Inter::Tree::place appears nowhere else.</p>
<p class="inwebparagraph"><a id="SP3_1"></a><b>&#167;3.1. </b><code class="display">
&lt;<span class="cwebmacrodefn">Extricate C from its current tree position</span> <span class="cwebmacronumber">3.1</span>&gt; =
</code></p>
<pre class="displaydefn">
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">OP</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::parent</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">OP</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="functiontext">Inter::Tree::first_child</span><span class="plain">(</span><span class="identifier">OP</span><span class="plain">) == </span><span class="identifier">C</span><span class="plain">)</span>
<span class="functiontext">Inter::Tree::set_first_child</span><span class="plain">(</span><span class="identifier">OP</span><span class="plain">, </span><span class="functiontext">Inter::Tree::next</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">));</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="functiontext">Inter::Tree::last_child</span><span class="plain">(</span><span class="identifier">OP</span><span class="plain">) == </span><span class="identifier">C</span><span class="plain">)</span>
<span class="functiontext">Inter::Tree::set_last_child</span><span class="plain">(</span><span class="identifier">OP</span><span class="plain">, </span><span class="functiontext">Inter::Tree::previous</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">));</span>
<span class="plain">}</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">OB</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::previous</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">);</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">OD</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::next</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">OB</span><span class="plain">) {</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">OB</span><span class="plain">, </span><span class="identifier">OD</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">OD</span><span class="plain">) {</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">OD</span><span class="plain">, </span><span class="identifier">OB</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="functiontext">Inter::Tree::set_parent</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">NULL</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">NULL</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">NULL</span><span class="plain">);</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">This code is used in <a href="#SP3">&#167;3</a>.</p>
<p class="inwebparagraph"><a id="SP3_2"></a><b>&#167;3.2. </b><code class="display">
&lt;<span class="cwebmacrodefn">Make C the first child of R</span> <span class="cwebmacronumber">3.2</span>&gt; =
</code></p>
<pre class="displaydefn">
<span class="functiontext">Inter::Tree::set_parent</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">D</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::first_child</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">D</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) {</span>
<span class="functiontext">Inter::Tree::set_last_child</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">NULL</span><span class="plain">);</span>
<span class="plain">} </span><span class="reserved">else</span><span class="plain"> {</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">D</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">D</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="functiontext">Inter::Tree::set_first_child</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">This code is used in <a href="#SP3">&#167;3</a>.</p>
<p class="inwebparagraph"><a id="SP3_3"></a><b>&#167;3.3. </b><code class="display">
&lt;<span class="cwebmacrodefn">Make C the last child of R</span> <span class="cwebmacronumber">3.3</span>&gt; =
</code></p>
<pre class="displaydefn">
<span class="functiontext">Inter::Tree::set_parent</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">B</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::last_child</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">B</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) {</span>
<span class="functiontext">Inter::Tree::set_first_child</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">NULL</span><span class="plain">);</span>
<span class="plain">} </span><span class="reserved">else</span><span class="plain"> {</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">B</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">B</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="functiontext">Inter::Tree::set_last_child</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">This code is used in <a href="#SP3">&#167;3</a>.</p>
<p class="inwebparagraph"><a id="SP3_4"></a><b>&#167;3.4. </b><code class="display">
&lt;<span class="cwebmacrodefn">Insert C after R</span> <span class="cwebmacronumber">3.4</span>&gt; =
</code></p>
<pre class="displaydefn">
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::parent</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"can't move C after R when R is nowhere"</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_parent</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">P</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="functiontext">Inter::Tree::last_child</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">) == </span><span class="identifier">R</span><span class="plain">)</span>
<span class="functiontext">Inter::Tree::set_last_child</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="reserved">else</span><span class="plain"> {</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">D</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::next</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">D</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"inter tree broken"</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">D</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">D</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">R</span><span class="plain">);</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">This code is used in <a href="#SP3">&#167;3</a>.</p>
<p class="inwebparagraph"><a id="SP3_5"></a><b>&#167;3.5. </b><code class="display">
&lt;<span class="cwebmacrodefn">Insert C before R</span> <span class="cwebmacronumber">3.5</span>&gt; =
</code></p>
<pre class="displaydefn">
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::parent</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">P</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"can't move C before R when R is nowhere"</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_parent</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">P</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="functiontext">Inter::Tree::first_child</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">) == </span><span class="identifier">R</span><span class="plain">)</span>
<span class="functiontext">Inter::Tree::set_first_child</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="reserved">else</span><span class="plain"> {</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">B</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::previous</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">B</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"inter tree broken"</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">B</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">B</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="functiontext">Inter::Tree::set_next</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">R</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::set_previous</span><span class="plain">(</span><span class="identifier">R</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">);</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">This code is used in <a href="#SP3">&#167;3</a>.</p>
<p class="inwebparagraph"><a id="SP4"></a><b>&#167;4. </b></p>
<pre class="definitions">
<span class="definitionkeyword">define</span> <span class="identifier">LOOP_THROUGH_INTER_CHILDREN</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="identifier">P</span><span class="plain">)</span>
<span class="reserved">for</span><span class="plain"> (</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::first_child</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">); </span><span class="identifier">F</span><span class="plain">; </span><span class="identifier">F</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::next</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">))</span>
<span class="definitionkeyword">define</span> <span class="identifier">PROTECTED_LOOP_THROUGH_INTER_CHILDREN</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="identifier">P</span><span class="plain">)</span>
<span class="reserved">for</span><span class="plain"> (</span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::first_child</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">), *</span><span class="identifier">FN</span><span class="plain"> = </span><span class="identifier">F</span><span class="plain">?(</span><span class="functiontext">Inter::Tree::next</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">)):</span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">F</span><span class="plain">; </span><span class="identifier">F</span><span class="plain"> = </span><span class="identifier">FN</span><span class="plain">, </span><span class="identifier">FN</span><span class="plain"> = </span><span class="identifier">FN</span><span class="plain">?(</span><span class="functiontext">Inter::Tree::next</span><span class="plain">(</span><span class="identifier">FN</span><span class="plain">)):</span><span class="identifier">NULL</span><span class="plain">)</span>
</pre>
<pre class="display">
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::traverse_root_only</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">from</span><span class="plain">, </span><span class="reserved">void</span><span class="plain"> (*</span><span class="identifier">visitor</span><span class="plain">)(</span><span class="reserved">inter_tree</span><span class="plain"> *, </span><span class="reserved">inter_tree_node</span><span class="plain"> *, </span><span class="reserved">void</span><span class="plain"> *), </span><span class="reserved">void</span><span class="plain"> *</span><span class="identifier">state</span><span class="plain">, </span><span class="reserved">int</span><span class="plain"> </span><span class="identifier">filter</span><span class="plain">) {</span>
<span class="identifier">PROTECTED_LOOP_THROUGH_INTER_CHILDREN</span><span class="plain">(</span><span class="identifier">P</span><span class="plain">, </span><span class="identifier">from</span><span class="plain">-</span><span class="element">&gt;root_node</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> ((</span><span class="identifier">filter</span><span class="plain"> == 0) ||</span>
<span class="plain">((</span><span class="identifier">filter</span><span class="plain"> &gt; 0) &amp;&amp; (</span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">ID_IFLD</span><span class="plain">] == (</span><span class="constant">inter_t</span><span class="plain">) </span><span class="identifier">filter</span><span class="plain">)) ||</span>
<span class="plain">((</span><span class="identifier">filter</span><span class="plain"> &lt; 0) &amp;&amp; (</span><span class="identifier">P</span><span class="plain">-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">ID_IFLD</span><span class="plain">] != (</span><span class="constant">inter_t</span><span class="plain">) -</span><span class="identifier">filter</span><span class="plain">)))</span>
<span class="plain">(*</span><span class="identifier">visitor</span><span class="plain">)(</span><span class="identifier">from</span><span class="plain">, </span><span class="identifier">P</span><span class="plain">, </span><span class="identifier">state</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::traverse</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">from</span><span class="plain">, </span><span class="reserved">void</span><span class="plain"> (*</span><span class="identifier">visitor</span><span class="plain">)(</span><span class="reserved">inter_tree</span><span class="plain"> *, </span><span class="reserved">inter_tree_node</span><span class="plain"> *, </span><span class="reserved">void</span><span class="plain"> *), </span><span class="reserved">void</span><span class="plain"> *</span><span class="identifier">state</span><span class="plain">, </span><span class="reserved">inter_package</span><span class="plain"> *</span><span class="identifier">mp</span><span class="plain">, </span><span class="reserved">int</span><span class="plain"> </span><span class="identifier">filter</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">mp</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">mp</span><span class="plain"> = </span><span class="functiontext">Inter::Tree::main_package</span><span class="plain">(</span><span class="identifier">from</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">mp</span><span class="plain">) {</span>
<span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">D</span><span class="plain"> = </span><span class="functiontext">Inter::Symbols::definition</span><span class="plain">(</span><span class="identifier">mp</span><span class="plain">-</span><span class="element">&gt;package_name</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> ((</span><span class="identifier">filter</span><span class="plain"> == 0) ||</span>
<span class="plain">((</span><span class="identifier">filter</span><span class="plain"> &gt; 0) &amp;&amp; (</span><span class="identifier">D</span><span class="plain">-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">ID_IFLD</span><span class="plain">] == (</span><span class="constant">inter_t</span><span class="plain">) </span><span class="identifier">filter</span><span class="plain">)) ||</span>
<span class="plain">((</span><span class="identifier">filter</span><span class="plain"> &lt; 0) &amp;&amp; (</span><span class="identifier">D</span><span class="plain">-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">ID_IFLD</span><span class="plain">] != (</span><span class="constant">inter_t</span><span class="plain">) -</span><span class="identifier">filter</span><span class="plain">)))</span>
<span class="plain">(*</span><span class="identifier">visitor</span><span class="plain">)(</span><span class="identifier">from</span><span class="plain">, </span><span class="identifier">D</span><span class="plain">, </span><span class="identifier">state</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::traverse_r</span><span class="plain">(</span><span class="identifier">from</span><span class="plain">, </span><span class="identifier">D</span><span class="plain">, </span><span class="identifier">visitor</span><span class="plain">, </span><span class="identifier">state</span><span class="plain">, </span><span class="identifier">filter</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Tree::traverse_r</span><span class="plain">(</span><span class="reserved">inter_tree</span><span class="plain"> *</span><span class="identifier">from</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">P</span><span class="plain">, </span><span class="reserved">void</span><span class="plain"> (*</span><span class="identifier">visitor</span><span class="plain">)(</span><span class="reserved">inter_tree</span><span class="plain"> *, </span><span class="reserved">inter_tree_node</span><span class="plain"> *, </span><span class="reserved">void</span><span class="plain"> *), </span><span class="reserved">void</span><span class="plain"> *</span><span class="identifier">state</span><span class="plain">, </span><span class="reserved">int</span><span class="plain"> </span><span class="identifier">filter</span><span class="plain">) {</span>
<span class="identifier">PROTECTED_LOOP_THROUGH_INTER_CHILDREN</span><span class="plain">(</span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">P</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> ((</span><span class="identifier">filter</span><span class="plain"> == 0) ||</span>
<span class="plain">((</span><span class="identifier">filter</span><span class="plain"> &gt; 0) &amp;&amp; (</span><span class="identifier">C</span><span class="plain">-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">ID_IFLD</span><span class="plain">] == (</span><span class="constant">inter_t</span><span class="plain">) </span><span class="identifier">filter</span><span class="plain">)) ||</span>
<span class="plain">((</span><span class="identifier">filter</span><span class="plain"> &lt; 0) &amp;&amp; (</span><span class="identifier">C</span><span class="plain">-</span><span class="element">&gt;W.data</span><span class="plain">[</span><span class="constant">ID_IFLD</span><span class="plain">] != (</span><span class="constant">inter_t</span><span class="plain">) -</span><span class="identifier">filter</span><span class="plain">)))</span>
<span class="plain">(*</span><span class="identifier">visitor</span><span class="plain">)(</span><span class="identifier">from</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">state</span><span class="plain">);</span>
<span class="functiontext">Inter::Tree::traverse_r</span><span class="plain">(</span><span class="identifier">from</span><span class="plain">, </span><span class="identifier">C</span><span class="plain">, </span><span class="identifier">visitor</span><span class="plain">, </span><span class="identifier">state</span><span class="plain">, </span><span class="identifier">filter</span><span class="plain">);</span>
<span class="plain">}</span>
<span class="plain">}</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">The function Inter::Tree::traverse_root_only is used in 2/iibf (<a href="2-iibf.html#SP1_1_5">&#167;1.1.5</a>), 2/iitf (<a href="2-iitf.html#SP2">&#167;2</a>).</p>
<p class="endnote">The function Inter::Tree::traverse is used in 2/st (<a href="2-st.html#SP10">&#167;10</a>), 2/iibf (<a href="2-iibf.html#SP1_1_5">&#167;1.1.5</a>), 2/iitf (<a href="2-iitf.html#SP1">&#167;1</a>, <a href="2-iitf.html#SP2">&#167;2</a>).</p>
<p class="endnote">The function Inter::Tree::traverse_r appears nowhere else.</p>
<hr class="tocbar">
<ul class="toc"><li><i>(This section begins Chapter 2: Interoperability.)</i></li><li><a href="2-in.html">Continue with 'Inter Nodes'</a></li></ul><hr class="tocbar">
<!--End of weave-->
</body>
</html>
Reference in a new issue Copy permalink