WeakNodePath¶

class WeakNodePath¶

This class is a wrapper around a NodePath that, unlike the actual NodePath class, doesn’t hold a reference count to the node. Thus the node may be detached from the scene graph and destructed at any time.

You can call is_valid() or was_deleted() at any time to determine whether the node is still around; if it is, get_node_path() will return the associated NodePath.

Inheritance diagram

digraph inheritance089a25c010 { bgcolor=transparent; rankdir=BT; size="8.0, 12.0"; "DTOOL_SUPER_BASE" [fillcolor=white,fontname="Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans",fontsize=11,height=0.25,shape=box,style=""]; "WeakNodePath" [URL="acron.core.WeakNodePath.html#acron.core.WeakNodePath",fillcolor=white,fontname="Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans",fontsize=11,height=0.25,shape=box,style="",target="_top",tooltip="/**"]; "DTOOL_SUPER_BASE" -> "WeakNodePath" [arrowsize=0.75,style=""]; }

WeakNodePath.__eq__()¶

WeakNodePath.__init__()¶

WeakNodePath.__lt__()¶

WeakNodePath.__ne__()¶

WeakNodePath.assign()¶

WeakNodePath.clear()¶: Sets this NodePath to the empty NodePath. It will no longer point to any node.

WeakNodePath.compare_to()¶

Returns a number less than zero if this NodePath sorts before the other one, greater than zero if it sorts after, or zero if they are equivalent.

Two NodePaths are considered equivalent if they consist of exactly the same list of nodes in the same order. Otherwise, they are different; different NodePaths will be ranked in a consistent but undefined ordering; the ordering is useful only for placing the NodePaths in a sorted container like an STL set.

Returns a number less than zero if this WeakNodePath sorts before the other one, greater than zero if it sorts after, or zero if they are equivalent.

Two WeakNodePaths are considered equivalent if they consist of exactly the same list of nodes in the same order. Otherwise, they are different; different WeakNodePaths will be ranked in a consistent but undefined ordering; the ordering is useful only for placing the WeakNodePaths in a sorted container like an STL set.

WeakNodePath.get_key()¶: Returns the same values as NodePath::get_key().

WeakNodePath.get_node_path()¶: Returns the NodePath held within this object, or an empty NodePath with the error flag set if the object was deleted.

WeakNodePath.is_empty()¶: Returns true if the NodePath contains no nodes, or if it has been deleted.

WeakNodePath.node()¶: Returns the AcronNode held within this object, or nullptr if the object was deleted.

WeakNodePath.output()¶

WeakNodePath.was_deleted()¶: Returns true if the NodePath we were referencing has been quietly deleted outside of the WeakNodePath.