36 #include <Inventor/misc/SoBase.h> 37 #include <Inventor/lists/SbList.h> 38 #include <Inventor/lists/SoNodeList.h> 42 #include <Inventor/SoLists.h> 43 #endif // !COIN_INTERNAL 58 SoPath(
const int approxlength = 4);
67 void setHead(
SoNode *
const head);
68 SoNode * getHead(
void)
const;
69 void append(
const int childindex);
70 void append(
SoNode *
const node);
71 void append(
const SoPath *
const frompath);
72 void push(
const int childindex);
74 SoNode * getTail(
void)
const;
75 SoNode * getNode(
const int index)
const;
76 SoNode * getNodeFromTail(
const int index)
const;
77 int getIndex(
const int index)
const;
78 int getIndexFromTail(
const int index)
const;
79 int getLength(
void)
const;
80 void truncate(
const int length);
82 int findFork(
const SoPath *
const path)
const;
83 int findNode(
const SoNode *
const node)
const;
85 SbBool containsNode(
const SoNode *
const node)
const;
86 SbBool containsPath(
const SoPath *
const path)
const;
87 SoPath * copy(
const int startfromnodeindex = 0,
int numnodes = 0)
const;
88 friend COIN_DLL_API SbBool operator==(
const SoPath & lhs,
const SoPath & rhs);
89 friend COIN_DLL_API SbBool operator!=(
const SoPath & lhs,
const SoPath & rhs);
94 void insertIndex(
SoNode *
const parent,
const int newindex);
95 void removeIndex(
SoNode *
const parent,
const int oldindex);
96 void replaceIndex(
SoNode *
const parent,
const int index,
98 SbBool isRelevantNotification(
SoNotList *
const l)
const;
104 void auditPath(
const SbBool flag);
107 static void cleanupClass(
void);
108 static void * createInstance(
void);
109 void append(
SoNode *
const node,
const int index);
110 int getFullLength(
void)
const;
111 void truncate(
const int length,
const SbBool donotify);
113 void setFirstHidden(
void);
119 SbBool firsthiddendirty;
120 static SoType classTypeId;
131 SoPath::getFullLength(
void)
const 145 this->
truncate(this->getFullLength() - 1);
151 #ifndef COIN_INTERNAL 153 #include <Inventor/SoFullPath.h> 154 #include <Inventor/misc/SoLightPath.h> 155 #endif // COIN_INTERNAL 157 #endif // !COIN_SOPATH_H The SoBase class is the top-level superclass for a number of class-hierarchies.
Definition: SoBase.h:45
The SoPathList class is a container for pointers to SoPath objects.
Definition: SoPathList.h:40
virtual SoType getTypeId(void) const =0
Returns the type identification of an object derived from a class inheriting SoBase. This is used for run-time type checking and "downward" casting.
void push(const int childindex)
Definition: SoPath.h:137
The SoNodeKitPath class is a path that contains only nodekit nodes.
Definition: SoNodeKitPath.h:42
The SoNode class is the base class for nodes used in scene graphs.
Definition: SoNode.h:56
The SoFullPath class allows examination of hidden children in paths.
Definition: SoFullPath.h:38
The SoPath class is a container class for traversal path descriptions.
Definition: SoPath.h:52
The SoAction class is the base class for all traversal actions.
Definition: SoAction.h:77
The SoTempPath class is used to store temporary paths.
Definition: SoTempPath.h:38
virtual SbBool readInstance(SoInput *input, unsigned short flags)=0
static void initClass(void)
Sets up initialization for data common to all instances of this class, like submitting necessary info...
Definition: SoBase.cpp:348
void append(const int childindex)
Definition: SoPath.cpp:211
The SoNodeList class is a container for pointers to SoNode objects.
Definition: SoNodeList.h:40
The SoWriteAction class writes a scene graph to file.
Definition: SoWriteAction.h:42
static SoType getClassTypeId(void)
This static method returns the SoType object associated with objects of this class.
Definition: SoBase.cpp:632
void pop(void)
Definition: SoPath.h:143
The SoNotList class is a list of SoNotRec notification records.
Definition: SoNotification.h:43
The SoType class is the basis for the run-time type system in Coin.
Definition: SoType.h:59
int getLength(void) const
Definition: lists/SbPList.h:103
The SbName class stores strings by reference.
Definition: SbName.h:40
void truncate(const int length)
Definition: SoPath.cpp:528