Use inner nodes for hierarchy calculation.

KN4CK3R · KN4CK3R · commit 45696a717258 · 2022-08-08T21:09:52.000+02:00
diff --git a/ReClass.NET/CodeGenerator/CppCodeGenerator.cs b/ReClass.NET/CodeGenerator/CppCodeGenerator.cs
@@ -192,6 +192,9 @@ IEnumerable<ClassNode> GetReversedClassHierarchy(ClassNode node)
 				}
 
 				var classNodes = node.Nodes
+					.OfType<BaseContainerNode>()
+					.SelectMany(c => c.Nodes)
+					.Concat(node.Nodes)
 					.OfType<BaseWrapperNode>()
 					.Where(w => !w.IsNodePresentInChain<PointerNode>()) // Pointers are forward declared
 					.Select(w => w.ResolveMostInnerNode() as ClassNode)

Original file line number	Diff line number	Diff line change
`@@ -192,6 +192,9 @@ IEnumerable<ClassNode> GetReversedClassHierarchy(ClassNode node)`
`192`	`192`	`}`
`193`	`193`
`194`	`194`	`var classNodes = node.Nodes`
	`195`	`+ .OfType<BaseContainerNode>()`
	`196`	`+ .SelectMany(c => c.Nodes)`
	`197`	`+ .Concat(node.Nodes)`
`195`	`198`	`.OfType<BaseWrapperNode>()`
`196`	`199`	`.Where(w => !w.IsNodePresentInChain<PointerNode>()) // Pointers are forward declared`
`197`	`200`	`.Select(w => w.ResolveMostInnerNode() as ClassNode)`