CalculateTask class
Base classes
- class TaskBase
Derived classes
- class ControllerMgr
- class InfLoopChecker
Public types
- 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
- CalculateTask(const TaskConstructArg& arg) explicit
- CalculateTask(const TaskConstructArg& arg, const char* name)
- ~CalculateTask() override
Public functions
- void pauseCalc(bool b) override
- void pauseDraw(bool b) override
- void pauseCalcRec(bool b) override
- void pauseDrawRec(bool b) override
- void pauseCalcChild(bool b) override
- void pauseDrawChild(bool b) override
- void attachCalcImpl() override
- void attachDrawImpl() override
- void detachCalcImpl() override
- void detachDrawImpl() override
-
auto getCorrespondingMethodTreeMgrTypeInfo() const -> const RuntimeTypeInfo::
Interface* override - auto getMethodTreeNode(s32 method_type) -> MethodTreeNode* override
- void calc() virtual
- void prepare() virtual
- void enterCommon() virtual
- void enter() virtual
- void exit() virtual
- void onEvent(const TaskEvent&) 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 sead:: CalculateTask:: State
#include <framework/seadTaskBase.h>
enum sead:: CalculateTask:: Tag
#include <framework/seadTaskBase.h>
enum class sead:: CalculateTask:: HeapNullOption
#include <heap/seadDisposer.h>
Typedef documentation
typedef TListNode<TaskBase*> sead:: CalculateTask:: ListNode
#include <framework/seadTaskBase.h>
typedef TList<TaskBase*> sead:: CalculateTask:: List
#include <framework/seadTaskBase.h>
Function documentation
static u32 sead:: CalculateTask:: getListNodeOffset()
#include <heap/seadDisposer.h>
void sead:: CalculateTask:: prepare() virtual
#include <framework/seadTaskBase.h>
void sead:: CalculateTask:: enterCommon() virtual
#include <framework/seadTaskBase.h>
void sead:: CalculateTask:: enter() virtual
#include <framework/seadTaskBase.h>
void sead:: CalculateTask:: exit() virtual
#include <framework/seadTaskBase.h>
void sead:: CalculateTask:: onEvent(const TaskEvent&) virtual
#include <framework/seadTaskBase.h>
void sead:: CalculateTask:: onDestroy() virtual
#include <framework/seadTaskBase.h>
DelegateThread* sead:: CalculateTask:: getFramework() const
#include <framework/seadTaskBase.h>
TaskBase*& sead:: CalculateTask:: value()
#include <container/seadTreeNode.h>
const TaskBase*& sead:: CalculateTask:: value() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: CalculateTask:: parent() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: CalculateTask:: child() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: CalculateTask:: next() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: CalculateTask:: prev() const
#include <container/seadTreeNode.h>
TTreeNode* sead:: CalculateTask:: findRoot()
#include <container/seadTreeNode.h>
const TTreeNode* sead:: CalculateTask:: findRoot() const
#include <container/seadTreeNode.h>
const TreeNode* sead:: CalculateTask:: findRoot() const
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: insertAfterSelf(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: insertAfterSelf(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: insertBeforeSelf(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: insertBeforeSelf(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: pushBackChild(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: pushBackChild(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: pushBackSibling(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: pushBackSibling(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: pushFrontChild(TTreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: pushFrontChild(TreeNode* node)
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: clearLinks()
#include <container/seadTreeNode.h>
s32 sead:: CalculateTask:: countChildren() const
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: detachAll()
#include <container/seadTreeNode.h>
void sead:: CalculateTask:: detachSubTree()
#include <container/seadTreeNode.h>
const SafeString& sead:: CalculateTask:: getName() const
#include <prim/seadNamable.h>
void sead:: CalculateTask:: setName(const SafeString& name)
#include <prim/seadNamable.h>
void sead:: CalculateTask:: clearChildLinksRecursively_() protected
#include <container/seadTreeNode.h>
Heap* sead:: CalculateTask:: getDisposerHeap_() const protected
#include <heap/seadDisposer.h>
Variable documentation
TaskParameter* sead:: CalculateTask:: mParameter
#include <framework/seadTaskBase.h>
BitFlag32 sead:: CalculateTask:: mInternalFlag
#include <framework/seadTaskBase.h>
ListNode sead:: CalculateTask:: mTaskListNode
#include <framework/seadTaskBase.h>
HeapArray sead:: CalculateTask:: mHeapArray
#include <framework/seadTaskBase.h>
TaskMgr* sead:: CalculateTask:: mTaskMgr
#include <framework/seadTaskBase.h>
State sead:: CalculateTask:: mState
#include <framework/seadTaskBase.h>
Tag sead:: CalculateTask:: mTag
#include <framework/seadTaskBase.h>
TaskClassID sead:: CalculateTask:: mClassID
#include <framework/seadTaskBase.h>
TaskBase* sead:: CalculateTask:: mData protected
#include <container/seadTreeNode.h>
TreeNode* sead:: CalculateTask:: mParent protected
#include <container/seadTreeNode.h>
TreeNode* sead:: CalculateTask:: mChild protected
#include <container/seadTreeNode.h>
TreeNode* sead:: CalculateTask:: mNext protected
#include <container/seadTreeNode.h>
TreeNode* sead:: CalculateTask:: mPrev protected
#include <container/seadTreeNode.h>