<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>VTK: vtkTreeFieldAggregator Class Reference</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="classes.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="classes.html"><span>Alphabetical List</span></a></li>
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
</div>
<div class="contents">
<h1>vtkTreeFieldAggregator Class Reference</h1><!-- doxytag: class="vtkTreeFieldAggregator" --><!-- doxytag: inherits="vtkTreeAlgorithm" --><code>#include <<a class="el" href="a04868.html">vtkTreeFieldAggregator.h</a>></code>
<p>
<div class="dynheader">
Inheritance diagram for vtkTreeFieldAggregator:</div>
<div class="dynsection">
<p><center><img src="a15366.png" border="0" usemap="#a15367" alt="Inheritance graph"></center>
<map name="a15367">
<area shape="rect" href="a01742.html" title="Superclass for algorithms that produce only Tree as output." alt="" coords="25,229,151,256"><area shape="rect" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK." alt="" coords="39,155,137,181"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="48,80,128,107"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="33,5,143,32"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for vtkTreeFieldAggregator:</div>
<div class="dynsection">
<p><center><img src="a15368.png" border="0" usemap="#a15369" alt="Collaboration graph"></center>
<map name="a15369">
<area shape="rect" href="a01742.html" title="Superclass for algorithms that produce only Tree as output." alt="" coords="188,499,313,525"><area shape="rect" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK." alt="" coords="281,381,380,408"><area shape="rect" href="a00472.html" title="Superclass for all pipeline executives in VTK." alt="" coords="477,499,576,525"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="407,173,487,200"><area shape="rect" href="a00895.html" title="Store zero or more vtkInformation instances." alt="" coords="404,264,553,291"><area shape="rect" href="a00872.html" title="Store vtkAlgorithm input/output information." alt="" coords="212,264,321,291"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="164,5,273,32"><area shape="rect" href="a00884.html" title="internal structure for vtkInformation" alt="" coords="5,173,168,200"><area shape="rect" href="a00886.html" title="Superclass for vtkInformation keys." alt="" coords="153,83,284,109"><area shape="rect" href="a01719.html" title="record modification and/or execution time" alt="" coords="308,83,417,109"><area shape="rect" href="a00891.html" title="Key for pointer to pointer." alt="" coords="192,173,373,200"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<p>
<a href="a15370.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2>
aggregate field values from the leaves up the tree
<p>
<a class="el" href="a01746.html" title="aggregate field values from the leaves up the tree">vtkTreeFieldAggregator</a> may be used to assign sizes to all the vertices in the tree, based on the sizes of the leaves. The size of a vertex will equal the sum of the sizes of the child vertices. If you have a data array with values for all leaves, you may specify that array, and the values will be filled in for interior tree vertices. If you do not yet have an array, you may tell the filter to create a new array, assuming that the size of each leaf vertex is 1. You may optionally set a flag to first take the log of all leaf values before aggregating.<p>
<dl class="user" compact><dt><b>Tests:</b></dt><dd><a class="el" href="c2_vtk_t_16.html#c2_vtk_t_vtkTreeFieldAggregator">vtkTreeFieldAggregator (Tests)</a> </dd></dl>
<p>Definition at line <a class="el" href="a04868.html#l00045">45</a> of file <a class="el" href="a04868.html">vtkTreeFieldAggregator.h</a>.</p>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="a01742.html">vtkTreeAlgorithm</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#dcd31b9229f53838426a80060ff26df0">Superclass</a></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#65e7ca795799a4632203f94e56336e76">GetClassName</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#820380cc673501e391c551203fbfa9c9">IsA</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#3865caa119d830dcf928f21c8d419208">PrintSelf</a> (ostream &os, <a class="el" href="a00869.html">vtkIndent</a> indent)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual char * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#423d12e52c1bea058f905a0a8606b6eb">GetField</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#8267d8098084e919bf36612b4de1dc29">SetField</a> (const char *)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual double </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#34c159b9402d518727e62d805eef6665">GetMinValue</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#5103256796a144ed85bb0d7d75aee967">SetMinValue</a> (double)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#fa4ad54a5ce0df0b11363009db77fa7d">SetLeafVertexUnitSize</a> (bool)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#d6480a5f32cea42e4752bac4d483db2d">GetLeafVertexUnitSize</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#81485c968a9d22f9ea1c4bf2aa1f5354">LeafVertexUnitSizeOn</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#b08b412b1d3c2d6dafa0c2b32dc54121">LeafVertexUnitSizeOff</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#3276128b29e6ead2582de60008f95906">SetLogScale</a> (bool)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#e9af0ed086fe9b01704f6421ccbda310">GetLogScale</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#2d7c2eedc6610749e4e6f39166a38d76">LogScaleOn</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#dd663def0d74ed55530a627a9ef62fcf">LogScaleOff</a> ()</td></tr>
<tr><td colspan="2"><br><h2>Static Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a01746.html">vtkTreeFieldAggregator</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#d8abbd8ee54cc5a45cc04f522f935e9c">New</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#24682c9ed87b2494170af643d1cd75e7">IsTypeOf</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a01746.html">vtkTreeFieldAggregator</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#8d52c8ac4b68f8820819ed1f399e6def">SafeDownCast</a> (<a class="el" href="a01084.html">vtkObject</a> *o)</td></tr>
<tr><td colspan="2"><br><h2>Protected Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#a8f0944358991da4137b5315788bae80">vtkTreeFieldAggregator</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#2e3d3020a77d8e198e89e166f04ab979">~vtkTreeFieldAggregator</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a01746.html#16ac56a0a7038f095da5623ed8ae755a">RequestData</a> (<a class="el" href="a00872.html">vtkInformation</a> *, <a class="el" href="a00895.html">vtkInformationVector</a> **, <a class="el" href="a00895.html">vtkInformationVector</a> *)</td></tr>
</table>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="dcd31b9229f53838426a80060ff26df0"></a><!-- doxytag: member="vtkTreeFieldAggregator::Superclass" ref="dcd31b9229f53838426a80060ff26df0" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a01742.html">vtkTreeAlgorithm</a> <a class="el" href="a01742.html">vtkTreeFieldAggregator::Superclass</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01742.html#32ee1ca1008ec7fbc7455e3d64defd63">vtkTreeAlgorithm</a>.</p>
<p>Definition at line <a class="el" href="a04868.html#l00050">50</a> of file <a class="el" href="a04868.html">vtkTreeFieldAggregator.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="a8f0944358991da4137b5315788bae80"></a><!-- doxytag: member="vtkTreeFieldAggregator::vtkTreeFieldAggregator" ref="a8f0944358991da4137b5315788bae80" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkTreeFieldAggregator::vtkTreeFieldAggregator </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="2e3d3020a77d8e198e89e166f04ab979"></a><!-- doxytag: member="vtkTreeFieldAggregator::~vtkTreeFieldAggregator" ref="2e3d3020a77d8e198e89e166f04ab979" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkTreeFieldAggregator::~vtkTreeFieldAggregator </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="d8abbd8ee54cc5a45cc04f522f935e9c"></a><!-- doxytag: member="vtkTreeFieldAggregator::New" ref="d8abbd8ee54cc5a45cc04f522f935e9c" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a01746.html">vtkTreeFieldAggregator</a>* vtkTreeFieldAggregator::New </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
<p>Reimplemented from <a class="el" href="a01742.html#4624ea23784cb86f58f319f6e459c3bf">vtkTreeAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="65e7ca795799a4632203f94e56336e76"></a><!-- doxytag: member="vtkTreeFieldAggregator::GetClassName" ref="65e7ca795799a4632203f94e56336e76" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual const char* vtkTreeFieldAggregator::GetClassName </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01742.html#21a2cc71c3296e4d173e1682087ee806">vtkTreeAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="24682c9ed87b2494170af643d1cd75e7"></a><!-- doxytag: member="vtkTreeFieldAggregator::IsTypeOf" ref="24682c9ed87b2494170af643d1cd75e7" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static int vtkTreeFieldAggregator::IsTypeOf </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a01742.html#1e8c11ef997dd86dcab65a5c424a4ded">vtkTreeAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="820380cc673501e391c551203fbfa9c9"></a><!-- doxytag: member="vtkTreeFieldAggregator::IsA" ref="820380cc673501e391c551203fbfa9c9" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkTreeFieldAggregator::IsA </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a01742.html#29f60e0ce151b9906ffae775bba7963b">vtkTreeAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="8d52c8ac4b68f8820819ed1f399e6def"></a><!-- doxytag: member="vtkTreeFieldAggregator::SafeDownCast" ref="8d52c8ac4b68f8820819ed1f399e6def" args="(vtkObject *o)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a01746.html">vtkTreeFieldAggregator</a>* vtkTreeFieldAggregator::SafeDownCast </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01084.html">vtkObject</a> * </td>
<td class="paramname"> <em>o</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01742.html#654d0f1da4ac96c7f26ac2a969945030">vtkTreeAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="3865caa119d830dcf928f21c8d419208"></a><!-- doxytag: member="vtkTreeFieldAggregator::PrintSelf" ref="3865caa119d830dcf928f21c8d419208" args="(ostream &os, vtkIndent indent)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkTreeFieldAggregator::PrintSelf </td>
<td>(</td>
<td class="paramtype">ostream & </td>
<td class="paramname"> <em>os</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00869.html">vtkIndent</a> </td>
<td class="paramname"> <em>indent</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use <a class="el" href="a01085.html#edadf6378465fd81c2592ef64262e2a5">Print()</a> instead) but used in the hierarchical print process to combine the output of several classes.
<p>Reimplemented from <a class="el" href="a01742.html#f7e04adecd30eae5b0e2282f0b376e15">vtkTreeAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="423d12e52c1bea058f905a0a8606b6eb"></a><!-- doxytag: member="vtkTreeFieldAggregator::GetField" ref="423d12e52c1bea058f905a0a8606b6eb" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual char* vtkTreeFieldAggregator::GetField </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The field to aggregate. If this is a string array, the entries are converted to double. TODO: Remove this field and use the ArrayToProcess in <a class="el" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK.">vtkAlgorithm</a>.
</div>
</div><p>
<a class="anchor" name="8267d8098084e919bf36612b4de1dc29"></a><!-- doxytag: member="vtkTreeFieldAggregator::SetField" ref="8267d8098084e919bf36612b4de1dc29" args="(const char *)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::SetField </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The field to aggregate. If this is a string array, the entries are converted to double. TODO: Remove this field and use the ArrayToProcess in <a class="el" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK.">vtkAlgorithm</a>.
</div>
</div><p>
<a class="anchor" name="34c159b9402d518727e62d805eef6665"></a><!-- doxytag: member="vtkTreeFieldAggregator::GetMinValue" ref="34c159b9402d518727e62d805eef6665" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual double vtkTreeFieldAggregator::GetMinValue </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If the value of the vertex is less than MinValue then consider it's value to be minVal.
</div>
</div><p>
<a class="anchor" name="5103256796a144ed85bb0d7d75aee967"></a><!-- doxytag: member="vtkTreeFieldAggregator::SetMinValue" ref="5103256796a144ed85bb0d7d75aee967" args="(double)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::SetMinValue </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If the value of the vertex is less than MinValue then consider it's value to be minVal.
</div>
</div><p>
<a class="anchor" name="fa4ad54a5ce0df0b11363009db77fa7d"></a><!-- doxytag: member="vtkTreeFieldAggregator::SetLeafVertexUnitSize" ref="fa4ad54a5ce0df0b11363009db77fa7d" args="(bool)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::SetLeafVertexUnitSize </td>
<td>(</td>
<td class="paramtype">bool </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the algorithm will assume a size of 1 for each leaf vertex.
</div>
</div><p>
<a class="anchor" name="d6480a5f32cea42e4752bac4d483db2d"></a><!-- doxytag: member="vtkTreeFieldAggregator::GetLeafVertexUnitSize" ref="d6480a5f32cea42e4752bac4d483db2d" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkTreeFieldAggregator::GetLeafVertexUnitSize </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the algorithm will assume a size of 1 for each leaf vertex.
</div>
</div><p>
<a class="anchor" name="81485c968a9d22f9ea1c4bf2aa1f5354"></a><!-- doxytag: member="vtkTreeFieldAggregator::LeafVertexUnitSizeOn" ref="81485c968a9d22f9ea1c4bf2aa1f5354" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::LeafVertexUnitSizeOn </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the algorithm will assume a size of 1 for each leaf vertex.
</div>
</div><p>
<a class="anchor" name="b08b412b1d3c2d6dafa0c2b32dc54121"></a><!-- doxytag: member="vtkTreeFieldAggregator::LeafVertexUnitSizeOff" ref="b08b412b1d3c2d6dafa0c2b32dc54121" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::LeafVertexUnitSizeOff </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the algorithm will assume a size of 1 for each leaf vertex.
</div>
</div><p>
<a class="anchor" name="3276128b29e6ead2582de60008f95906"></a><!-- doxytag: member="vtkTreeFieldAggregator::SetLogScale" ref="3276128b29e6ead2582de60008f95906" args="(bool)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::SetLogScale </td>
<td>(</td>
<td class="paramtype">bool </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the leaf values in the tree will be logarithmically scaled (base 10).
</div>
</div><p>
<a class="anchor" name="e9af0ed086fe9b01704f6421ccbda310"></a><!-- doxytag: member="vtkTreeFieldAggregator::GetLogScale" ref="e9af0ed086fe9b01704f6421ccbda310" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkTreeFieldAggregator::GetLogScale </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the leaf values in the tree will be logarithmically scaled (base 10).
</div>
</div><p>
<a class="anchor" name="2d7c2eedc6610749e4e6f39166a38d76"></a><!-- doxytag: member="vtkTreeFieldAggregator::LogScaleOn" ref="2d7c2eedc6610749e4e6f39166a38d76" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::LogScaleOn </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the leaf values in the tree will be logarithmically scaled (base 10).
</div>
</div><p>
<a class="anchor" name="dd663def0d74ed55530a627a9ef62fcf"></a><!-- doxytag: member="vtkTreeFieldAggregator::LogScaleOff" ref="dd663def0d74ed55530a627a9ef62fcf" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkTreeFieldAggregator::LogScaleOff </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If set, the leaf values in the tree will be logarithmically scaled (base 10).
</div>
</div><p>
<a class="anchor" name="16ac56a0a7038f095da5623ed8ae755a"></a><!-- doxytag: member="vtkTreeFieldAggregator::RequestData" ref="16ac56a0a7038f095da5623ed8ae755a" args="(vtkInformation *, vtkInformationVector **, vtkInformationVector *)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int vtkTreeFieldAggregator::RequestData </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00872.html">vtkInformation</a> * </td>
<td class="paramname"> <em>request</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00895.html">vtkInformationVector</a> ** </td>
<td class="paramname"> <em>inputVector</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00895.html">vtkInformationVector</a> * </td>
<td class="paramname"> <em>outputVector</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
This is called by the superclass. This is the method you should override.
<p>Reimplemented from <a class="el" href="a01742.html#bb22ffb916ced6eb4a0db98615bb8444">vtkTreeAlgorithm</a>.</p>
</div>
</div><p>
<hr>The documentation for this class was generated from the following file:<ul>
<li>dox/Infovis/<a class="el" href="a04868.html">vtkTreeFieldAggregator.h</a></ul>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Jun 3 19:41:13 2009 for VTK by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
60f1dc962abad0f3b492991a4fbef9be
>
files
>
1749
