本文整理汇总了C++中UBTNode类的典型用法代码示例。如果您正苦于以下问题:C++ UBTNode类的具体用法?C++ UBTNode怎么用?C++ UBTNode使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
在下文中一共展示了UBTNode类的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: CollectBreakpointsFromAsset
void FBehaviorTreeDebugger::CollectBreakpointsFromAsset(class UBehaviorTreeGraphNode* Node)
{
if (Node == NULL)
{
return;
}
for (int32 PinIdx = 0; PinIdx < Node->Pins.Num(); PinIdx++)
{
UEdGraphPin* Pin = Node->Pins[PinIdx];
if (Pin->Direction != EGPD_Output)
{
continue;
}
for (int32 i = 0; i < Pin->LinkedTo.Num(); i++)
{
UBehaviorTreeGraphNode* LinkedNode = Cast<UBehaviorTreeGraphNode>(Pin->LinkedTo[i]->GetOwningNode());
if (LinkedNode)
{
UBTNode* BTNode = Cast<UBTNode>(LinkedNode->NodeInstance);
if (BTNode && LinkedNode->bHasBreakpoint && LinkedNode->bIsBreakpointEnabled)
{
ActiveBreakpoints.Add(BTNode->GetExecutionIndex());
}
CollectBreakpointsFromAsset(LinkedNode);
}
}
}
}
示例2: check
void UBTNode::InitializeInSubtree(UBehaviorTreeComponent& OwnerComp, uint8* NodeMemory, int32& NextInstancedIndex, EBTMemoryInit::Type InitType) const
{
if (bCreateNodeInstance)
{
// composite nodes can't be instanced!
check(IsA(UBTCompositeNode::StaticClass()) == false);
UBTNode* NodeInstance = OwnerComp.NodeInstances.IsValidIndex(NextInstancedIndex) ? OwnerComp.NodeInstances[NextInstancedIndex] : NULL;
if (NodeInstance == NULL)
{
NodeInstance = NewObject<UBTNode>(&OwnerComp, GetClass(), GetFName(), RF_NoFlags, (UObject*)(this));
NodeInstance->InitializeNode(GetParentNode(), GetExecutionIndex(), GetMemoryOffset(), GetTreeDepth());
NodeInstance->bIsInstanced = true;
OwnerComp.NodeInstances.Add(NodeInstance);
}
check(NodeInstance);
NodeInstance->SetOwner(OwnerComp.GetOwner());
FBTInstancedNodeMemory* MyMemory = GetSpecialNodeMemory<FBTInstancedNodeMemory>(NodeMemory);
MyMemory->NodeIdx = NextInstancedIndex;
NodeInstance->OnInstanceCreated(OwnerComp);
NextInstancedIndex++;
}
else
{
InitializeMemory(OwnerComp, NodeMemory, InitType);
}
}
示例3: OnBreakpointRemoved
void FBehaviorTreeDebugger::OnBreakpointRemoved(class UBehaviorTreeGraphNode* Node)
{
if (IsDebuggerReady())
{
UBTNode* BTNode = Cast<UBTNode>(Node->NodeInstance);
if (BTNode)
{
ActiveBreakpoints.RemoveSingleSwap(BTNode->GetExecutionIndex());
}
}
}
示例4: FindBlackboardAsset
const UBlackboardData* FBlackboardSelectorDetails::FindBlackboardAsset(UObject* InObj)
{
for (UObject* TestOb = InObj; TestOb; TestOb = TestOb->GetOuter())
{
UBTNode* NodeOb = Cast<UBTNode>(TestOb);
if (NodeOb)
{
return NodeOb->GetBlackboardAsset();
}
}
return NULL;
}
示例5: ResetNodeOwner
void UBehaviorTreeGraphNode::PostEditImport()
{
ResetNodeOwner();
if (NodeInstance)
{
UBehaviorTree* BT = Cast<UBehaviorTree>(GetBehaviorTreeGraph()->GetOuter());
if (BT)
{
UBTNode* BTNode = (UBTNode*)NodeInstance;
BTNode->InitializeFromAsset(*BT);
BTNode->InitializeNode(NULL, MAX_uint16, 0, 0);
}
}
}
示例6: RebuildExecutionOrder
void UBehaviorTreeGraph::RebuildExecutionOrder()
{
// initial cleanup & root node search
UBehaviorTreeGraphNode_Root* RootNode = NULL;
for (int32 Index = 0; Index < Nodes.Num(); ++Index)
{
UBehaviorTreeGraphNode* Node = Cast<UBehaviorTreeGraphNode>(Nodes[Index]);
// prepare node instance
UBTNode* NodeInstance = Cast<UBTNode>(Node->NodeInstance);
if (NodeInstance)
{
// mark all nodes as disconnected first, path from root will replace it with valid values later
NodeInstance->InitializeNode(NULL, MAX_uint16, 0, 0);
}
// cache root
if (RootNode == NULL)
{
RootNode = Cast<UBehaviorTreeGraphNode_Root>(Nodes[Index]);
}
UBehaviorTreeGraphNode_CompositeDecorator* CompositeDecorator = Cast<UBehaviorTreeGraphNode_CompositeDecorator>(Nodes[Index]);
if (CompositeDecorator)
{
CompositeDecorator->ResetExecutionRange();
}
}
if (RootNode && RootNode->Pins.Num() > 0 && RootNode->Pins[0]->LinkedTo.Num() > 0)
{
UBehaviorTreeGraphNode* Node = Cast<UBehaviorTreeGraphNode>(RootNode->Pins[0]->LinkedTo[0]->GetOwningNode());
if (Node)
{
UBTCompositeNode* BTNode = Cast<UBTCompositeNode>(Node->NodeInstance);
if (BTNode)
{
uint16 ExecutionIndex = 0;
uint8 TreeDepth = 0;
BTNode->InitializeNode(NULL, ExecutionIndex, 0, TreeDepth);
ExecutionIndex++;
BTGraphHelpers::RebuildExecutionOrder(Node, BTNode, &ExecutionIndex, TreeDepth);
}
}
}
}
示例7: PostPlacedNewNode
void UBehaviorTreeGraphNode::PostPlacedNewNode()
{
UClass* NodeClass = ClassData.GetClass(true);
if (NodeClass)
{
UBehaviorTree* BT = Cast<UBehaviorTree>(GetBehaviorTreeGraph()->GetOuter());
if (BT)
{
NodeInstance = ConstructObject<UBTNode>(NodeClass, BT);
UBTNode* BTNode = (UBTNode*)NodeInstance;
BTNode->SetFlags(RF_Transactional);
BTNode->InitializeFromAsset(*BT);
BTNode->InitializeNode(NULL, MAX_uint16, 0, 0);
}
}
}
示例8: OnBlackboardUpdate
void UBehaviorTreeGraphNode_CompositeDecorator::OnBlackboardUpdate()
{
UBehaviorTreeDecoratorGraph* MyGraph = Cast<UBehaviorTreeDecoratorGraph>(BoundGraph);
UBehaviorTree* BTAsset = Cast<UBehaviorTree>(GetOuter()->GetOuter());
if (MyGraph && BTAsset)
{
for (int32 i = 0; i < MyGraph->Nodes.Num(); i++)
{
UBehaviorTreeDecoratorGraphNode_Decorator* MyNode = Cast<UBehaviorTreeDecoratorGraphNode_Decorator>(MyGraph->Nodes[i]);
UBTNode* MyNodeInstance = MyNode ? Cast<UBTNode>(MyNode->NodeInstance) : NULL;
if (MyNodeInstance)
{
MyNodeInstance->InitializeFromAsset(*BTAsset);
}
}
}
}
示例9: UpdateAbortHighlight
void UBehaviorTreeGraph::UpdateAbortHighlight(struct FAbortDrawHelper& Mode0, struct FAbortDrawHelper& Mode1)
{
for (int32 Index = 0; Index < Nodes.Num(); ++Index)
{
UBehaviorTreeGraphNode* Node = Cast<UBehaviorTreeGraphNode>(Nodes[Index]);
UBTNode* NodeInstance = Node ? Cast<UBTNode>(Node->NodeInstance) : NULL;
if (NodeInstance)
{
const uint16 ExecIndex = NodeInstance->GetExecutionIndex();
Node->bHighlightInAbortRange0 = (ExecIndex != MAX_uint16) && (ExecIndex >= Mode0.AbortStart) && (ExecIndex <= Mode0.AbortEnd);
Node->bHighlightInAbortRange1 = (ExecIndex != MAX_uint16) && (ExecIndex >= Mode1.AbortStart) && (ExecIndex <= Mode1.AbortEnd);
Node->bHighlightInSearchRange0 = (ExecIndex != MAX_uint16) && (ExecIndex >= Mode0.SearchStart) && (ExecIndex <= Mode0.SearchEnd);
Node->bHighlightInSearchRange1 = (ExecIndex != MAX_uint16) && (ExecIndex >= Mode1.SearchStart) && (ExecIndex <= Mode1.SearchEnd);
Node->bHighlightInSearchTree = false;
}
}
}
示例10: CacheBlackboardData
END_SLATE_FUNCTION_BUILD_OPTIMIZATION
void FBlackboardDecoratorDetails::CacheBlackboardData(IDetailLayoutBuilder& DetailLayout)
{
TArray<TWeakObjectPtr<UObject> > MyOuters;
DetailLayout.GetObjectsBeingCustomized(MyOuters);
CachedBlackboardAsset.Reset();
for (int32 i = 0; i < MyOuters.Num(); i++)
{
UBTNode* NodeOb = Cast<UBTNode>(MyOuters[i].Get());
if (NodeOb)
{
CachedBlackboardAsset = NodeOb->GetBlackboardAsset();
break;
}
}
}
示例11: LOCTEXT
void UBehaviorTreeGraphNode::FindDiffs(UEdGraphNode* OtherNode, FDiffResults& Results)
{
FDiffSingleResult Diff;
Diff.Diff = EDiffType::NODE_PROPERTY;
Diff.Node1 = this;
Diff.Node2 = OtherNode;
Diff.ToolTip = LOCTEXT("DIF_NodePropertyToolTip", "A Property of the node has changed");
Diff.DisplayColor = FLinearColor(0.25f,0.71f,0.85f);
UBehaviorTreeGraphNode* ThisBehaviorTreeNode = Cast<UBehaviorTreeGraphNode>(this);
UBehaviorTreeGraphNode* OtherBehaviorTreeNode = Cast<UBehaviorTreeGraphNode>(OtherNode);
if(ThisBehaviorTreeNode && OtherBehaviorTreeNode)
{
DiffProperties( ThisBehaviorTreeNode->GetClass(), ThisBehaviorTreeNode, OtherBehaviorTreeNode, Results, Diff );
UBTNode* ThisNodeInstance = Cast<UBTNode>(ThisBehaviorTreeNode->NodeInstance);
UBTNode* OtherNodeInstance = Cast<UBTNode>(OtherBehaviorTreeNode->NodeInstance);
if(ThisNodeInstance && OtherNodeInstance)
{
DiffProperties( ThisNodeInstance->GetClass(), ThisNodeInstance, OtherNodeInstance, Results, Diff );
}
}
}
示例12: UpdateBlackboardChange
void UBehaviorTreeGraph::UpdateBlackboardChange()
{
UBehaviorTree* BTAsset = Cast<UBehaviorTree>(GetOuter());
if (BTAsset == nullptr)
{
return;
}
for (int32 Index = 0; Index < Nodes.Num(); ++Index)
{
UBehaviorTreeGraphNode* MyNode = Cast<UBehaviorTreeGraphNode>(Nodes[Index]);
if (MyNode)
{
UBTNode* MyNodeInstance = Cast<UBTNode>(MyNode->NodeInstance);
if (MyNodeInstance)
{
MyNodeInstance->InitializeFromAsset(*BTAsset);
}
}
for (int32 iDecorator = 0; iDecorator < MyNode->Decorators.Num(); iDecorator++)
{
UBTNode* MyNodeInstance = MyNode->Decorators[iDecorator] ? Cast<UBTNode>(MyNode->Decorators[iDecorator]->NodeInstance) : NULL;
if (MyNodeInstance)
{
MyNodeInstance->InitializeFromAsset(*BTAsset);
}
UBehaviorTreeGraphNode_CompositeDecorator* CompDecoratorNode = Cast<UBehaviorTreeGraphNode_CompositeDecorator>(MyNode->Decorators[iDecorator]);
if (CompDecoratorNode)
{
CompDecoratorNode->OnBlackboardUpdate();
}
}
for (int32 iService = 0; iService < MyNode->Services.Num(); iService++)
{
UBTNode* MyNodeInstance = MyNode->Services[iService] ? Cast<UBTNode>(MyNode->Services[iService]->NodeInstance) : NULL;
if (MyNodeInstance)
{
MyNodeInstance->InitializeFromAsset(*BTAsset);
}
}
}
}
示例13: check
void UBTNode::InitializeInSubtree(UBehaviorTreeComponent& OwnerComp, uint8* NodeMemory, int32& NextInstancedIndex, EBTMemoryInit::Type InitType) const
{
FBTInstancedNodeMemory* SpecialMemory = GetSpecialNodeMemory<FBTInstancedNodeMemory>(NodeMemory);
if (SpecialMemory)
{
SpecialMemory->NodeIdx = INDEX_NONE;
}
if (bCreateNodeInstance)
{
// composite nodes can't be instanced!
check(IsA(UBTCompositeNode::StaticClass()) == false);
UBTNode* NodeInstance = OwnerComp.NodeInstances.IsValidIndex(NextInstancedIndex) ? OwnerComp.NodeInstances[NextInstancedIndex] : NULL;
if (NodeInstance == NULL)
{
NodeInstance = (UBTNode*)StaticDuplicateObject(this, &OwnerComp);
NodeInstance->InitializeNode(GetParentNode(), GetExecutionIndex(), GetMemoryOffset(), GetTreeDepth());
NodeInstance->bIsInstanced = true;
OwnerComp.NodeInstances.Add(NodeInstance);
}
check(NodeInstance);
check(SpecialMemory);
SpecialMemory->NodeIdx = NextInstancedIndex;
NodeInstance->SetOwner(OwnerComp.GetOwner());
NodeInstance->InitializeMemory(OwnerComp, NodeMemory, InitType);
check(TreeAsset);
NodeInstance->InitializeFromAsset(*TreeAsset);
NodeInstance->OnInstanceCreated(OwnerComp);
NextInstancedIndex++;
}
else
{
InitializeMemory(OwnerComp, NodeMemory, InitType);
}
}
示例14: GetObjectsWithOuter
void UBehaviorTreeGraph::RemoveOrphanedNodes()
{
UBehaviorTree* BTAsset = CastChecked<UBehaviorTree>(GetOuter());
// Obtain a list of all nodes that should be in the asset
TSet<UBTNode*> AllNodes;
for (int32 Index = 0; Index < Nodes.Num(); ++Index)
{
UBehaviorTreeGraphNode* MyNode = Cast<UBehaviorTreeGraphNode>(Nodes[Index]);
if (MyNode)
{
UBTNode* MyNodeInstance = Cast<UBTNode>(MyNode->NodeInstance);
if (MyNodeInstance)
{
AllNodes.Add(MyNodeInstance);
}
for (int32 iDecorator = 0; iDecorator < MyNode->Decorators.Num(); iDecorator++)
{
UBehaviorTreeGraphNode_CompositeDecorator* SubgraphNode = Cast<UBehaviorTreeGraphNode_CompositeDecorator>(MyNode->Decorators[iDecorator]);
if (SubgraphNode)
{
TArray<UBTDecorator*> NodeInstances;
TArray<FBTDecoratorLogic> DummyOps;
SubgraphNode->CollectDecoratorData(NodeInstances, DummyOps);
for (int32 SubIdx = 0; SubIdx < NodeInstances.Num(); SubIdx++)
{
AllNodes.Add(NodeInstances[SubIdx]);
}
}
else
{
UBTNode* MyDecoratorNodeInstance = MyNode->Decorators[iDecorator] ? Cast<UBTNode>(MyNode->Decorators[iDecorator]->NodeInstance) : NULL;
if (MyDecoratorNodeInstance)
{
AllNodes.Add(MyDecoratorNodeInstance);
}
}
}
for (int32 iService = 0; iService < MyNode->Services.Num(); iService++)
{
UBTNode* MyServiceNodeInstance = MyNode->Services[iService] ? Cast<UBTNode>(MyNode->Services[iService]->NodeInstance) : NULL;
if (MyServiceNodeInstance)
{
AllNodes.Add(MyServiceNodeInstance);
}
}
}
}
// Obtain a list of all nodes actually in the asset and discard unused nodes
TArray<UObject*> AllInners;
const bool bIncludeNestedObjects = false;
GetObjectsWithOuter(BTAsset, AllInners, bIncludeNestedObjects);
for (auto InnerIt = AllInners.CreateConstIterator(); InnerIt; ++InnerIt)
{
UBTNode* Node = Cast<UBTNode>(*InnerIt);
if (Node && !AllNodes.Contains(Node))
{
Node->SetFlags(RF_Transient);
Node->Rename(NULL, GetTransientPackage(), REN_DontCreateRedirectors | REN_NonTransactional | REN_ForceNoResetLoaders);
}
}
}
示例15: UpdateAsset
void UBehaviorTreeGraph::UpdateAsset(EDebuggerFlags DebuggerFlags, bool bBumpVersion)
{
if (bLockUpdates)
{
return;
}
// initial cleanup & root node search
UBehaviorTreeGraphNode_Root* RootNode = NULL;
for (int32 Index = 0; Index < Nodes.Num(); ++Index)
{
UBehaviorTreeGraphNode* Node = Cast<UBehaviorTreeGraphNode>(Nodes[Index]);
// debugger flags
if (DebuggerFlags == ClearDebuggerFlags)
{
Node->ClearDebuggerState();
for (int32 iAux = 0; iAux < Node->Services.Num(); iAux++)
{
Node->Services[iAux]->ClearDebuggerState();
}
for (int32 iAux = 0; iAux < Node->Decorators.Num(); iAux++)
{
Node->Decorators[iAux]->ClearDebuggerState();
}
}
// parent chain
Node->ParentNode = NULL;
for (int32 iAux = 0; iAux < Node->Services.Num(); iAux++)
{
Node->Services[iAux]->ParentNode = Node;
}
for (int32 iAux = 0; iAux < Node->Decorators.Num(); iAux++)
{
Node->Decorators[iAux]->ParentNode = Node;
}
// prepare node instance
UBTNode* NodeInstance = Cast<UBTNode>(Node->NodeInstance);
if (NodeInstance)
{
// mark all nodes as disconnected first, path from root will replace it with valid values later
NodeInstance->InitializeNode(NULL, MAX_uint16, 0, 0);
}
// cache root
if (RootNode == NULL)
{
RootNode = Cast<UBehaviorTreeGraphNode_Root>(Nodes[Index]);
}
UBehaviorTreeGraphNode_CompositeDecorator* CompositeDecorator = Cast<UBehaviorTreeGraphNode_CompositeDecorator>(Nodes[Index]);
if (CompositeDecorator)
{
CompositeDecorator->ResetExecutionRange();
}
}
if (RootNode && RootNode->Pins.Num() > 0 && RootNode->Pins[0]->LinkedTo.Num() > 0)
{
UBehaviorTreeGraphNode* Node = Cast<UBehaviorTreeGraphNode>(RootNode->Pins[0]->LinkedTo[0]->GetOwningNode());
if (Node)
{
CreateBTFromGraph(Node);
if (bBumpVersion)
{
GraphVersion++;
}
}
}
}