This file is indexed.

/usr/share/doc/libcwidget-doc/html/documentation/api/subtree_8h_source.html is in libcwidget-doc 0.5.16-3.1ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>cwidget: src/cwidget/widgets/subtree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">cwidget&#160;<span id="projectnumber">0.5.16</span></div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li><a href="dirs.html"><span>Directories</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><a class="el" href="dir_243988d349377286cc7f96103c5b81e1.html">src</a>      </li>
      <li class="navelem"><a class="el" href="dir_9f12a1d6ca44d84f8b067f6d6a3d0a3c.html">cwidget</a>      </li>
      <li class="navelem"><a class="el" href="dir_432a773280520c90f7ab83227d95a74c.html">widgets</a>      </li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">subtree.h</div>  </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// subtree.h  (this is -*-c++-*-)</span>
<a name="l00002"></a>00002 <span class="comment">//</span>
<a name="l00003"></a>00003 <span class="comment">//  Copyright 1999-2003, 2005 Daniel Burrows</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">//  This program is free software; you can redistribute it and/or modify</span>
<a name="l00006"></a>00006 <span class="comment">//  it under the terms of the GNU General Public License as published by</span>
<a name="l00007"></a>00007 <span class="comment">//  the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00008"></a>00008 <span class="comment">//  (at your option) any later version.</span>
<a name="l00009"></a>00009 <span class="comment">//</span>
<a name="l00010"></a>00010 <span class="comment">//  This program is distributed in the hope that it will be useful,</span>
<a name="l00011"></a>00011 <span class="comment">//  but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00012"></a>00012 <span class="comment">//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00013"></a>00013 <span class="comment">//  GNU General Public License for more details.</span>
<a name="l00014"></a>00014 <span class="comment">//</span>
<a name="l00015"></a>00015 <span class="comment">//  You should have received a copy of the GNU General Public License</span>
<a name="l00016"></a>00016 <span class="comment">//  along with this program; see the file COPYING.  If not, write to</span>
<a name="l00017"></a>00017 <span class="comment">//  the Free Software Foundation, Inc., 59 Temple Place - Suite 330,</span>
<a name="l00018"></a>00018 <span class="comment">//  Boston, MA 02111-1307, USA.</span>
<a name="l00019"></a>00019 <span class="comment">//</span>
<a name="l00020"></a>00020 <span class="comment">//  Subtrees for trees.</span>
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef SUBTREE_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define SUBTREE_H</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span>
<a name="l00025"></a>00025 <span class="preprocessor">#include &lt;list&gt;</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include &quot;treeitem.h&quot;</span>
<a name="l00027"></a>00027 <span class="preprocessor">#include &quot;tree.h&quot;</span>
<a name="l00028"></a>00028 
<a name="l00029"></a>00029 <span class="preprocessor">#include &lt;<a class="code" href="keybindings_8h.html" title="Support for defining and remapping keybindings.">cwidget/config/keybindings.h</a>&gt;</span>
<a name="l00030"></a>00030 
<a name="l00031"></a>00031 <span class="keyword">namespace </span>cwidget
<a name="l00032"></a>00032 {
<a name="l00033"></a>00033   <span class="keyword">namespace </span>widgets
<a name="l00034"></a>00034   {
<a name="l00035"></a>00035     <span class="keyword">template</span>&lt;<span class="keyword">class</span> childtype, <span class="keyword">class</span> default_sorter=tag_sort_policy&gt;
<a name="l00036"></a><a class="code" href="classcwidget_1_1widgets_1_1subtree.html">00036</a>     <span class="keyword">class </span><a class="code" href="classcwidget_1_1widgets_1_1subtree.html">subtree</a>:<span class="keyword">virtual</span> <span class="keyword">public</span> <a class="code" href="classcwidget_1_1widgets_1_1treeitem.html">treeitem</a>
<a name="l00037"></a>00037     <span class="comment">// A tree-item which can contain other tree items.  Still abstract -- the</span>
<a name="l00038"></a>00038     <span class="comment">// display routines have to be filled in, and you may want to add more behavior</span>
<a name="l00039"></a>00039     <span class="comment">// on keypresses -- but we&#39;re getting there :)</span>
<a name="l00040"></a>00040     {
<a name="l00041"></a>00041     <span class="keyword">protected</span>:
<a name="l00042"></a>00042 
<a name="l00043"></a>00043       <span class="keyword">typedef</span> std::list&lt;childtype *&gt; child_list;
<a name="l00044"></a>00044       <span class="keyword">typedef</span> <span class="keyword">typename</span> std::list&lt;childtype *&gt;::iterator child_iterator;
<a name="l00045"></a>00045 
<a name="l00046"></a><a class="code" href="classcwidget_1_1widgets_1_1subtree_1_1levelref.html">00046</a>       <span class="keyword">class </span><a class="code" href="classcwidget_1_1widgets_1_1subtree_1_1levelref.html">levelref</a>:<span class="keyword">public</span> <a class="code" href="classcwidget_1_1widgets_1_1tree__levelref.html">tree_levelref</a>
<a name="l00047"></a>00047       {
<a name="l00048"></a>00048         child_iterator realitem;
<a name="l00049"></a>00049 
<a name="l00050"></a>00050         child_list *parent_list;
<a name="l00051"></a>00051       <span class="keyword">public</span>:
<a name="l00052"></a>00052         <a class="code" href="classcwidget_1_1widgets_1_1subtree_1_1levelref.html">levelref</a>(<span class="keyword">const</span> <a class="code" href="classcwidget_1_1widgets_1_1subtree_1_1levelref.html">levelref</a> &amp;x)
<a name="l00053"></a>00053           :<a class="code" href="classcwidget_1_1widgets_1_1tree__levelref.html">tree_levelref</a>(x), realitem(x.realitem), parent_list(x.parent_list) {}
<a name="l00054"></a>00054         <a class="code" href="classcwidget_1_1widgets_1_1subtree_1_1levelref.html">levelref</a>(<span class="keyword">const</span> child_iterator &amp;_realitem, child_list *_parent_list)
<a name="l00055"></a>00055           :realitem(_realitem), parent_list(_parent_list)
<a name="l00056"></a>00056         {
<a name="l00057"></a>00057         }
<a name="l00058"></a>00058 
<a name="l00059"></a>00059         <a class="code" href="classcwidget_1_1widgets_1_1treeitem.html">treeitem</a> *get_item() {eassert(realitem!=parent_list-&gt;end()); <span class="keywordflow">return</span> *realitem;}
<a name="l00060"></a>00060         <span class="keyword">virtual</span> <span class="keywordtype">void</span> advance_next() {++realitem;}
<a name="l00061"></a>00061         <span class="keyword">virtual</span> <span class="keywordtype">void</span> return_prev() {--realitem;}
<a name="l00062"></a>00062         <span class="keywordtype">bool</span> is_begin() {<span class="keywordflow">return</span> realitem==parent_list-&gt;begin();}
<a name="l00063"></a>00063         <span class="keywordtype">bool</span> is_end() {<span class="keywordflow">return</span> realitem==parent_list-&gt;end();}
<a name="l00064"></a>00064         <a class="code" href="classcwidget_1_1widgets_1_1subtree_1_1levelref.html">levelref</a> *clone()<span class="keyword"> const </span>{<span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="classcwidget_1_1widgets_1_1subtree_1_1levelref.html">levelref</a>(*<span class="keyword">this</span>);}
<a name="l00065"></a>00065       };
<a name="l00066"></a>00066 
<a name="l00067"></a>00067     <span class="keyword">private</span>:
<a name="l00068"></a>00068       <span class="keywordtype">bool</span> expanded;
<a name="l00069"></a>00069 
<a name="l00070"></a>00070       child_list children;
<a name="l00071"></a>00071 
<a name="l00072"></a>00072     <span class="keyword">protected</span>:
<a name="l00073"></a>00073       child_iterator get_children_begin() {<span class="keywordflow">return</span> children.begin();}
<a name="l00074"></a>00074       child_iterator get_children_end() {<span class="keywordflow">return</span> children.end();}
<a name="l00075"></a>00075 
<a name="l00076"></a>00076     <span class="keyword">public</span>:
<a name="l00077"></a>00077       <span class="keyword">typedef</span> <a class="code" href="classcwidget_1_1widgets_1_1treeiterator.html">treeiterator</a> iterator;
<a name="l00078"></a>00078       <span class="keyword">typedef</span> default_sorter default_sort;
<a name="l00079"></a>00079 
<a name="l00080"></a>00080       <a class="code" href="classcwidget_1_1widgets_1_1subtree.html">subtree</a>(<span class="keywordtype">bool</span> _expanded):<a class="code" href="classcwidget_1_1widgets_1_1treeitem.html">treeitem</a>(),expanded(_expanded) {}
<a name="l00081"></a>00081 
<a name="l00082"></a>00082       <span class="keywordtype">bool</span> get_expanded() {<span class="keywordflow">return</span> expanded;}
<a name="l00083"></a>00083 
<a name="l00084"></a>00084       <span class="keywordtype">void</span> expand() {expanded=<span class="keyword">true</span>;}
<a name="l00085"></a>00085 
<a name="l00086"></a>00086       <span class="keywordtype">void</span> expand_all()
<a name="l00087"></a>00087       {
<a name="l00088"></a>00088         expanded=<span class="keyword">true</span>;
<a name="l00089"></a>00089         <span class="keywordflow">for</span>(child_iterator i=children.begin(); i!=children.end(); i++)
<a name="l00090"></a>00090           (*i)-&gt;expand_all();
<a name="l00091"></a>00091       }
<a name="l00092"></a>00092 
<a name="l00093"></a>00093       <span class="keywordtype">void</span> collapse_all()
<a name="l00094"></a>00094       {
<a name="l00095"></a>00095         expanded=<span class="keyword">false</span>;
<a name="l00096"></a>00096         <span class="keywordflow">for</span>(child_iterator i=children.begin(); i!=children.end(); i++)
<a name="l00097"></a>00097           (*i)-&gt;collapse_all();
<a name="l00098"></a>00098       }
<a name="l00099"></a>00099 
<a name="l00100"></a><a class="code" href="classcwidget_1_1widgets_1_1subtree.html#a8ba8a174bd7dc1be91a33bd86eb86e3b">00100</a>       <span class="keywordtype">void</span> <a class="code" href="classcwidget_1_1widgets_1_1subtree.html#a8ba8a174bd7dc1be91a33bd86eb86e3b" title="Display the given text as the label of this item at the given shifted depth.">paint</a>(<a class="code" href="classcwidget_1_1widgets_1_1tree.html">tree</a> *win, <span class="keywordtype">int</span> y, <span class="keywordtype">bool</span> hierarchical,
<a name="l00101"></a>00101                  <span class="keyword">const</span> std::wstring &amp;str, <span class="keywordtype">int</span> depth_shift=2)
<a name="l00102"></a>00102       {
<a name="l00103"></a>00103         <span class="keywordtype">int</span> width, height;
<a name="l00104"></a>00104         <span class="keywordtype">int</span> basex=hierarchical?depth_shift*get_depth():0;
<a name="l00105"></a>00105         win-&gt;getmaxyx(height,width);
<a name="l00106"></a>00106 
<a name="l00107"></a>00107         win-&gt;move(y,0);
<a name="l00108"></a>00108 
<a name="l00109"></a>00109         <span class="keywordtype">int</span> x=0;
<a name="l00110"></a>00110         <span class="keywordflow">while</span>(x&lt;basex &amp;&amp; x&lt;width)
<a name="l00111"></a>00111           {
<a name="l00112"></a>00112             win-&gt;add_wch(L<span class="charliteral">&#39; &#39;</span>);
<a name="l00113"></a>00113             x+=wcwidth(L<span class="charliteral">&#39; &#39;</span>);
<a name="l00114"></a>00114           }
<a name="l00115"></a>00115 
<a name="l00116"></a>00116         <span class="keywordflow">if</span>(basex&gt;width)
<a name="l00117"></a>00117           <span class="keywordflow">return</span>;
<a name="l00118"></a>00118 
<a name="l00119"></a>00119         <span class="keyword">const</span> <span class="keywordtype">wchar_t</span> *ws;
<a name="l00120"></a>00120         <span class="keywordflow">if</span>(hierarchical)
<a name="l00121"></a>00121           ws=get_expanded()?L<span class="stringliteral">&quot;--\\ &quot;</span>:L<span class="stringliteral">&quot;--- &quot;</span>;
<a name="l00122"></a>00122         <span class="keywordflow">else</span>
<a name="l00123"></a>00123           ws=L<span class="stringliteral">&quot;-&gt; &quot;</span>;
<a name="l00124"></a>00124 
<a name="l00125"></a>00125         <span class="keywordflow">while</span>(*ws!=0 &amp;&amp; x&lt;width)
<a name="l00126"></a>00126           {
<a name="l00127"></a>00127             win-&gt;add_wch(*ws);
<a name="l00128"></a>00128             x+=wcwidth(*ws);
<a name="l00129"></a>00129             ++ws;
<a name="l00130"></a>00130           }
<a name="l00131"></a>00131 
<a name="l00132"></a>00132         <span class="keywordflow">if</span>(x&gt;=width)
<a name="l00133"></a>00133           <span class="keywordflow">return</span>;
<a name="l00134"></a>00134 
<a name="l00135"></a>00135         <span class="keywordtype">size_t</span> i=0;
<a name="l00136"></a>00136         <span class="keywordflow">while</span>(i&lt;str.size() &amp;&amp; x&lt;width)
<a name="l00137"></a>00137           {
<a name="l00138"></a>00138             <span class="keywordtype">wchar_t</span> ch=str[i];
<a name="l00139"></a>00139 
<a name="l00140"></a>00140             win-&gt;add_wch(ch);
<a name="l00141"></a>00141             x+=wcwidth(ch);
<a name="l00142"></a>00142             ++i;
<a name="l00143"></a>00143           }
<a name="l00144"></a>00144 
<a name="l00145"></a>00145         <span class="keywordflow">while</span>(x&lt;width)
<a name="l00146"></a>00146           {
<a name="l00147"></a>00147             win-&gt;add_wch(L<span class="charliteral">&#39; &#39;</span>);
<a name="l00148"></a>00148             x+=wcwidth(L<span class="charliteral">&#39; &#39;</span>);
<a name="l00149"></a>00149           }
<a name="l00150"></a>00150       }
<a name="l00151"></a>00151 
<a name="l00152"></a>00152       <span class="keywordtype">void</span> set_depth(<span class="keywordtype">int</span> _depth)
<a name="l00153"></a>00153       {
<a name="l00154"></a>00154         <span class="keywordflow">for</span>(child_iterator i=children.begin(); i!=children.end(); i++)
<a name="l00155"></a>00155           (*i)-&gt;set_depth(_depth+1);
<a name="l00156"></a>00156 
<a name="l00157"></a>00157         treeitem::set_depth(_depth);
<a name="l00158"></a>00158       }
<a name="l00159"></a>00159 
<a name="l00160"></a>00160       <span class="keywordtype">void</span> add_child(childtype *newchild)
<a name="l00161"></a>00161       {
<a name="l00162"></a>00162         newchild-&gt;set_depth(get_depth()+1);
<a name="l00163"></a>00163 
<a name="l00164"></a>00164         children.push_back(newchild);
<a name="l00165"></a>00165       }
<a name="l00166"></a>00166 
<a name="l00167"></a>00167       <span class="comment">// Adds a new child item at an unspecified location -- you should call sort()</span>
<a name="l00168"></a>00168       <span class="comment">// after adding children or the tree will have an undetermined order.  (yes,</span>
<a name="l00169"></a>00169       <span class="comment">// you can deduce the real order.  Don&#39;t.)</span>
<a name="l00170"></a>00170       <span class="keywordtype">void</span> sort(sortpolicy &amp;sort_method)
<a name="l00171"></a>00171       {
<a name="l00172"></a>00172         <span class="keywordflow">for</span>(child_iterator i=children.begin(); i!=children.end(); i++)
<a name="l00173"></a>00173           (*i)-&gt;sort(sort_method);
<a name="l00174"></a>00174 
<a name="l00175"></a>00175         children.sort(sortpolicy_wrapper(sort_method));
<a name="l00176"></a>00176       }
<a name="l00177"></a>00177 
<a name="l00178"></a>00178       <span class="keywordtype">void</span> sort()
<a name="l00179"></a>00179       {
<a name="l00180"></a>00180         default_sort sorter;
<a name="l00181"></a>00181         sort(sorter);
<a name="l00182"></a>00182       }
<a name="l00183"></a>00183 
<a name="l00184"></a>00184       <span class="keyword">virtual</span> <span class="keywordtype">bool</span> dispatch_key(<span class="keyword">const</span> config::key &amp;k, tree *owner)
<a name="l00185"></a>00185       {
<a name="l00186"></a>00186         <span class="keywordflow">if</span>(tree::bindings-&gt;key_matches(k, <span class="stringliteral">&quot;ToggleExpanded&quot;</span>))
<a name="l00187"></a>00187           {
<a name="l00188"></a>00188             expanded=!expanded;
<a name="l00189"></a>00189             <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00190"></a>00190           }
<a name="l00191"></a>00191         <span class="keywordflow">else</span> <span class="keywordflow">if</span>(tree::bindings-&gt;key_matches(k, <span class="stringliteral">&quot;ExpandTree&quot;</span>))
<a name="l00192"></a>00192           {
<a name="l00193"></a>00193             <span class="keywordflow">if</span>(!expanded)
<a name="l00194"></a>00194               {
<a name="l00195"></a>00195                 expanded=<span class="keyword">true</span>;
<a name="l00196"></a>00196                 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00197"></a>00197               }
<a name="l00198"></a>00198             <span class="keywordflow">else</span>
<a name="l00199"></a>00199               <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00200"></a>00200           }
<a name="l00201"></a>00201         <span class="keywordflow">else</span> <span class="keywordflow">if</span>(tree::bindings-&gt;key_matches(k, <span class="stringliteral">&quot;CollapseTree&quot;</span>))
<a name="l00202"></a>00202           {
<a name="l00203"></a>00203             <span class="keywordflow">if</span>(expanded)
<a name="l00204"></a>00204               {
<a name="l00205"></a>00205                 expanded=<span class="keyword">false</span>;
<a name="l00206"></a>00206                 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00207"></a>00207               } <span class="keywordflow">else</span>
<a name="l00208"></a>00208               <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00209"></a>00209           }
<a name="l00210"></a>00210         <span class="keywordflow">else</span> <span class="keywordflow">if</span>(tree::bindings-&gt;key_matches(k, <span class="stringliteral">&quot;ExpandAll&quot;</span>))
<a name="l00211"></a>00211           {
<a name="l00212"></a>00212             expand_all();
<a name="l00213"></a>00213             <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00214"></a>00214           }
<a name="l00215"></a>00215         <span class="keywordflow">else</span> <span class="keywordflow">if</span>(tree::bindings-&gt;key_matches(k, <span class="stringliteral">&quot;CollapseAll&quot;</span>))
<a name="l00216"></a>00216           {
<a name="l00217"></a>00217             collapse_all();
<a name="l00218"></a>00218             <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00219"></a>00219           }
<a name="l00220"></a>00220         <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00221"></a>00221       }
<a name="l00222"></a>00222       <span class="comment">// The default action is to expand or shrink the tree when Enter is pressed.</span>
<a name="l00223"></a>00223       <span class="comment">// FIXME: should I use &#39;+&#39; and &#39;-&#39; here?  That would appear to conflict with</span>
<a name="l00224"></a>00224       <span class="comment">// the other keybindings I need.  Hm.</span>
<a name="l00225"></a>00225 
<a name="l00226"></a>00226       <span class="keyword">virtual</span> <span class="keywordtype">void</span> dispatch_mouse(<span class="keywordtype">short</span> <span class="keywordtype">id</span>, <span class="keywordtype">int</span> x, mmask_t bstate, tree *owner)
<a name="l00227"></a>00227       {
<a name="l00228"></a>00228         <span class="keywordflow">if</span>(bstate &amp; (BUTTON1_DOUBLE_CLICKED | BUTTON2_DOUBLE_CLICKED |
<a name="l00229"></a>00229                      BUTTON3_DOUBLE_CLICKED | BUTTON4_DOUBLE_CLICKED |
<a name="l00230"></a>00230                      BUTTON1_TRIPLE_CLICKED | BUTTON2_TRIPLE_CLICKED |
<a name="l00231"></a>00231                      BUTTON3_TRIPLE_CLICKED | BUTTON4_TRIPLE_CLICKED))
<a name="l00232"></a>00232           expanded=!expanded;
<a name="l00233"></a>00233       }
<a name="l00234"></a>00234 
<a name="l00235"></a>00235       <span class="keyword">virtual</span> levelref *begin() {<span class="keywordflow">return</span> <span class="keyword">new</span> levelref(children.begin(), &amp;children);}
<a name="l00236"></a>00236       <span class="keyword">virtual</span> levelref *end() {<span class="keywordflow">return</span> <span class="keyword">new</span> levelref(children.end(), &amp;children);}
<a name="l00237"></a>00237 
<a name="l00238"></a>00238       <span class="keywordtype">bool</span> has_visible_children() {<span class="keywordflow">return</span> expanded &amp;&amp; children.size()&gt;0;}
<a name="l00239"></a>00239       <span class="keywordtype">bool</span> has_children() {<span class="keywordflow">return</span> children.size()&gt;0;}
<a name="l00240"></a>00240 
<a name="l00241"></a>00241       <span class="keyword">virtual</span> ~subtree()
<a name="l00242"></a>00242       {
<a name="l00243"></a>00243         child_iterator i,j;
<a name="l00244"></a>00244         <span class="keywordflow">for</span>(i=children.begin(); i!=children.end(); i=j)
<a name="l00245"></a>00245           {
<a name="l00246"></a>00246             j=i;
<a name="l00247"></a>00247             j++;
<a name="l00248"></a>00248             <span class="keyword">delete</span> *i;
<a name="l00249"></a>00249           }
<a name="l00250"></a>00250       }
<a name="l00251"></a>00251     };
<a name="l00252"></a>00252 
<a name="l00253"></a><a class="code" href="classcwidget_1_1widgets_1_1subtree__generic.html">00253</a>     <span class="keyword">class </span><a class="code" href="classcwidget_1_1widgets_1_1subtree__generic.html">subtree_generic</a>:<span class="keyword">public</span> <a class="code" href="classcwidget_1_1widgets_1_1subtree.html">subtree</a>&lt;treeitem&gt;
<a name="l00254"></a>00254     {
<a name="l00255"></a>00255     <span class="keyword">public</span>:
<a name="l00256"></a>00256       <a class="code" href="classcwidget_1_1widgets_1_1subtree__generic.html">subtree_generic</a>(<span class="keywordtype">int</span> _expanded):<a class="code" href="classcwidget_1_1widgets_1_1subtree.html">subtree&lt;treeitem&gt;</a>(_expanded) {}
<a name="l00257"></a>00257     };
<a name="l00258"></a>00258   }
<a name="l00259"></a>00259 }
<a name="l00260"></a>00260 
<a name="l00261"></a>00261 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Fri Jun 17 2011 07:49:38 for cwidget by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>