226 lines
41 KiB
XML
226 lines
41 KiB
XML
<?xml version='1.0' encoding='UTF-8' standalone='no'?>
|
|
<doxygen xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="compound.xsd" version="1.8.6">
|
|
<compounddef id="task_2tree_8hpp" kind="file">
|
|
<compoundname>tree.hpp</compoundname>
|
|
<includedby refid="task_8hh" local="no">/usr/include/gecode/int/task.hh</includedby>
|
|
<invincdepgraph>
|
|
<node id="12772">
|
|
<label>/usr/include/gecode/int/task/tree.hpp</label>
|
|
<link refid="task/tree.hpp"/>
|
|
<childnode refid="12773" relation="include">
|
|
</childnode>
|
|
</node>
|
|
<node id="12774">
|
|
<label>/usr/include/gecode/int/cumulative.hh</label>
|
|
<link refid="cumulative_8hh_source"/>
|
|
</node>
|
|
<node id="12775">
|
|
<label>/usr/include/gecode/int/unary.hh</label>
|
|
<link refid="unary_8hh_source"/>
|
|
<childnode refid="12774" relation="include">
|
|
</childnode>
|
|
</node>
|
|
<node id="12773">
|
|
<label>/usr/include/gecode/int/task.hh</label>
|
|
<link refid="task_8hh_source"/>
|
|
<childnode refid="12774" relation="include">
|
|
</childnode>
|
|
<childnode refid="12775" relation="include">
|
|
</childnode>
|
|
</node>
|
|
</invincdepgraph>
|
|
<innernamespace refid="namespaceGecode">Gecode</innernamespace>
|
|
<innernamespace refid="namespaceGecode_1_1Int">Gecode::Int</innernamespace>
|
|
<briefdescription>
|
|
</briefdescription>
|
|
<detaileddescription>
|
|
</detaileddescription>
|
|
<programlisting>
|
|
<codeline lineno="1"><highlight class="comment">/*<sp/>-*-<sp/>mode:<sp/>C++;<sp/>c-basic-offset:<sp/>2;<sp/>indent-tabs-mode:<sp/>nil<sp/>-*-<sp/>*/</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="2"><highlight class="normal"></highlight><highlight class="comment">/*</highlight></codeline>
|
|
<codeline lineno="3"><highlight class="comment"><sp/>*<sp/><sp/>Main<sp/>authors:</highlight></codeline>
|
|
<codeline lineno="4"><highlight class="comment"><sp/>*<sp/><sp/><sp/><sp/><sp/>Christian<sp/>Schulte<sp/><schulte@gecode.org></highlight></codeline>
|
|
<codeline lineno="5"><highlight class="comment"><sp/>*<sp/><sp/><sp/><sp/><sp/>Guido<sp/>Tack<sp/><tack@gecode.org></highlight></codeline>
|
|
<codeline lineno="6"><highlight class="comment"><sp/>*</highlight></codeline>
|
|
<codeline lineno="7"><highlight class="comment"><sp/>*<sp/><sp/>Copyright:</highlight></codeline>
|
|
<codeline lineno="8"><highlight class="comment"><sp/>*<sp/><sp/><sp/><sp/><sp/>Christian<sp/>Schulte,<sp/>2009</highlight></codeline>
|
|
<codeline lineno="9"><highlight class="comment"><sp/>*<sp/><sp/><sp/><sp/><sp/>Guido<sp/>Tack,<sp/>2010</highlight></codeline>
|
|
<codeline lineno="10"><highlight class="comment"><sp/>*</highlight></codeline>
|
|
<codeline lineno="11"><highlight class="comment"><sp/>*<sp/><sp/>Last<sp/>modified:</highlight></codeline>
|
|
<codeline lineno="12"><highlight class="comment"><sp/>*<sp/><sp/><sp/><sp/><sp/>$Date:<sp/>2013-03-11<sp/>06:26:07<sp/>+0100<sp/>(Mon,<sp/>11<sp/>Mar<sp/>2013)<sp/>$<sp/>by<sp/>$Author:<sp/>tack<sp/>$</highlight></codeline>
|
|
<codeline lineno="13"><highlight class="comment"><sp/>*<sp/><sp/><sp/><sp/><sp/>$Revision:<sp/>13487<sp/>$</highlight></codeline>
|
|
<codeline lineno="14"><highlight class="comment"><sp/>*</highlight></codeline>
|
|
<codeline lineno="15"><highlight class="comment"><sp/>*<sp/><sp/>This<sp/>file<sp/>is<sp/>part<sp/>of<sp/>Gecode,<sp/>the<sp/>generic<sp/>constraint</highlight></codeline>
|
|
<codeline lineno="16"><highlight class="comment"><sp/>*<sp/><sp/>development<sp/>environment:</highlight></codeline>
|
|
<codeline lineno="17"><highlight class="comment"><sp/>*<sp/><sp/><sp/><sp/><sp/>http://www.gecode.org</highlight></codeline>
|
|
<codeline lineno="18"><highlight class="comment"><sp/>*</highlight></codeline>
|
|
<codeline lineno="19"><highlight class="comment"><sp/>*<sp/><sp/>Permission<sp/>is<sp/>hereby<sp/>granted,<sp/>free<sp/>of<sp/>charge,<sp/>to<sp/>any<sp/>person<sp/>obtaining</highlight></codeline>
|
|
<codeline lineno="20"><highlight class="comment"><sp/>*<sp/><sp/>a<sp/>copy<sp/>of<sp/>this<sp/>software<sp/>and<sp/>associated<sp/>documentation<sp/>files<sp/>(the</highlight></codeline>
|
|
<codeline lineno="21"><highlight class="comment"><sp/>*<sp/><sp/>"Software"),<sp/>to<sp/>deal<sp/>in<sp/>the<sp/>Software<sp/>without<sp/>restriction,<sp/>including</highlight></codeline>
|
|
<codeline lineno="22"><highlight class="comment"><sp/>*<sp/><sp/>without<sp/>limitation<sp/>the<sp/>rights<sp/>to<sp/>use,<sp/>copy,<sp/>modify,<sp/>merge,<sp/>publish,</highlight></codeline>
|
|
<codeline lineno="23"><highlight class="comment"><sp/>*<sp/><sp/>distribute,<sp/>sublicense,<sp/>and/or<sp/>sell<sp/>copies<sp/>of<sp/>the<sp/>Software,<sp/>and<sp/>to</highlight></codeline>
|
|
<codeline lineno="24"><highlight class="comment"><sp/>*<sp/><sp/>permit<sp/>persons<sp/>to<sp/>whom<sp/>the<sp/>Software<sp/>is<sp/>furnished<sp/>to<sp/>do<sp/>so,<sp/>subject<sp/>to</highlight></codeline>
|
|
<codeline lineno="25"><highlight class="comment"><sp/>*<sp/><sp/>the<sp/>following<sp/>conditions:</highlight></codeline>
|
|
<codeline lineno="26"><highlight class="comment"><sp/>*</highlight></codeline>
|
|
<codeline lineno="27"><highlight class="comment"><sp/>*<sp/><sp/>The<sp/>above<sp/>copyright<sp/>notice<sp/>and<sp/>this<sp/>permission<sp/>notice<sp/>shall<sp/>be</highlight></codeline>
|
|
<codeline lineno="28"><highlight class="comment"><sp/>*<sp/><sp/>included<sp/>in<sp/>all<sp/>copies<sp/>or<sp/>substantial<sp/>portions<sp/>of<sp/>the<sp/>Software.</highlight></codeline>
|
|
<codeline lineno="29"><highlight class="comment"><sp/>*</highlight></codeline>
|
|
<codeline lineno="30"><highlight class="comment"><sp/>*<sp/><sp/>THE<sp/>SOFTWARE<sp/>IS<sp/>PROVIDED<sp/>"AS<sp/>IS",<sp/>WITHOUT<sp/>WARRANTY<sp/>OF<sp/>ANY<sp/>KIND,</highlight></codeline>
|
|
<codeline lineno="31"><highlight class="comment"><sp/>*<sp/><sp/>EXPRESS<sp/>OR<sp/>IMPLIED,<sp/>INCLUDING<sp/>BUT<sp/>NOT<sp/>LIMITED<sp/>TO<sp/>THE<sp/>WARRANTIES<sp/>OF</highlight></codeline>
|
|
<codeline lineno="32"><highlight class="comment"><sp/>*<sp/><sp/>MERCHANTABILITY,<sp/>FITNESS<sp/>FOR<sp/>A<sp/>PARTICULAR<sp/>PURPOSE<sp/>AND</highlight></codeline>
|
|
<codeline lineno="33"><highlight class="comment"><sp/>*<sp/><sp/>NONINFRINGEMENT.<sp/>IN<sp/>NO<sp/>EVENT<sp/>SHALL<sp/>THE<sp/>AUTHORS<sp/>OR<sp/>COPYRIGHT<sp/>HOLDERS<sp/>BE</highlight></codeline>
|
|
<codeline lineno="34"><highlight class="comment"><sp/>*<sp/><sp/>LIABLE<sp/>FOR<sp/>ANY<sp/>CLAIM,<sp/>DAMAGES<sp/>OR<sp/>OTHER<sp/>LIABILITY,<sp/>WHETHER<sp/>IN<sp/>AN<sp/>ACTION</highlight></codeline>
|
|
<codeline lineno="35"><highlight class="comment"><sp/>*<sp/><sp/>OF<sp/>CONTRACT,<sp/>TORT<sp/>OR<sp/>OTHERWISE,<sp/>ARISING<sp/>FROM,<sp/>OUT<sp/>OF<sp/>OR<sp/>IN<sp/>CONNECTION</highlight></codeline>
|
|
<codeline lineno="36"><highlight class="comment"><sp/>*<sp/><sp/>WITH<sp/>THE<sp/>SOFTWARE<sp/>OR<sp/>THE<sp/>USE<sp/>OR<sp/>OTHER<sp/>DEALINGS<sp/>IN<sp/>THE<sp/>SOFTWARE.</highlight></codeline>
|
|
<codeline lineno="37"><highlight class="comment"><sp/>*</highlight></codeline>
|
|
<codeline lineno="38"><highlight class="comment"><sp/>*/</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="39"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="40"><highlight class="normal"></highlight><highlight class="keyword">namespace<sp/></highlight><highlight class="normal">Gecode<sp/>{<sp/></highlight><highlight class="keyword">namespace<sp/></highlight><highlight class="normal">Int<sp/>{</highlight></codeline>
|
|
<codeline lineno="41"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="42"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/></highlight></codeline>
|
|
<codeline lineno="43" refid="namespaceGecode_1_1Int_1a6c8c36ec855e57c1638ce9e531a486bf" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="namespaceGecode_1_1Int_1a6c8c36ec855e57c1638ce9e531a486bf" kindref="member">plus</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>x,<sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>y)<sp/>{</highlight></codeline>
|
|
<codeline lineno="44"><highlight class="normal"><sp/><sp/><sp/><sp/>assert(y<sp/>!=<sp/>-<ref refid="namespaceGecode_1_1Int_1_1Limits_1a5a8edf24fe7e29c7159587b7e7d0260a" kindref="member">Int::Limits::infinity</ref>);</highlight></codeline>
|
|
<codeline lineno="45"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>(x<sp/>==<sp/>-<ref refid="namespaceGecode_1_1Int_1_1Limits_1a5a8edf24fe7e29c7159587b7e7d0260a" kindref="member">Int::Limits::infinity</ref>)<sp/>?<sp/>x<sp/>:<sp/>x+y;</highlight></codeline>
|
|
<codeline lineno="46"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="47"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="48"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">long</highlight><highlight class="normal"><sp/></highlight><highlight class="keywordtype">long</highlight><highlight class="normal"><sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/></highlight></codeline>
|
|
<codeline lineno="49" refid="namespaceGecode_1_1Int_1a6d28b7bde370f2d25a26fa41248bba8f" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="namespaceGecode_1_1Int_1a6c8c36ec855e57c1638ce9e531a486bf" kindref="member">plus</ref>(</highlight><highlight class="keywordtype">long</highlight><highlight class="normal"><sp/></highlight><highlight class="keywordtype">long</highlight><highlight class="normal"><sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>x,<sp/></highlight><highlight class="keywordtype">long</highlight><highlight class="normal"><sp/></highlight><highlight class="keywordtype">long</highlight><highlight class="normal"><sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>y)<sp/>{</highlight></codeline>
|
|
<codeline lineno="50"><highlight class="normal"><sp/><sp/><sp/><sp/>assert(y<sp/>!=<sp/>-<ref refid="namespaceGecode_1_1Int_1_1Limits_1ae5e93636b2a7b2defae6986b2eb85dab" kindref="member">Int::Limits::llinfinity</ref>);</highlight></codeline>
|
|
<codeline lineno="51"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>(x<sp/>==<sp/>-<ref refid="namespaceGecode_1_1Int_1_1Limits_1ae5e93636b2a7b2defae6986b2eb85dab" kindref="member">Int::Limits::llinfinity</ref>)<sp/>?<sp/>x<sp/>:<sp/>x+y;</highlight></codeline>
|
|
<codeline lineno="52"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="53"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="54"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="55"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/></highlight></codeline>
|
|
<codeline lineno="56" refid="classGecode_1_1Int_1_1TaskTree_1ab462844f872a2e3ef78f1f19935828bc" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ab462844f872a2e3ef78f1f19935828bc" kindref="member">TaskTree<TaskView,Node>::n_inner</ref>(</highlight><highlight class="keywordtype">void</highlight><highlight class="normal">)</highlight><highlight class="keyword"><sp/>const<sp/></highlight><highlight class="normal">{</highlight></codeline>
|
|
<codeline lineno="57"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>tasks.size()-1;</highlight></codeline>
|
|
<codeline lineno="58"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="59"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="60"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/></highlight></codeline>
|
|
<codeline lineno="61" refid="classGecode_1_1Int_1_1TaskTree_1ae6d009044ed117d747b162c2c382f5ac" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ae6d009044ed117d747b162c2c382f5ac" kindref="member">TaskTree<TaskView,Node>::n_nodes</ref>(</highlight><highlight class="keywordtype">void</highlight><highlight class="normal">)</highlight><highlight class="keyword"><sp/>const<sp/></highlight><highlight class="normal">{</highlight></codeline>
|
|
<codeline lineno="62"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>2*tasks.size()<sp/>-<sp/>1;</highlight></codeline>
|
|
<codeline lineno="63"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="64"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="65"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="66"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">bool</highlight><highlight class="normal"><sp/></highlight></codeline>
|
|
<codeline lineno="67" refid="classGecode_1_1Int_1_1TaskTree_1a53b4a92e7008ccebc5fe6743850ebce3" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a53b4a92e7008ccebc5fe6743850ebce3" kindref="member">TaskTree<TaskView,Node>::n_root</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)<sp/>{</highlight></codeline>
|
|
<codeline lineno="68"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>i<sp/>==<sp/>0;</highlight></codeline>
|
|
<codeline lineno="69"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="70"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="71"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">bool</highlight><highlight class="normal"><sp/></highlight></codeline>
|
|
<codeline lineno="72" refid="classGecode_1_1Int_1_1TaskTree_1a48ca346b6fb17041f6071f19918551d3" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a48ca346b6fb17041f6071f19918551d3" kindref="member">TaskTree<TaskView,Node>::n_leaf</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)</highlight><highlight class="keyword"><sp/>const<sp/></highlight><highlight class="normal">{</highlight></codeline>
|
|
<codeline lineno="73"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>i<sp/>>=<sp/>n_inner();</highlight></codeline>
|
|
<codeline lineno="74"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="75"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="76"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/></highlight></codeline>
|
|
<codeline lineno="77" refid="classGecode_1_1Int_1_1TaskTree_1a042af8749ab881f8177a7dd6bb652493" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a042af8749ab881f8177a7dd6bb652493" kindref="member">TaskTree<TaskView,Node>::n_left</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)<sp/>{</highlight></codeline>
|
|
<codeline lineno="78"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>2*(i+1)<sp/>-<sp/>1;</highlight></codeline>
|
|
<codeline lineno="79"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="80"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="81"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">bool</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="82" refid="classGecode_1_1Int_1_1TaskTree_1ac1e2d7451276c8c66cb0f878245322a8" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ac1e2d7451276c8c66cb0f878245322a8" kindref="member">TaskTree<TaskView,Node>::left</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)<sp/>{</highlight></codeline>
|
|
<codeline lineno="83"><highlight class="normal"><sp/><sp/><sp/><sp/>assert(!n_root(i));</highlight></codeline>
|
|
<codeline lineno="84"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>A<sp/>left<sp/>node<sp/>has<sp/>an<sp/>odd<sp/>number</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="85"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>(i<sp/>&<sp/>1)<sp/>!=<sp/>0;</highlight></codeline>
|
|
<codeline lineno="86"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="87"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="88"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="89" refid="classGecode_1_1Int_1_1TaskTree_1a8c5cba14df5398d4afb7bb3e39daa091" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a8c5cba14df5398d4afb7bb3e39daa091" kindref="member">TaskTree<TaskView,Node>::n_right</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)<sp/>{</highlight></codeline>
|
|
<codeline lineno="90"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>2*(i+1);</highlight></codeline>
|
|
<codeline lineno="91"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="92"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="93"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">bool</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="94" refid="classGecode_1_1Int_1_1TaskTree_1a02d1b8bd53d7fe4e96aac12157821e68" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a02d1b8bd53d7fe4e96aac12157821e68" kindref="member">TaskTree<TaskView,Node>::right</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)<sp/>{</highlight></codeline>
|
|
<codeline lineno="95"><highlight class="normal"><sp/><sp/><sp/><sp/>assert(!n_root(i));</highlight></codeline>
|
|
<codeline lineno="96"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>A<sp/>left<sp/>node<sp/>has<sp/>an<sp/>even<sp/>number</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="97"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>(i<sp/>&<sp/>1)<sp/>==<sp/>0;</highlight></codeline>
|
|
<codeline lineno="98"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="99"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="100"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="101" refid="classGecode_1_1Int_1_1TaskTree_1ae9aef5acf922e6023ed343a6067106bc" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ae9aef5acf922e6023ed343a6067106bc" kindref="member">TaskTree<TaskView,Node>::n_parent</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)<sp/>{</highlight></codeline>
|
|
<codeline lineno="102"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>(i+1)/2<sp/>-<sp/>1;</highlight></codeline>
|
|
<codeline lineno="103"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="104"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="105"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="106"><highlight class="normal"><sp/><sp/>forceinline<sp/>Node&</highlight></codeline>
|
|
<codeline lineno="107" refid="classGecode_1_1Int_1_1TaskTree_1aab3d5439983995ce1a163f34acff2da4" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1aab3d5439983995ce1a163f34acff2da4" kindref="member">TaskTree<TaskView,Node>::leaf</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i)<sp/>{</highlight></codeline>
|
|
<codeline lineno="108"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>node[_leaf[i]];</highlight></codeline>
|
|
<codeline lineno="109"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="110"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="111"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="112"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/>Node&</highlight></codeline>
|
|
<codeline lineno="113" refid="classGecode_1_1Int_1_1TaskTree_1a130379d0eb9b561fd8c2ecd34a1e6e85" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a130379d0eb9b561fd8c2ecd34a1e6e85" kindref="member">TaskTree<TaskView,Node>::root</ref>(</highlight><highlight class="keywordtype">void</highlight><highlight class="normal">)</highlight><highlight class="keyword"><sp/>const<sp/></highlight><highlight class="normal">{</highlight></codeline>
|
|
<codeline lineno="114"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>node[0];</highlight></codeline>
|
|
<codeline lineno="115"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="116"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="117"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="118"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="119" refid="classGecode_1_1Int_1_1TaskTree_1ac3c4f8d8062e3f4184e0dc0f8e3f0780" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ac3c4f8d8062e3f4184e0dc0f8e3f0780" kindref="member">TaskTree<TaskView,Node>::init</ref>(</highlight><highlight class="keywordtype">void</highlight><highlight class="normal">)<sp/>{</highlight></codeline>
|
|
<codeline lineno="120"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">for</highlight><highlight class="normal"><sp/>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i=n_inner();<sp/>i--;<sp/>)</highlight></codeline>
|
|
<codeline lineno="121"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>node[i].init(node[n_left(i)],node[n_right(i)]);</highlight></codeline>
|
|
<codeline lineno="122"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="123"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="124"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="125"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="126" refid="classGecode_1_1Int_1_1TaskTree_1ae19f603654fbcfb07f639fc1b235872f" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ae19f603654fbcfb07f639fc1b235872f" kindref="member">TaskTree<TaskView,Node>::update</ref>(</highlight><highlight class="keywordtype">void</highlight><highlight class="normal">)<sp/>{</highlight></codeline>
|
|
<codeline lineno="127"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">for</highlight><highlight class="normal"><sp/>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i=n_inner();<sp/>i--;<sp/>)</highlight></codeline>
|
|
<codeline lineno="128"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>node[i].update(node[n_left(i)],node[n_right(i)]);</highlight></codeline>
|
|
<codeline lineno="129"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="130"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="131"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="132"><highlight class="normal"><sp/><sp/>forceinline<sp/></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="133" refid="classGecode_1_1Int_1_1TaskTree_1abfa208a7d67585ae6556caf8831de6e4" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ae19f603654fbcfb07f639fc1b235872f" kindref="member">TaskTree<TaskView,Node>::update</ref>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i,<sp/></highlight><highlight class="keywordtype">bool</highlight><highlight class="normal"><sp/>l)<sp/>{</highlight></codeline>
|
|
<codeline lineno="134"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">if</highlight><highlight class="normal"><sp/>(l)</highlight></codeline>
|
|
<codeline lineno="135"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>i<sp/>=<sp/>_leaf[i];</highlight></codeline>
|
|
<codeline lineno="136"><highlight class="normal"><sp/><sp/><sp/><sp/>assert(!n_root(i));</highlight></codeline>
|
|
<codeline lineno="137"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">do</highlight><highlight class="normal"><sp/>{</highlight></codeline>
|
|
<codeline lineno="138"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>i<sp/>=<sp/>n_parent(i);</highlight></codeline>
|
|
<codeline lineno="139"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>node[i].update(node[n_left(i)],node[n_right(i)]);</highlight></codeline>
|
|
<codeline lineno="140"><highlight class="normal"><sp/><sp/><sp/><sp/>}<sp/></highlight><highlight class="keywordflow">while</highlight><highlight class="normal"><sp/>(!n_root(i));</highlight></codeline>
|
|
<codeline lineno="141"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="142"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="143"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node></highlight></codeline>
|
|
<codeline lineno="144"><highlight class="normal"><sp/><sp/>forceinline</highlight></codeline>
|
|
<codeline lineno="145" refid="classGecode_1_1Int_1_1TaskTree_1ac9f29e170e81a1b0eab3cfff1c49c69a" refkind="member"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree" kindref="compound">TaskTree<TaskView,Node>::TaskTree</ref>(<ref refid="classGecode_1_1Region" kindref="compound">Region</ref>&<sp/>r,<sp/></highlight></codeline>
|
|
<codeline lineno="146"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/></highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="classGecode_1_1Int_1_1TaskViewArray" kindref="compound">TaskViewArray<TaskView></ref>&<sp/>t)</highlight></codeline>
|
|
<codeline lineno="147"><highlight class="normal"><sp/><sp/><sp/><sp/>:<sp/>tasks(t),<sp/></highlight></codeline>
|
|
<codeline lineno="148"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>node(r.alloc<Node>(n_nodes())),</highlight></codeline>
|
|
<codeline lineno="149"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>_leaf(r.alloc<int>(tasks.<ref refid="group__FuncIterRangesOp_1ga9f9ab6d72452ad86b95cd65abf463161" kindref="member">size</ref>()))<sp/>{</highlight></codeline>
|
|
<codeline lineno="150"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>Compute<sp/>a<sp/>sorting<sp/>map<sp/>to<sp/>order<sp/>by<sp/>non<sp/>decreasing<sp/>est</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="151"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal">*<sp/>map<sp/>=<sp/>r.<ref refid="classGecode_1_1Region_1a167cff2d16f08d890fff11f80e519233" kindref="member">alloc</ref><</highlight><highlight class="keywordtype">int</highlight><highlight class="normal">>(<ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>.size());</highlight></codeline>
|
|
<codeline lineno="152"><highlight class="normal"><sp/><sp/><sp/><sp/>sort<TaskView,STO_EST,true>(map,<sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>);</highlight></codeline>
|
|
<codeline lineno="153"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>Compute<sp/>inverse<sp/>of<sp/>sorting<sp/>map</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="154"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">for</highlight><highlight class="normal"><sp/>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i=<ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>.size();<sp/>i--;<sp/>)</highlight></codeline>
|
|
<codeline lineno="155"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ad3ffc82407eb8b4c9c0f4edd63ae91f7" kindref="member">_leaf</ref>[map[i]]<sp/>=<sp/>i;</highlight></codeline>
|
|
<codeline lineno="156"><highlight class="normal"><sp/><sp/><sp/><sp/>r.<ref refid="classGecode_1_1Region_1ab6fb7233ea7822b457558d78d808a46c" kindref="member">free</ref><</highlight><highlight class="keywordtype">int</highlight><highlight class="normal">>(map,<ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>.size());</highlight></codeline>
|
|
<codeline lineno="157"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>Compute<sp/>index<sp/>of<sp/>first<sp/>leaf<sp/>in<sp/>tree:<sp/>the<sp/>next<sp/>larger<sp/>power<sp/>of<sp/>two</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="158"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>fst<sp/>=<sp/>1;</highlight></codeline>
|
|
<codeline lineno="159"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">while</highlight><highlight class="normal"><sp/>(fst<sp/><<sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>.size())</highlight></codeline>
|
|
<codeline lineno="160"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>fst<sp/><<=<sp/>1;</highlight></codeline>
|
|
<codeline lineno="161"><highlight class="normal"><sp/><sp/><sp/><sp/>fst--;</highlight></codeline>
|
|
<codeline lineno="162"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>Remap<sp/>task<sp/>indices<sp/>to<sp/>leaf<sp/>indices</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="163"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">for</highlight><highlight class="normal"><sp/>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i=<ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>.size();<sp/>i--;<sp/>)</highlight></codeline>
|
|
<codeline lineno="164"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">if</highlight><highlight class="normal"><sp/>(<ref refid="classGecode_1_1Int_1_1TaskTree_1ad3ffc82407eb8b4c9c0f4edd63ae91f7" kindref="member">_leaf</ref>[i]<sp/>+<sp/>fst<sp/>>=<sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ae6d009044ed117d747b162c2c382f5ac" kindref="member">n_nodes</ref>())</highlight></codeline>
|
|
<codeline lineno="165"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ad3ffc82407eb8b4c9c0f4edd63ae91f7" kindref="member">_leaf</ref>[i]<sp/>+=<sp/>fst<sp/>-<sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>.size();</highlight></codeline>
|
|
<codeline lineno="166"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">else</highlight><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="167"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ad3ffc82407eb8b4c9c0f4edd63ae91f7" kindref="member">_leaf</ref>[i]<sp/>+=<sp/>fst;</highlight></codeline>
|
|
<codeline lineno="168"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="169"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="170"><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>TaskView,<sp/></highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node><sp/></highlight><highlight class="keyword">template</highlight><highlight class="normal"><</highlight><highlight class="keyword">class</highlight><highlight class="normal"><sp/>Node2></highlight></codeline>
|
|
<codeline lineno="171"><highlight class="normal"><sp/><sp/>forceinline</highlight></codeline>
|
|
<codeline lineno="172"><highlight class="normal"><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree" kindref="compound">TaskTree<TaskView,Node>::TaskTree</ref>(<ref refid="classGecode_1_1Region" kindref="compound">Region</ref>&<sp/>r,<sp/></highlight></codeline>
|
|
<codeline lineno="173"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/></highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="classGecode_1_1Int_1_1TaskTree" kindref="compound">TaskTree<TaskView,Node2></ref>&<sp/>t)</highlight></codeline>
|
|
<codeline lineno="174"><highlight class="normal"><sp/><sp/><sp/><sp/>:<sp/>tasks(t.tasks),<sp/></highlight></codeline>
|
|
<codeline lineno="175"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>node(r.alloc<Node>(n_nodes())),</highlight></codeline>
|
|
<codeline lineno="176"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>_leaf(r.alloc<int>(tasks.<ref refid="group__FuncIterRangesOp_1ga9f9ab6d72452ad86b95cd65abf463161" kindref="member">size</ref>()))<sp/>{</highlight></codeline>
|
|
<codeline lineno="177"><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">for</highlight><highlight class="normal"><sp/>(</highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>i=<ref refid="classGecode_1_1Int_1_1TaskTree_1a588d7ff506e04319c9730a20686c5736" kindref="member">tasks</ref>.size();<sp/>i--;<sp/>)</highlight></codeline>
|
|
<codeline lineno="178"><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><ref refid="classGecode_1_1Int_1_1TaskTree_1ad3ffc82407eb8b4c9c0f4edd63ae91f7" kindref="member">_leaf</ref>[i]<sp/>=<sp/>t.<ref refid="classGecode_1_1Int_1_1TaskTree_1ad3ffc82407eb8b4c9c0f4edd63ae91f7" kindref="member">_leaf</ref>[i];</highlight></codeline>
|
|
<codeline lineno="179"><highlight class="normal"><sp/><sp/>}</highlight></codeline>
|
|
<codeline lineno="180"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="181"><highlight class="normal">}}</highlight></codeline>
|
|
<codeline lineno="182"><highlight class="normal"></highlight></codeline>
|
|
<codeline lineno="183"><highlight class="normal"></highlight><highlight class="comment">//<sp/>STATISTICS:<sp/>int-prop</highlight><highlight class="normal"></highlight></codeline>
|
|
</programlisting>
|
|
<location file="/usr/include/gecode/int/task/tree.hpp"/>
|
|
</compounddef>
|
|
</doxygen>
|