vxwlist.html

vxworks相关论文

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine extracts the sublist that starts with <i>pStart</i> and ends
with <i>pEnd</i>.  It returns the extracted list.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
The extracted sublist.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::find"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::find</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::find</i>(&nbsp;)</strong> - find a node in list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>int find
    (
    NODE * pNode
    ) const</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine returns the node number of a specified node (the 
first node is 1).
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
<p>
The node number, or
ERROR if the node is not found.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::first"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::first</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::first</i>(&nbsp;)</strong> - find first node in list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>    NODE * first ()</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine finds the first node in its list.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
A pointer to the first node in the list, or
NULL if the list is empty.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::get"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::get</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::get</i>(&nbsp;)</strong> - delete and return the first node from list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>    NODE * get ()</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine gets the first node from its list, deletes the node
from the list, and returns a pointer to the node gotten.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
A pointer to the node gotten, or
NULL if the list is empty.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::insert"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::insert</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::insert</i>(&nbsp;)</strong> - insert a node in list after a specified node</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>void insert
    (
    NODE * pPrev,
    NODE * pNode
    )</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine inserts a specified node into the list.
The new node is placed following the list node <i>pPrev</i>.
If <i>pPrev</i> is NULL, the node is inserted at the head of the list.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
N/A
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::last"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::last</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::last</i>(&nbsp;)</strong> - find the last node in list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>    NODE * last ()</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine finds the last node in its list.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
A pointer to the last node in the list, or
NULL if the list is empty.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::next"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::next</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::next</i>(&nbsp;)</strong> - find the next node in list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>NODE * next
    (
    NODE * pNode
    ) const</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine locates the node immediately following a specified node.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
<p>
A pointer to the next node in the list, or
NULL if there is no next node.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::nStep"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::nStep</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::nStep</i>(&nbsp;)</strong> - find a list node <i>nStep</i> steps away from a specified node</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>NODE * nStep
    (
    NODE * pNode,
    int    nStep
    ) const</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine locates the node <i>nStep</i> steps away in either direction from 
a specified node.  If <i>nStep</i> is positive, it steps toward the tail.  If
<i>nStep</i> is negative, it steps toward the head.  If the number of steps is
out of range, NULL is returned.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
<p>
A pointer to the node <i>nStep</i> steps away, or
NULL if the node is out of range.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::nth"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::nth</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::nth</i>(&nbsp;)</strong> - find the Nth node in a list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>NODE * nth
    (
    int nodeNum
    ) const</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine returns a pointer to the node specified by a number <i>nodeNum</i>
where the first node in the list is numbered 1.
Note that the search is optimized by searching forward from the beginning
if the node is closer to the head, and searching back from the end
if it is closer to the tail.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
<p>
A pointer to the Nth node, or
NULL if there is no Nth node.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::previous"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::previous</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::previous</i>(&nbsp;)</strong> - find the previous node in list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>NODE * previous
    (
    NODE * pNode
    ) const</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine locates the node immediately preceding the node pointed to 
by <i>pNode</i>.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
<p>
A pointer to the previous node in the list, or
NULL if there is no previous node.
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

<hr>
<a name="VXWList::remove"></a>
<p align=right>
<a href="rtnIndex.html"><i>Wind Foundation Classes :  Methods</i></a></p>

</blockquote><h1><i>VXWList::remove</i>(&nbsp;)</h1> <blockquote></a></blockquote><h4>NAME</h4><blockquote>  
<p><strong><i>VXWList::remove</i>(&nbsp;)</strong> - delete a specified node from list</p>

</blockquote><h4>SYNOPSIS</h4><blockquote><p>
<pre>void remove
    (
    NODE * pNode
    )</pre>

</blockquote><h4>DESCRIPTION</h4><blockquote><p>
This routine deletes a specified node from its list.
<p>
</blockquote><h4>RETURNS</h4><blockquote><p>
N/A
</blockquote><h4>SEE ALSO</h4><blockquote><p>
<b><a href="./VXWList.html#top">VXWList</a></b>

</body>
</html>