代码重构 & JDT遍历AST，获取每个节点的所有直接子节点

Posted 2022-10-29 同学少年

public class DataNode 
	public ASTNode node; //所代表的的AST节点
	public int label; //编号
	public List<Integer> childrenLables = new ArrayList<>(); //直接的子节点的编号
	public List<ASTNode> childrenNodes = new ArrayList<>(); //直接的子节点
	public boolean isLeaf = false; //是否是叶子节点
	public String nodeType = "unknown";





public static int ID = 0; //用来编号

// 输入的是CompilationUnit根节点， label为0
public static void getDirectChildren(ASTNode node, int label, Map<Integer, DataNode> Nodes)
	
	//先创建一个节点数据结构
	DataNode myNode = new DataNode();
	Nodes.put(label, myNode);
	myNode.label = label;
	myNode.node = node;
	myNode.nodeType = node.getClass().toString();
	List listProperty = node.structuralPropertiesForType();
	boolean hasChildren = false;
	for(int i = 0; i < listProperty.size(); i++)
		StructuralPropertyDescriptor propertyDescriptor = (StructuralPropertyDescriptor) listProperty.get(i);
		if(propertyDescriptor instanceof ChildListPropertyDescriptor)//ASTNode列表
			ChildListPropertyDescriptor childListPropertyDescriptor = (ChildListPropertyDescriptor)propertyDescriptor;
			Object children = node.getStructuralProperty(childListPropertyDescriptor);
			List<ASTNode> childrenNodes = (List<ASTNode>)children;
			for(ASTNode childNode: childrenNodes)
				//获取所有节点
				if(childNode == null)
					continue;
				hasChildren = true;
				myNode.childrenNodes.add(childNode);
				myNode.childrenLables.add((++ID));
				getDirectChildren(childNode, ID, Nodes);//继续递归
				//System.out.println("childrenList:   "+childNode+"   "+childNode.getClass());
			
			
		else if(propertyDescriptor instanceof ChildPropertyDescriptor)//一个ASTNode
			ChildPropertyDescriptor childPropertyDescriptor = (ChildPropertyDescriptor)propertyDescriptor;
			Object child = node.getStructuralProperty(childPropertyDescriptor);
			ASTNode childNode = (ASTNode)child;
			if(childNode == null)
				continue;
			hasChildren = true;
			//获取了这个节点
			myNode.childrenNodes.add(childNode);
			myNode.childrenLables.add((++ID));
			getDirectChildren(childNode, ID, Nodes);//继续递归
			
			//System.out.println("child:   "+childNode +"  "+childNode.getClass());
		
	
	if(hasChildren)
		//进行递归子节点
		myNode.isLeaf = false;
	
	else
		//结束，是叶子结点
		myNode.isLeaf = true;