GeListHead Manual

About

A GeListHead object is the root of a list or tree of GeListNode elements. See also GeListNode Manual.

GeListHead objects are an instance of ID_LISTHEAD.

Allocation/Deallocation

GeListHead objects can be created with the usual tools:

  • GeListHead::Alloc(): Creates a new GeListHead.
  • GeListHead::Free(): Destroys the given GeListHead.

The creation of GeListHead objects is typically only needed in custom NodeData based plugin classes that internally store custom objects (see also Heads and Branches).

Access

It is possible to get the root GeListHead from every member of that list or tree:

  • GeListNode::GetListHead(): Returns the GeListHead root of the element's list or tree.
// This example loops through all selected objects and tags.
// For each selected element the GeListHead is accessed to
// get the first child object of that list.
doc->GetSelection(selection);
// loop through all elements of the selection
for (Int32 i = 0; i < selection->GetCount(); ++i)
{
C4DAtom* const atom = selection->GetIndex(i);
if (atom == nullptr)
return maxon::UnexpectedError(MAXON_SOURCE_LOCATION);
// check if the C4DAtom is a GeListNode
if (atom->IsInstanceOf(Tgelistnode) == false)
continue;
GeListNode* const node = static_cast<GeListNode*>(atom);
GeListHead* const head = node->GetListHead();
// check if the list head can be accessed
if (head != nullptr)
{
GeListNode* const child = head->GetFirst();
// check if the child is a BaseList2D object
if (child && child->IsInstanceOf(Tbaselist2d))
{
const BaseList2D* const child2D = static_cast<BaseList2D*>(child);
ApplicationOutput("First Child Element: " + child2D->GetName());
}
}
}
Py_ssize_t i
Definition: abstract.h:645
#define atom
Definition: graminit.h:72
#define MAXON_SOURCE_LOCATION
Definition: memoryallocationbase.h:69
#define ApplicationOutput(formatString,...)
Definition: debugdiagnostics.h:204
#define Tbaselist2d
2D list.
Definition: ge_prepass.h:995
#define Tgelistnode
Node list.
Definition: ge_prepass.h:999
maxon::Int32 Int32
Definition: ge_sys_math.h:51
const char * doc
Definition: pyerrors.h:226
Definition: node.h:10

GeListHead objects can also be obtained using GeListNode::GetBranchInfo():

// This example loops through all branches of a given BaseDocument.
// If possible the name of the first branch child object is printed.
maxon::BufferedBaseArray<BranchInfo, 20> branches; // 20 is just an arbitrary number, that should be enough to catch all branches
const Int32 branchCount = branches.GetCount();
for (Int32 i = 0; i < branchCount; ++i)
{
ApplicationOutput("Branch " + String::IntToString(i));
const String branchName = branches[i].name;
ApplicationOutput(" - Name: " + branchName);
const GeListHead* branchHead = branches[i].head;
if (branchHead != nullptr)
{
const GeListNode* child = branchHead->GetFirst();
// check if the child is a BaseList2D object
if (child && child->IsInstanceOf(Tbaselist2d))
{
const BaseList2D* child2D = static_cast<const BaseList2D*>(child);
ApplicationOutput(" - First Child Element: " + child2D->GetName());
}
}
}
ONLYWITHCHILDREN
Only return branch if it is in use, i.e. has content.
Definition: ge_prepass.h:1
typename BufferedBaseArraySelector< COUNT, MINCHUNKSIZE, MEMFLAGS, ALLOCATOR >::template Type< T > BufferedBaseArray
Definition: basearray.h:1814
#define iferr_return
Definition: resultbase.h:1531

See also GeListNode Heads and Branches and BaseList2D::GetMain() at BaseList2D Read-Only Properties.

Navigation

GeListHead itself is based on GeListNode. So instances of GeListHead can be organized in a list or tree:

  • GeListHead::InsertBefore(): Inserts the element before the given GeListNode in the list.
  • GeListHead::InsertAfter(): Inserts the element after the given GeListNode in the list.
  • GeListHead::InsertUnder(): Inserts the element under the given GeListNode.
  • GeListHead::InsertUnderLast(): Inserts the element as the last child element under the given GeListNode.
  • GeListHead::Remove(): Removes the element from the list or tree.

See Edit Lists and Trees.

Parent

The parent of a GeListHead instance is typically the object that owns that instance/branch.

  • GeListHead::SetParent(): Sets the parent of the GeListHead.
  • GeListHead::GetParent(): Returns the parent of the GeListHead.

GeListHead::SetParent() is normally used directly after the creation of a GeListHead instance.

// This example allocates a new GeListHead in a custom object's "Init" function.
// The "node" argument of "Init" is used as the parent object.
_branchHead = GeListHead::Alloc();
if (_branchHead == nullptr)
return false;
_branchHead->SetParent(node);
_branchName = ::String { "My Branch" };

List Content

A GeListHead is a root of a list of GeListNode elements. These elements can be obtained with:

  • GeListHead::GetFirst(): Returns the first element of the list.
  • GeListHead::GetLast(): Returns the last element of the list.

New elements can be added to the list with:

  • GeListHead::InsertFirst(): Inserts the given element as the first element of the list.
  • GeListHead::InsertLast(): Inserts the given element as the last element of the list.
  • GeListHead::Insert(): Inserts the given element as a child or after another elements.

All elements of a list can easily be deleted with:

  • GeListHead::FlushAll(): Clears the list. The list elements will be properly deallocated.
// This example removes all existing markers using the list head.
BaseList2D* const marker = GetFirstMarker(doc);
if (marker != nullptr)
{
GeListHead* const head = marker->GetListHead();
if (head == nullptr)
return maxon::UnexpectedError(MAXON_SOURCE_LOCATION);
head->FlushAll();
}
BaseList2D * GetFirstMarker(BaseDocument *doc)

Further Reading