--- /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 Graph/AdjacencyMap/Heavy.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 mode_btn_selected">block view</span> • <span class="mode_btn"><a href="Graph-AdjacencyMap-Heavy-pm-697-line.html">line view</a></span> • <span class="mode_btn"><a href="Graph-AdjacencyMap-Heavy-pm-697-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:51:53 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/Graph/AdjacencyMap/Heavy.pm">/Users/edenc/perl5/lib/perl5/Graph/AdjacencyMap/Heavy.pm</a></td></tr>
+<tr><td class="h">Statements</td><td align="left">Executed 278796 statements in 159ms</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">39178</td><td class="c0">5</td><td class="c1">2</td><td class="c0"><span title="0.3%">121ms</span></td><td class="c0"><span title="0.3%">121ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::__attr</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#175">__attr</a></span></td></tr>
+<tr><td class="c0">1249</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.0%">12.3ms</span></td><td class="c0"><span title="0.0%">12.3ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::__set_path</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#19">__set_path</a></span></td></tr>
+<tr><td class="c0">1249</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.0%">11.0ms</span></td><td class="c0"><span title="0.0%">15.2ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::__set_path_node</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#47">__set_path_node</a></span></td></tr>
+<tr><td class="c0">1249</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.0%">10.8ms</span></td><td class="c0"><span title="0.1%">38.4ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::set_path</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#60">set_path</a></span></td></tr>
+<tr><td class="c3">2</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">238µs</span></td><td class="c3"><span title="0.0%">238µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::paths</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#246">paths</a></span></td></tr>
+<tr><td class="c3">254</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">150µs</span></td><td class="c3"><span title="0.0%">150µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::CORE:sort</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#Graph__AdjacencyMap__Heavy__CORE_sort">CORE:sort</a> (opcode)</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%">18µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::BEGIN@7</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#7">BEGIN@7</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%">9µs</span></td><td class="c3"><span title="0.0%">82µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::BEGIN@13</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#13">BEGIN@13</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%">232µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::Heavy::::BEGIN@12</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#12">BEGIN@12</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;">Graph::AdjacencyMap::Heavy::::__has_path</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#73">__has_path</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;">Graph::AdjacencyMap::Heavy::::_get_id_path</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#195">_get_id_path</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;">Graph::AdjacencyMap::Heavy::::_get_path_count</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#165">_get_path_count</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;">Graph::AdjacencyMap::Heavy::::_get_path_id</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#148">_get_path_id</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;">Graph::AdjacencyMap::Heavy::::_get_path_node</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#129">_get_path_node</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;">Graph::AdjacencyMap::Heavy::::del_path</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#201">del_path</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;">Graph::AdjacencyMap::Heavy::::del_path_by_multi_id</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#223">del_path_by_multi_id</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;">Graph::AdjacencyMap::Heavy::::has_path</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#104">has_path</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;">Graph::AdjacencyMap::Heavy::::has_path_by_multi_id</span>Graph::AdjacencyMap::Heavy::<a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#116">has_path_by_multi_id</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-Graph-AdjacencyMap-Heavy-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 Graph::AdjacencyMap::Heavy;</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"># THIS IS INTERNAL IMPLEMENTATION ONLY, NOT TO BE USED DIRECTLY.</td></tr>
+<tr><td class="h"><a name="4"></a>4</td><td></td><td></td><td></td><td></td><td class="s"># THE INTERFACE IS HARD TO USE AND GOING TO STAY THAT WAY AND</td></tr>
+<tr><td class="h"><a name="5"></a>5</td><td></td><td></td><td></td><td></td><td class="s"># ALMOST GUARANTEED TO CHANGE OR GO AWAY IN FUTURE RELEASES.</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 class="c3">2</td><td class="c3"><span title="Avg 14µs">27µs</span></td><td class="c3">2</td><td class="c3">21µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 18µs (14+3) within Graph::AdjacencyMap::Heavy::BEGIN@7 which was called:
+# once (14µs+3µs) by Graph::BEGIN@28 at <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#7">line 7</a></div></div>use strict;<div class="calls"><div class="calls_out"># spent 18µs making 1 call to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#7">Graph::AdjacencyMap::Heavy::BEGIN@7</a>
+# spent 3µs making 1 call to <a href="strict-pm-3-block.html#34">strict::import</a></div></div></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"># $SIG{__DIE__ } = sub { use Carp; confess };</td></tr>
+<tr><td class="h"><a name="10"></a>10</td><td></td><td></td><td></td><td></td><td class="s"># $SIG{__WARN__} = sub { use Carp; confess };</td></tr>
+<tr><td class="h"><a name="11"></a>11</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="12"></a>12</td><td class="c3">2</td><td class="c3"><span title="Avg 14µs">28µs</span></td><td class="c3">2</td><td class="c3">456µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 232µs (7+224) within Graph::AdjacencyMap::Heavy::BEGIN@12 which was called:
+# once (7µs+224µs) by Graph::BEGIN@28 at <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#12">line 12</a></div></div>use Graph::AdjacencyMap qw(:flags :fields);<div class="calls"><div class="calls_out"># spent 232µs making 1 call to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#12">Graph::AdjacencyMap::Heavy::BEGIN@12</a>
+# spent 224µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="13"></a>13</td><td class="c3">2</td><td class="c3"><span title="Avg 778µs">1.56ms</span></td><td class="c3">2</td><td class="c3">156µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 82µs (9+74) within Graph::AdjacencyMap::Heavy::BEGIN@13 which was called:
+# once (9µs+74µs) by Graph::BEGIN@28 at <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#13">line 13</a></div></div>use base 'Graph::AdjacencyMap';<div class="calls"><div class="calls_out"># spent 82µs making 1 call to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#13">Graph::AdjacencyMap::Heavy::BEGIN@13</a>
+# spent 74µs making 1 call to <a href="base-pm-22-block.html#58">base::import</a></div></div></td></tr>
+<tr><td class="h"><a name="14"></a>14</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="15"></a>15</td><td class="c3">1</td><td class="c3"><span title="Avg 600ns">600ns</span></td><td></td><td></td><td class="s">require overload; # for de-overloading</td></tr>
+<tr><td class="h"><a name="16"></a>16</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="17"></a>17</td><td class="c3">1</td><td class="c3"><span title="Avg 96µs">96µs</span></td><td></td><td></td><td class="s">require Data::Dumper;</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"><div class="calls"><div class="calls_in"># spent 12.3ms within Graph::AdjacencyMap::Heavy::__set_path which was called 1249 times, avg 10µs/call:
+# 1249 times (12.3ms+0s) by Graph::AdjacencyMap::Heavy::set_path at <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#67">line 67</a>, avg 10µs/call</div></div>sub __set_path {</td></tr>
+<tr><td class="h"><a name="20"></a>20</td><td class="c0">12490</td><td class="c1"><span title="Avg 479ns">5.98ms</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="21"></a>21</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="22"></a>22</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="23"></a>23</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ != $m->[ _a ] && !($f & _HYPER)) {</td></tr>
+<tr><td class="h"><a name="24"></a>24</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="25"></a>25</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess(sprintf "Graph::AdjacencyMap::Heavy: arguments %d expected %d",</td></tr>
+<tr><td class="h"><a name="26"></a>26</td><td></td><td></td><td></td><td></td><td class="s"> scalar @_, $m->[ _a ]);</td></tr>
+<tr><td class="h"><a name="27"></a>27</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="28"></a>28</td><td></td><td></td><td></td><td></td><td class="s"> my $p;</td></tr>
+<tr><td class="h"><a name="29"></a>29</td><td></td><td></td><td></td><td></td><td class="s"> $p = ($f & _HYPER) ?</td></tr>
+<tr><td class="h"><a name="30"></a>30</td><td></td><td></td><td></td><td></td><td class="s"> (( $m->[ _s ] ||= [ ] )->[ @_ ] ||= { }) :</td></tr>
+<tr><td class="h"><a name="31"></a>31</td><td></td><td></td><td></td><td></td><td class="s"> ( $m->[ _s ] ||= { });</td></tr>
+<tr><td class="h"><a name="32"></a>32</td><td></td><td></td><td></td><td></td><td class="s"> my @p = $p;</td></tr>
+<tr><td class="h"><a name="33"></a>33</td><td></td><td></td><td></td><td></td><td class="s"> my @k;</td></tr>
+<tr><td class="h"><a name="34"></a>34</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="35"></a>35</td><td class="c1">9992</td><td class="c3"><span title="Avg 272ns">2.71ms</span></td><td></td><td></td><td class="s"> my $k = shift;</td></tr>
+<tr><td class="h"><a name="36"></a>36</td><td></td><td></td><td></td><td></td><td class="s"> my $q = ref $k && ($f & _REF) && overload::Method($k, '""') ? overload::StrVal($k) : $k;</td></tr>
+<tr><td class="h"><a name="37"></a>37</td><td class="c3">3747</td><td class="c3"><span title="Avg 527ns">1.98ms</span></td><td></td><td></td><td class="s"> if (@_) {</td></tr>
+<tr><td class="h"><a name="38"></a>38</td><td></td><td></td><td></td><td></td><td class="s"> $p = $p->{ $q } ||= {};</td></tr>
+<tr><td class="h"><a name="39"></a>39</td><td></td><td></td><td></td><td></td><td class="s"> return unless $p;</td></tr>
+<tr><td class="h"><a name="40"></a>40</td><td></td><td></td><td></td><td></td><td class="s"> push @p, $p;</td></tr>
+<tr><td class="h"><a name="41"></a>41</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="42"></a>42</td><td></td><td></td><td></td><td></td><td class="s"> push @k, $q;</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"> return (\@p, \@k);</td></tr>
+<tr><td class="h"><a name="45"></a>45</td><td></td><td></td><td></td><td></td><td class="s">}</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"><div class="calls"><div class="calls_in"># spent 15.2ms (11.0+4.24) within Graph::AdjacencyMap::Heavy::__set_path_node which was called 1249 times, avg 12µs/call:
+# 1249 times (11.0ms+4.24ms) by Graph::AdjacencyMap::Heavy::set_path at <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#70">line 70</a>, avg 12µs/call</div></div>sub __set_path_node {</td></tr>
+<tr><td class="h"><a name="48"></a>48</td><td class="c3">4996</td><td class="c3"><span title="Avg 404ns">2.02ms</span></td><td></td><td></td><td class="s"> my ($m, $p, $l) = splice @_, 0, 3;</td></tr>
+<tr><td class="h"><a name="49"></a>49</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ] ;</td></tr>
+<tr><td class="h"><a name="50"></a>50</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="51"></a>51</td><td class="c3">3747</td><td class="c0"><span title="Avg 2µs">7.72ms</span></td><td></td><td></td><td class="s"> unless (exists $p->[-1]->{ $l }) {</td></tr>
+<tr><td class="h"><a name="52"></a>52</td><td></td><td></td><td class="c0">1249</td><td class="c0">4.24ms</td><td class="s"> my $i = $m->_new_node( \$p->[-1]->{ $l }, $id );<div class="calls"><div class="calls_out"> # spent 4.24ms making 1249 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#77">Graph::AdjacencyMap::_new_node</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="53"></a>53</td><td></td><td></td><td></td><td></td><td class="s"> $m->[ _i ]->{ defined $i ? $i : "" } = [ @_ ];</td></tr>
+<tr><td class="h"><a name="54"></a>54</td><td></td><td></td><td></td><td></td><td class="s"> return defined $id ? ($id eq _GEN_ID ? $$id : $id) : $i;</td></tr>
+<tr><td class="h"><a name="55"></a>55</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="56"></a>56</td><td></td><td></td><td></td><td></td><td class="s"> return $m->_inc_node( \$p->[-1]->{ $l }, $id );</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></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="59"></a>59</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="60"></a>60</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 38.4ms (10.8+27.5) within Graph::AdjacencyMap::Heavy::set_path which was called 1249 times, avg 31µs/call:
+# 1249 times (10.8ms+27.5ms) by Graph::add_edge at <a href="Graph-pm-695-block.html#504">line 504 of Graph.pm</a>, avg 31µs/call</div></div>sub set_path {</td></tr>
+<tr><td class="h"><a name="61"></a>61</td><td class="c1">8743</td><td class="c0"><span title="Avg 956ns">8.36ms</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="62"></a>62</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="63"></a>63</td><td></td><td></td><td class="c3">59</td><td class="c3">62µs</td><td class="s"> if (@_ > 1 && ($f & _UNORDUNIQ)) {<div class="calls"><div class="calls_out"> # spent 62µs making 59 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#Graph__AdjacencyMap__Heavy__CORE_sort">Graph::AdjacencyMap::Heavy::CORE:sort</a>, avg 1µs/call</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"> if (($f & _UNORDUNIQ) == _UNORD && @_ == 2) { @_ = sort @_ }</td></tr>
+<tr><td class="h"><a name="65"></a>65</td><td></td><td></td><td></td><td></td><td class="s"> else { $m->__arg(\@_) }</td></tr>
+<tr><td class="h"><a name="66"></a>66</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="67"></a>67</td><td></td><td></td><td class="c0">1249</td><td class="c0">12.3ms</td><td class="s"> my ($p, $k) = $m->__set_path( @_ );<div class="calls"><div class="calls_out"> # spent 12.3ms making 1249 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#19">Graph::AdjacencyMap::Heavy::__set_path</a>, avg 10µs/call</div></div></td></tr>
+<tr><td class="h"><a name="68"></a>68</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="69"></a>69</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="70"></a>70</td><td></td><td></td><td class="c0">1249</td><td class="c0">15.2ms</td><td class="s"> return $m->__set_path_node( $p, $l, @_ );<div class="calls"><div class="calls_out"> # spent 15.2ms making 1249 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#47">Graph::AdjacencyMap::Heavy::__set_path_node</a>, avg 12µs/call</div></div></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"></td></tr>
+<tr><td class="h"><a name="73"></a>73</td><td></td><td></td><td></td><td></td><td class="s">sub __has_path {</td></tr>
+<tr><td class="h"><a name="74"></a>74</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="75"></a>75</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="76"></a>76</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ != $m->[ _a ] && !($f & _HYPER)) {</td></tr>
+<tr><td class="h"><a name="77"></a>77</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="78"></a>78</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess(sprintf "Graph::AdjacencyMap::Heavy: arguments %d expected %d",</td></tr>
+<tr><td class="h"><a name="79"></a>79</td><td></td><td></td><td></td><td></td><td class="s"> scalar @_, $m->[ _a ]);</td></tr>
+<tr><td class="h"><a name="80"></a>80</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"> if (@_ > 1 && ($f & _UNORDUNIQ)) {</td></tr>
+<tr><td class="h"><a name="82"></a>82</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _UNORDUNIQ) == _UNORD && @_ == 2) { @_ = sort @_ }</td></tr>
+<tr><td class="h"><a name="83"></a>83</td><td></td><td></td><td></td><td></td><td class="s"> else { $m->__arg(\@_) }</td></tr>
+<tr><td class="h"><a name="84"></a>84</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="85"></a>85</td><td></td><td></td><td></td><td></td><td class="s"> my $p = $m->[ _s ];</td></tr>
+<tr><td class="h"><a name="86"></a>86</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p;</td></tr>
+<tr><td class="h"><a name="87"></a>87</td><td></td><td></td><td></td><td></td><td class="s"> $p = $p->[ @_ ] if ($f & _HYPER);</td></tr>
+<tr><td class="h"><a name="88"></a>88</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p;</td></tr>
+<tr><td class="h"><a name="89"></a>89</td><td></td><td></td><td></td><td></td><td class="s"> my @p = $p;</td></tr>
+<tr><td class="h"><a name="90"></a>90</td><td></td><td></td><td></td><td></td><td class="s"> my @k;</td></tr>
+<tr><td class="h"><a name="91"></a>91</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="92"></a>92</td><td></td><td></td><td></td><td></td><td class="s"> my $k = shift;</td></tr>
+<tr><td class="h"><a name="93"></a>93</td><td></td><td></td><td></td><td></td><td class="s"> my $q = ref $k && ($f & _REF) && overload::Method($k, '""') ? overload::StrVal($k) : $k;</td></tr>
+<tr><td class="h"><a name="94"></a>94</td><td></td><td></td><td></td><td></td><td class="s"> if (@_) {</td></tr>
+<tr><td class="h"><a name="95"></a>95</td><td></td><td></td><td></td><td></td><td class="s"> $p = $p->{ $q };</td></tr>
+<tr><td class="h"><a name="96"></a>96</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p;</td></tr>
+<tr><td class="h"><a name="97"></a>97</td><td></td><td></td><td></td><td></td><td class="s"> push @p, $p;</td></tr>
+<tr><td class="h"><a name="98"></a>98</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="99"></a>99</td><td></td><td></td><td></td><td></td><td class="s"> push @k, $q;</td></tr>
+<tr><td class="h"><a name="100"></a>100</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="101"></a>101</td><td></td><td></td><td></td><td></td><td class="s"> return (\@p, \@k);</td></tr>
+<tr><td class="h"><a name="102"></a>102</td><td></td><td></td><td></td><td></td><td class="s">}</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">sub has_path {</td></tr>
+<tr><td class="h"><a name="105"></a>105</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="106"></a>106</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="107"></a>107</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ > 1 && ($f & _UNORDUNIQ)) {</td></tr>
+<tr><td class="h"><a name="108"></a>108</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _UNORDUNIQ) == _UNORD && @_ == 2) { @_ = sort @_ }</td></tr>
+<tr><td class="h"><a name="109"></a>109</td><td></td><td></td><td></td><td></td><td class="s"> else { $m->__arg(\@_) }</td></tr>
+<tr><td class="h"><a name="110"></a>110</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="111"></a>111</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="112"></a>112</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="113"></a>113</td><td></td><td></td><td></td><td></td><td class="s"> return exists $p->[-1]->{ defined $k->[-1] ? $k->[-1] : "" };</td></tr>
+<tr><td class="h"><a name="114"></a>114</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="115"></a>115</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="116"></a>116</td><td></td><td></td><td></td><td></td><td class="s">sub has_path_by_multi_id {</td></tr>
+<tr><td class="h"><a name="117"></a>117</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="118"></a>118</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="119"></a>119</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="120"></a>120</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ > 1 && ($f & _UNORDUNIQ)) {</td></tr>
+<tr><td class="h"><a name="121"></a>121</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _UNORDUNIQ) == _UNORD && @_ == 2) { @_ = sort @_ }</td></tr>
+<tr><td class="h"><a name="122"></a>122</td><td></td><td></td><td></td><td></td><td class="s"> else { $m->__arg(\@_) }</td></tr>
+<tr><td class="h"><a name="123"></a>123</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="124"></a>124</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="125"></a>125</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="126"></a>126</td><td></td><td></td><td></td><td></td><td class="s"> return exists $n->[ _nm ]->{ $id };</td></tr>
+<tr><td class="h"><a name="127"></a>127</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="128"></a>128</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="129"></a>129</td><td></td><td></td><td></td><td></td><td class="s">sub _get_path_node {</td></tr>
+<tr><td class="h"><a name="130"></a>130</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="131"></a>131</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="132"></a>132</td><td></td><td></td><td></td><td></td><td class="s"> if ($m->[ _a ] == 2 && @_ == 2 && !($f & (_HYPER|_REF|_UNIQ))) { # Fast path.</td></tr>
+<tr><td class="h"><a name="133"></a>133</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="134"></a>134</td><td></td><td></td><td></td><td></td><td class="s"> return unless exists $m->[ _s ]->{ $_[0] };</td></tr>
+<tr><td class="h"><a name="135"></a>135</td><td></td><td></td><td></td><td></td><td class="s"> my $p = [ $m->[ _s ], $m->[ _s ]->{ $_[0] } ];</td></tr>
+<tr><td class="h"><a name="136"></a>136</td><td></td><td></td><td></td><td></td><td class="s"> my $k = [ $_[0], $_[1] ];</td></tr>
+<tr><td class="h"><a name="137"></a>137</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $_[1];</td></tr>
+<tr><td class="h"><a name="138"></a>138</td><td></td><td></td><td></td><td></td><td class="s"> return ( exists $p->[-1]->{ $l }, $p->[-1]->{ $l }, $p, $k, $l );</td></tr>
+<tr><td class="h"><a name="139"></a>139</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="140"></a>140</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ > 1 && ($f & _UNORDUNIQ)) {</td></tr>
+<tr><td class="h"><a name="141"></a>141</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _UNORDUNIQ) == _UNORD && @_ == 2) { @_ = sort @_ }</td></tr>
+<tr><td class="h"><a name="142"></a>142</td><td></td><td></td><td></td><td></td><td class="s"> else { $m->__arg(\@_) }</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"> $m->__get_path_node( @_ );</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">}</td></tr>
+<tr><td class="h"><a name="147"></a>147</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="148"></a>148</td><td></td><td></td><td></td><td></td><td class="s">sub _get_path_id {</td></tr>
+<tr><td class="h"><a name="149"></a>149</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="150"></a>150</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="151"></a>151</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n);</td></tr>
+<tr><td class="h"><a name="152"></a>152</td><td></td><td></td><td></td><td></td><td class="s"> if ($m->[ _a ] == 2 && @_ == 2 && !($f & (_HYPER|_REF|_UNIQ))) { # Fast path.</td></tr>
+<tr><td class="h"><a name="153"></a>153</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="154"></a>154</td><td></td><td></td><td></td><td></td><td class="s"> return unless exists $m->[ _s ]->{ $_[0] };</td></tr>
+<tr><td class="h"><a name="155"></a>155</td><td></td><td></td><td></td><td></td><td class="s"> my $p = $m->[ _s ]->{ $_[0] };</td></tr>
+<tr><td class="h"><a name="156"></a>156</td><td></td><td></td><td></td><td></td><td class="s"> $e = exists $p->{ $_[1] };</td></tr>
+<tr><td class="h"><a name="157"></a>157</td><td></td><td></td><td></td><td></td><td class="s"> $n = $p->{ $_[1] };</td></tr>
+<tr><td class="h"><a name="158"></a>158</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="159"></a>159</td><td></td><td></td><td></td><td></td><td class="s"> ($e, $n) = $m->_get_path_node( @_ );</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"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="162"></a>162</td><td></td><td></td><td></td><td></td><td class="s"> return ref $n ? $n->[ _ni ] : $n;</td></tr>
+<tr><td class="h"><a name="163"></a>163</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="164"></a>164</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="165"></a>165</td><td></td><td></td><td></td><td></td><td class="s">sub _get_path_count {</td></tr>
+<tr><td class="h"><a name="166"></a>166</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="167"></a>167</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="168"></a>168</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->_get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="169"></a>169</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e && defined $n;</td></tr>
+<tr><td class="h"><a name="170"></a>170</td><td></td><td></td><td></td><td></td><td class="s"> return</td></tr>
+<tr><td class="h"><a name="171"></a>171</td><td></td><td></td><td></td><td></td><td class="s"> ($f & _COUNT) ? $n->[ _nc ] :</td></tr>
+<tr><td class="h"><a name="172"></a>172</td><td></td><td></td><td></td><td></td><td class="s"> ($f & _MULTI) ? scalar keys %{ $n->[ _nm ] } : 1;</td></tr>
+<tr><td class="h"><a name="173"></a>173</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="174"></a>174</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="175"></a>175</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 121ms (121+88µs) within Graph::AdjacencyMap::Heavy::__attr which was called 39178 times, avg 3µs/call:
+# 13255 times (41.3ms+31µs) by Graph::AdjacencyMap::_has_path_attr at <a href="Graph-AdjacencyMap-pm-696-block.html#186">line 186 of Graph/AdjacencyMap.pm</a>, avg 3µs/call
+# 13191 times (39.8ms+0s) by Graph::AdjacencyMap::_get_path_attrs at <a href="Graph-AdjacencyMap-pm-696-block.html#235">line 235 of Graph/AdjacencyMap.pm</a>, avg 3µs/call
+# 12662 times (39.2ms+31µs) by Graph::AdjacencyMap::_set_path_attr at <a href="Graph-AdjacencyMap-pm-696-block.html#207">line 207 of Graph/AdjacencyMap.pm</a>, avg 3µs/call
+# 68 times (445µs+25µs) by Graph::AdjacencyMap::_get_path_attr at <a href="Graph-AdjacencyMap-pm-696-block.html#255">line 255 of Graph/AdjacencyMap.pm</a>, avg 7µs/call
+# 2 times (15µs+700ns) by Graph::AdjacencyMap::_set_path_attr at <a href="Graph-AdjacencyMap-Light-pm-700-block.html#238">line 238 of Graph/AdjacencyMap/Light.pm</a>, avg 8µs/call</div></div>sub __attr {</td></tr>
+<tr><td class="h"><a name="176"></a>176</td><td class="c0">78356</td><td class="c0"><span title="Avg 1µs">83.6ms</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="177"></a>177</td><td class="c0">39178</td><td class="c0"><span title="Avg 430ns">16.8ms</span></td><td></td><td></td><td class="s"> if (@_) {</td></tr>
+<tr><td class="h"><a name="178"></a>178</td><td class="c0">117534</td><td class="c0"><span title="Avg 237ns">27.9ms</span></td><td></td><td></td><td class="s"> if (ref $_[0] && @{ $_[0] }) {</td></tr>
+<tr><td class="h"><a name="179"></a>179</td><td></td><td></td><td></td><td></td><td class="s"> if (@{ $_[0] } != $m->[ _a ]) {</td></tr>
+<tr><td class="h"><a name="180"></a>180</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="181"></a>181</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess(sprintf</td></tr>
+<tr><td class="h"><a name="182"></a>182</td><td></td><td></td><td></td><td></td><td class="s"> "Graph::AdjacencyMap::Heavy: arguments %d expected %d\n",</td></tr>
+<tr><td class="h"><a name="183"></a>183</td><td></td><td></td><td></td><td></td><td class="s"> scalar @{ $_[0] }, $m->[ _a ]);</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"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="186"></a>186</td><td></td><td></td><td class="c3">195</td><td class="c3">88µs</td><td class="s"> if (@{ $_[0] } > 1 && ($f & _UNORDUNIQ)) {<div class="calls"><div class="calls_out"> # spent 88µs making 195 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#Graph__AdjacencyMap__Heavy__CORE_sort">Graph::AdjacencyMap::Heavy::CORE:sort</a>, avg 450ns/call</div></div></td></tr>
+<tr><td class="h"><a name="187"></a>187</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _UNORDUNIQ) == _UNORD && @{ $_[0] } == 2) {</td></tr>
+<tr><td class="h"><a name="188"></a>188</td><td></td><td></td><td></td><td></td><td class="s"> @{ $_[0] } = sort @{ $_[0] }</td></tr>
+<tr><td class="h"><a name="189"></a>189</td><td></td><td></td><td></td><td></td><td class="s"> } else { $m->__arg(\@_) }</td></tr>
+<tr><td class="h"><a name="190"></a>190</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="191"></a>191</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="192"></a>192</td><td></td><td></td><td></td><td></td><td class="s"> }</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">sub _get_id_path {</td></tr>
+<tr><td class="h"><a name="196"></a>196</td><td></td><td></td><td></td><td></td><td class="s"> my ($m, $i) = @_;</td></tr>
+<tr><td class="h"><a name="197"></a>197</td><td></td><td></td><td></td><td></td><td class="s"> my $p = defined $i ? $m->[ _i ]->{ $i } : undef;</td></tr>
+<tr><td class="h"><a name="198"></a>198</td><td></td><td></td><td></td><td></td><td class="s"> return defined $p ? @$p : ( );</td></tr>
+<tr><td class="h"><a name="199"></a>199</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="200"></a>200</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="201"></a>201</td><td></td><td></td><td></td><td></td><td class="s">sub del_path {</td></tr>
+<tr><td class="h"><a name="202"></a>202</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="203"></a>203</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="204"></a>204</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ > 1 && ($f & _UNORDUNIQ)) {</td></tr>
+<tr><td class="h"><a name="205"></a>205</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _UNORDUNIQ) == _UNORD && @_ == 2) { @_ = sort @_ }</td></tr>
+<tr><td class="h"><a name="206"></a>206</td><td></td><td></td><td></td><td></td><td class="s"> else { $m->__arg(\@_) }</td></tr>
+<tr><td class="h"><a name="207"></a>207</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="208"></a>208</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n, $p, $k, $l) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="209"></a>209</td><td></td><td></td><td></td><td></td><td class="s"> return unless $e;</td></tr>
+<tr><td class="h"><a name="210"></a>210</td><td></td><td></td><td></td><td></td><td class="s"> my $c = ($f & _COUNT) ? --$n->[ _nc ] : 0;</td></tr>
+<tr><td class="h"><a name="211"></a>211</td><td></td><td></td><td></td><td></td><td class="s"> if ($c == 0) {</td></tr>
+<tr><td class="h"><a name="212"></a>212</td><td></td><td></td><td></td><td></td><td class="s"> delete $m->[ _i ]->{ ref $n ? $n->[ _ni ] : $n };</td></tr>
+<tr><td class="h"><a name="213"></a>213</td><td></td><td></td><td></td><td></td><td class="s"> delete $p->[-1]->{ $l };</td></tr>
+<tr><td class="h"><a name="214"></a>214</td><td></td><td></td><td></td><td></td><td class="s"> while (@$p && @$k && keys %{ $p->[-1]->{ $k->[-1] } } == 0) {</td></tr>
+<tr><td class="h"><a name="215"></a>215</td><td></td><td></td><td></td><td></td><td class="s"> delete $p->[-1]->{ $k->[-1] };</td></tr>
+<tr><td class="h"><a name="216"></a>216</td><td></td><td></td><td></td><td></td><td class="s"> pop @$p;</td></tr>
+<tr><td class="h"><a name="217"></a>217</td><td></td><td></td><td></td><td></td><td class="s"> pop @$k;</td></tr>
+<tr><td class="h"><a name="218"></a>218</td><td></td><td></td><td></td><td></td><td class="s"> }</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"> return 1;</td></tr>
+<tr><td class="h"><a name="221"></a>221</td><td></td><td></td><td></td><td></td><td class="s">}</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">sub del_path_by_multi_id {</td></tr>
+<tr><td class="h"><a name="224"></a>224</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="225"></a>225</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="226"></a>226</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="227"></a>227</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ > 1 && ($f & _UNORDUNIQ)) {</td></tr>
+<tr><td class="h"><a name="228"></a>228</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _UNORDUNIQ) == _UNORD && @_ == 2) { @_ = sort @_ }</td></tr>
+<tr><td class="h"><a name="229"></a>229</td><td></td><td></td><td></td><td></td><td class="s"> else { $m->__arg(\@_) }</td></tr>
+<tr><td class="h"><a name="230"></a>230</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="231"></a>231</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n, $p, $k, $l) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="232"></a>232</td><td></td><td></td><td></td><td></td><td class="s"> return unless $e;</td></tr>
+<tr><td class="h"><a name="233"></a>233</td><td></td><td></td><td></td><td></td><td class="s"> delete $n->[ _nm ]->{ $id };</td></tr>
+<tr><td class="h"><a name="234"></a>234</td><td></td><td></td><td></td><td></td><td class="s"> unless (keys %{ $n->[ _nm ] }) {</td></tr>
+<tr><td class="h"><a name="235"></a>235</td><td></td><td></td><td></td><td></td><td class="s"> delete $m->[ _i ]->{ $n->[ _ni ] };</td></tr>
+<tr><td class="h"><a name="236"></a>236</td><td></td><td></td><td></td><td></td><td class="s"> delete $p->[-1]->{ $l };</td></tr>
+<tr><td class="h"><a name="237"></a>237</td><td></td><td></td><td></td><td></td><td class="s"> while (@$p && @$k && keys %{ $p->[-1]->{ $k->[-1] } } == 0) {</td></tr>
+<tr><td class="h"><a name="238"></a>238</td><td></td><td></td><td></td><td></td><td class="s"> delete $p->[-1]->{ $k->[-1] };</td></tr>
+<tr><td class="h"><a name="239"></a>239</td><td></td><td></td><td></td><td></td><td class="s"> pop @$p;</td></tr>
+<tr><td class="h"><a name="240"></a>240</td><td></td><td></td><td></td><td></td><td class="s"> pop @$k;</td></tr>
+<tr><td class="h"><a name="241"></a>241</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="242"></a>242</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="243"></a>243</td><td></td><td></td><td></td><td></td><td class="s"> return 1;</td></tr>
+<tr><td class="h"><a name="244"></a>244</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="245"></a>245</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="246"></a>246</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 238µs within Graph::AdjacencyMap::Heavy::paths which was called 2 times, avg 119µs/call:
+# 2 times (238µs+0s) by Graph::edges05 at <a href="Graph-pm-695-block.html#557">line 557 of Graph.pm</a>, avg 119µs/call</div></div>sub paths {</td></tr>
+<tr><td class="h"><a name="247"></a>247</td><td class="c3">4</td><td class="c3"><span title="Avg 61µs">245µs</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="248"></a>248</td><td></td><td></td><td></td><td></td><td class="s"> return values %{ $m->[ _i ] } if defined $m->[ _i ];</td></tr>
+<tr><td class="h"><a name="249"></a>249</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ? ( ) : 0;</td></tr>
+<tr><td class="h"><a name="250"></a>250</td><td></td><td></td><td></td><td></td><td class="s">}</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 class="c3">1</td><td class="c3"><span title="Avg 3µs">3µs</span></td><td></td><td></td><td class="s">1;</td></tr>
+<tr><td class="h"><a name="253"></a>253</td><td></td><td></td><td></td><td></td><td class="s">__END__</td></tr>
+<tr><td class="s"><a name=""></a> </td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="Graph__AdjacencyMap__Heavy__CORE_sort"></a></td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 150µs within Graph::AdjacencyMap::Heavy::CORE:sort which was called 254 times, avg 591ns/call:
+# 195 times (88µs+0s) by Graph::AdjacencyMap::Heavy::__attr at <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#186">line 186</a>, avg 450ns/call
+# 59 times (62µs+0s) by Graph::AdjacencyMap::Heavy::set_path at <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#63">line 63</a>, avg 1µs/call</div></div>sub Graph::AdjacencyMap::Heavy::CORE:sort; # opcode<br /> </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