All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.scudata.dm.query.utils.ExpressionTranslator Maven / Gradle / Ivy

Go to download

SPL(Structured Process Language) A programming language specially for structured data computing.

There is a newer version: 20241126
Show newest version
package com.scudata.dm.query.utils;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

import com.scudata.common.Logger;

public class ExpressionTranslator //ֻ?ܴ????м?????еı???ʽ??????ֱ??????????SQL???
{
	public static List marksList = new ArrayList();
	public static List funcsList = new ArrayList();

	public static String translateExp(String exp, Map trMap)
	{
		if(exp == null || exp.isEmpty() || trMap == null || trMap.isEmpty())
		{
			return exp;
		}
		//Logger.debug("translateExp beg : "+ exp);		
		exp = moveOutMarks(exp);//???????ܰ????ֶ??????ַ???""
		exp = moveOutFuncs(exp, trMap);//???????ֶ?ͬ???ĺ???fun(
		
		//??????ǰ???̵??ں󣬷?ֹ???İ????̵?
		String[] keyBuf = new String[trMap.size()];
		trMap.keySet().toArray(keyBuf);
		Arrays.sort(keyBuf, new NameComprator()); 
		
		List keyList = new ArrayList();
		List valueList = new ArrayList();
		for(String key : keyBuf)
		{
			String value = trMap.get(key);
			keyList.add(key);
			valueList.add(value);
		}
		
		String specials = "^$.[]*\\?+{}|()";//???????ʽ???????ַ?
		
		//?Ը???Сдͬʱ???ڵ????
		Map> ignoreCaseMap = new LinkedHashMap>();
		for(int i = 0; i < keyList.size(); i++)
		{
			String key = keyList.get(i);
			List ignoreCaseList = ignoreCaseMap.get(key.toLowerCase());
			if(ignoreCaseList != null)
			{
				ignoreCaseList.add(key);
			}
			else
			{
				ignoreCaseList = new ArrayList();
				ignoreCaseList.add(key);
				ignoreCaseMap.put(key.toLowerCase(), ignoreCaseList);
			}
		}
		
		//???ò??ɼ???ʶ?滻????key????ֹ??;?滻??value?а????????key
		for(Map.Entry> ignoreCaseEntry : ignoreCaseMap.entrySet())
		{
			List ignoreCaseList = ignoreCaseEntry.getValue();
			for(String sameKeyIgnoreCase : ignoreCaseList)
			{
				int index = keyList.indexOf(sameKeyIgnoreCase);
				StringBuffer sb = new StringBuffer();
				for(int k = 0; k < sameKeyIgnoreCase.length(); k++)
				{
					char ch = sameKeyIgnoreCase.charAt(k);
					if(specials.indexOf(ch) != -1)
					{
						sb.append('\\');//???????ʽ???????ַ?Ҫ??\
						sb.append(ch);
					}
					else
					{
						sb.append(ch);
					}
				}
				sameKeyIgnoreCase = sb.toString();
				exp = exp.replace(sameKeyIgnoreCase, "" + (char)30 + (index + 1) + (char)31);
			}
			
			String sameKeyIgnoreCase = ignoreCaseList.get(0);
			int index = keyList.indexOf(sameKeyIgnoreCase);
			StringBuffer sb = new StringBuffer();
			for(int k = 0; k < sameKeyIgnoreCase.length(); k++)
			{
				char ch = sameKeyIgnoreCase.charAt(k);
				if(specials.indexOf(ch) != -1)
				{
					sb.append('\\');//???????ʽ???????ַ?Ҫ??\
					sb.append(ch);
				}
				else
				{
					sb.append(ch);
				}
			}
			sameKeyIgnoreCase = sb.toString();
			exp = exp.replaceAll("(?i)" + sameKeyIgnoreCase, "" + (char)30 + (index + 1) + (char)31);
		}
		
		//?????value?滻???в??ɼ???ʶ
		for(int j = 0; j < valueList.size(); j++)
		{
			String value = valueList.get(j);
			exp = exp.replace("" + (char)30 + (j + 1) + (char)31, value);
		}
		
		exp = moveInMarks(exp);
		exp = moveInFuncs(exp);

		//Logger.debug("translateExp end : "+ exp);		

		return exp;
	}
	
	public static String translateExp2(String exp, Map trMap)
	{
		if(exp == null || exp.isEmpty() || trMap == null || trMap.isEmpty())
		{
			return exp;
		}
		
		//??????ǰ???̵??ں󣬷?ֹ???İ????̵?
		String[] keyBuf = new String[trMap.size()];
		trMap.keySet().toArray(keyBuf);
		Arrays.sort(keyBuf, new NameComprator()); 
		
		List keyList = new ArrayList();
		List valueList = new ArrayList();
		for(String key : keyBuf)
		{
			String value = trMap.get(key);
			keyList.add(key);
			valueList.add(value);
		}
		
		String specials = "^$.[]*\\?+{}|()";//???????ʽ???????ַ?
		
		//?Ը???Сдͬʱ???ڵ????
		Map> ignoreCaseMap = new LinkedHashMap>();
		for(int i = 0; i < keyList.size(); i++)
		{
			String key = keyList.get(i);
			List ignoreCaseList = ignoreCaseMap.get(key.toLowerCase());
			if(ignoreCaseList != null)
			{
				ignoreCaseList.add(key);
			}
			else
			{
				ignoreCaseList = new ArrayList();
				ignoreCaseList.add(key);
				ignoreCaseMap.put(key.toLowerCase(), ignoreCaseList);
			}
		}		
				
		//???ò??ɼ???ʶ?滻????key????ֹ??;?滻??value?а????????key
		for(Map.Entry> ignoreCaseEntry : ignoreCaseMap.entrySet())
		{
			List ignoreCaseList = ignoreCaseEntry.getValue();
			for(String sameKeyIgnoreCase : ignoreCaseList)
			{
				int index = keyList.indexOf(sameKeyIgnoreCase);
				StringBuffer sb = new StringBuffer();
				for(int k = 0; k < sameKeyIgnoreCase.length(); k++)
				{
					char ch = sameKeyIgnoreCase.charAt(k);
					if(specials.indexOf(ch) != -1)
					{
						sb.append('\\');//???????ʽ???????ַ?Ҫ??\
						sb.append(ch);
					}
					else
					{
						sb.append(ch);
					}
				}
				sameKeyIgnoreCase = sb.toString();
				exp = exp.replace(sameKeyIgnoreCase, "" + (char)30 + (index + 1) + (char)31);
			}
			
			String sameKeyIgnoreCase = ignoreCaseList.get(0);
			int index = keyList.indexOf(sameKeyIgnoreCase);
			StringBuffer sb = new StringBuffer();
			for(int k = 0; k < sameKeyIgnoreCase.length(); k++)
			{
				char ch = sameKeyIgnoreCase.charAt(k);
				if(specials.indexOf(ch) != -1)
				{
					sb.append('\\');//???????ʽ???????ַ?Ҫ??\
					sb.append(ch);
				}
				else
				{
					sb.append(ch);
				}
			}
			sameKeyIgnoreCase = sb.toString();
			exp = exp.replaceAll("(?i)" + sameKeyIgnoreCase, "" + (char)30 + (index + 1) + (char)31);
		}		
		
		//?????value?滻???в??ɼ???ʶ
		for(int j = 0; j < valueList.size(); j++)
		{
			String value = valueList.get(j);
			exp = exp.replace("" + (char)30 + (j + 1) + (char)31, value);
		}
		
		return exp;
	}
	
	public static boolean containExp(String exp, Set scSet)
	{
		if(exp == null || exp.isEmpty() || scSet == null || scSet.isEmpty())
		{
			return false;
		}
		
		for(String sc : scSet)
		{
			if(sc != null && !sc.isEmpty() && exp.toLowerCase().indexOf(sc.toLowerCase()) != -1)
			{
				return true;
			}
		}
		
		return false;
	}
	
	private static String moveOutMarks(String exp)
	{
		Pattern pattern = Pattern.compile("\"([\\s\\S]*?)\"");
		Matcher matcher = pattern.matcher(exp);
		while(matcher.find())
		{
			String marks = matcher.group(0);
			marksList.add(marks);
			int index = exp.indexOf(marks);
			exp = new StringBuffer(exp).replace(index, index + marks.length(), "" + (char)14 + marksList.size() + (char)15).toString();
		}
		return exp;
	}
	
	private static String moveInMarks(String exp)
	{
		for(int i = 0, sz = marksList.size(); i < sz; i++)
		{
			String marks = marksList.get(i);
			int index = exp.indexOf("" + (char)14 + (i + 1) + (char)15);
			exp = new StringBuffer(exp).replace(index, index + ("" + (char)14 + (i + 1) + (char)15).length(), marks).toString();
		}
		marksList.clear();
		return exp;
	}
	
	private static String moveOutFuncs(String exp, Map trMap)
	{
		Next:
		for(String name : trMap.keySet())
		{
			for(int i = 0; i < name.length(); i++)
			{
				char ch = name.charAt(i);
				if(i == 0)
				{
					if(!Character.isJavaIdentifierStart(ch))
					{
						continue Next;
					}
				}
				else
				{
					if(!Character.isJavaIdentifierPart(ch))
					{
						continue Next;
					}
				}
			}

			Pattern pattern = Pattern.compile("(?i)" + name + "\\(");
			Matcher matcher = pattern.matcher(exp);
			while(matcher.find())
			{
				String func = matcher.group(0);
				funcsList.add(func);
				int index = exp.indexOf(func);
				exp = new StringBuffer(exp).replace(index, index + func.length(), "" + (char)16 + funcsList.size() + (char)17).toString();
			}
		}
		return exp;
	}
	
	private static String moveInFuncs(String exp)
	{
		for(int i = 0, sz = funcsList.size(); i < sz; i++)
		{
			String func = funcsList.get(i);
			int index = exp.indexOf("" + (char)16 + (i + 1) + (char)17);
			exp = new StringBuffer(exp).replace(index, index + ("" + (char)16 + (i + 1) + (char)17).length(), func).toString();
		}
		funcsList.clear();
		return exp;
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy