org.sweble.wikitext.engine.ext.ParserFunctionIfeq Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of swc-engine Show documentation

A minimal engine using the Sweble Wikitext Parser to process articles in the context of a MediaWiki-like configuration.

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.engine.ext;

import java.util.LinkedList;

import org.sweble.wikitext.engine.ExpansionFrame;
import org.sweble.wikitext.engine.ParserFunctionBase;
import org.sweble.wikitext.lazy.preprocessor.Template;
import org.sweble.wikitext.lazy.utils.StringConversionException;
import org.sweble.wikitext.lazy.utils.StringConverter;
import org.sweble.wikitext.lazy.utils.TextUtils;

import de.fau.cs.osr.ptk.common.ast.AstNode;
import de.fau.cs.osr.ptk.common.ast.NodeList;

public class ParserFunctionIfeq
        extends
            ParserFunctionBase
{
	private static final long serialVersionUID = 1L;
	
	public ParserFunctionIfeq()
	{
		super("#ifeq");
	}
	
	@Override
	public AstNode invoke(Template template, ExpansionFrame preprocessorFrame, LinkedList args)
	{
		if (args.size() < 3)
			return new NodeList();
		
		AstNode arg0 = preprocessorFrame.expand(args.get(0));
		AstNode arg1 = preprocessorFrame.expand(args.get(1));
		
		String a = null;
		String b = null;
		try
		{
			a = StringConverter.convert(arg0).trim();
			b = StringConverter.convert(arg1).trim();
		}
		catch (StringConversionException e1)
		{
			// FIXME: Do recursive equality check
		}
		
		boolean eval = false;
		if (a != null && b != null)
		{
			boolean numbers = false;
			double ia = -1;
			double ib = +1;
			try
			{
				ia = Double.parseDouble(a);
				ib = Double.parseDouble(b);
				numbers = true;
			}
			catch (NumberFormatException e)
			{
				numbers = false;
			}
			
			if (numbers)
			{
				eval = ia == ib;
			}
			else
			{
				eval = a.equals(b);
			}
		}
		
		AstNode result;
		if (eval)
		{
			result = args.get(2);
		}
		else
		{
			result = null;
			if (args.size() >= 4)
				result = args.get(3);
		}
		
		if (result != null)
			result = preprocessorFrame.expand(result);
		
		if (result == null)
			result = new NodeList();
		
		if (result.isNodeType(AstNode.NT_NODE_LIST))
			return TextUtils.trim((NodeList) result);
		
		return result;
	}
}