Method ProcessAsset

Source/FlowEditor/Private/Find/FindInFlow.cpp:589–639

}

bool SFindInFlow::ProcessAsset(UFlowAsset* Asset, FSearchResult ParentResult, const TArray<FString>& Tokens, int32 Depth)
{
	if (!Asset || !Asset->GetGraph() || Depth >= MaxSearchDepth || SearchResults.VisitedAssets.Contains(Asset))
	{
		return false;
	}

	SearchResults.VisitedAssets.Add(Asset);
	
	bool bAnyMatches = false;

	for (UEdGraphNode* EdNode : Asset->GetGraph()->Nodes)
	{
		const TMap<EFlowSearchFlags, TSet<FString>>* CategoryStrings = BuildCategoryStrings(EdNode, Depth);

		if (!CategoryStrings)
		{
			continue;
		}

		EFlowSearchFlags NodeMatchedFlags = EFlowSearchFlags::None;

		for (const TPair<EFlowSearchFlags, TSet<FString>>& Pair : *CategoryStrings)
		{
			const TSet<FString>& StringSet = Pair.Value;
			if (EnumHasAnyFlags(SearchFlags, Pair.Key) && StringSetMatchesSearchTokens(Tokens, StringSet))
			{
				EnumAddFlags(NodeMatchedFlags, Pair.Key);
			}
		}

		if (NodeMatchedFlags != EFlowSearchFlags::None)
		{
			FString Title = EdNode->GetNodeTitle(ENodeTitleType::ListView).ToString();
			if (Title.IsEmpty())
			{
				Title = EdNode->GetClass()->GetName();
			}

			FSearchResult Result = MakeShareable(new FFindInFlowResult(Title, ParentResult, EdNode, Depth > 0, Asset));
			Result->MatchedFlags = NodeMatchedFlags;
			ParentResult->Children.Add(Result);

			bAnyMatches = true;
		}

		bAnyMatches |= RecurseIntoSubgraphsIfEnabled(EdNode, ParentResult, Tokens, Depth);
	}

	return bAnyMatches;
}

bool SFindInFlow::RecurseIntoSubgraphsIfEnabled(UEdGraphNode* EdNode, FSearchResult ParentResult, const TArray<FString>& Tokens, int32 Depth)
{