Re: the path

WI <[email protected]> Thu, 05 Jun 2008 22:41:59 +0700
Newsgroups gmane.text.xml.xpath.general
Message-ID <[email protected]>
This is a multi-part message in MIME format.
--------------000609050405080504070703
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit


A path is essentially a potential node.

It is a location on a that may or may not actually talk to a node on a 
specific model.

A Path can be converted into either an array of unsigned integers or a 
string. The string form is a list of numbers separated by a colon. Each 
number refers to the offset at that level. The path "0" refers to the 
root node and the path "2:6" refers to the fifth child of the third node.


> Appends a new index to a path.
>
> As a result, the depth of the path is increased.
>
> *Deprecated: 
> <http://www.gtkmm.org/docs/gtkmm-2.4/docs/reference/html/deprecated.html#_deprecated000052>*
>     replaced by push_back()
>     http://www.diet-forum.org/
>     <http://www.gtkmm.org/docs/gtkmm-2.4/docs/reference/html/classGtk_1_1TreePath.html#347cad71a31af29ed6fb775485ef4892>
>
>
> *Parameters:*
>
>     	/index/  	The index.
>


> Return value: |true| if /descendant/ is contained inside /path/.
>
> *Parameters:*
>
>     	/descendant/  	Another Gtk::TreePath
>     <http://www.gtkmm.org/docs/gtkmm-2.4/docs/reference/html/classGtk_1_1TreePath.html>.
>
>
> *Returns:*
>     |true| if /descendant/ is contained inside /path/.
>     http://www.caloriescout.com/
>
Virtual Trees are source-rooted trees in ATM networks in which VCs 
originating at the source but going to different destinations share some 
of the bandwidth pre-allocated to the VT, thus providing an additional 
advantage over Virtual Paths. Non-ATM protocols such as MIL-STD188 -220A 
can also take advantage of Virtual Trees source concatenation provides a 
benefit similar to ATM multiplexing. We describe the results of a 
simulation study which shows Virtual Trees.



--------------000609050405080504070703
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: 8bit

<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
</head>
<body bgcolor="#ffffff" text="#000000">
<br>
A path is essentially a potential node.
<p>It is a location on a that may or may not actually talk to a node on
a specific model.</p>
<p>A Path can be converted into either an array of unsigned integers or
a
string. The string form is a list of numbers separated by a colon. Each
number refers to the offset at that level. The path "0" refers to
the root node and the path "2:6" refers to the fifth child of the third
node.</p>
<br>
<blockquote type="cite">
  <p>Appends a new index to a path. </p>
  <p>As a result, the depth of the path is increased. </p>
  <dl compact="compact">
    <dt><b><a class="el"
 href="http://www.gtkmm.org/docs/gtkmm-2.4/docs/reference/html/deprecated.html#_deprecated000052">Deprecated:</a></b></dt>
    <dd>replaced by <a class="el"
 href="http://www.gtkmm.org/docs/gtkmm-2.4/docs/reference/html/classGtk_1_1TreePath.html#347cad71a31af29ed6fb775485ef4892"
 title="Appends a new index to a path.">push_back()<br>
http://www.diet-forum.org/<br>
      </a> </dd>
  </dl>
  <dl compact="compact">
    <dt><b>Parameters:</b></dt>
    <dd>
      <table border="0" cellpadding="0" cellspacing="2">
        <tbody>
          <tr>
            <td valign="top"><br>
            </td>
            <td valign="top"><em>index</em> </td>
            <td>The index.</td>
          </tr>
        </tbody>
      </table>
    </dd>
  </dl>
</blockquote>
<br>
<br>
<blockquote type="cite">
  <div class="memdoc">
  <p>Return value: <code>true</code> if <em>descendant</em> is
contained inside <em>path</em>. </p>
  <p></p>
  <dl compact="compact">
    <dt><b>Parameters:</b></dt>
    <dd>
      <table border="0" cellpadding="0" cellspacing="2">
        <tbody>
          <tr>
            <td valign="top"><br>
            </td>
            <td valign="top"><em>descendant</em> </td>
            <td>Another <a class="el"
 href="http://www.gtkmm.org/docs/gtkmm-2.4/docs/reference/html/classGtk_1_1TreePath.html"
 title="A path is essentially a potential node.">Gtk::TreePath</a>. </td>
          </tr>
        </tbody>
      </table>
    </dd>
  </dl>
  <dl class="return" compact="compact">
    <dt><b>Returns:</b></dt>
    <dd><code>true</code> if <em>descendant</em> is contained inside <em>path</em>.<br>
<a class="moz-txt-link-freetext" href="http://www.caloriescout.com/">http://www.caloriescout.com/</a><br>
    </dd>
  </dl>
  </div>
</blockquote>
<span class="m">Virtual Trees are source-rooted trees in ATM networks
in which VCs originating at the source but
going to different destinations share some of
the bandwidth pre-allocated to the VT, thus providing
an additional advantage over Virtual
Paths. Non-ATM protocols such as MIL-STD188
-220A can also take advantage of Virtual Trees
source concatenation provides a benefit similar to ATM multiplexing. We
describe the results
of a simulation study which shows Virtual
Trees.<br>
<br>
</span><br>
</body>
</html>

--------------000609050405080504070703--