--- /dev/null
+ <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+ <html xmlns="http://www.w3.org/1999/xhtml">
+<!--
+This file was generated by Devel::NYTProf version 4.06
+-->
+<head>
+ <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+ <meta http-equiv="Content-Language" content="en-us" />
+ <title>Profile of PPI/Node.pm</title>
+<link rel="stylesheet" type="text/css" href="style.css" />
+ <script type="text/javascript" src="js/jquery-min.js"></script>
+
+ <script type="text/javascript" src="js/jquery-tablesorter-min.js"></script>
+ <link rel="stylesheet" type="text/css" href="js/style-tablesorter.css" />
+ <script type="text/javascript">
+ // when a column is first clicked on to sort it, use descending order
+ // XXX doesn't seem to work (and not just because the tablesorter formatSortingOrder() is broken)
+ $.tablesorter.defaults.sortInitialOrder = "desc";
+ // add parser through the tablesorter addParser method
+ $.tablesorter.addParser({
+ id: 'fmt_time', // name of this parser
+ is: function(s) {
+ return false; // return false so this parser is not auto detected
+ },
+ format: function(orig) { // format data for normalization
+ // console.log(orig);
+ val = orig.replace(/ns/,'');
+ if (val != orig) { return val / (1000*1000*1000); }
+ val = orig.replace(/µs/,''); /* XXX use µ ? */
+ if (val != orig) { return val / (1000*1000); }
+ var val = orig.replace(/ms/,'');
+ if (val != orig) { return val / (1000); }
+ var val = orig.replace(/s/,'');
+ if (val != orig) { return val; }
+ if (orig == '0') { return orig; }
+ console.log('no match for fmt_time of '.concat(orig));
+ return orig;
+ },
+ type: 'numeric' // set type, either numeric or text
+ });
+ </script>
+</head>
+
+<body >
+<div class="header" style="position: relative; overflow-x: hidden; overflow-y: hidden; z-index: 0; ">
+<div class="header_back">
+ <a href="index.html">← Index</a>
+ </div>
+<div class="headerForeground" style="float: left">
+ <span class="siteTitle">NYTProf Performance Profile</span>
+ <span class="siteSubtitle">  <span>« <span class="mode_btn"><a href="PPI-Node-pm-921-block.html">block view</a></span> • <span class="mode_btn mode_btn_selected">line view</span> • <span class="mode_btn"><a href="PPI-Node-pm-921-sub.html">sub view</a></span> »</span><br />
+ For script/nytprof.pl
+ </span>
+</div>
+<div class="headerForeground" style="float: right; text-align: right">
+ <span class="siteTitle"> </span>
+ <span class="siteSubtitle">Run on Thu May 31 16:49:15 2012<br />Reported on Thu May 31 16:55:10 2012</span>
+</div>
+<div style="position: absolute; left: 0px; top: 0%; width: 100%; height: 101%; z-index: -1; background-color: rgb(17, 136, 255); "></div>
+<div style="position: absolute; left: 0px; top: 2%; width: 100%; height: 99%; z-index: -1; background-color: rgb(16, 134, 253); "></div>
+<div style="position: absolute; left: 0px; top: 4%; width: 100%; height: 97%; z-index: -1; background-color: rgb(16, 133, 252); "></div>
+<div style="position: absolute; left: 0px; top: 6%; width: 100%; height: 95%; z-index: -1; background-color: rgb(15, 131, 250); "></div>
+<div style="position: absolute; left: 0px; top: 8%; width: 100%; height: 93%; z-index: -1; background-color: rgb(15, 130, 249); "></div>
+<div style="position: absolute; left: 0px; top: 10%; width: 100%; height: 91%; z-index: -1; background-color: rgb(15, 129, 248); "></div>
+<div style="position: absolute; left: 0px; top: 12%; width: 100%; height: 89%; z-index: -1; background-color: rgb(14, 127, 246); "></div>
+<div style="position: absolute; left: 0px; top: 14%; width: 100%; height: 87%; z-index: -1; background-color: rgb(14, 126, 245); "></div>
+<div style="position: absolute; left: 0px; top: 16%; width: 100%; height: 85%; z-index: -1; background-color: rgb(14, 125, 244); "></div>
+<div style="position: absolute; left: 0px; top: 18%; width: 100%; height: 83%; z-index: -1; background-color: rgb(13, 123, 242); "></div>
+<div style="position: absolute; left: 0px; top: 20%; width: 100%; height: 81%; z-index: -1; background-color: rgb(13, 122, 241); "></div>
+<div style="position: absolute; left: 0px; top: 22%; width: 100%; height: 79%; z-index: -1; background-color: rgb(13, 121, 240); "></div>
+<div style="position: absolute; left: 0px; top: 24%; width: 100%; height: 77%; z-index: -1; background-color: rgb(12, 119, 238); "></div>
+<div style="position: absolute; left: 0px; top: 26%; width: 100%; height: 75%; z-index: -1; background-color: rgb(12, 118, 237); "></div>
+<div style="position: absolute; left: 0px; top: 28%; width: 100%; height: 73%; z-index: -1; background-color: rgb(12, 116, 235); "></div>
+<div style="position: absolute; left: 0px; top: 30%; width: 100%; height: 71%; z-index: -1; background-color: rgb(11, 115, 234); "></div>
+<div style="position: absolute; left: 0px; top: 32%; width: 100%; height: 69%; z-index: -1; background-color: rgb(11, 114, 233); "></div>
+<div style="position: absolute; left: 0px; top: 34%; width: 100%; height: 67%; z-index: -1; background-color: rgb(11, 112, 231); "></div>
+<div style="position: absolute; left: 0px; top: 36%; width: 100%; height: 65%; z-index: -1; background-color: rgb(10, 111, 230); "></div>
+<div style="position: absolute; left: 0px; top: 38%; width: 100%; height: 63%; z-index: -1; background-color: rgb(10, 110, 229); "></div>
+<div style="position: absolute; left: 0px; top: 40%; width: 100%; height: 61%; z-index: -1; background-color: rgb(10, 108, 227); "></div>
+<div style="position: absolute; left: 0px; top: 42%; width: 100%; height: 59%; z-index: -1; background-color: rgb(9, 107, 226); "></div>
+<div style="position: absolute; left: 0px; top: 44%; width: 100%; height: 57%; z-index: -1; background-color: rgb(9, 106, 225); "></div>
+<div style="position: absolute; left: 0px; top: 46%; width: 100%; height: 55%; z-index: -1; background-color: rgb(9, 104, 223); "></div>
+<div style="position: absolute; left: 0px; top: 48%; width: 100%; height: 53%; z-index: -1; background-color: rgb(8, 103, 222); "></div>
+<div style="position: absolute; left: 0px; top: 50%; width: 100%; height: 51%; z-index: -1; background-color: rgb(8, 102, 221); "></div>
+<div style="position: absolute; left: 0px; top: 52%; width: 100%; height: 49%; z-index: -1; background-color: rgb(8, 100, 219); "></div>
+<div style="position: absolute; left: 0px; top: 54%; width: 100%; height: 47%; z-index: -1; background-color: rgb(7, 99, 218); "></div>
+<div style="position: absolute; left: 0px; top: 56%; width: 100%; height: 45%; z-index: -1; background-color: rgb(7, 97, 216); "></div>
+<div style="position: absolute; left: 0px; top: 58%; width: 100%; height: 43%; z-index: -1; background-color: rgb(7, 96, 215); "></div>
+<div style="position: absolute; left: 0px; top: 60%; width: 100%; height: 41%; z-index: -1; background-color: rgb(6, 95, 214); "></div>
+<div style="position: absolute; left: 0px; top: 62%; width: 100%; height: 39%; z-index: -1; background-color: rgb(6, 93, 212); "></div>
+<div style="position: absolute; left: 0px; top: 64%; width: 100%; height: 37%; z-index: -1; background-color: rgb(6, 92, 211); "></div>
+<div style="position: absolute; left: 0px; top: 66%; width: 100%; height: 35%; z-index: -1; background-color: rgb(5, 91, 210); "></div>
+<div style="position: absolute; left: 0px; top: 68%; width: 100%; height: 33%; z-index: -1; background-color: rgb(5, 89, 208); "></div>
+<div style="position: absolute; left: 0px; top: 70%; width: 100%; height: 31%; z-index: -1; background-color: rgb(5, 88, 207); "></div>
+<div style="position: absolute; left: 0px; top: 72%; width: 100%; height: 29%; z-index: -1; background-color: rgb(4, 87, 206); "></div>
+<div style="position: absolute; left: 0px; top: 74%; width: 100%; height: 27%; z-index: -1; background-color: rgb(4, 85, 204); "></div>
+<div style="position: absolute; left: 0px; top: 76%; width: 100%; height: 25%; z-index: -1; background-color: rgb(4, 84, 203); "></div>
+<div style="position: absolute; left: 0px; top: 78%; width: 100%; height: 23%; z-index: -1; background-color: rgb(3, 82, 201); "></div>
+<div style="position: absolute; left: 0px; top: 80%; width: 100%; height: 21%; z-index: -1; background-color: rgb(3, 81, 200); "></div>
+<div style="position: absolute; left: 0px; top: 82%; width: 100%; height: 19%; z-index: -1; background-color: rgb(3, 80, 199); "></div>
+<div style="position: absolute; left: 0px; top: 84%; width: 100%; height: 17%; z-index: -1; background-color: rgb(2, 78, 197); "></div>
+<div style="position: absolute; left: 0px; top: 86%; width: 100%; height: 15%; z-index: -1; background-color: rgb(2, 77, 196); "></div>
+<div style="position: absolute; left: 0px; top: 88%; width: 100%; height: 13%; z-index: -1; background-color: rgb(2, 76, 195); "></div>
+<div style="position: absolute; left: 0px; top: 90%; width: 100%; height: 11%; z-index: -1; background-color: rgb(1, 74, 193); "></div>
+<div style="position: absolute; left: 0px; top: 92%; width: 100%; height: 9%; z-index: -1; background-color: rgb(1, 73, 192); "></div>
+<div style="position: absolute; left: 0px; top: 94%; width: 100%; height: 7%; z-index: -1; background-color: rgb(1, 72, 191); "></div>
+<div style="position: absolute; left: 0px; top: 96%; width: 100%; height: 5%; z-index: -1; background-color: rgb(0, 70, 189); "></div>
+<div style="position: absolute; left: 0px; top: 98%; width: 100%; height: 3%; z-index: -1; background-color: rgb(0, 69, 188); "></div>
+<div style="position: absolute; left: 0px; top: 100%; width: 100%; height: 1%; z-index: -1; background-color: rgb(0, 68, 187); "></div>
+</div>
+
+<div class="body_content"><br />
+<table class="file_summary"><tr><td class="h">Filename</td><td align="left"><a href="file:///Users/edenc/perl5/lib/perl5/PPI/Node.pm">/Users/edenc/perl5/lib/perl5/PPI/Node.pm</a></td></tr>
+<tr><td class="h">Statements</td><td align="left">Executed 2234 statements in 7.74ms</td></tr></table>
+
+ <table id="subs_table" border="1" cellpadding="0" class="tablesorter">
+ <caption>Subroutines</caption>
+ <thead>
+ <tr>
+ <th>Calls</th>
+ <th><span title="Number of Places sub is called from">P</span></th>
+ <th><span title="Number of Files sub is called from">F</span></th>
+ <th>Exclusive<br />Time</th>
+ <th>Inclusive<br />Time</th>
+ <th>Subroutine</th>
+ </tr>
+ </thead>
+ <tbody>
+<tr><td class="c0">32</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.0%">2.41ms</span></td><td class="c0"><span title="0.0%">2.74ms</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::_wanted</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#601">_wanted</a></span></td></tr>
+<tr><td class="c0">32</td><td class="c0">4</td><td class="c3">1</td><td class="c0"><span title="0.0%">1.84ms</span></td><td class="c0"><span title="0.0%">5.96ms</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::find</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#371">find</a></span></td></tr>
+<tr><td class="c0">16</td><td class="c1">2</td><td class="c1">2</td><td class="c0"><span title="0.0%">408µs</span></td><td class="c0"><span title="0.0%">587µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::DESTROY</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#695">DESTROY</a> (recurses: max depth 1, inclusive time 52µs)</span></td></tr>
+<tr><td class="c0">8</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.0%">229µs</span></td><td class="c0"><span title="0.0%">229µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::new</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#72">new</a></span></td></tr>
+<tr><td class="c0">16</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.0%">115µs</span></td><td class="c1"><span title="0.0%">126µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::schild</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#270">schild</a></span></td></tr>
+<tr><td class="c0">8</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.0%">114µs</span></td><td class="c0"><span title="0.0%">175µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::add_element</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#110">add_element</a></span></td></tr>
+<tr><td class="c0">16</td><td class="c3">1</td><td class="c3">1</td><td class="c1"><span title="0.0%">31µs</span></td><td class="c3"><span title="0.0%">31µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::first_element</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#173">first_element</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">16µs</span></td><td class="c3"><span title="0.0%">21µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@51</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#51">BEGIN@51</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">14µs</span></td><td class="c3"><span title="0.0%">14µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@59</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#59">BEGIN@59</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">11µs</span></td><td class="c3"><span title="0.0%">55µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@55</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#55">BEGIN@55</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">10µs</span></td><td class="c3"><span title="0.0%">79µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@58</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#58">BEGIN@58</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">7µs</span></td><td class="c3"><span title="0.0%">33µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@53</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#53">BEGIN@53</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">6µs</span></td><td class="c3"><span title="0.0%">6µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@56</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#56">BEGIN@56</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">4µs</span></td><td class="c3"><span title="0.0%">4µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@52</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#52">BEGIN@52</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">4µs</span></td><td class="c3"><span title="0.0%">4µs</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::BEGIN@54</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#54">BEGIN@54</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__ANON__[:508]</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#506">__ANON__[:508]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__ANON__[:715]</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#715">__ANON__[:715]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__ANON__[:724]</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#722">__ANON__[:724]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__ANON__[:740]</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#738">__ANON__[:740]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__ANON__[:756]</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#754">__ANON__[:756]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__add_element</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#128">__add_element</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__insert_after_child</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#735">__insert_after_child</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__insert_before_child</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#719">__insert_before_child</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__link_children</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#768">__link_children</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__position</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#713">__position</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::__replace_child</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#751">__replace_child</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::child</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#249">child</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::children</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#212">children</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::clone</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#675">clone</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::contains</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#303">contains</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::content</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#670">content</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::elements</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#151">elements</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::find_any</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#481">find_any</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::find_first</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#428">find_first</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::last_element</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#191">last_element</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::location</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#682">location</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::prune</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#563">prune</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::remove_child</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#500">remove_child</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::schildren</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#228">schildren</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::scope</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#94">scope</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">PPI::Node::::tokens</span>PPI::Node::<a href="PPI-Node-pm-921-line.html#665">tokens</a></span></td></tr>
+</tbody></table>
+ Call graph for these subroutines as a
+ <a href="http://en.wikipedia.org/wiki/Graphviz">Graphviz</a>
+ <a href="Users-edenc-perl5-lib-perl5-PPI-Node-pm.dot">dot language file</a>.
+
+ <table border="1" cellpadding="0">
+ <thead>
+ <tr><th>Line</th>
+ <th><span title="Number of statements executed">State<br />ments</span></th>
+ <th><span title="Time spend executing statements on the line,
+ excluding time spent executing statements in any called subroutines">Time<br />on line</span></th>
+ <th><span title="Number of subroutines calls">Calls</span></th>
+ <th><span title="Time spent in subroutines called (inclusive)">Time<br />in subs</span></th>
+ <th class="left_indent_header">Code</th>
+ </tr>
+
+ </thead>
+ <tbody>
+ <tr><td class="h"><a name="1"></a>1</td><td></td><td></td><td></td><td></td><td class="s">package PPI::Node;</td></tr>
+<tr><td class="h"><a name="2"></a>2</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3"></a>3</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="4"></a>4</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="5"></a>5</td><td></td><td></td><td></td><td></td><td class="s">=head1 NAME</td></tr>
+<tr><td class="h"><a name="6"></a>6</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="7"></a>7</td><td></td><td></td><td></td><td></td><td class="s">PPI::Node - Abstract PPI Node class, an Element that can contain other Elements</td></tr>
+<tr><td class="h"><a name="8"></a>8</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="9"></a>9</td><td></td><td></td><td></td><td></td><td class="s">=head1 INHERITANCE</td></tr>
+<tr><td class="h"><a name="10"></a>10</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="11"></a>11</td><td></td><td></td><td></td><td></td><td class="s"> PPI::Node</td></tr>
+<tr><td class="h"><a name="12"></a>12</td><td></td><td></td><td></td><td></td><td class="s"> isa PPI::Element</td></tr>
+<tr><td class="h"><a name="13"></a>13</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="14"></a>14</td><td></td><td></td><td></td><td></td><td class="s">=head1 SYNOPSIS</td></tr>
+<tr><td class="h"><a name="15"></a>15</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="16"></a>16</td><td></td><td></td><td></td><td></td><td class="s"> # Create a typical node (a Document in this case)</td></tr>
+<tr><td class="h"><a name="17"></a>17</td><td></td><td></td><td></td><td></td><td class="s"> my $Node = PPI::Document->new;</td></tr>
+<tr><td class="h"><a name="18"></a>18</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="19"></a>19</td><td></td><td></td><td></td><td></td><td class="s"> # Add an element to the node( in this case, a token )</td></tr>
+<tr><td class="h"><a name="20"></a>20</td><td></td><td></td><td></td><td></td><td class="s"> my $Token = PPI::Token::Word->new('my');</td></tr>
+<tr><td class="h"><a name="21"></a>21</td><td></td><td></td><td></td><td></td><td class="s"> $Node->add_element( $Token );</td></tr>
+<tr><td class="h"><a name="22"></a>22</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="23"></a>23</td><td></td><td></td><td></td><td></td><td class="s"> # Get the elements for the Node</td></tr>
+<tr><td class="h"><a name="24"></a>24</td><td></td><td></td><td></td><td></td><td class="s"> my @elements = $Node->children;</td></tr>
+<tr><td class="h"><a name="25"></a>25</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="26"></a>26</td><td></td><td></td><td></td><td></td><td class="s"> # Find all the barewords within a Node</td></tr>
+<tr><td class="h"><a name="27"></a>27</td><td></td><td></td><td></td><td></td><td class="s"> my $barewords = $Node->find( 'PPI::Token::Word' );</td></tr>
+<tr><td class="h"><a name="28"></a>28</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="29"></a>29</td><td></td><td></td><td></td><td></td><td class="s"> # Find by more complex criteria</td></tr>
+<tr><td class="h"><a name="30"></a>30</td><td></td><td></td><td></td><td></td><td class="s"> my $my_tokens = $Node->find( sub { $_[1]->content eq 'my' } );</td></tr>
+<tr><td class="h"><a name="31"></a>31</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="32"></a>32</td><td></td><td></td><td></td><td></td><td class="s"> # Remove all the whitespace</td></tr>
+<tr><td class="h"><a name="33"></a>33</td><td></td><td></td><td></td><td></td><td class="s"> $Node->prune( 'PPI::Token::Whitespace' );</td></tr>
+<tr><td class="h"><a name="34"></a>34</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="35"></a>35</td><td></td><td></td><td></td><td></td><td class="s"> # Remove by more complex criteria</td></tr>
+<tr><td class="h"><a name="36"></a>36</td><td></td><td></td><td></td><td></td><td class="s"> $Node->prune( sub { $_[1]->content eq 'my' } );</td></tr>
+<tr><td class="h"><a name="37"></a>37</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="38"></a>38</td><td></td><td></td><td></td><td></td><td class="s">=head1 DESCRIPTION</td></tr>
+<tr><td class="h"><a name="39"></a>39</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="40"></a>40</td><td></td><td></td><td></td><td></td><td class="s">The C<PPI::Node> class provides an abstract base class for the Element</td></tr>
+<tr><td class="h"><a name="41"></a>41</td><td></td><td></td><td></td><td></td><td class="s">classes that are able to contain other elements L<PPI::Document>,</td></tr>
+<tr><td class="h"><a name="42"></a>42</td><td></td><td></td><td></td><td></td><td class="s">L<PPI::Statement>, and L<PPI::Structure>.</td></tr>
+<tr><td class="h"><a name="43"></a>43</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="44"></a>44</td><td></td><td></td><td></td><td></td><td class="s">As well as those listed below, all of the methods that apply to</td></tr>
+<tr><td class="h"><a name="45"></a>45</td><td></td><td></td><td></td><td></td><td class="s">L<PPI::Element> objects also apply to C<PPI::Node> objects.</td></tr>
+<tr><td class="h"><a name="46"></a>46</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="47"></a>47</td><td></td><td></td><td></td><td></td><td class="s">=head1 METHODS</td></tr>
+<tr><td class="h"><a name="48"></a>48</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="49"></a>49</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="50"></a>50</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="51"></a>51</td><td class="c3">2</td><td class="c3"><span title="Avg 12µs">25µs</span></td><td class="c3">2</td><td class="c3">26µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 21µs (16+5) within PPI::Node::BEGIN@51 which was called:
+# once (16µs+5µs) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#51">line 51</a></div></div>use strict;<div class="calls"><div class="calls_out"># spent 21µs making 1 call to <a href="PPI-Node-pm-921-line.html#51">PPI::Node::BEGIN@51</a>
+# spent 5µs making 1 call to <a href="strict-pm-3-line.html#34">strict::import</a></div></div></td></tr>
+<tr><td class="h"><a name="52"></a>52</td><td class="c3">2</td><td class="c3"><span title="Avg 11µs">22µs</span></td><td class="c3">1</td><td class="c3">4µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 4µs within PPI::Node::BEGIN@52 which was called:
+# once (4µs+0s) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#52">line 52</a></div></div>use Carp ();<div class="calls"><div class="calls_out"># spent 4µs making 1 call to <a href="PPI-Node-pm-921-line.html#52">PPI::Node::BEGIN@52</a></div></div></td></tr>
+<tr><td class="h"><a name="53"></a>53</td><td class="c3">2</td><td class="c3"><span title="Avg 11µs">23µs</span></td><td class="c3">2</td><td class="c3">58µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 33µs (7+25) within PPI::Node::BEGIN@53 which was called:
+# once (7µs+25µs) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#53">line 53</a></div></div>use Scalar::Util qw{refaddr};<div class="calls"><div class="calls_out"># spent 33µs making 1 call to <a href="PPI-Node-pm-921-line.html#53">PPI::Node::BEGIN@53</a>
+# spent 25µs making 1 call to <a href="Exporter-pm-8-line.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="54"></a>54</td><td class="c3">2</td><td class="c1"><span title="Avg 21µs">42µs</span></td><td class="c3">1</td><td class="c3">4µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 4µs within PPI::Node::BEGIN@54 which was called:
+# once (4µs+0s) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#54">line 54</a></div></div>use List::MoreUtils ();<div class="calls"><div class="calls_out"># spent 4µs making 1 call to <a href="PPI-Node-pm-921-line.html#54">PPI::Node::BEGIN@54</a></div></div></td></tr>
+<tr><td class="h"><a name="55"></a>55</td><td class="c3">2</td><td class="c2"><span title="Avg 17µs">33µs</span></td><td class="c3">2</td><td class="c1">100µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 55µs (11+44) within PPI::Node::BEGIN@55 which was called:
+# once (11µs+44µs) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#55">line 55</a></div></div>use Params::Util qw{_INSTANCE _CLASS _CODELIKE};<div class="calls"><div class="calls_out"># spent 55µs making 1 call to <a href="PPI-Node-pm-921-line.html#55">PPI::Node::BEGIN@55</a>
+# spent 44µs making 1 call to <a href="Exporter-pm-8-line.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="56"></a>56</td><td class="c3">2</td><td class="c3"><span title="Avg 16µs">32µs</span></td><td class="c3">1</td><td class="c3">6µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 6µs within PPI::Node::BEGIN@56 which was called:
+# once (6µs+0s) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#56">line 56</a></div></div>use PPI::Element ();<div class="calls"><div class="calls_out"># spent 6µs making 1 call to <a href="PPI-Node-pm-921-line.html#56">PPI::Node::BEGIN@56</a></div></div></td></tr>
+<tr><td class="h"><a name="57"></a>57</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="58"></a>58</td><td class="c3">2</td><td class="c0"><span title="Avg 33µs">66µs</span></td><td class="c3">2</td><td class="c0">149µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 79µs (10+69) within PPI::Node::BEGIN@58 which was called:
+# once (10µs+69µs) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#58">line 58</a></div></div>use vars qw{$VERSION @ISA *_PARENT};<div class="calls"><div class="calls_out"># spent 79µs making 1 call to <a href="PPI-Node-pm-921-line.html#58">PPI::Node::BEGIN@58</a>
+# spent 69µs making 1 call to <a href="vars-pm-6-line.html#10">vars::import</a></div></div></td></tr>
+<tr><td class="h"><a name="59"></a>59</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 14µs within PPI::Node::BEGIN@59 which was called:
+# once (14µs+0s) by PPI::Element::BEGIN@30 at <a href="PPI-Node-pm-921-line.html#63">line 63</a></div></div>BEGIN {</td></tr>
+<tr><td class="h"><a name="60"></a>60</td><td class="c3">1</td><td class="c3"><span title="Avg 600ns">600ns</span></td><td></td><td></td><td class="s"> $VERSION = '1.215';</td></tr>
+<tr><td class="h"><a name="61"></a>61</td><td class="c3">1</td><td class="c3"><span title="Avg 7µs">7µs</span></td><td></td><td></td><td class="s"> @ISA = 'PPI::Element';</td></tr>
+<tr><td class="h"><a name="62"></a>62</td><td class="c3">1</td><td class="c3"><span title="Avg 12µs">12µs</span></td><td></td><td></td><td class="s"> *_PARENT = *PPI::Element::_PARENT;</td></tr>
+<tr><td class="h"><a name="63"></a>63</td><td class="c3">1</td><td class="c0"><span title="Avg 2.55ms">2.55ms</span></td><td class="c3">1</td><td class="c3">14µs</td><td class="s">}<div class="calls"><div class="calls_out"># spent 14µs making 1 call to <a href="PPI-Node-pm-921-line.html#59">PPI::Node::BEGIN@59</a></div></div></td></tr>
+<tr><td class="h"><a name="64"></a>64</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="- -"></a>- -</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="69"></a>69</td><td></td><td></td><td></td><td></td><td class="s">#####################################################################</td></tr>
+<tr><td class="h"><a name="70"></a>70</td><td></td><td></td><td></td><td></td><td class="s"># The basic constructor</td></tr>
+<tr><td class="h"><a name="71"></a>71</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="72"></a>72</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 229µs within PPI::Node::new which was called 8 times, avg 29µs/call:
+# 8 times (229µs+0s) by PPI::Document::new at <a href="PPI-Document-pm-996-line.html#153">line 153 of PPI/Document.pm</a>, avg 29µs/call</div></div>sub new {</td></tr>
+<tr><td class="h"><a name="73"></a>73</td><td class="c3">8</td><td class="c3"><span title="Avg 825ns">7µs</span></td><td></td><td></td><td class="s"> my $class = ref $_[0] || $_[0];</td></tr>
+<tr><td class="h"><a name="74"></a>74</td><td class="c3">8</td><td class="c0"><span title="Avg 29µs">235µs</span></td><td></td><td></td><td class="s"> bless { children => [] }, $class;</td></tr>
+<tr><td class="h"><a name="75"></a>75</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="76"></a>76</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="- -"></a>- -</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="81"></a>81</td><td></td><td></td><td></td><td></td><td class="s">#####################################################################</td></tr>
+<tr><td class="h"><a name="82"></a>82</td><td></td><td></td><td></td><td></td><td class="s"># PDOM Methods</td></tr>
+<tr><td class="h"><a name="83"></a>83</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="84"></a>84</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="85"></a>85</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="86"></a>86</td><td></td><td></td><td></td><td></td><td class="s">=head2 scope</td></tr>
+<tr><td class="h"><a name="87"></a>87</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="88"></a>88</td><td></td><td></td><td></td><td></td><td class="s">The C<scope> method returns true if the node represents a lexical scope</td></tr>
+<tr><td class="h"><a name="89"></a>89</td><td></td><td></td><td></td><td></td><td class="s">boundary, or false if it does not.</td></tr>
+<tr><td class="h"><a name="90"></a>90</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="91"></a>91</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="92"></a>92</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="93"></a>93</td><td></td><td></td><td></td><td></td><td class="s">### XS -> PPI/XS.xs:_PPI_Node__scope 0.903+</td></tr>
+<tr><td class="h"><a name="94"></a>94</td><td></td><td></td><td></td><td></td><td class="s">sub scope { '' }</td></tr>
+<tr><td class="h"><a name="95"></a>95</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="96"></a>96</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="97"></a>97</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="98"></a>98</td><td></td><td></td><td></td><td></td><td class="s">=head2 add_element $Element</td></tr>
+<tr><td class="h"><a name="99"></a>99</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="100"></a>100</td><td></td><td></td><td></td><td></td><td class="s">The C<add_element> method adds a L<PPI::Element> object to the end of a</td></tr>
+<tr><td class="h"><a name="101"></a>101</td><td></td><td></td><td></td><td></td><td class="s">C<PPI::Node>. Because Elements maintain links to their parent, an</td></tr>
+<tr><td class="h"><a name="102"></a>102</td><td></td><td></td><td></td><td></td><td class="s">Element can only be added to a single Node.</td></tr>
+<tr><td class="h"><a name="103"></a>103</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="104"></a>104</td><td></td><td></td><td></td><td></td><td class="s">Returns true if the L<PPI::Element> was added. Returns C<undef> if the</td></tr>
+<tr><td class="h"><a name="105"></a>105</td><td></td><td></td><td></td><td></td><td class="s">Element was already within another Node, or the method is not passed </td></tr>
+<tr><td class="h"><a name="106"></a>106</td><td></td><td></td><td></td><td></td><td class="s">a L<PPI::Element> object.</td></tr>
+<tr><td class="h"><a name="107"></a>107</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="108"></a>108</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="109"></a>109</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="110"></a>110</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 175µs (114+61) within PPI::Node::add_element which was called 8 times, avg 22µs/call:
+# 8 times (114µs+61µs) by Parse::Method::Signatures::parse at <a href="Parse-Method-Signatures-pm-911-line.html#131">line 131 of Parse/Method/Signatures.pm</a>, avg 22µs/call</div></div>sub add_element {</td></tr>
+<tr><td class="h"><a name="111"></a>111</td><td class="c3">8</td><td class="c3"><span title="Avg 412ns">3µs</span></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="112"></a>112</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="113"></a>113</td><td></td><td></td><td></td><td></td><td class="s"> # Check the element</td></tr>
+<tr><td class="h"><a name="114"></a>114</td><td class="c3">8</td><td class="c0"><span title="Avg 10µs">79µs</span></td><td class="c2">24</td><td class="c3">54µs</td><td class="s"> my $Element = _INSTANCE(shift, 'PPI::Element') or return undef;<div class="calls"><div class="calls_out"> # spent 43µs making 8 calls to <a href="Params-Util-pm-70-line.html#Params__Util___INSTANCE">Params::Util::_INSTANCE</a>, avg 5µs/call
+ # spent 8µs making 8 calls to <a href="UNIVERSAL-pm-738-line.html#UNIVERSAL__isa">UNIVERSAL::isa</a>, avg 1µs/call
+ # spent 4µs making 8 calls to <a href="PPI-Util-pm-915-line.html#PPI__Util__TRUE">PPI::Util::TRUE</a>, avg 462ns/call</div></div></td></tr>
+<tr><td class="h"><a name="115"></a>115</td><td class="c3">8</td><td class="c3"><span title="Avg 3µs">25µs</span></td><td class="c3">8</td><td class="c3">6µs</td><td class="s"> $_PARENT{refaddr $Element} and return undef;<div class="calls"><div class="calls_out"> # spent 6µs making 8 calls to <a href="Scalar-Util-pm-63-line.html#Scalar__Util__refaddr">Scalar::Util::refaddr</a>, avg 725ns/call</div></div></td></tr>
+<tr><td class="h"><a name="116"></a>116</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="117"></a>117</td><td></td><td></td><td></td><td></td><td class="s"> # Add the argument to the elements</td></tr>
+<tr><td class="h"><a name="118"></a>118</td><td class="c3">8</td><td class="c3"><span title="Avg 925ns">7µs</span></td><td></td><td></td><td class="s"> push @{$self->{children}}, $Element;</td></tr>
+<tr><td class="h"><a name="119"></a>119</td><td class="c3">8</td><td class="c1"><span title="Avg 5µs">42µs</span></td><td class="c3">16</td><td class="c3">9µs</td><td class="s"> Scalar::Util::weaken(<div class="calls"><div class="calls_out"> # spent 5µs making 8 calls to <a href="Scalar-Util-pm-63-line.html#Scalar__Util__weaken">Scalar::Util::weaken</a>, avg 588ns/call
+ # spent 4µs making 8 calls to <a href="Scalar-Util-pm-63-line.html#Scalar__Util__refaddr">Scalar::Util::refaddr</a>, avg 537ns/call</div></div></td></tr>
+<tr><td class="h"><a name="120"></a>120</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr $Element} = $self</td></tr>
+<tr><td class="h"><a name="121"></a>121</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="122"></a>122</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="123"></a>123</td><td class="c3">8</td><td class="c3"><span title="Avg 2µs">17µs</span></td><td></td><td></td><td class="s"> 1;</td></tr>
+<tr><td class="h"><a name="124"></a>124</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="125"></a>125</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="126"></a>126</td><td></td><td></td><td></td><td></td><td class="s"># In a typical run profile, add_element is the number 1 resource drain.</td></tr>
+<tr><td class="h"><a name="127"></a>127</td><td></td><td></td><td></td><td></td><td class="s"># This is a highly optimised unsafe version, for internal use only.</td></tr>
+<tr><td class="h"><a name="128"></a>128</td><td></td><td></td><td></td><td></td><td class="s">sub __add_element {</td></tr>
+<tr><td class="h"><a name="129"></a>129</td><td></td><td></td><td></td><td></td><td class="s"> Scalar::Util::weaken(</td></tr>
+<tr><td class="h"><a name="130"></a>130</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr $_[1]} = $_[0]</td></tr>
+<tr><td class="h"><a name="131"></a>131</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="132"></a>132</td><td></td><td></td><td></td><td></td><td class="s"> push @{$_[0]->{children}}, $_[1];</td></tr>
+<tr><td class="h"><a name="133"></a>133</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="134"></a>134</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="135"></a>135</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="136"></a>136</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="137"></a>137</td><td></td><td></td><td></td><td></td><td class="s">=head2 elements</td></tr>
+<tr><td class="h"><a name="138"></a>138</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="139"></a>139</td><td></td><td></td><td></td><td></td><td class="s">The C<elements> method accesses all child elements B<structurally> within</td></tr>
+<tr><td class="h"><a name="140"></a>140</td><td></td><td></td><td></td><td></td><td class="s">the C<PPI::Node> object. Note that in the base of the L<PPI::Structure></td></tr>
+<tr><td class="h"><a name="141"></a>141</td><td></td><td></td><td></td><td></td><td class="s">classes, this C<DOES> include the brace tokens at either end of the</td></tr>
+<tr><td class="h"><a name="142"></a>142</td><td></td><td></td><td></td><td></td><td class="s">structure.</td></tr>
+<tr><td class="h"><a name="143"></a>143</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="144"></a>144</td><td></td><td></td><td></td><td></td><td class="s">Returns a list of zero or more L<PPI::Element> objects.</td></tr>
+<tr><td class="h"><a name="145"></a>145</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="146"></a>146</td><td></td><td></td><td></td><td></td><td class="s">Alternatively, if called in the scalar context, the C<elements> method</td></tr>
+<tr><td class="h"><a name="147"></a>147</td><td></td><td></td><td></td><td></td><td class="s">returns a count of the number of elements.</td></tr>
+<tr><td class="h"><a name="148"></a>148</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="149"></a>149</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="150"></a>150</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="151"></a>151</td><td></td><td></td><td></td><td></td><td class="s">sub elements {</td></tr>
+<tr><td class="h"><a name="152"></a>152</td><td></td><td></td><td></td><td></td><td class="s"> if ( wantarray ) {</td></tr>
+<tr><td class="h"><a name="153"></a>153</td><td></td><td></td><td></td><td></td><td class="s"> return @{$_[0]->{children}};</td></tr>
+<tr><td class="h"><a name="154"></a>154</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="155"></a>155</td><td></td><td></td><td></td><td></td><td class="s"> return scalar @{$_[0]->{children}};</td></tr>
+<tr><td class="h"><a name="156"></a>156</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="157"></a>157</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="158"></a>158</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="159"></a>159</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="160"></a>160</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="161"></a>161</td><td></td><td></td><td></td><td></td><td class="s">=head2 first_element</td></tr>
+<tr><td class="h"><a name="162"></a>162</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="163"></a>163</td><td></td><td></td><td></td><td></td><td class="s">The C<first_element> method accesses the first element structurally within</td></tr>
+<tr><td class="h"><a name="164"></a>164</td><td></td><td></td><td></td><td></td><td class="s">the C<PPI::Node> object. As for the C<elements> method, this does include</td></tr>
+<tr><td class="h"><a name="165"></a>165</td><td></td><td></td><td></td><td></td><td class="s">the brace tokens for L<PPI::Structure> objects.</td></tr>
+<tr><td class="h"><a name="166"></a>166</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="167"></a>167</td><td></td><td></td><td></td><td></td><td class="s">Returns a L<PPI::Element> object, or C<undef> if for some reason the</td></tr>
+<tr><td class="h"><a name="168"></a>168</td><td></td><td></td><td></td><td></td><td class="s">C<PPI::Node> object does not contain any elements.</td></tr>
+<tr><td class="h"><a name="169"></a>169</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="170"></a>170</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="171"></a>171</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="172"></a>172</td><td></td><td></td><td></td><td></td><td class="s"># Normally the first element is also the first child</td></tr>
+<tr><td class="h"><a name="173"></a>173</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 31µs within PPI::Node::first_element which was called 16 times, avg 2µs/call:
+# 16 times (31µs+0s) by PPI::Element::first_token at <a href="PPI-Element-pm-919-line.html#445">line 445 of PPI/Element.pm</a>, avg 2µs/call</div></div>sub first_element {</td></tr>
+<tr><td class="h"><a name="174"></a>174</td><td class="c3">16</td><td class="c1"><span title="Avg 3µs">44µs</span></td><td></td><td></td><td class="s"> $_[0]->{children}->[0];</td></tr>
+<tr><td class="h"><a name="175"></a>175</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="176"></a>176</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="177"></a>177</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="178"></a>178</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="179"></a>179</td><td></td><td></td><td></td><td></td><td class="s">=head2 last_element</td></tr>
+<tr><td class="h"><a name="180"></a>180</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="181"></a>181</td><td></td><td></td><td></td><td></td><td class="s">The C<last_element> method accesses the last element structurally within</td></tr>
+<tr><td class="h"><a name="182"></a>182</td><td></td><td></td><td></td><td></td><td class="s">the C<PPI::Node> object. As for the C<elements> method, this does include</td></tr>
+<tr><td class="h"><a name="183"></a>183</td><td></td><td></td><td></td><td></td><td class="s">the brace tokens for L<PPI::Structure> objects.</td></tr>
+<tr><td class="h"><a name="184"></a>184</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="185"></a>185</td><td></td><td></td><td></td><td></td><td class="s">Returns a L<PPI::Element> object, or C<undef> if for some reason the</td></tr>
+<tr><td class="h"><a name="186"></a>186</td><td></td><td></td><td></td><td></td><td class="s">C<PPI::Node> object does not contain any elements.</td></tr>
+<tr><td class="h"><a name="187"></a>187</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="188"></a>188</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="189"></a>189</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="190"></a>190</td><td></td><td></td><td></td><td></td><td class="s"># Normally the last element is also the last child</td></tr>
+<tr><td class="h"><a name="191"></a>191</td><td></td><td></td><td></td><td></td><td class="s">sub last_element {</td></tr>
+<tr><td class="h"><a name="192"></a>192</td><td></td><td></td><td></td><td></td><td class="s"> $_[0]->{children}->[-1];</td></tr>
+<tr><td class="h"><a name="193"></a>193</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="194"></a>194</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="195"></a>195</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="196"></a>196</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="197"></a>197</td><td></td><td></td><td></td><td></td><td class="s">=head2 children</td></tr>
+<tr><td class="h"><a name="198"></a>198</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="199"></a>199</td><td></td><td></td><td></td><td></td><td class="s">The C<children> method accesses all child elements lexically within the</td></tr>
+<tr><td class="h"><a name="200"></a>200</td><td></td><td></td><td></td><td></td><td class="s">C<PPI::Node> object. Note that in the case of the L<PPI::Structure></td></tr>
+<tr><td class="h"><a name="201"></a>201</td><td></td><td></td><td></td><td></td><td class="s">classes, this does B<NOT> include the brace tokens at either end of the</td></tr>
+<tr><td class="h"><a name="202"></a>202</td><td></td><td></td><td></td><td></td><td class="s">structure.</td></tr>
+<tr><td class="h"><a name="203"></a>203</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="204"></a>204</td><td></td><td></td><td></td><td></td><td class="s">Returns a list of zero of more L<PPI::Element> objects.</td></tr>
+<tr><td class="h"><a name="205"></a>205</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="206"></a>206</td><td></td><td></td><td></td><td></td><td class="s">Alternatively, if called in the scalar context, the C<children> method</td></tr>
+<tr><td class="h"><a name="207"></a>207</td><td></td><td></td><td></td><td></td><td class="s">returns a count of the number of lexical children.</td></tr>
+<tr><td class="h"><a name="208"></a>208</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="209"></a>209</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="210"></a>210</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="211"></a>211</td><td></td><td></td><td></td><td></td><td class="s"># In the default case, this is the same as for the elements method</td></tr>
+<tr><td class="h"><a name="212"></a>212</td><td></td><td></td><td></td><td></td><td class="s">sub children {</td></tr>
+<tr><td class="h"><a name="213"></a>213</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ? @{$_[0]->{children}} : scalar @{$_[0]->{children}};</td></tr>
+<tr><td class="h"><a name="214"></a>214</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="215"></a>215</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="216"></a>216</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="217"></a>217</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="218"></a>218</td><td></td><td></td><td></td><td></td><td class="s">=head2 schildren</td></tr>
+<tr><td class="h"><a name="219"></a>219</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="220"></a>220</td><td></td><td></td><td></td><td></td><td class="s">The C<schildren> method is really just a convenience, the significant-only</td></tr>
+<tr><td class="h"><a name="221"></a>221</td><td></td><td></td><td></td><td></td><td class="s">variation of the normal C<children> method.</td></tr>
+<tr><td class="h"><a name="222"></a>222</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="223"></a>223</td><td></td><td></td><td></td><td></td><td class="s">In list context, returns a list of significant children. In scalar context,</td></tr>
+<tr><td class="h"><a name="224"></a>224</td><td></td><td></td><td></td><td></td><td class="s">returns the number of significant children.</td></tr>
+<tr><td class="h"><a name="225"></a>225</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="226"></a>226</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="227"></a>227</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="228"></a>228</td><td></td><td></td><td></td><td></td><td class="s">sub schildren {</td></tr>
+<tr><td class="h"><a name="229"></a>229</td><td></td><td></td><td></td><td></td><td class="s"> return grep { $_->significant } @{$_[0]->{children}} if wantarray;</td></tr>
+<tr><td class="h"><a name="230"></a>230</td><td></td><td></td><td></td><td></td><td class="s"> my $count = 0;</td></tr>
+<tr><td class="h"><a name="231"></a>231</td><td></td><td></td><td></td><td></td><td class="s"> foreach ( @{$_[0]->{children}} ) {</td></tr>
+<tr><td class="h"><a name="232"></a>232</td><td></td><td></td><td></td><td></td><td class="s"> $count++ if $_->significant;</td></tr>
+<tr><td class="h"><a name="233"></a>233</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="234"></a>234</td><td></td><td></td><td></td><td></td><td class="s"> return $count;</td></tr>
+<tr><td class="h"><a name="235"></a>235</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="236"></a>236</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="237"></a>237</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="238"></a>238</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="239"></a>239</td><td></td><td></td><td></td><td></td><td class="s">=head2 child $index</td></tr>
+<tr><td class="h"><a name="240"></a>240</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="241"></a>241</td><td></td><td></td><td></td><td></td><td class="s">The C<child> method accesses a child L<PPI::Element> object by its</td></tr>
+<tr><td class="h"><a name="242"></a>242</td><td></td><td></td><td></td><td></td><td class="s">position within the Node.</td></tr>
+<tr><td class="h"><a name="243"></a>243</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="244"></a>244</td><td></td><td></td><td></td><td></td><td class="s">Returns a L<PPI::Element> object, or C<undef> if there is no child</td></tr>
+<tr><td class="h"><a name="245"></a>245</td><td></td><td></td><td></td><td></td><td class="s">element at that node.</td></tr>
+<tr><td class="h"><a name="246"></a>246</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="247"></a>247</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="248"></a>248</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="249"></a>249</td><td></td><td></td><td></td><td></td><td class="s">sub child {</td></tr>
+<tr><td class="h"><a name="250"></a>250</td><td></td><td></td><td></td><td></td><td class="s"> $_[0]->{children}->[$_[1]];</td></tr>
+<tr><td class="h"><a name="251"></a>251</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="252"></a>252</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="253"></a>253</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="254"></a>254</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="255"></a>255</td><td></td><td></td><td></td><td></td><td class="s">=head2 schild $index</td></tr>
+<tr><td class="h"><a name="256"></a>256</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="257"></a>257</td><td></td><td></td><td></td><td></td><td class="s">The lexical structure of the Perl language ignores 'insignificant' items,</td></tr>
+<tr><td class="h"><a name="258"></a>258</td><td></td><td></td><td></td><td></td><td class="s">such as whitespace and comments, while L<PPI> treats these items as valid</td></tr>
+<tr><td class="h"><a name="259"></a>259</td><td></td><td></td><td></td><td></td><td class="s">tokens so that it can reassemble the file at any time. Because of this,</td></tr>
+<tr><td class="h"><a name="260"></a>260</td><td></td><td></td><td></td><td></td><td class="s">in many situations there is a need to find an Element within a Node by</td></tr>
+<tr><td class="h"><a name="261"></a>261</td><td></td><td></td><td></td><td></td><td class="s">index, only counting lexically significant Elements.</td></tr>
+<tr><td class="h"><a name="262"></a>262</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="263"></a>263</td><td></td><td></td><td></td><td></td><td class="s">The C<schild> method returns a child Element by index, ignoring</td></tr>
+<tr><td class="h"><a name="264"></a>264</td><td></td><td></td><td></td><td></td><td class="s">insignificant Elements. The index of a child Element is specified in the</td></tr>
+<tr><td class="h"><a name="265"></a>265</td><td></td><td></td><td></td><td></td><td class="s">same way as for a normal array, with the first Element at index 0, and</td></tr>
+<tr><td class="h"><a name="266"></a>266</td><td></td><td></td><td></td><td></td><td class="s">negative indexes used to identify a "from the end" position.</td></tr>
+<tr><td class="h"><a name="267"></a>267</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="268"></a>268</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="269"></a>269</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="270"></a>270</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 126µs (115+12) within PPI::Node::schild which was called 16 times, avg 8µs/call:
+# 8 times (69µs+6µs) by PPI::Lexer::_add_element at <a href="PPI-Lexer-pm-1005-line.html#1444">line 1444 of PPI/Lexer.pm</a>, avg 9µs/call
+# 8 times (45µs+6µs) by PPI::Lexer::_add_element at <a href="PPI-Lexer-pm-1005-line.html#1445">line 1445 of PPI/Lexer.pm</a>, avg 6µs/call</div></div>sub schild {</td></tr>
+<tr><td class="h"><a name="271"></a>271</td><td class="c3">16</td><td class="c3"><span title="Avg 312ns">5µs</span></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="272"></a>272</td><td class="c3">16</td><td class="c3"><span title="Avg 350ns">6µs</span></td><td></td><td></td><td class="s"> my $idx = 0 + shift;</td></tr>
+<tr><td class="h"><a name="273"></a>273</td><td class="c3">16</td><td class="c3"><span title="Avg 362ns">6µs</span></td><td></td><td></td><td class="s"> my $el = $self->{children};</td></tr>
+<tr><td class="h"><a name="274"></a>274</td><td class="c3">16</td><td class="c3"><span title="Avg 331ns">5µs</span></td><td></td><td></td><td class="s"> if ( $idx < 0 ) {</td></tr>
+<tr><td class="h"><a name="275"></a>275</td><td></td><td></td><td></td><td></td><td class="s"> my $cursor = 0;</td></tr>
+<tr><td class="h"><a name="276"></a>276</td><td></td><td></td><td></td><td></td><td class="s"> while ( exists $el->[--$cursor] ) {</td></tr>
+<tr><td class="h"><a name="277"></a>277</td><td></td><td></td><td></td><td></td><td class="s"> return $el->[$cursor] if $el->[$cursor]->significant and ++$idx >= 0;</td></tr>
+<tr><td class="h"><a name="278"></a>278</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="279"></a>279</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="280"></a>280</td><td class="c3">16</td><td class="c3"><span title="Avg 250ns">4µs</span></td><td></td><td></td><td class="s"> my $cursor = -1;</td></tr>
+<tr><td class="h"><a name="281"></a>281</td><td class="c3">16</td><td class="c3"><span title="Avg 475ns">8µs</span></td><td></td><td></td><td class="s"> while ( exists $el->[++$cursor] ) {</td></tr>
+<tr><td class="h"><a name="282"></a>282</td><td class="c3">16</td><td class="c1"><span title="Avg 3µs">44µs</span></td><td class="c3">16</td><td class="c3">12µs</td><td class="s"> return $el->[$cursor] if $el->[$cursor]->significant and --$idx < 0;<div class="calls"><div class="calls_out"> # spent 12µs making 16 calls to <a href="PPI-Element-pm-919-line.html#70">PPI::Element::significant</a>, avg 725ns/call</div></div></td></tr>
+<tr><td class="h"><a name="283"></a>283</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="284"></a>284</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="285"></a>285</td><td class="c3">8</td><td class="c3"><span title="Avg 2µs">14µs</span></td><td></td><td></td><td class="s"> undef;</td></tr>
+<tr><td class="h"><a name="286"></a>286</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="287"></a>287</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="288"></a>288</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="289"></a>289</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="290"></a>290</td><td></td><td></td><td></td><td></td><td class="s">=head2 contains $Element</td></tr>
+<tr><td class="h"><a name="291"></a>291</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="292"></a>292</td><td></td><td></td><td></td><td></td><td class="s">The C<contains> method is used to determine if another L<PPI::Element></td></tr>
+<tr><td class="h"><a name="293"></a>293</td><td></td><td></td><td></td><td></td><td class="s">object is logically "within" a C<PPI::Node>. For the special case of the</td></tr>
+<tr><td class="h"><a name="294"></a>294</td><td></td><td></td><td></td><td></td><td class="s">brace tokens at either side of a L<PPI::Structure> object, they are</td></tr>
+<tr><td class="h"><a name="295"></a>295</td><td></td><td></td><td></td><td></td><td class="s">generally considered "within" a L<PPI::Structure> object, even if they are</td></tr>
+<tr><td class="h"><a name="296"></a>296</td><td></td><td></td><td></td><td></td><td class="s">not actually in the elements for the L<PPI::Structure>.</td></tr>
+<tr><td class="h"><a name="297"></a>297</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="298"></a>298</td><td></td><td></td><td></td><td></td><td class="s">Returns true if the L<PPI::Element> is within us, false if not, or C<undef></td></tr>
+<tr><td class="h"><a name="299"></a>299</td><td></td><td></td><td></td><td></td><td class="s">on error.</td></tr>
+<tr><td class="h"><a name="300"></a>300</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="301"></a>301</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="302"></a>302</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="303"></a>303</td><td></td><td></td><td></td><td></td><td class="s">sub contains {</td></tr>
+<tr><td class="h"><a name="304"></a>304</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="305"></a>305</td><td></td><td></td><td></td><td></td><td class="s"> my $Element = _INSTANCE(shift, 'PPI::Element') or return undef;</td></tr>
+<tr><td class="h"><a name="306"></a>306</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="307"></a>307</td><td></td><td></td><td></td><td></td><td class="s"> # Iterate up the Element's parent chain until we either run out</td></tr>
+<tr><td class="h"><a name="308"></a>308</td><td></td><td></td><td></td><td></td><td class="s"> # of parents, or get to ourself.</td></tr>
+<tr><td class="h"><a name="309"></a>309</td><td></td><td></td><td></td><td></td><td class="s"> while ( $Element = $Element->parent ) {</td></tr>
+<tr><td class="h"><a name="310"></a>310</td><td></td><td></td><td></td><td></td><td class="s"> return 1 if refaddr($self) == refaddr($Element);</td></tr>
+<tr><td class="h"><a name="311"></a>311</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="312"></a>312</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="313"></a>313</td><td></td><td></td><td></td><td></td><td class="s"> '';</td></tr>
+<tr><td class="h"><a name="314"></a>314</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="315"></a>315</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="316"></a>316</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="317"></a>317</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="318"></a>318</td><td></td><td></td><td></td><td></td><td class="s">=head2 find $class | \&wanted</td></tr>
+<tr><td class="h"><a name="319"></a>319</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="320"></a>320</td><td></td><td></td><td></td><td></td><td class="s">The C<find> method is used to search within a code tree for</td></tr>
+<tr><td class="h"><a name="321"></a>321</td><td></td><td></td><td></td><td></td><td class="s">L<PPI::Element> objects that meet a particular condition.</td></tr>
+<tr><td class="h"><a name="322"></a>322</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="323"></a>323</td><td></td><td></td><td></td><td></td><td class="s">To specify the condition, the method can be provided with either a simple</td></tr>
+<tr><td class="h"><a name="324"></a>324</td><td></td><td></td><td></td><td></td><td class="s">class name (full or shortened), or a C<CODE>/function reference.</td></tr>
+<tr><td class="h"><a name="325"></a>325</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="326"></a>326</td><td></td><td></td><td></td><td></td><td class="s"> # Find all single quotes in a Document (which is a Node)</td></tr>
+<tr><td class="h"><a name="327"></a>327</td><td></td><td></td><td></td><td></td><td class="s"> $Document->find('PPI::Quote::Single');</td></tr>
+<tr><td class="h"><a name="328"></a>328</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="329"></a>329</td><td></td><td></td><td></td><td></td><td class="s"> # The same thing with a shortened class name</td></tr>
+<tr><td class="h"><a name="330"></a>330</td><td></td><td></td><td></td><td></td><td class="s"> $Document->find('Quote::Single');</td></tr>
+<tr><td class="h"><a name="331"></a>331</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="332"></a>332</td><td></td><td></td><td></td><td></td><td class="s"> # Anything more elaborate, we so with the sub</td></tr>
+<tr><td class="h"><a name="333"></a>333</td><td></td><td></td><td></td><td></td><td class="s"> $Document->find( sub {</td></tr>
+<tr><td class="h"><a name="334"></a>334</td><td></td><td></td><td></td><td></td><td class="s"> # At the top level of the file...</td></tr>
+<tr><td class="h"><a name="335"></a>335</td><td></td><td></td><td></td><td></td><td class="s"> $_[1]->parent == $_[0]</td></tr>
+<tr><td class="h"><a name="336"></a>336</td><td></td><td></td><td></td><td></td><td class="s"> and (</td></tr>
+<tr><td class="h"><a name="337"></a>337</td><td></td><td></td><td></td><td></td><td class="s"> # ...find all comments and POD</td></tr>
+<tr><td class="h"><a name="338"></a>338</td><td></td><td></td><td></td><td></td><td class="s"> $_[1]->isa('PPI::Token::Pod')</td></tr>
+<tr><td class="h"><a name="339"></a>339</td><td></td><td></td><td></td><td></td><td class="s"> or</td></tr>
+<tr><td class="h"><a name="340"></a>340</td><td></td><td></td><td></td><td></td><td class="s"> $_[1]->isa('PPI::Token::Comment')</td></tr>
+<tr><td class="h"><a name="341"></a>341</td><td></td><td></td><td></td><td></td><td class="s"> )</td></tr>
+<tr><td class="h"><a name="342"></a>342</td><td></td><td></td><td></td><td></td><td class="s"> } );</td></tr>
+<tr><td class="h"><a name="343"></a>343</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="344"></a>344</td><td></td><td></td><td></td><td></td><td class="s">The function will be passed two arguments, the top-level C<PPI::Node></td></tr>
+<tr><td class="h"><a name="345"></a>345</td><td></td><td></td><td></td><td></td><td class="s">you are searching in and the current L<PPI::Element> that the condition</td></tr>
+<tr><td class="h"><a name="346"></a>346</td><td></td><td></td><td></td><td></td><td class="s">is testing.</td></tr>
+<tr><td class="h"><a name="347"></a>347</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="348"></a>348</td><td></td><td></td><td></td><td></td><td class="s">The anonymous function should return one of three values. Returning true</td></tr>
+<tr><td class="h"><a name="349"></a>349</td><td></td><td></td><td></td><td></td><td class="s">indicates a condition match, defined-false (C<0> or C<''>) indicates</td></tr>
+<tr><td class="h"><a name="350"></a>350</td><td></td><td></td><td></td><td></td><td class="s">no-match, and C<undef> indicates no-match and no-descend.</td></tr>
+<tr><td class="h"><a name="351"></a>351</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="352"></a>352</td><td></td><td></td><td></td><td></td><td class="s">In the last case, the tree walker will skip over anything below the</td></tr>
+<tr><td class="h"><a name="353"></a>353</td><td></td><td></td><td></td><td></td><td class="s">C<undef>-returning element and move on to the next element at the same</td></tr>
+<tr><td class="h"><a name="354"></a>354</td><td></td><td></td><td></td><td></td><td class="s">level.</td></tr>
+<tr><td class="h"><a name="355"></a>355</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="356"></a>356</td><td></td><td></td><td></td><td></td><td class="s">To halt the entire search and return C<undef> immediately, a condition</td></tr>
+<tr><td class="h"><a name="357"></a>357</td><td></td><td></td><td></td><td></td><td class="s">function should throw an exception (i.e. C<die>).</td></tr>
+<tr><td class="h"><a name="358"></a>358</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="359"></a>359</td><td></td><td></td><td></td><td></td><td class="s">Note that this same wanted logic is used for all methods documented to</td></tr>
+<tr><td class="h"><a name="360"></a>360</td><td></td><td></td><td></td><td></td><td class="s">have a C<\&wanted> parameter, as this one does.</td></tr>
+<tr><td class="h"><a name="361"></a>361</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="362"></a>362</td><td></td><td></td><td></td><td></td><td class="s">The C<find> method returns a reference to an array of L<PPI::Element></td></tr>
+<tr><td class="h"><a name="363"></a>363</td><td></td><td></td><td></td><td></td><td class="s">objects that match the condition, false (but defined) if no Elements match</td></tr>
+<tr><td class="h"><a name="364"></a>364</td><td></td><td></td><td></td><td></td><td class="s">the condition, or C<undef> if you provide a bad condition, or an error</td></tr>
+<tr><td class="h"><a name="365"></a>365</td><td></td><td></td><td></td><td></td><td class="s">occurs during the search process.</td></tr>
+<tr><td class="h"><a name="366"></a>366</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="367"></a>367</td><td></td><td></td><td></td><td></td><td class="s">In the case of a bad condition, a warning will be emitted as well.</td></tr>
+<tr><td class="h"><a name="368"></a>368</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="369"></a>369</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="370"></a>370</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="371"></a>371</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 5.96ms (1.84+4.11) within PPI::Node::find which was called 32 times, avg 186µs/call:
+# 8 times (513µs+1.25ms) by Parse::Method::Signatures::_replace_regexps at <a href="Parse-Method-Signatures-pm-911-line.html#159">line 159 of Parse/Method/Signatures.pm</a>, avg 220µs/call
+# 8 times (436µs+977µs) by Parse::Method::Signatures::_fixup_hex at <a href="Parse-Method-Signatures-pm-911-line.html#207">line 207 of Parse/Method/Signatures.pm</a>, avg 177µs/call
+# 8 times (459µs+954µs) by Parse::Method::Signatures::_replace_magic at <a href="Parse-Method-Signatures-pm-911-line.html#182">line 182 of Parse/Method/Signatures.pm</a>, avg 177µs/call
+# 8 times (432µs+935µs) by Parse::Method::Signatures::_replace_labels at <a href="Parse-Method-Signatures-pm-911-line.html#194">line 194 of Parse/Method/Signatures.pm</a>, avg 171µs/call</div></div>sub find {</td></tr>
+<tr><td class="h"><a name="372"></a>372</td><td class="c1">32</td><td class="c3"><span title="Avg 250ns">8µs</span></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="373"></a>373</td><td class="c1">32</td><td class="c1"><span title="Avg 2µs">49µs</span></td><td class="c1">32</td><td class="c0">2.74ms</td><td class="s"> my $wanted = $self->_wanted(shift) or return undef;<div class="calls"><div class="calls_out"> # spent 2.74ms making 32 calls to <a href="PPI-Node-pm-921-line.html#601">PPI::Node::_wanted</a>, avg 86µs/call</div></div></td></tr>
+<tr><td class="h"><a name="374"></a>374</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="375"></a>375</td><td></td><td></td><td></td><td></td><td class="s"> # Use a queue based search, rather than a recursive one</td></tr>
+<tr><td class="h"><a name="376"></a>376</td><td class="c1">32</td><td class="c3"><span title="Avg 506ns">16µs</span></td><td></td><td></td><td class="s"> my @found = ();</td></tr>
+<tr><td class="h"><a name="377"></a>377</td><td class="c1">32</td><td class="c2"><span title="Avg 1µs">40µs</span></td><td></td><td></td><td class="s"> my @queue = @{$self->{children}};</td></tr>
+<tr><td class="h"><a name="378"></a>378</td><td class="c1">32</td><td class="c3"><span title="Avg 422ns">14µs</span></td><td></td><td></td><td class="s"> eval {</td></tr>
+<tr><td class="h"><a name="379"></a>379</td><td class="c1">32</td><td class="c0"><span title="Avg 2µs">70µs</span></td><td></td><td></td><td class="s"> while ( @queue ) {</td></tr>
+<tr><td class="h"><a name="380"></a>380</td><td class="c0">224</td><td class="c0"><span title="Avg 271ns">61µs</span></td><td></td><td></td><td class="s"> my $Element = shift @queue;</td></tr>
+<tr><td class="h"><a name="381"></a>381</td><td class="c0">224</td><td class="c0"><span title="Avg 2µs">343µs</span></td><td class="c0">224</td><td class="c0">1.12ms</td><td class="s"> my $rv = &$wanted( $self, $Element );<div class="calls"><div class="calls_out"> # spent 301µs making 56 calls to <a href="(eval 865)[PPI-Node-pm-654]-1295-line.html#1">PPI::Node::__ANON__[(eval 1521)[PPI/Node.pm:654]:4]</a>, avg 5µs/call
+ # spent 287µs making 56 calls to <a href="(eval 862)[PPI-Node-pm-654]-1292-line.html#1">PPI::Node::__ANON__[(eval 1518)[PPI/Node.pm:654]:4]</a>, avg 5µs/call
+ # spent 269µs making 56 calls to <a href="(eval 863)[PPI-Node-pm-654]-1293-line.html#1">PPI::Node::__ANON__[(eval 1519)[PPI/Node.pm:654]:4]</a>, avg 5µs/call
+ # spent 261µs making 56 calls to <a href="(eval 864)[PPI-Node-pm-654]-1294-line.html#1">PPI::Node::__ANON__[(eval 1520)[PPI/Node.pm:654]:4]</a>, avg 5µs/call</div></div></td></tr>
+<tr><td class="h"><a name="382"></a>382</td><td class="c0">224</td><td class="c3"><span title="Avg 59ns">13µs</span></td><td></td><td></td><td class="s"> push @found, $Element if $rv;</td></tr>
+<tr><td class="h"><a name="383"></a>383</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="384"></a>384</td><td></td><td></td><td></td><td></td><td class="s"> # Support "don't descend on undef return"</td></tr>
+<tr><td class="h"><a name="385"></a>385</td><td class="c0">224</td><td class="c3"><span title="Avg 96ns">22µs</span></td><td></td><td></td><td class="s"> next unless defined $rv;</td></tr>
+<tr><td class="h"><a name="386"></a>386</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="387"></a>387</td><td></td><td></td><td></td><td></td><td class="s"> # Skip if the Element doesn't have any children</td></tr>
+<tr><td class="h"><a name="388"></a>388</td><td class="c0">224</td><td class="c0"><span title="Avg 3µs">635µs</span></td><td class="c0">224</td><td class="c0">216µs</td><td class="s"> next unless $Element->isa('PPI::Node');<div class="calls"><div class="calls_out"> # spent 216µs making 224 calls to <a href="UNIVERSAL-pm-738-line.html#UNIVERSAL__isa">UNIVERSAL::isa</a>, avg 965ns/call</div></div></td></tr>
+<tr><td class="h"><a name="389"></a>389</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="390"></a>390</td><td></td><td></td><td></td><td></td><td class="s"> # Depth-first keeps the queue size down and provides a</td></tr>
+<tr><td class="h"><a name="391"></a>391</td><td></td><td></td><td></td><td></td><td class="s"> # better logical order.</td></tr>
+<tr><td class="h"><a name="392"></a>392</td><td class="c1">32</td><td class="c0"><span title="Avg 4µs">115µs</span></td><td class="c1">32</td><td class="c3">43µs</td><td class="s"> if ( $Element->isa('PPI::Structure') ) {<div class="calls"><div class="calls_out"> # spent 43µs making 32 calls to <a href="UNIVERSAL-pm-738-line.html#UNIVERSAL__isa">UNIVERSAL::isa</a>, avg 1µs/call</div></div></td></tr>
+<tr><td class="h"><a name="393"></a>393</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, $Element->finish if $Element->finish;</td></tr>
+<tr><td class="h"><a name="394"></a>394</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, @{$Element->{children}};</td></tr>
+<tr><td class="h"><a name="395"></a>395</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, $Element->start if $Element->start;</td></tr>
+<tr><td class="h"><a name="396"></a>396</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="397"></a>397</td><td class="c1">32</td><td class="c2"><span title="Avg 1µs">37µs</span></td><td></td><td></td><td class="s"> unshift @queue, @{$Element->{children}};</td></tr>
+<tr><td class="h"><a name="398"></a>398</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="399"></a>399</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="400"></a>400</td><td></td><td></td><td></td><td></td><td class="s"> };</td></tr>
+<tr><td class="h"><a name="401"></a>401</td><td class="c1">32</td><td class="c3"><span title="Avg 137ns">4µs</span></td><td></td><td></td><td class="s"> if ( $@ ) {</td></tr>
+<tr><td class="h"><a name="402"></a>402</td><td></td><td></td><td></td><td></td><td class="s"> # Caught exception thrown from the wanted function</td></tr>
+<tr><td class="h"><a name="403"></a>403</td><td></td><td></td><td></td><td></td><td class="s"> return undef;</td></tr>
+<tr><td class="h"><a name="404"></a>404</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="405"></a>405</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="406"></a>406</td><td class="c1">32</td><td class="c0"><span title="Avg 9µs">294µs</span></td><td></td><td></td><td class="s"> @found ? \@found : '';</td></tr>
+<tr><td class="h"><a name="407"></a>407</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="408"></a>408</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="409"></a>409</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="410"></a>410</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="411"></a>411</td><td></td><td></td><td></td><td></td><td class="s">=head2 find_first $class | \&wanted</td></tr>
+<tr><td class="h"><a name="412"></a>412</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="413"></a>413</td><td></td><td></td><td></td><td></td><td class="s">If the normal C<find> method is like a grep, then C<find_first> is</td></tr>
+<tr><td class="h"><a name="414"></a>414</td><td></td><td></td><td></td><td></td><td class="s">equivalent to the L<Scalar::Util> C<first> function.</td></tr>
+<tr><td class="h"><a name="415"></a>415</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="416"></a>416</td><td></td><td></td><td></td><td></td><td class="s">Given an element class or a wanted function, it will search depth-first</td></tr>
+<tr><td class="h"><a name="417"></a>417</td><td></td><td></td><td></td><td></td><td class="s">through a tree until it finds something that matches the condition,</td></tr>
+<tr><td class="h"><a name="418"></a>418</td><td></td><td></td><td></td><td></td><td class="s">returning the first Element that it encounters.</td></tr>
+<tr><td class="h"><a name="419"></a>419</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="420"></a>420</td><td></td><td></td><td></td><td></td><td class="s">See the C<find> method for details on the format of the search condition.</td></tr>
+<tr><td class="h"><a name="421"></a>421</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="422"></a>422</td><td></td><td></td><td></td><td></td><td class="s">Returns the first L<PPI::Element> object that matches the condition, false</td></tr>
+<tr><td class="h"><a name="423"></a>423</td><td></td><td></td><td></td><td></td><td class="s">if nothing matches the condition, or C<undef> if given an invalid condition,</td></tr>
+<tr><td class="h"><a name="424"></a>424</td><td></td><td></td><td></td><td></td><td class="s">or an error occurs.</td></tr>
+<tr><td class="h"><a name="425"></a>425</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="426"></a>426</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="427"></a>427</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="428"></a>428</td><td></td><td></td><td></td><td></td><td class="s">sub find_first {</td></tr>
+<tr><td class="h"><a name="429"></a>429</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="430"></a>430</td><td></td><td></td><td></td><td></td><td class="s"> my $wanted = $self->_wanted(shift) or return undef;</td></tr>
+<tr><td class="h"><a name="431"></a>431</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="432"></a>432</td><td></td><td></td><td></td><td></td><td class="s"> # Use the same queue-based search as for ->find</td></tr>
+<tr><td class="h"><a name="433"></a>433</td><td></td><td></td><td></td><td></td><td class="s"> my @queue = @{$self->{children}};</td></tr>
+<tr><td class="h"><a name="434"></a>434</td><td></td><td></td><td></td><td></td><td class="s"> my $rv = eval {</td></tr>
+<tr><td class="h"><a name="435"></a>435</td><td></td><td></td><td></td><td></td><td class="s"> # The defined() here prevents a ton of calls to PPI::Util::TRUE</td></tr>
+<tr><td class="h"><a name="436"></a>436</td><td></td><td></td><td></td><td></td><td class="s"> while ( @queue ) {</td></tr>
+<tr><td class="h"><a name="437"></a>437</td><td></td><td></td><td></td><td></td><td class="s"> my $Element = shift @queue;</td></tr>
+<tr><td class="h"><a name="438"></a>438</td><td></td><td></td><td></td><td></td><td class="s"> my $rv = &$wanted( $self, $Element );</td></tr>
+<tr><td class="h"><a name="439"></a>439</td><td></td><td></td><td></td><td></td><td class="s"> return $Element if $rv;</td></tr>
+<tr><td class="h"><a name="440"></a>440</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="441"></a>441</td><td></td><td></td><td></td><td></td><td class="s"> # Support "don't descend on undef return"</td></tr>
+<tr><td class="h"><a name="442"></a>442</td><td></td><td></td><td></td><td></td><td class="s"> next unless defined $rv;</td></tr>
+<tr><td class="h"><a name="443"></a>443</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="444"></a>444</td><td></td><td></td><td></td><td></td><td class="s"> # Skip if the Element doesn't have any children</td></tr>
+<tr><td class="h"><a name="445"></a>445</td><td></td><td></td><td></td><td></td><td class="s"> next unless $Element->isa('PPI::Node');</td></tr>
+<tr><td class="h"><a name="446"></a>446</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="447"></a>447</td><td></td><td></td><td></td><td></td><td class="s"> # Depth-first keeps the queue size down and provides a</td></tr>
+<tr><td class="h"><a name="448"></a>448</td><td></td><td></td><td></td><td></td><td class="s"> # better logical order.</td></tr>
+<tr><td class="h"><a name="449"></a>449</td><td></td><td></td><td></td><td></td><td class="s"> if ( $Element->isa('PPI::Structure') ) {</td></tr>
+<tr><td class="h"><a name="450"></a>450</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, $Element->finish if defined($Element->finish);</td></tr>
+<tr><td class="h"><a name="451"></a>451</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, @{$Element->{children}};</td></tr>
+<tr><td class="h"><a name="452"></a>452</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, $Element->start if defined($Element->start);</td></tr>
+<tr><td class="h"><a name="453"></a>453</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="454"></a>454</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, @{$Element->{children}};</td></tr>
+<tr><td class="h"><a name="455"></a>455</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="456"></a>456</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="457"></a>457</td><td></td><td></td><td></td><td></td><td class="s"> };</td></tr>
+<tr><td class="h"><a name="458"></a>458</td><td></td><td></td><td></td><td></td><td class="s"> if ( $@ ) {</td></tr>
+<tr><td class="h"><a name="459"></a>459</td><td></td><td></td><td></td><td></td><td class="s"> # Caught exception thrown from the wanted function</td></tr>
+<tr><td class="h"><a name="460"></a>460</td><td></td><td></td><td></td><td></td><td class="s"> return undef;</td></tr>
+<tr><td class="h"><a name="461"></a>461</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="462"></a>462</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="463"></a>463</td><td></td><td></td><td></td><td></td><td class="s"> $rv or '';</td></tr>
+<tr><td class="h"><a name="464"></a>464</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="465"></a>465</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="466"></a>466</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="467"></a>467</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="468"></a>468</td><td></td><td></td><td></td><td></td><td class="s">=head2 find_any $class | \&wanted</td></tr>
+<tr><td class="h"><a name="469"></a>469</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="470"></a>470</td><td></td><td></td><td></td><td></td><td class="s">The C<find_any> method is a short-circuiting true/false method that behaves</td></tr>
+<tr><td class="h"><a name="471"></a>471</td><td></td><td></td><td></td><td></td><td class="s">like the normal C<find> method, but returns true as soon as it finds any</td></tr>
+<tr><td class="h"><a name="472"></a>472</td><td></td><td></td><td></td><td></td><td class="s">Elements that match the search condition.</td></tr>
+<tr><td class="h"><a name="473"></a>473</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="474"></a>474</td><td></td><td></td><td></td><td></td><td class="s">See the C<find> method for details on the format of the search condition.</td></tr>
+<tr><td class="h"><a name="475"></a>475</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="476"></a>476</td><td></td><td></td><td></td><td></td><td class="s">Returns true if any Elements that match the condition can be found, false if</td></tr>
+<tr><td class="h"><a name="477"></a>477</td><td></td><td></td><td></td><td></td><td class="s">not, or C<undef> if given an invalid condition, or an error occurs.</td></tr>
+<tr><td class="h"><a name="478"></a>478</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="479"></a>479</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="480"></a>480</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="481"></a>481</td><td></td><td></td><td></td><td></td><td class="s">sub find_any {</td></tr>
+<tr><td class="h"><a name="482"></a>482</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="483"></a>483</td><td></td><td></td><td></td><td></td><td class="s"> my $rv = $self->find_first(@_);</td></tr>
+<tr><td class="h"><a name="484"></a>484</td><td></td><td></td><td></td><td></td><td class="s"> $rv ? 1 : $rv; # false or undef</td></tr>
+<tr><td class="h"><a name="485"></a>485</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="486"></a>486</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="487"></a>487</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="488"></a>488</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="489"></a>489</td><td></td><td></td><td></td><td></td><td class="s">=head2 remove_child $Element</td></tr>
+<tr><td class="h"><a name="490"></a>490</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="491"></a>491</td><td></td><td></td><td></td><td></td><td class="s">If passed a L<PPI::Element> object that is a direct child of the Node,</td></tr>
+<tr><td class="h"><a name="492"></a>492</td><td></td><td></td><td></td><td></td><td class="s">the C<remove_element> method will remove the C<Element> intact, along</td></tr>
+<tr><td class="h"><a name="493"></a>493</td><td></td><td></td><td></td><td></td><td class="s">with any of its children. As such, this method acts essentially as a</td></tr>
+<tr><td class="h"><a name="494"></a>494</td><td></td><td></td><td></td><td></td><td class="s">'cut' function.</td></tr>
+<tr><td class="h"><a name="495"></a>495</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="496"></a>496</td><td></td><td></td><td></td><td></td><td class="s">If successful, returns the removed element. Otherwise, returns C<undef>.</td></tr>
+<tr><td class="h"><a name="497"></a>497</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="498"></a>498</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="499"></a>499</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="500"></a>500</td><td></td><td></td><td></td><td></td><td class="s">sub remove_child {</td></tr>
+<tr><td class="h"><a name="501"></a>501</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="502"></a>502</td><td></td><td></td><td></td><td></td><td class="s"> my $child = _INSTANCE(shift, 'PPI::Element') or return undef;</td></tr>
+<tr><td class="h"><a name="503"></a>503</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="504"></a>504</td><td></td><td></td><td></td><td></td><td class="s"> # Find the position of the child</td></tr>
+<tr><td class="h"><a name="505"></a>505</td><td></td><td></td><td></td><td></td><td class="s"> my $key = refaddr $child;</td></tr>
+<tr><td class="h"><a name="506"></a>506</td><td></td><td></td><td></td><td></td><td class="s"> my $p = List::MoreUtils::firstidx {</td></tr>
+<tr><td class="h"><a name="507"></a>507</td><td></td><td></td><td></td><td></td><td class="s"> refaddr $_ == $key</td></tr>
+<tr><td class="h"><a name="508"></a>508</td><td></td><td></td><td></td><td></td><td class="s"> } @{$self->{children}};</td></tr>
+<tr><td class="h"><a name="509"></a>509</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless defined $p;</td></tr>
+<tr><td class="h"><a name="510"></a>510</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="511"></a>511</td><td></td><td></td><td></td><td></td><td class="s"> # Splice it out, and remove the child's parent entry</td></tr>
+<tr><td class="h"><a name="512"></a>512</td><td></td><td></td><td></td><td></td><td class="s"> splice( @{$self->{children}}, $p, 1 );</td></tr>
+<tr><td class="h"><a name="513"></a>513</td><td></td><td></td><td></td><td></td><td class="s"> delete $_PARENT{refaddr $child};</td></tr>
+<tr><td class="h"><a name="514"></a>514</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="515"></a>515</td><td></td><td></td><td></td><td></td><td class="s"> $child;</td></tr>
+<tr><td class="h"><a name="516"></a>516</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="517"></a>517</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="518"></a>518</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="519"></a>519</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="520"></a>520</td><td></td><td></td><td></td><td></td><td class="s">=head2 prune $class | \&wanted</td></tr>
+<tr><td class="h"><a name="521"></a>521</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="522"></a>522</td><td></td><td></td><td></td><td></td><td class="s">The C<prune> method is used to strip L<PPI::Element> objects out of a code</td></tr>
+<tr><td class="h"><a name="523"></a>523</td><td></td><td></td><td></td><td></td><td class="s">tree. The argument is the same as for the C<find> method, either a class</td></tr>
+<tr><td class="h"><a name="524"></a>524</td><td></td><td></td><td></td><td></td><td class="s">name, or an anonymous subroutine which returns true/false. Any Element</td></tr>
+<tr><td class="h"><a name="525"></a>525</td><td></td><td></td><td></td><td></td><td class="s">that matches the class|wanted will be deleted from the code tree, along</td></tr>
+<tr><td class="h"><a name="526"></a>526</td><td></td><td></td><td></td><td></td><td class="s">with any of its children.</td></tr>
+<tr><td class="h"><a name="527"></a>527</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="528"></a>528</td><td></td><td></td><td></td><td></td><td class="s">The C<prune> method returns the number of C<Element> objects that matched</td></tr>
+<tr><td class="h"><a name="529"></a>529</td><td></td><td></td><td></td><td></td><td class="s">and were removed, B<non-recursively>. This might also be zero, so avoid a</td></tr>
+<tr><td class="h"><a name="530"></a>530</td><td></td><td></td><td></td><td></td><td class="s">simple true/false test on the return false of the C<prune> method. It</td></tr>
+<tr><td class="h"><a name="531"></a>531</td><td></td><td></td><td></td><td></td><td class="s">returns C<undef> on error, which you probably B<should> test for.</td></tr>
+<tr><td class="h"><a name="532"></a>532</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="533"></a>533</td><td></td><td></td><td></td><td></td><td class="s">=begin testing prune 2</td></tr>
+<tr><td class="h"><a name="534"></a>534</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="535"></a>535</td><td></td><td></td><td></td><td></td><td class="s"># Avoids a bug in old Perls relating to the detection of scripts</td></tr>
+<tr><td class="h"><a name="536"></a>536</td><td></td><td></td><td></td><td></td><td class="s"># Known to occur in ActivePerl 5.6.1 and at least one 5.6.2 install.</td></tr>
+<tr><td class="h"><a name="537"></a>537</td><td></td><td></td><td></td><td></td><td class="s">my $hashbang = reverse 'lrep/nib/rsu/!#'; </td></tr>
+<tr><td class="h"><a name="538"></a>538</td><td></td><td></td><td></td><td></td><td class="s">my $document = PPI::Document->new( \<<"END_PERL" );</td></tr>
+<tr><td class="h"><a name="539"></a>539</td><td></td><td></td><td></td><td></td><td class="s">$hashbang</td></tr>
+<tr><td class="h"><a name="540"></a>540</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="541"></a>541</td><td></td><td></td><td></td><td></td><td class="s">use strict;</td></tr>
+<tr><td class="h"><a name="542"></a>542</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="543"></a>543</td><td></td><td></td><td></td><td></td><td class="s">sub one { 1 }</td></tr>
+<tr><td class="h"><a name="544"></a>544</td><td></td><td></td><td></td><td></td><td class="s">sub two { 2 }</td></tr>
+<tr><td class="h"><a name="545"></a>545</td><td></td><td></td><td></td><td></td><td class="s">sub three { 3 }</td></tr>
+<tr><td class="h"><a name="546"></a>546</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="547"></a>547</td><td></td><td></td><td></td><td></td><td class="s">print one;</td></tr>
+<tr><td class="h"><a name="548"></a>548</td><td></td><td></td><td></td><td></td><td class="s">print "\n";</td></tr>
+<tr><td class="h"><a name="549"></a>549</td><td></td><td></td><td></td><td></td><td class="s">print three;</td></tr>
+<tr><td class="h"><a name="550"></a>550</td><td></td><td></td><td></td><td></td><td class="s">print "\n";</td></tr>
+<tr><td class="h"><a name="551"></a>551</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="552"></a>552</td><td></td><td></td><td></td><td></td><td class="s">exit;</td></tr>
+<tr><td class="h"><a name="553"></a>553</td><td></td><td></td><td></td><td></td><td class="s">END_PERL</td></tr>
+<tr><td class="h"><a name="554"></a>554</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="555"></a>555</td><td></td><td></td><td></td><td></td><td class="s">isa_ok( $document, 'PPI::Document' );</td></tr>
+<tr><td class="h"><a name="556"></a>556</td><td></td><td></td><td></td><td></td><td class="s">ok( defined($document->prune ('PPI::Statement::Sub')),</td></tr>
+<tr><td class="h"><a name="557"></a>557</td><td></td><td></td><td></td><td></td><td class="s"> 'Pruned multiple subs ok' );</td></tr>
+<tr><td class="h"><a name="558"></a>558</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="559"></a>559</td><td></td><td></td><td></td><td></td><td class="s">=end testing</td></tr>
+<tr><td class="h"><a name="560"></a>560</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="561"></a>561</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+<tr><td class="h"><a name="562"></a>562</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="563"></a>563</td><td></td><td></td><td></td><td></td><td class="s">sub prune {</td></tr>
+<tr><td class="h"><a name="564"></a>564</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="565"></a>565</td><td></td><td></td><td></td><td></td><td class="s"> my $wanted = $self->_wanted(shift) or return undef;</td></tr>
+<tr><td class="h"><a name="566"></a>566</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="567"></a>567</td><td></td><td></td><td></td><td></td><td class="s"> # Use a depth-first queue search</td></tr>
+<tr><td class="h"><a name="568"></a>568</td><td></td><td></td><td></td><td></td><td class="s"> my $pruned = 0;</td></tr>
+<tr><td class="h"><a name="569"></a>569</td><td></td><td></td><td></td><td></td><td class="s"> my @queue = $self->children;</td></tr>
+<tr><td class="h"><a name="570"></a>570</td><td></td><td></td><td></td><td></td><td class="s"> eval {</td></tr>
+<tr><td class="h"><a name="571"></a>571</td><td></td><td></td><td></td><td></td><td class="s"> while ( my $element = shift @queue ) {</td></tr>
+<tr><td class="h"><a name="572"></a>572</td><td></td><td></td><td></td><td></td><td class="s"> my $rv = &$wanted( $self, $element );</td></tr>
+<tr><td class="h"><a name="573"></a>573</td><td></td><td></td><td></td><td></td><td class="s"> if ( $rv ) {</td></tr>
+<tr><td class="h"><a name="574"></a>574</td><td></td><td></td><td></td><td></td><td class="s"> # Delete the child</td></tr>
+<tr><td class="h"><a name="575"></a>575</td><td></td><td></td><td></td><td></td><td class="s"> $element->delete or return undef;</td></tr>
+<tr><td class="h"><a name="576"></a>576</td><td></td><td></td><td></td><td></td><td class="s"> $pruned++;</td></tr>
+<tr><td class="h"><a name="577"></a>577</td><td></td><td></td><td></td><td></td><td class="s"> next;</td></tr>
+<tr><td class="h"><a name="578"></a>578</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="579"></a>579</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="580"></a>580</td><td></td><td></td><td></td><td></td><td class="s"> # Support the undef == "don't descend"</td></tr>
+<tr><td class="h"><a name="581"></a>581</td><td></td><td></td><td></td><td></td><td class="s"> next unless defined $rv;</td></tr>
+<tr><td class="h"><a name="582"></a>582</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="583"></a>583</td><td></td><td></td><td></td><td></td><td class="s"> if ( _INSTANCE($element, 'PPI::Node') ) {</td></tr>
+<tr><td class="h"><a name="584"></a>584</td><td></td><td></td><td></td><td></td><td class="s"> # Depth-first keeps the queue size down</td></tr>
+<tr><td class="h"><a name="585"></a>585</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, $element->children;</td></tr>
+<tr><td class="h"><a name="586"></a>586</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="587"></a>587</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="588"></a>588</td><td></td><td></td><td></td><td></td><td class="s"> };</td></tr>
+<tr><td class="h"><a name="589"></a>589</td><td></td><td></td><td></td><td></td><td class="s"> if ( $@ ) {</td></tr>
+<tr><td class="h"><a name="590"></a>590</td><td></td><td></td><td></td><td></td><td class="s"> # Caught exception thrown from the wanted function</td></tr>
+<tr><td class="h"><a name="591"></a>591</td><td></td><td></td><td></td><td></td><td class="s"> return undef; </td></tr>
+<tr><td class="h"><a name="592"></a>592</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="593"></a>593</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="594"></a>594</td><td></td><td></td><td></td><td></td><td class="s"> $pruned;</td></tr>
+<tr><td class="h"><a name="595"></a>595</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="596"></a>596</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="597"></a>597</td><td></td><td></td><td></td><td></td><td class="s"># This method is likely to be very heavily used, to take</td></tr>
+<tr><td class="h"><a name="598"></a>598</td><td></td><td></td><td></td><td></td><td class="s"># it slowly and carefuly.</td></tr>
+<tr><td class="h"><a name="599"></a>599</td><td></td><td></td><td></td><td></td><td class="s">### NOTE: Renaming this function or changing either to self will probably</td></tr>
+<tr><td class="h"><a name="600"></a>600</td><td></td><td></td><td></td><td></td><td class="s">### break File::Find::Rule::PPI</td></tr>
+<tr><td class="h"><a name="601"></a>601</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 2.74ms (2.41+328µs) within PPI::Node::_wanted which was called 32 times, avg 86µs/call:
+# 32 times (2.41ms+328µs) by PPI::Node::find at <a href="PPI-Node-pm-921-line.html#373">line 373</a>, avg 86µs/call</div></div>sub _wanted {</td></tr>
+<tr><td class="h"><a name="602"></a>602</td><td class="c1">32</td><td class="c3"><span title="Avg 187ns">6µs</span></td><td></td><td></td><td class="s"> my $either = shift;</td></tr>
+<tr><td class="h"><a name="603"></a>603</td><td class="c1">32</td><td class="c3"><span title="Avg 444ns">14µs</span></td><td></td><td></td><td class="s"> my $it = defined($_[0]) ? shift : do {</td></tr>
+<tr><td class="h"><a name="604"></a>604</td><td></td><td></td><td></td><td></td><td class="s"> Carp::carp('Undefined value passed as search condition') if $^W;</td></tr>
+<tr><td class="h"><a name="605"></a>605</td><td></td><td></td><td></td><td></td><td class="s"> return undef;</td></tr>
+<tr><td class="h"><a name="606"></a>606</td><td></td><td></td><td></td><td></td><td class="s"> };</td></tr>
+<tr><td class="h"><a name="607"></a>607</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="608"></a>608</td><td></td><td></td><td></td><td></td><td class="s"> # Has the caller provided a wanted function directly</td></tr>
+<tr><td class="h"><a name="609"></a>609</td><td class="c1">32</td><td class="c0"><span title="Avg 3µs">102µs</span></td><td class="c1">32</td><td class="c3">26µs</td><td class="s"> return $it if _CODELIKE($it);<div class="calls"><div class="calls_out"> # spent 26µs making 32 calls to <a href="Params-Util-pm-70-line.html#Params__Util___CODELIKE">Params::Util::_CODELIKE</a>, avg 797ns/call</div></div></td></tr>
+<tr><td class="h"><a name="610"></a>610</td><td class="c1">32</td><td class="c3"><span title="Avg 166ns">5µs</span></td><td></td><td></td><td class="s"> if ( ref $it ) {</td></tr>
+<tr><td class="h"><a name="611"></a>611</td><td></td><td></td><td></td><td></td><td class="s"> # No other ref types are supported</td></tr>
+<tr><td class="h"><a name="612"></a>612</td><td></td><td></td><td></td><td></td><td class="s"> Carp::carp('Illegal non-CODE reference passed as search condition') if $^W;</td></tr>
+<tr><td class="h"><a name="613"></a>613</td><td></td><td></td><td></td><td></td><td class="s"> return undef;</td></tr>
+<tr><td class="h"><a name="614"></a>614</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="615"></a>615</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="616"></a>616</td><td></td><td></td><td></td><td></td><td class="s"> # The first argument should be an Element class, possibly in shorthand</td></tr>
+<tr><td class="h"><a name="617"></a>617</td><td class="c1">32</td><td class="c1"><span title="Avg 1µs">43µs</span></td><td></td><td></td><td class="s"> $it = "PPI::$it" unless substr($it, 0, 5) eq 'PPI::';</td></tr>
+<tr><td class="h"><a name="618"></a>618</td><td class="c1">32</td><td class="c0"><span title="Avg 7µs">229µs</span></td><td class="c0">64</td><td class="c0">303µs</td><td class="s"> unless ( _CLASS($it) and $it->isa('PPI::Element') ) {<div class="calls"><div class="calls_out"> # spent 243µs making 32 calls to <a href="(eval 21)[Params-Util-pm-190]-1291-line.html#1">Params::Util::_CLASS</a>, avg 8µs/call
+ # spent 60µs making 32 calls to <a href="UNIVERSAL-pm-738-line.html#UNIVERSAL__isa">UNIVERSAL::isa</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="619"></a>619</td><td></td><td></td><td></td><td></td><td class="s"> # We got something, but it isn't an element</td></tr>
+<tr><td class="h"><a name="620"></a>620</td><td></td><td></td><td></td><td></td><td class="s"> Carp::carp("Cannot create search condition for '$it': Not a PPI::Element") if $^W;</td></tr>
+<tr><td class="h"><a name="621"></a>621</td><td></td><td></td><td></td><td></td><td class="s"> return undef;</td></tr>
+<tr><td class="h"><a name="622"></a>622</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="623"></a>623</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="624"></a>624</td><td></td><td></td><td></td><td></td><td class="s"> # Create the class part of the wanted function</td></tr>
+<tr><td class="h"><a name="625"></a>625</td><td class="c1">32</td><td class="c3"><span title="Avg 759ns">24µs</span></td><td></td><td></td><td class="s"> my $wanted_class = "\n\treturn '' unless \$_[1]->isa('$it');";</td></tr>
+<tr><td class="h"><a name="626"></a>626</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="627"></a>627</td><td></td><td></td><td></td><td></td><td class="s"> # Have we been given a second argument to check the content</td></tr>
+<tr><td class="h"><a name="628"></a>628</td><td class="c1">32</td><td class="c3"><span title="Avg 181ns">6µs</span></td><td></td><td></td><td class="s"> my $wanted_content = '';</td></tr>
+<tr><td class="h"><a name="629"></a>629</td><td class="c1">32</td><td class="c3"><span title="Avg 272ns">9µs</span></td><td></td><td></td><td class="s"> if ( defined $_[0] ) {</td></tr>
+<tr><td class="h"><a name="630"></a>630</td><td></td><td></td><td></td><td></td><td class="s"> my $content = shift;</td></tr>
+<tr><td class="h"><a name="631"></a>631</td><td></td><td></td><td></td><td></td><td class="s"> if ( ref $content eq 'Regexp' ) {</td></tr>
+<tr><td class="h"><a name="632"></a>632</td><td></td><td></td><td></td><td></td><td class="s"> $content = "$content";</td></tr>
+<tr><td class="h"><a name="633"></a>633</td><td></td><td></td><td></td><td></td><td class="s"> } elsif ( ref $content ) {</td></tr>
+<tr><td class="h"><a name="634"></a>634</td><td></td><td></td><td></td><td></td><td class="s"> # No other ref types are supported</td></tr>
+<tr><td class="h"><a name="635"></a>635</td><td></td><td></td><td></td><td></td><td class="s"> Carp::carp("Cannot create search condition for '$it': Not a PPI::Element") if $^W;</td></tr>
+<tr><td class="h"><a name="636"></a>636</td><td></td><td></td><td></td><td></td><td class="s"> return undef;</td></tr>
+<tr><td class="h"><a name="637"></a>637</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="638"></a>638</td><td></td><td></td><td></td><td></td><td class="s"> $content = quotemeta $content;</td></tr>
+<tr><td class="h"><a name="639"></a>639</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="640"></a>640</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="641"></a>641</td><td></td><td></td><td></td><td></td><td class="s"> # Complete the content part of the wanted function</td></tr>
+<tr><td class="h"><a name="642"></a>642</td><td></td><td></td><td></td><td></td><td class="s"> $wanted_content .= "\n\treturn '' unless defined \$_[1]->{content};";</td></tr>
+<tr><td class="h"><a name="643"></a>643</td><td></td><td></td><td></td><td></td><td class="s"> $wanted_content .= "\n\treturn '' unless \$_[1]->{content} =~ /$content/;";</td></tr>
+<tr><td class="h"><a name="644"></a>644</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="645"></a>645</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="646"></a>646</td><td></td><td></td><td></td><td></td><td class="s"> # Create the complete wanted function</td></tr>
+<tr><td class="h"><a name="647"></a>647</td><td class="c1">32</td><td class="c3"><span title="Avg 944ns">30µs</span></td><td></td><td></td><td class="s"> my $code = "sub {"</td></tr>
+<tr><td class="h"><a name="648"></a>648</td><td></td><td></td><td></td><td></td><td class="s"> . $wanted_class</td></tr>
+<tr><td class="h"><a name="649"></a>649</td><td></td><td></td><td></td><td></td><td class="s"> . $wanted_content</td></tr>
+<tr><td class="h"><a name="650"></a>650</td><td></td><td></td><td></td><td></td><td class="s"> . "\n\t1;"</td></tr>
+<tr><td class="h"><a name="651"></a>651</td><td></td><td></td><td></td><td></td><td class="s"> . "\n}";</td></tr>
+<tr><td class="h"><a name="652"></a>652</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="653"></a>653</td><td></td><td></td><td></td><td></td><td class="s"> # Compile the wanted function</td></tr>
+<tr><td class="h"><a name="654"></a>654</td><td class="c1">32</td><td class="c0"><span title="Avg 53µs">1.70ms</span></td><td></td><td></td><td class="s"> $code = eval $code;<div class="calls"><div class="calls_out"> # spent 386µs executing statements in <a href="(eval 862)[PPI-Node-pm-654]-1292-line.html">8 string evals (merged)</a><br /> # includes 222µs spent executing 56 calls to 1 sub defined therein.
+ # spent 380µs executing statements in <a href="(eval 865)[PPI-Node-pm-654]-1295-line.html">8 string evals (merged)</a><br /> # includes 227µs spent executing 56 calls to 1 sub defined therein.
+ # spent 347µs executing statements in <a href="(eval 863)[PPI-Node-pm-654]-1293-line.html">8 string evals (merged)</a><br /> # includes 207µs spent executing 56 calls to 1 sub defined therein.
+ # spent 335µs executing statements in <a href="(eval 864)[PPI-Node-pm-654]-1294-line.html">8 string evals (merged)</a><br /> # includes 202µs spent executing 56 calls to 1 sub defined therein.</div></div></td></tr>
+<tr><td class="h"><a name="655"></a>655</td><td class="c1">32</td><td class="c0"><span title="Avg 4µs">125µs</span></td><td></td><td></td><td class="s"> (ref $code eq 'CODE') ? $code : undef;</td></tr>
+<tr><td class="h"><a name="656"></a>656</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="657"></a>657</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="- -"></a>- -</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="662"></a>662</td><td></td><td></td><td></td><td></td><td class="s">####################################################################</td></tr>
+<tr><td class="h"><a name="663"></a>663</td><td></td><td></td><td></td><td></td><td class="s"># PPI::Element overloaded methods</td></tr>
+<tr><td class="h"><a name="664"></a>664</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="665"></a>665</td><td></td><td></td><td></td><td></td><td class="s">sub tokens {</td></tr>
+<tr><td class="h"><a name="666"></a>666</td><td></td><td></td><td></td><td></td><td class="s"> map { $_->tokens } @{$_[0]->{children}};</td></tr>
+<tr><td class="h"><a name="667"></a>667</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="668"></a>668</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="669"></a>669</td><td></td><td></td><td></td><td></td><td class="s">### XS -> PPI/XS.xs:_PPI_Element__content 0.900+</td></tr>
+<tr><td class="h"><a name="670"></a>670</td><td></td><td></td><td></td><td></td><td class="s">sub content {</td></tr>
+<tr><td class="h"><a name="671"></a>671</td><td></td><td></td><td></td><td></td><td class="s"> join '', map { $_->content } @{$_[0]->{children}};</td></tr>
+<tr><td class="h"><a name="672"></a>672</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="673"></a>673</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="674"></a>674</td><td></td><td></td><td></td><td></td><td class="s"># Clone as normal, but then go down and relink all the _PARENT entries</td></tr>
+<tr><td class="h"><a name="675"></a>675</td><td></td><td></td><td></td><td></td><td class="s">sub clone {</td></tr>
+<tr><td class="h"><a name="676"></a>676</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="677"></a>677</td><td></td><td></td><td></td><td></td><td class="s"> my $clone = $self->SUPER::clone;</td></tr>
+<tr><td class="h"><a name="678"></a>678</td><td></td><td></td><td></td><td></td><td class="s"> $clone->__link_children;</td></tr>
+<tr><td class="h"><a name="679"></a>679</td><td></td><td></td><td></td><td></td><td class="s"> $clone;</td></tr>
+<tr><td class="h"><a name="680"></a>680</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="681"></a>681</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="682"></a>682</td><td></td><td></td><td></td><td></td><td class="s">sub location {</td></tr>
+<tr><td class="h"><a name="683"></a>683</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="684"></a>684</td><td></td><td></td><td></td><td></td><td class="s"> my $first = $self->{children}->[0] or return undef;</td></tr>
+<tr><td class="h"><a name="685"></a>685</td><td></td><td></td><td></td><td></td><td class="s"> $first->location;</td></tr>
+<tr><td class="h"><a name="686"></a>686</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="687"></a>687</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="- -"></a>- -</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="692"></a>692</td><td></td><td></td><td></td><td></td><td class="s">#####################################################################</td></tr>
+<tr><td class="h"><a name="693"></a>693</td><td></td><td></td><td></td><td></td><td class="s"># Internal Methods</td></tr>
+<tr><td class="h"><a name="694"></a>694</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="695"></a>695</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 587µs (408+180) within PPI::Node::DESTROY which was called 16 times, avg 37µs/call:
+# 8 times (362µs+226µs) by TryCatch::parse_proto_using_pms at <a href="TryCatch-pm-905-line.html#230">line 230 of TryCatch.pm</a>, avg 73µs/call
+# 8 times (46µs+-46µs) by PPI::Node::DESTROY at <a href="PPI-Node-pm-921-line.html#700">line 700</a>, avg 0s/call</div></div>sub DESTROY {</td></tr>
+<tr><td class="h"><a name="696"></a>696</td><td class="c3">16</td><td class="c3"><span title="Avg 150ns">2µs</span></td><td></td><td></td><td class="s"> local $_;</td></tr>
+<tr><td class="h"><a name="697"></a>697</td><td class="c3">16</td><td class="c3"><span title="Avg 906ns">15µs</span></td><td></td><td></td><td class="s"> if ( $_[0]->{children} ) {</td></tr>
+<tr><td class="h"><a name="698"></a>698</td><td class="c3">8</td><td class="c3"><span title="Avg 825ns">7µs</span></td><td></td><td></td><td class="s"> my @queue = $_[0];</td></tr>
+<tr><td class="h"><a name="699"></a>699</td><td class="c3">8</td><td class="c3"><span title="Avg 975ns">8µs</span></td><td></td><td></td><td class="s"> while ( defined($_ = shift @queue) ) {</td></tr>
+<tr><td class="h"><a name="700"></a>700</td><td class="c0">64</td><td class="c0"><span title="Avg 1µs">92µs</span></td><td class="c0">48</td><td class="c0">169µs</td><td class="s"> unshift @queue, @{delete $_->{children}} if $_->{children};<div class="calls"><div class="calls_out"> # spent 169µs making 40 calls to <a href="PPI-Element-pm-919-line.html#1083">PPI::Element::DESTROY</a>, avg 4µs/call
+ # spent 52µs making 8 calls to <a href="PPI-Node-pm-921-line.html#695">PPI::Node::DESTROY</a>, avg 6µs/call, recursion: max depth 1, sum of overlapping time 52µs</div></div></td></tr>
+<tr><td class="h"><a name="701"></a>701</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="702"></a>702</td><td></td><td></td><td></td><td></td><td class="s"> # Remove all internal/private weird crosslinking so that</td></tr>
+<tr><td class="h"><a name="703"></a>703</td><td></td><td></td><td></td><td></td><td class="s"> # the cascading DESTROY calls will get called properly.</td></tr>
+<tr><td class="h"><a name="704"></a>704</td><td class="c0">64</td><td class="c0"><span title="Avg 2µs">144µs</span></td><td></td><td></td><td class="s"> %$_ = ();</td></tr>
+<tr><td class="h"><a name="705"></a>705</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="706"></a>706</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="707"></a>707</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="708"></a>708</td><td></td><td></td><td></td><td></td><td class="s"> # Remove us from our parent node as normal</td></tr>
+<tr><td class="h"><a name="709"></a>709</td><td class="c3">16</td><td class="c0"><span title="Avg 6µs">93µs</span></td><td class="c3">16</td><td class="c3">11µs</td><td class="s"> delete $_PARENT{refaddr $_[0]};<div class="calls"><div class="calls_out"> # spent 11µs making 16 calls to <a href="Scalar-Util-pm-63-line.html#Scalar__Util__refaddr">Scalar::Util::refaddr</a>, avg 681ns/call</div></div></td></tr>
+<tr><td class="h"><a name="710"></a>710</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="711"></a>711</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="712"></a>712</td><td></td><td></td><td></td><td></td><td class="s"># Find the position of a child</td></tr>
+<tr><td class="h"><a name="713"></a>713</td><td></td><td></td><td></td><td></td><td class="s">sub __position {</td></tr>
+<tr><td class="h"><a name="714"></a>714</td><td></td><td></td><td></td><td></td><td class="s"> my $key = refaddr $_[1];</td></tr>
+<tr><td class="h"><a name="715"></a>715</td><td></td><td></td><td></td><td></td><td class="s"> List::MoreUtils::firstidx { refaddr $_ == $key } @{$_[0]->{children}};</td></tr>
+<tr><td class="h"><a name="716"></a>716</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="717"></a>717</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="718"></a>718</td><td></td><td></td><td></td><td></td><td class="s"># Insert one or more elements before a child</td></tr>
+<tr><td class="h"><a name="719"></a>719</td><td></td><td></td><td></td><td></td><td class="s">sub __insert_before_child {</td></tr>
+<tr><td class="h"><a name="720"></a>720</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="721"></a>721</td><td></td><td></td><td></td><td></td><td class="s"> my $key = refaddr shift;</td></tr>
+<tr><td class="h"><a name="722"></a>722</td><td></td><td></td><td></td><td></td><td class="s"> my $p = List::MoreUtils::firstidx {</td></tr>
+<tr><td class="h"><a name="723"></a>723</td><td></td><td></td><td></td><td></td><td class="s"> refaddr $_ == $key</td></tr>
+<tr><td class="h"><a name="724"></a>724</td><td></td><td></td><td></td><td></td><td class="s"> } @{$self->{children}};</td></tr>
+<tr><td class="h"><a name="725"></a>725</td><td></td><td></td><td></td><td></td><td class="s"> foreach ( @_ ) {</td></tr>
+<tr><td class="h"><a name="726"></a>726</td><td></td><td></td><td></td><td></td><td class="s"> Scalar::Util::weaken(</td></tr>
+<tr><td class="h"><a name="727"></a>727</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr $_} = $self</td></tr>
+<tr><td class="h"><a name="728"></a>728</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="729"></a>729</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="730"></a>730</td><td></td><td></td><td></td><td></td><td class="s"> splice( @{$self->{children}}, $p, 0, @_ );</td></tr>
+<tr><td class="h"><a name="731"></a>731</td><td></td><td></td><td></td><td></td><td class="s"> 1;</td></tr>
+<tr><td class="h"><a name="732"></a>732</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="733"></a>733</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="734"></a>734</td><td></td><td></td><td></td><td></td><td class="s"># Insert one or more elements after a child</td></tr>
+<tr><td class="h"><a name="735"></a>735</td><td></td><td></td><td></td><td></td><td class="s">sub __insert_after_child {</td></tr>
+<tr><td class="h"><a name="736"></a>736</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="737"></a>737</td><td></td><td></td><td></td><td></td><td class="s"> my $key = refaddr shift;</td></tr>
+<tr><td class="h"><a name="738"></a>738</td><td></td><td></td><td></td><td></td><td class="s"> my $p = List::MoreUtils::firstidx {</td></tr>
+<tr><td class="h"><a name="739"></a>739</td><td></td><td></td><td></td><td></td><td class="s"> refaddr $_ == $key</td></tr>
+<tr><td class="h"><a name="740"></a>740</td><td></td><td></td><td></td><td></td><td class="s"> } @{$self->{children}};</td></tr>
+<tr><td class="h"><a name="741"></a>741</td><td></td><td></td><td></td><td></td><td class="s"> foreach ( @_ ) {</td></tr>
+<tr><td class="h"><a name="742"></a>742</td><td></td><td></td><td></td><td></td><td class="s"> Scalar::Util::weaken(</td></tr>
+<tr><td class="h"><a name="743"></a>743</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr $_} = $self</td></tr>
+<tr><td class="h"><a name="744"></a>744</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="745"></a>745</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="746"></a>746</td><td></td><td></td><td></td><td></td><td class="s"> splice( @{$self->{children}}, $p + 1, 0, @_ );</td></tr>
+<tr><td class="h"><a name="747"></a>747</td><td></td><td></td><td></td><td></td><td class="s"> 1;</td></tr>
+<tr><td class="h"><a name="748"></a>748</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="749"></a>749</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="750"></a>750</td><td></td><td></td><td></td><td></td><td class="s"># Replace a child</td></tr>
+<tr><td class="h"><a name="751"></a>751</td><td></td><td></td><td></td><td></td><td class="s">sub __replace_child {</td></tr>
+<tr><td class="h"><a name="752"></a>752</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="753"></a>753</td><td></td><td></td><td></td><td></td><td class="s"> my $key = refaddr shift;</td></tr>
+<tr><td class="h"><a name="754"></a>754</td><td></td><td></td><td></td><td></td><td class="s"> my $p = List::MoreUtils::firstidx {</td></tr>
+<tr><td class="h"><a name="755"></a>755</td><td></td><td></td><td></td><td></td><td class="s"> refaddr $_ == $key</td></tr>
+<tr><td class="h"><a name="756"></a>756</td><td></td><td></td><td></td><td></td><td class="s"> } @{$self->{children}};</td></tr>
+<tr><td class="h"><a name="757"></a>757</td><td></td><td></td><td></td><td></td><td class="s"> foreach ( @_ ) {</td></tr>
+<tr><td class="h"><a name="758"></a>758</td><td></td><td></td><td></td><td></td><td class="s"> Scalar::Util::weaken(</td></tr>
+<tr><td class="h"><a name="759"></a>759</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr $_} = $self</td></tr>
+<tr><td class="h"><a name="760"></a>760</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="761"></a>761</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="762"></a>762</td><td></td><td></td><td></td><td></td><td class="s"> splice( @{$self->{children}}, $p, 1, @_ );</td></tr>
+<tr><td class="h"><a name="763"></a>763</td><td></td><td></td><td></td><td></td><td class="s"> 1;</td></tr>
+<tr><td class="h"><a name="764"></a>764</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="765"></a>765</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="766"></a>766</td><td></td><td></td><td></td><td></td><td class="s"># Create PARENT links for an entire tree.</td></tr>
+<tr><td class="h"><a name="767"></a>767</td><td></td><td></td><td></td><td></td><td class="s"># Used when cloning or thawing.</td></tr>
+<tr><td class="h"><a name="768"></a>768</td><td></td><td></td><td></td><td></td><td class="s">sub __link_children {</td></tr>
+<tr><td class="h"><a name="769"></a>769</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="770"></a>770</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="771"></a>771</td><td></td><td></td><td></td><td></td><td class="s"> # Relink all our children ( depth first )</td></tr>
+<tr><td class="h"><a name="772"></a>772</td><td></td><td></td><td></td><td></td><td class="s"> my @queue = ( $self );</td></tr>
+<tr><td class="h"><a name="773"></a>773</td><td></td><td></td><td></td><td></td><td class="s"> while ( my $Node = shift @queue ) {</td></tr>
+<tr><td class="h"><a name="774"></a>774</td><td></td><td></td><td></td><td></td><td class="s"> # Link our immediate children</td></tr>
+<tr><td class="h"><a name="775"></a>775</td><td></td><td></td><td></td><td></td><td class="s"> foreach my $Element ( @{$Node->{children}} ) {</td></tr>
+<tr><td class="h"><a name="776"></a>776</td><td></td><td></td><td></td><td></td><td class="s"> Scalar::Util::weaken(</td></tr>
+<tr><td class="h"><a name="777"></a>777</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr($Element)} = $Node</td></tr>
+<tr><td class="h"><a name="778"></a>778</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="779"></a>779</td><td></td><td></td><td></td><td></td><td class="s"> unshift @queue, $Element if $Element->isa('PPI::Node');</td></tr>
+<tr><td class="h"><a name="780"></a>780</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="781"></a>781</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="782"></a>782</td><td></td><td></td><td></td><td></td><td class="s"> # If it's a structure, relink the open/close braces</td></tr>
+<tr><td class="h"><a name="783"></a>783</td><td></td><td></td><td></td><td></td><td class="s"> next unless $Node->isa('PPI::Structure');</td></tr>
+<tr><td class="h"><a name="784"></a>784</td><td></td><td></td><td></td><td></td><td class="s"> Scalar::Util::weaken(</td></tr>
+<tr><td class="h"><a name="785"></a>785</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr($Node->start)} = $Node</td></tr>
+<tr><td class="h"><a name="786"></a>786</td><td></td><td></td><td></td><td></td><td class="s"> ) if $Node->start;</td></tr>
+<tr><td class="h"><a name="787"></a>787</td><td></td><td></td><td></td><td></td><td class="s"> Scalar::Util::weaken(</td></tr>
+<tr><td class="h"><a name="788"></a>788</td><td></td><td></td><td></td><td></td><td class="s"> $_PARENT{refaddr($Node->finish)} = $Node</td></tr>
+<tr><td class="h"><a name="789"></a>789</td><td></td><td></td><td></td><td></td><td class="s"> ) if $Node->finish;</td></tr>
+<tr><td class="h"><a name="790"></a>790</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="791"></a>791</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="792"></a>792</td><td></td><td></td><td></td><td></td><td class="s"> 1;</td></tr>
+<tr><td class="h"><a name="793"></a>793</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="794"></a>794</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="795"></a>795</td><td class="c3">1</td><td class="c3"><span title="Avg 4µs">4µs</span></td><td></td><td></td><td class="s">1;</td></tr>
+<tr><td class="h"><a name="796"></a>796</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="797"></a>797</td><td></td><td></td><td></td><td></td><td class="s">=pod</td></tr>
+<tr><td class="h"><a name="798"></a>798</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="799"></a>799</td><td></td><td></td><td></td><td></td><td class="s">=head1 TO DO</td></tr>
+<tr><td class="h"><a name="800"></a>800</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="801"></a>801</td><td></td><td></td><td></td><td></td><td class="s">- Move as much as possible to L<PPI::XS></td></tr>
+<tr><td class="h"><a name="802"></a>802</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="803"></a>803</td><td></td><td></td><td></td><td></td><td class="s">=head1 SUPPORT</td></tr>
+<tr><td class="h"><a name="804"></a>804</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="805"></a>805</td><td></td><td></td><td></td><td></td><td class="s">See the L<support section|PPI/SUPPORT> in the main module.</td></tr>
+<tr><td class="h"><a name="806"></a>806</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="807"></a>807</td><td></td><td></td><td></td><td></td><td class="s">=head1 AUTHOR</td></tr>
+<tr><td class="h"><a name="808"></a>808</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="809"></a>809</td><td></td><td></td><td></td><td></td><td class="s">Adam Kennedy E<lt>adamk@cpan.orgE<gt></td></tr>
+<tr><td class="h"><a name="810"></a>810</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="811"></a>811</td><td></td><td></td><td></td><td></td><td class="s">=head1 COPYRIGHT</td></tr>
+<tr><td class="h"><a name="812"></a>812</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="813"></a>813</td><td></td><td></td><td></td><td></td><td class="s">Copyright 2001 - 2011 Adam Kennedy.</td></tr>
+<tr><td class="h"><a name="814"></a>814</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="815"></a>815</td><td></td><td></td><td></td><td></td><td class="s">This program is free software; you can redistribute</td></tr>
+<tr><td class="h"><a name="816"></a>816</td><td></td><td></td><td></td><td></td><td class="s">it and/or modify it under the same terms as Perl itself.</td></tr>
+<tr><td class="h"><a name="817"></a>817</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="818"></a>818</td><td></td><td></td><td></td><td></td><td class="s">The full text of the license can be found in the</td></tr>
+<tr><td class="h"><a name="819"></a>819</td><td></td><td></td><td></td><td></td><td class="s">LICENSE file included with this module.</td></tr>
+<tr><td class="h"><a name="820"></a>820</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="821"></a>821</td><td></td><td></td><td></td><td></td><td class="s">=cut</td></tr>
+</tbody></table></div>
+
+ <script type="text/javascript"> $(document).ready(function() {
+
+ $("#subs_table").tablesorter({
+ sortList: [[3,1]],
+ headers: {
+ 3: { sorter: 'fmt_time' },
+ 4: { sorter: 'fmt_time' }
+ }
+ });
+
+ } ); </script>
+
+ <div class="footer">Report produced by the
+ <a href="http://search.cpan.org/dist/Devel-NYTProf/">NYTProf 4.06</a>
+ Perl profiler, developed by
+ <a href="http://www.linkedin.com/in/timbunce">Tim Bunce</a> and
+ <a href="http://code.nytimes.com">Adam Kaplan</a>.
+ </div>
+ <br /><br /><br /><br /><br /><br /><br /><br /><br /><br />
+ </body></html>
\ No newline at end of file
projects / scpubgit/stemmatology.git / blobdiff