Chronicle 4 branch.

L2J_Mobius_C4/java/com/l2jmobius/util/Util.java

@@ -0,0 +1,130 @@
+/*
+ * This file is part of the L2J Mobius project.
+ * 
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ * 
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * General Public License for more details.
+ * 
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ */
+package com.l2jmobius.util;
+
+import java.net.UnknownHostException;
+
+import javolution.text.TextBuilder;
+
+/**
+ * This class ...
+ * @version $Revision: 1.2 $ $Date: 2004/06/27 08:12:59 $
+ */
+public class Util
+{
+	public static boolean isInternalIP(String ipAddress)
+	{
+		java.net.InetAddress addr = null;
+		try
+		{
+			addr = java.net.InetAddress.getByName(ipAddress);
+			return addr.isSiteLocalAddress() || addr.isLoopbackAddress();
+		}
+		catch (final UnknownHostException e)
+		{
+			e.printStackTrace();
+		}
+		return false;
+	}
+	
+	public static String printData(byte[] data, int len)
+	{
+		final TextBuilder result = new TextBuilder();
+		
+		int counter = 0;
+		
+		for (int i = 0; i < len; i++)
+		{
+			if ((counter % 16) == 0)
+			{
+				result.append(fillHex(i, 4) + ": ");
+			}
+			
+			result.append(fillHex(data[i] & 0xff, 2) + " ");
+			counter++;
+			if (counter == 16)
+			{
+				result.append("   ");
+				
+				int charpoint = i - 15;
+				for (int a = 0; a < 16; a++)
+				{
+					final int t1 = data[charpoint++];
+					if ((t1 > 0x1f) && (t1 < 0x80))
+					{
+						result.append((char) t1);
+					}
+					else
+					{
+						result.append('.');
+					}
+				}
+				
+				result.append("\n");
+				counter = 0;
+			}
+		}
+		
+		final int rest = data.length % 16;
+		if (rest > 0)
+		{
+			for (int i = 0; i < (17 - rest); i++)
+			{
+				result.append("   ");
+			}
+			
+			int charpoint = data.length - rest;
+			for (int a = 0; a < rest; a++)
+			{
+				final int t1 = data[charpoint++];
+				if ((t1 > 0x1f) && (t1 < 0x80))
+				{
+					result.append((char) t1);
+				}
+				else
+				{
+					result.append('.');
+				}
+			}
+			
+			result.append("\n");
+		}
+		
+		return result.toString();
+	}
+	
+	public static String fillHex(int data, int digits)
+	{
+		String number = Integer.toHexString(data);
+		
+		for (int i = number.length(); i < digits; i++)
+		{
+			number = "0" + number;
+		}
+		
+		return number;
+	}
+	
+	/**
+	 * @param raw
+	 * @return
+	 */
+	public static String printData(byte[] raw)
+	{
+		return printData(raw, raw.length);
+	}
+}