SONODEKITPATH(3iv)
π SoNodeKitPath π
okay bestie, welcome to SoNodeKitPath(3IV) β the manual page you didn't know you needed but absolutely do π«Ά
πΈ NAME πΈ
SoNodeKitPath β a path that points to a list of hierarchical nodekits. it's giving "scenic route through your scene graph" fr fr β¨
π¦ INHERITS FROM π¦
SoBase > SoPath > SoNodeKitPath
so yes she's a whole descendant, a legacy, a bloodline π
β SYNOPSIS β
#include <Inventor/SoNodeKitPath.h>
methods from class SoNodeKitPath:
void append(SoBaseKit *childKit)
void append(const SoNodeKitPath *fromPath)
void pop()
SoNode * getTail() const
SoNode * getNode(int i) const
SoNode * getNodeFromTail(int i) const
int getLength() const
void truncate(int start)
SbBool containsNode(const SoNodeKit *nodeKit) const
int findFork(const SoNodeKitPath *path) const
friend int operator ==(const SoNodeKitPath &p1, const
SoNodeKitPath &p2)
methods from class SoPath:
void setHead(SoNode *node)
SoNode * getHead() const
SbBool containsPath(const SoPath *path) const
SoPath * copy(int startFromNodeIndex = 0, int numNodes = 0)
const
static SoPath * getByName(const SbName &name)
static int getByName(const SbName &name, SoPathList &list)
methods from class SoBase:
void ref()
void unref() const
void unrefNoDelete() const
void touch()
static SoType getClassTypeId()
virtual SoType getTypeId() const
SbBool isOfType(SoType type) const
virtual void setName(const SbName &name)
virtual SbName getName() const
π DESCRIPTION π
so. SoNodeKitPath is a subclass of SoPath that lets you look at nodekits below the top nodekit in the path. why does that matter, you ask? because nodekits have hidden children, bestie. so when you call getTail() on a regular path, it just returns the top-most nodekit on the path. π
and like β that happens even though the path might contain extra internal information leading to a node far deeper in the scene graph. for example, when picking an object inside an SoSceneKit, the regular path would end at the scenekit. but a nodekit path would continue further down, listing the other nodekits below it in the path. main character energy honestly π
intermediary (private) nodes between nodekits are not included in the nodekit path. we don't do plus-ones here π
β οΈ note that there is no constructor for anSoNodeKitPath, so you can not create one. periodt. instead, you cast an(SoPath *)into an(SoNodeKitPath *), which returns nodekit-style values from all the same questions asSoPath. it's giving glow-up via casting β¨
also, some methods of SoPath may not be called on an SoNodeKitPath. any methods which take a regular SoNode as an argument (except for setHead()) are not accessible, and replaced by methods that take an SoBaseKit as an argument instead. and methods which allow the programmer to refer to the child index of a node beneath its parent are also inaccessible β because a SoNodeKitPath only shows nodekits and hides any private parts, successive nodekits in the path may not actually be parent and child. the family tree is a vibe, not a strict hierarchy π
β¨ METHODS β¨
void append(SoBaseKit *childKit)β addschildKitto end of chain; uses first occurrence ofchildKitas a part within current last nodekit. if the path is empty, this is equivalent tosetHead(childKit). πvoid append(const SoNodeKitPath *fromPath)β adds all nodekits infromPath's chain to end of chain; the head node offromPathmust be the same as or a child of the current tail node. no cutting the line, bestie π«void pop()β pops the last nodekit off the end of the path. bye bitch πSoNode *getTail() constβ return the last nodekit in a path chain. note thatgetHead()is not redefined fromSoPath, since anSoNodeKitPathneed not begin with a nodekit; the restriction is placed only on successive nodes on the path. πSoNode *getNode(int i) constβ returns a pointer to the i'th node in the nodekit path.SoNode *getNodeFromTail(int i) constβ returns a pointer to the i'th nodekit in the chain, counting backward from the tail nodekit. passing0for i returns the tail nodekit. backwards is the new forwards fr fr πint getLength() constβ returns length of path chain (number of nodekits).void truncate(int start)β truncates the path chain, removing all nodes from index start on. callingtruncate(0)empties the path entirely. full reset, she's gone πSbBool containsNode(const SoNodeKit *nodeKit) constβ returnsTRUEif the passed nodekit is found anywhere in the path chain. πint findFork(const SoNodeKitPath *path) constβ if the two paths have different head nodes, this returns-1. otherwise, it returns the path chain index of the last nodekit (starting at the head) that is the same for both paths. the fork in the road moment πΈfriend int operator ==(const SoNodeKitPath &p1, const SoNodeKitPath &p2)β returnsTRUEif all node pointers in the two nodekit path chains are equal. twin flames check β
π SEE ALSO π
SoBaseKit, SoPath, SoRayPickAction, SoSearchAction
and that's the whole page bestie, no cap, every single flag and signature accounted for π this was SoNodeKitPath(3IV)() β go forth and cast responsibly, ily, bye π¦β¨
π¦ where this page comes from
- debian bookworm: inventor-doc 2.1.5-10+dfsg-2 Β· LGPL-2.0-or-later
- debian trixie: inventor-doc 2.1.6+ds-2 Β· LGPL-2.0-or-later
- ubuntu jammy: inventor-doc 2.1.5-10-24
- ubuntu noble: inventor-doc 2.1.5-10+dfsg-2.1build2 Β· LGPL-2.0-or-later
- ubuntu questing: inventor-doc 2.1.6+ds-2
- ubuntu resolute: inventor-doc 2.1.6.1+ds-1 Β· LGPL-2.0-or-later
- ubuntu stonking: inventor-doc 2.1.6.1+ds-1 Β· LGPL-2.0-or-later
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms