TaskBase class
Base classes
-
template<typename T>class TTreeNode<TaskBase*>
- class IDisposer
- class INamable
Derived classes
- class CalculateTask
- class Task
Public types
- struct CreateArg
- enum State { cCreated = 0, cPrepare = 1, cPrepareDone = 2, cSleep = 3, cRunning = 4, cDying = 5, cDestroyable = 6, cDead = 7 }
- enum Tag { cSystem = 0, cApp = 1 }
- using ListNode = TListNode<TaskBase*>
- using List = TList<TaskBase*>
- enum class HeapNullOption { AlwaysUseSpecifiedHeap = 0, UseSpecifiedOrContainHeap = 1, DoNotAppendDisposerIfNoHeapSpecified = 2, UseSpecifiedOrCurrentHeap = 3 }
Public static functions
- static auto getListNodeOffset() -> u32
Constructors, destructors, conversion operators
- TaskBase(const TaskConstructArg& arg) explicit
- TaskBase(const TaskConstructArg& arg, const char* name)
- ~TaskBase() virtual
Public functions
- void pauseCalc(bool b) pure virtual
- void pauseDraw(bool b) pure virtual
- void pauseCalcRec(bool b) pure virtual
- void pauseDrawRec(bool b) pure virtual
- void pauseCalcChild(bool b) virtual
- void pauseDrawChild(bool b) virtual
- void prepare() virtual
- void enterCommon() virtual
- void enter() virtual
- void exit() virtual
- void onEvent(const TaskEvent&) virtual
- void attachCalcImpl() pure virtual
- void attachDrawImpl() pure virtual
- void detachCalcImpl() pure virtual
- void detachDrawImpl() pure virtual
-
auto getCorrespondingMethodTreeMgrTypeInfo() const -> const RuntimeTypeInfo::
Interface* pure virtual - auto getMethodTreeNode(s32 method_type) -> MethodTreeNode* pure virtual
- void onDestroy() virtual
- auto getFramework() const -> DelegateThread*
- auto value() -> TaskBase*&
- auto value() const -> const TaskBase*&
- auto parent() const -> TTreeNode*
- auto child() const -> TTreeNode*
- auto next() const -> TTreeNode*
- auto prev() const -> TTreeNode*
- auto findRoot() -> TTreeNode*
- auto findRoot() const -> const TTreeNode*
- auto findRoot() const -> const TreeNode*
- void insertAfterSelf(TTreeNode* node)
- void insertAfterSelf(TreeNode* node)
- void insertBeforeSelf(TTreeNode* node)
- void insertBeforeSelf(TreeNode* node)
- void pushBackChild(TTreeNode* node)
- void pushBackChild(TreeNode* node)
- void pushBackSibling(TTreeNode* node)
- void pushBackSibling(TreeNode* node)
- void pushFrontChild(TTreeNode* node)
- void pushFrontChild(TreeNode* node)
- void clearLinks()
- auto countChildren() const -> s32
- void detachAll()
- void detachSubTree()
- auto getName() const -> const SafeString&
- void setName(const SafeString& name)
Public variables
Protected functions
- void clearChildLinksRecursively_()
- auto getDisposerHeap_() const -> Heap*
Protected variables
Enum documentation
enum class sead:: TaskBase:: HeapNullOption
#include <heap/seadDisposer.h>
Function documentation
static u32 sead:: TaskBase:: getListNodeOffset()
#include <heap/seadDisposer.h>
TaskBase*& sead:: TaskBase:: value()
#include <container/seadTreeNode.h>
const TaskBase*& sead:: TaskBase:: value() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: TaskBase:: parent() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: TaskBase:: child() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: TaskBase:: next() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: TaskBase:: prev() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: TaskBase:: findRoot()
#include <container/seadTreeNode.h>
const TTreeNode* sead:: TaskBase:: findRoot() const
#include <container/seadTreeNode.h>
const TreeNode* sead:: TaskBase:: findRoot() const
#include <container/seadTreeNode.h>
void sead:: TaskBase:: insertAfterSelf(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: insertAfterSelf(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: insertBeforeSelf(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: insertBeforeSelf(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: pushBackChild(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: pushBackChild(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: pushBackSibling(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: pushBackSibling(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: pushFrontChild(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: pushFrontChild(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: TaskBase:: clearLinks()
#include <container/seadTreeNode.h>
s32 sead:: TaskBase:: countChildren() const
#include <container/seadTreeNode.h>
void sead:: TaskBase:: detachAll()
#include <container/seadTreeNode.h>
void sead:: TaskBase:: detachSubTree()
#include <container/seadTreeNode.h>
const SafeString& sead:: TaskBase:: getName() const
#include <prim/seadNamable.h>
void sead:: TaskBase:: setName(const SafeString& name)
#include <prim/seadNamable.h>
void sead:: TaskBase:: clearChildLinksRecursively_() protected
#include <container/seadTreeNode.h>
Heap* sead:: TaskBase:: getDisposerHeap_() const protected
#include <heap/seadDisposer.h>
Variable documentation
TaskBase* sead:: TaskBase:: mData protected
#include <container/seadTreeNode.h>
TreeNode* sead:: TaskBase:: mParent protected
#include <container/seadTreeNode.h>
TreeNode* sead:: TaskBase:: mChild protected
#include <container/seadTreeNode.h>
TreeNode* sead:: TaskBase:: mNext protected
#include <container/seadTreeNode.h>
TreeNode* sead:: TaskBase:: mPrev protected
#include <container/seadTreeNode.h>