org.sweble.wikitext.lazy.utils.NodeStats Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of swc-parser-lazy Show documentation
A parser for MediaWiki's Wikitext.
There is a newer version: 3.1.9
/**
 * Copyright 2011 The Open Source Research Group,
 *                University of Erlangen-Nürnberg
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.sweble.wikitext.lazy.utils;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import de.fau.cs.osr.ptk.common.AstVisitor;
import de.fau.cs.osr.ptk.common.ast.AstNode;
import de.fau.cs.osr.utils.StringUtils;

public class NodeStats
{
	public static void process(AstNode astNode)
	{
		new NodeStatsVisitor().go(astNode);
	}
	
	protected static final class NodeStatsVisitor
			extends
				AstVisitor
	{
		private final Map nodeCounts =
				new HashMap();
		
		private int varCount = 0;
		
		private int varEmptyCount = 0;
		
		private int varChildCount = 0;
		
		private int varMaxChildCount = -1;
		
		private int fixCount = 0;
		
		private int fixChildCount = 0;
		
		private int leafCount = 0;
		
		@Override
		protected Object after(AstNode node, Object result)
		{
			System.out.println("Analysis:");
			
			List nodeNames = new ArrayList(nodeCounts.keySet());
			Collections.sort(nodeNames);
			
			int sum = 0;
			for (String name : nodeNames)
			{
				int count = nodeCounts.get(name);
				sum += count;
				
				String space = StringUtils.strrep('.', 80 - name.length());
				
				System.out.format("  %s %s %5d\n", name, space, count);
			}
			
			System.out.println("  " + StringUtils.strrep('=', 87));
			System.out.format("  %s%5d\n", StringUtils.strrep(' ', 82), sum);
			
			System.out.println();
			System.out.println("  Nodes with variable number of children: ");
			System.out.format("     Count:   %5d\n", varCount);
			System.out.format("     Leaf:    %5d\n", varEmptyCount);
			System.out.format("     Biggest: %5d\n", varMaxChildCount);
			System.out.format("     Average:    %5.2f\n", varChildCount / (float) (varCount - varEmptyCount));
			
			System.out.println();
			System.out.println("  Nodes with fixed number of children: ");
			System.out.format("     Inner:   %5d\n", fixCount);
			System.out.format("     Leafs:   %5d\n", leafCount);
			System.out.format("     Average:    %5.2f\n", fixChildCount / (float) fixCount);
			
			return super.after(node, result);
		}
		
		public void visit(AstNode n)
		{
			if (n != null)
			{
				countNode(n);
				
				int size = n.size();
				if (n.isList())
				{
					++varCount;
					varChildCount += size;
					if (n.isEmpty())
						++varEmptyCount;
					if (size > varMaxChildCount)
						varMaxChildCount = size;
				}
				else
				{
					if (!n.isEmpty())
					{
						++fixCount;
						fixChildCount += size;
					}
					else
					{
						++leafCount;
					}
				}
				
				iterate(n);
			}
		}
		
		private void countNode(AstNode n)
		{
			Class clazz = n.getClass();
			String name = clazz.getName();
			
			Integer i = nodeCounts.get(name);
			if (i == null)
				i = 0;
			
			nodeCounts.put(name, i + 1);
		}
	}
}