Skip to content

Commit

Permalink
Terminate those raw strings for poor GCC
Browse files Browse the repository at this point in the history
  • Loading branch information
mottosso committed Jun 6, 2021
1 parent 928ecb7 commit 18ed4c9
Showing 1 changed file with 71 additions and 72 deletions.
143 changes: 71 additions & 72 deletions src/MFnDagNode.inl
Original file line number Diff line number Diff line change
@@ -1,123 +1,123 @@
#define _doc_create R"pbdoc(create(type, name=None, parent=MObject.kNullObj) -> MObject
Creates a new DAG node of the specified type, with the given name.
The type may be either a type name or a type ID. If no name is given
then a unique name will be generated by combining the type name with
an integer.
If a parent is given then the new node will be parented under it and
the functionset will be attached to the newly-created node. The
newly-created node will be returned.
If no parent is given and the new node is a transform, it will be
parented under the world and the functionset will be attached to the
newly-created transform. The newly-created transform will be returned.
If no parent is given and the new node is not a transform then a
transform node will be created under the world, the new node will be
parented under it, and the functionset will be attached to the
#define _doc_create R"pbdoc(create(type, name=None, parent=MObject.kNullObj) -> MObject\
\
Creates a new DAG node of the specified type, with the given name.\
The type may be either a type name or a type ID. If no name is given\
then a unique name will be generated by combining the type name with\
an integer.\
\
If a parent is given then the new node will be parented under it and\
the functionset will be attached to the newly-created node. The\
newly-created node will be returned.\
\
If no parent is given and the new node is a transform, it will be\
parented under the world and the functionset will be attached to the\
newly-created transform. The newly-created transform will be returned.\
\
If no parent is given and the new node is not a transform then a\
transform node will be created under the world, the new node will be\
parented under it, and the functionset will be attached to the\
transform. The transform will be returned.)pbdoc"

#define _doc_addChild R"pbdoc(addChild(child, index=FnDagNode.kNextPos, keepExistingParents=False)
#define _doc_addChild R"pbdoc(addChild(child, index=FnDagNode.kNextPos, keepExistingParents=False)\
\
Makes this node a parent of `child`.)pbdoc"

#define _doc_child R"pbdoc(child(index) -> MObject
#define _doc_child R"pbdoc(child(index) -> MObject\
\
Returns the specified child of this node.)pbdoc"

#define _doc_childCount R"pbdoc(childCount() -> int
#define _doc_childCount R"pbdoc(childCount() -> int\
\
Returns the number of nodes which are children of this one.)pbdoc"

#define _doc_getConnectedSetsAndMembers R"pbdoc(getConnectedSetsAndMembers(instance, renderableSetsOnly) -> (MObjectArray, MObjectArray)
Returns a tuple containing an array of sets and an array of the
components of the DAG object which are in those sets. If the entire object is in a set, then the corresponding entry in the comps array will have no elements in it.
#define _doc_getConnectedSetsAndMembers R"pbdoc(getConnectedSetsAndMembers(instance, renderableSetsOnly) -> (MObjectArray, MObjectArray)\
\
Returns a tuple containing an array of sets and an array of the\
components of the DAG object which are in those sets. If the entire object is in a set, then the corresponding entry in the comps array will have no elements in it.\
)pbdoc"

#define _doc_dagPath R"pbdoc(dagPath() -> MDagPath
#define _doc_dagPath R"pbdoc(dagPath() -> MDagPath\
\
Returns the DAG path to which this function set is attached. Raises a TypeError if the function set is attached to an MObject rather than a path.)pbdoc"

#define _doc_dagRoot R"pbdoc(dagRoot() -> MObject
#define _doc_dagRoot R"pbdoc(dagRoot() -> MObject\
\
Returns the root node of the first path leading to this node.)pbdoc"

#define _doc_duplicate R"pbdoc(duplicate(instance=False, instanceLeaf=False) -> MObject
#define _doc_duplicate R"pbdoc(duplicate(instance=False, instanceLeaf=False) -> MObject\
\
Duplicates the DAG hierarchy rooted at the current node.)pbdoc"

#define _doc_fullPathName R"pbdoc(fullPathName() -> string
#define _doc_fullPathName R"pbdoc(fullPathName() -> string\
\
Returns the full path of the attached object, from the root of the DAG on down.)pbdoc"

#define _doc_getAllPaths R"pbdoc(getAllPaths() -> MDagPathArray
#define _doc_getAllPaths R"pbdoc(getAllPaths() -> MDagPathArray\
\
Returns all of the DAG paths which lead to the object to which this function set is attached.)pbdoc"

#define _doc_getPath R"pbdoc(getPath() -> MDagPath
#define _doc_getPath R"pbdoc(getPath() -> MDagPath\
\
Returns the DAG path to which this function set is attached, or the first path to the node if the function set is attached to an MObject.)pbdoc"

#define _doc_hasChild R"pbdoc(hasChild(node) -> bool
#define _doc_hasChild R"pbdoc(hasChild(node) -> bool\
\
Returns True if the specified node is a child of this one.)pbdoc"

#define _doc_hasParent R"pbdoc(hasParent(node) -> bool
#define _doc_hasParent R"pbdoc(hasParent(node) -> bool\
\
Returns True if the specified node is a parent of this one.)pbdoc"

#define _doc_instanceCount R"pbdoc(instanceCount(indirect) -> int
#define _doc_instanceCount R"pbdoc(instanceCount(indirect) -> int\
\
Returns the number of instances for this node.)pbdoc"

#define _doc_isChildOf R"pbdoc(isChildOf(node) -> bool
#define _doc_isChildOf R"pbdoc(isChildOf(node) -> bool\
\
Returns True if the specified node is a parent of this one.)pbdoc"

#define _doc_isInstanced R"pbdoc(isInstanced(indirect=True) -> bool
#define _doc_isInstanced R"pbdoc(isInstanced(indirect=True) -> bool\
\
Returns True if this node is instanced.)pbdoc"

#define _doc_isInstancedAttribute R"pbdoc(isInstancedAttribute(attr) -> bool
#define _doc_isInstancedAttribute R"pbdoc(isInstancedAttribute(attr) -> bool\
\
Returns True if the specified attribute is an instanced attribute of this node.)pbdoc"

#define _doc_isParentOf R"pbdoc(isParentOf(node) -> bool
#define _doc_isParentOf R"pbdoc(isParentOf(node) -> bool\
\
Returns True if the specified node is a child of this one.)pbdoc"

#define _doc_parent R"pbdoc(parent(index) -> MObject
#define _doc_parent R"pbdoc(parent(index) -> MObject\
\
Returns the specified parent of this node.)pbdoc"

#define _doc_parentCount R"pbdoc(parentCount() -> int
#define _doc_parentCount R"pbdoc(parentCount() -> int\
\
Returns the number of parents this node has.)pbdoc"

#define _doc_partialPathName R"pbdoc(partialPathName() -> string
#define _doc_partialPathName R"pbdoc(partialPathName() -> string\
\
Returns the minimum path string necessary to uniquely identify the attached object.)pbdoc"

#define _doc_removeChild R"pbdoc(removeChild(node) -> self
#define _doc_removeChild R"pbdoc(removeChild(node) -> self\
\
Removes the child, specified by MObject, reparenting it under the world.)pbdoc"

#define _doc_removeChildAt R"pbdoc(removeChildAt(index) -> self
#define _doc_removeChildAt R"pbdoc(removeChildAt(index) -> self\
\
Removes the child, specified by index, reparenting it under the world.)pbdoc"

#define _doc_setObject R"pbdoc(setObject(MObject or MDagPath) -> self
#define _doc_setObject R"pbdoc(setObject(MObject or MDagPath) -> self\
\
Attaches the function set to the specified node or DAG path.)pbdoc"

#define _doc_setObject R"pbdoc(setObject(MObject or MDagPath) -> self
#define _doc_setObject R"pbdoc(setObject(MObject or MDagPath) -> self\
\
Attaches the function set to the specified node or DAG path.)pbdoc"

#define _doc_transformationMatrix R"pbdoc(transformationMatrix() -> MMatrix
#define _doc_transformationMatrix R"pbdoc(transformationMatrix() -> MMatrix\
\
Returns the object space transformation matrix for this DAG node.)pbdoc"


Expand Down Expand Up @@ -416,5 +416,4 @@ py::class_<MFnDagNode>(m, "FnDagNode")

.def("transformationMatrix", [](MFnDagNode& self) -> MMatrix {
return self.transformationMatrix();
}, _doc_transformationMatrix
);
}, _doc_transformationMatrix);

0 comments on commit 18ed4c9

Please sign in to comment.