updated doc

Documentation/html/classalgo_1_1NStage-members.html

@@ -94,7 +94,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
 
 <p>This is the complete list of members for <a class="el" href="classalgo_1_1NStage.html">algo::NStage</a>, including all inherited members.</p>
 <table class="directory">
-  <tr class="even"><td class="entry"><a class="el" href="classalgo_1_1NStage.html#a65baad453fa371f18be02fd19e695ea1">NStage</a>(std::vector&lt; size_t &gt; max_frame_skip, std::vector&lt; double &gt; penalty_value, std::vector&lt; size_t &gt; max_tracklet_count, double edge_weight_threshold, std::unordered_map&lt; std::string, double &gt; constraints)</td><td class="entry"><a class="el" href="classalgo_1_1NStage.html">algo::NStage</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classalgo_1_1NStage.html#a3fd89ae32d8723b4fcd650be280a9c7c">NStage</a>(std::vector&lt; size_t &gt; max_frame_skip, std::vector&lt; double &gt; penalty_value, std::vector&lt; size_t &gt; max_tracklet_count, double edge_weight_threshold, std::vector&lt; std::unordered_map&lt; std::string, double &gt;&gt; constraints)</td><td class="entry"><a class="el" href="classalgo_1_1NStage.html">algo::NStage</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="classalgo_1_1NStage.html#a8c25c9c9796db048bb4b55d7a603b00b">Run</a>(core::DetectionSequence &amp;sequence, std::vector&lt; core::TrackletPtr &gt; &amp;tracks)</td><td class="entry"><a class="el" href="classalgo_1_1NStage.html">algo::NStage</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 <!-- start footer part -->

Documentation/html/classalgo_1_1NStage.html

@@ -99,15 +99,15 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a65baad453fa371f18be02fd19e695ea1"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classalgo_1_1NStage.html#a65baad453fa371f18be02fd19e695ea1">NStage</a> (std::vector&lt; size_t &gt; max_frame_skip, std::vector&lt; double &gt; penalty_value, std::vector&lt; size_t &gt; max_tracklet_count, double edge_weight_threshold, std::unordered_map&lt; std::string, double &gt; constraints)</td></tr>
-<tr class="separator:a65baad453fa371f18be02fd19e695ea1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a3fd89ae32d8723b4fcd650be280a9c7c"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classalgo_1_1NStage.html#a3fd89ae32d8723b4fcd650be280a9c7c">NStage</a> (std::vector&lt; size_t &gt; max_frame_skip, std::vector&lt; double &gt; penalty_value, std::vector&lt; size_t &gt; max_tracklet_count, double edge_weight_threshold, std::vector&lt; std::unordered_map&lt; std::string, double &gt;&gt; constraints)</td></tr>
+<tr class="separator:a3fd89ae32d8723b4fcd650be280a9c7c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8c25c9c9796db048bb4b55d7a603b00b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classalgo_1_1NStage.html#a8c25c9c9796db048bb4b55d7a603b00b">Run</a> (<a class="el" href="classcore_1_1DetectionSequence.html">core::DetectionSequence</a> &amp;sequence, std::vector&lt; core::TrackletPtr &gt; &amp;tracks)</td></tr>
 <tr class="separator:a8c25c9c9796db048bb4b55d7a603b00b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the two-staged graph-based multi-object tracker. Extended to allow N stages. </p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
-<a class="anchor" id="a65baad453fa371f18be02fd19e695ea1"></a>
+<a class="anchor" id="a3fd89ae32d8723b4fcd650be280a9c7c"></a>
 <div class="memitem">
 <div class="memproto">
       <table class="memname">
@@ -138,7 +138,7 @@ Public Member Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">std::unordered_map&lt; std::string, double &gt;&#160;</td>
+          <td class="paramtype">std::vector&lt; std::unordered_map&lt; std::string, double &gt;&gt;&#160;</td>
           <td class="paramname"><em>constraints</em>&#160;</td>
         </tr>
         <tr>

Documentation/html/functions.html

@@ -350,7 +350,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
 : <a class="el" href="classutil_1_1Filter2D.html#a242138102e2e30f4fe9cccf76f817e09">util::Filter2D</a>
 </li>
 <li>NStage()
-: <a class="el" href="classalgo_1_1NStage.html#a65baad453fa371f18be02fd19e695ea1">algo::NStage</a>
+: <a class="el" href="classalgo_1_1NStage.html#a3fd89ae32d8723b4fcd650be280a9c7c">algo::NStage</a>
 </li>
 </ul>
 

Documentation/html/functions_func.html

@@ -350,7 +350,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
 : <a class="el" href="classutil_1_1Filter2D.html#a242138102e2e30f4fe9cccf76f817e09">util::Filter2D</a>
 </li>
 <li>NStage()
-: <a class="el" href="classalgo_1_1NStage.html#a65baad453fa371f18be02fd19e695ea1">algo::NStage</a>
+: <a class="el" href="classalgo_1_1NStage.html#a3fd89ae32d8723b4fcd650be280a9c7c">algo::NStage</a>
 </li>
 </ul>
 

Documentation/html/search/all_b.js

@@ -1,6 +1,6 @@
 var searchData=
 [
   ['normalize',['Normalize',['../classutil_1_1Filter2D.html#a242138102e2e30f4fe9cccf76f817e09',1,'util::Filter2D']]],
-  ['nstage',['NStage',['../classalgo_1_1NStage.html#a65baad453fa371f18be02fd19e695ea1',1,'algo::NStage']]],
+  ['nstage',['NStage',['../classalgo_1_1NStage.html#a3fd89ae32d8723b4fcd650be280a9c7c',1,'algo::NStage']]],
   ['nstage',['NStage',['../classalgo_1_1NStage.html',1,'algo']]]
 ];

Documentation/html/search/functions_a.js

@@ -1,5 +1,5 @@
 var searchData=
 [
   ['normalize',['Normalize',['../classutil_1_1Filter2D.html#a242138102e2e30f4fe9cccf76f817e09',1,'util::Filter2D']]],
-  ['nstage',['NStage',['../classalgo_1_1NStage.html#a65baad453fa371f18be02fd19e695ea1',1,'algo::NStage']]]
+  ['nstage',['NStage',['../classalgo_1_1NStage.html#a3fd89ae32d8723b4fcd650be280a9c7c',1,'algo::NStage']]]
 ];

Documentation/latex/classalgo_1_1NStage.tex

@@ -7,7 +7,7 @@
 \subsection*{Public Member Functions}
 \begin{DoxyCompactItemize}
 \item 
-\hyperlink{classalgo_1_1NStage_a65baad453fa371f18be02fd19e695ea1}{N\+Stage} (std\+::vector$<$ size\+\_\+t $>$ max\+\_\+frame\+\_\+skip, std\+::vector$<$ double $>$ penalty\+\_\+value, std\+::vector$<$ size\+\_\+t $>$ max\+\_\+tracklet\+\_\+count, double edge\+\_\+weight\+\_\+threshold, std\+::unordered\+\_\+map$<$ std\+::string, double $>$ constraints)
+\hyperlink{classalgo_1_1NStage_a3fd89ae32d8723b4fcd650be280a9c7c}{N\+Stage} (std\+::vector$<$ size\+\_\+t $>$ max\+\_\+frame\+\_\+skip, std\+::vector$<$ double $>$ penalty\+\_\+value, std\+::vector$<$ size\+\_\+t $>$ max\+\_\+tracklet\+\_\+count, double edge\+\_\+weight\+\_\+threshold, std\+::vector$<$ std\+::unordered\+\_\+map$<$ std\+::string, double $>$$>$ constraints)
 \item 
 void \hyperlink{classalgo_1_1NStage_a8c25c9c9796db048bb4b55d7a603b00b}{Run} (\hyperlink{classcore_1_1DetectionSequence}{core\+::\+Detection\+Sequence} \&sequence, std\+::vector$<$ core\+::\+Tracklet\+Ptr $>$ \&tracks)
 \end{DoxyCompactItemize}
@@ -19,15 +19,15 @@ Implementation of the two-\/staged graph-\/based multi-\/object tracker. Extende
 \subsection{Constructor \& Destructor Documentation}
 \index{algo\+::\+N\+Stage@{algo\+::\+N\+Stage}!N\+Stage@{N\+Stage}}
 \index{N\+Stage@{N\+Stage}!algo\+::\+N\+Stage@{algo\+::\+N\+Stage}}
-\subsubsection[{\texorpdfstring{N\+Stage(std\+::vector$<$ size\+\_\+t $>$ max\+\_\+frame\+\_\+skip, std\+::vector$<$ double $>$ penalty\+\_\+value, std\+::vector$<$ size\+\_\+t $>$ max\+\_\+tracklet\+\_\+count, double edge\+\_\+weight\+\_\+threshold, std\+::unordered\+\_\+map$<$ std\+::string, double $>$ constraints)}{NStage(std::vector< size\_t > max\_frame\_skip, std::vector< double > penalty\_value, std::vector< size\_t > max\_tracklet\_count, double edge\_weight\_threshold, std::unordered\_map< std::string, double > constraints)}}]{\setlength{\rightskip}{0pt plus 5cm}algo\+::\+N\+Stage\+::\+N\+Stage (
+\subsubsection[{\texorpdfstring{N\+Stage(std\+::vector$<$ size\+\_\+t $>$ max\+\_\+frame\+\_\+skip, std\+::vector$<$ double $>$ penalty\+\_\+value, std\+::vector$<$ size\+\_\+t $>$ max\+\_\+tracklet\+\_\+count, double edge\+\_\+weight\+\_\+threshold, std\+::vector$<$ std\+::unordered\+\_\+map$<$ std\+::string, double $>$$>$ constraints)}{NStage(std::vector< size\_t > max\_frame\_skip, std::vector< double > penalty\_value, std::vector< size\_t > max\_tracklet\_count, double edge\_weight\_threshold, std::vector< std::unordered\_map< std::string, double >> constraints)}}]{\setlength{\rightskip}{0pt plus 5cm}algo\+::\+N\+Stage\+::\+N\+Stage (
 \begin{DoxyParamCaption}
 \item[{std\+::vector$<$ size\+\_\+t $>$}]{max\+\_\+frame\+\_\+skip, }
 \item[{std\+::vector$<$ double $>$}]{penalty\+\_\+value, }
 \item[{std\+::vector$<$ size\+\_\+t $>$}]{max\+\_\+tracklet\+\_\+count, }
 \item[{double}]{edge\+\_\+weight\+\_\+threshold, }
-\item[{std\+::unordered\+\_\+map$<$ std\+::string, double $>$}]{constraints}
+\item[{std\+::vector$<$ std\+::unordered\+\_\+map$<$ std\+::string, double $>$$>$}]{constraints}
 \end{DoxyParamCaption}
-)}\hypertarget{classalgo_1_1NStage_a65baad453fa371f18be02fd19e695ea1}{}\label{classalgo_1_1NStage_a65baad453fa371f18be02fd19e695ea1}
+)}\hypertarget{classalgo_1_1NStage_a3fd89ae32d8723b4fcd650be280a9c7c}{}\label{classalgo_1_1NStage_a3fd89ae32d8723b4fcd650be280a9c7c}
 Initializes the algorithm wih the given values. The number of stages is determined by the size of the given vectors.