Main Page   Modules   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members  

SoFullPath Class Reference

The SoFullPath class allows examination of hidden children in paths. More...

#include <Inventor/SoFullPath.h>

Inheritance diagram for SoFullPath::

SoPath SoBase List of all members.

Public Methods

void pop (void)
SoNodegetTail (void) const
SoNodegetNodeFromTail (const int index) const
int getIndexFromTail (const int index) const
int getLength (void) const

Detailed Description

The SoFullPath class allows examination of hidden children in paths.

SoPath allows only access from the head node to the first node with hidden children, but not any further.

Since the SoFullPath is derived from SoPath and contains no private data, you can cast SoPath instances to the SoFullPath type. This will allow you to examine hidden children.


Member Function Documentation

void SoFullPath::pop void [inline]
 

This method overrides SoPath::pop() to allow clients to get at all the nodes in the path.

Reimplemented from SoPath.

SoNode * SoFullPath::getTail void const
 

This method overrides SoPath::getTail() to allow clients to get the tail node, counting internal path nodes.

Reimplemented from SoPath.

SoNode * SoFullPath::getNodeFromTail const int index const
 

This method overrides SoPath::getNodeFromTail() to allow clients to get the node positioned index nodes from the tail, counting internal path nodes.

Reimplemented from SoPath.

int SoFullPath::getIndexFromTail const int index const
 

This method overrides SoPath::getIndexFromTail() to allow clients to get the child index number for nodes based on their position from the tail, counting hidden nodes.

Reimplemented from SoPath.

int SoFullPath::getLength void const
 

This method returns the length of the path, counting hidden nodes also.

Reimplemented from SoPath.


The documentation for this class was generated from the following files:
Generated at Tue Mar 5 03:31:25 2002 for Coin by doxygen1.2.9 written by Dimitri van Heesch, © 1997-2001