microtik tool to vie another router in a network

源代码在线查看: g.java

软件大小: 85 K
上传用户: cjf0426
关键词: microtik another network router
下载地址: 免注册下载 普通下载 VIP

相关代码

				package com.hoya.util.code;
				
				public final class g
				{
				  static boolean a = false;
				  static final int[] b = { 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 43, 47 };
				  static final int[] c = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, 99, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 };
				
				  public static final byte[] a(byte[] paramArrayOfByte)
				  {
				    int i;
				    int j = ((i = paramArrayOfByte.length) + 2) / 3 * 4;
				    if (a)
				      if ((j += j / 72) % 72 != 0)
				        ++j;
				    byte[] arrayOfByte = new byte[j];
				    int l = 0;
				    int i1 = 0;
				    while (true)
				    {
				      int i2 = 0;
				      do
				      {
				        if (i 				          break label251;
				        int k = (i == 2) ? paramArrayOfByte[(l++)] 				        for (int i3 = 18; i3 >= 0; i3 -= 6)
				          arrayOfByte[(i1++)] = (byte)b[(k >>> i3 & 0x3F)];
				        if (i < 3)
				          arrayOfByte[(--i1)] = 61;
				        if (i < 2)
				          arrayOfByte[(--i1)] = 61;
				        i -= 3;
				      }
				      while ((!(a)) || (++i2 != 18));
				      arrayOfByte[(i1++)] = 13;
				      arrayOfByte[(i1++)] = 10;
				    }
				    label251: return arrayOfByte;
				  }
				
				  public static final byte[] b(byte[] paramArrayOfByte)
				  {
				    int i;
				    byte[] arrayOfByte1 = new byte[i = (int)(paramArrayOfByte.length * 0.75D)];
				    int j = 0;
				    int k = 0;
				    int l = paramArrayOfByte.length;
				    int i1 = 0;
				    int i2 = 0;
				    int i3 = 0;
				    do
				    {
				      do
				      {
				        if (j >= l)
				          break label192;
				        i2 = (byte)c[paramArrayOfByte[j]];
				        i3 = (byte)c[paramArrayOfByte[(j + 1)]];
				        if (i2 == 99)
				          break label192;
				        if (i3 == 99);
				        arrayOfByte1[(k++)] = (byte)(i2 >> 2 : (switch (i1)) ? i3 >>> 4 : i3));
				        ++j;
				      }
				      while (++i1 != 3);
				      i1 = 0;
				      ++j;
				    }
				    while ((!(a)) || (j % 72 != 0));
				    label192: byte[] arrayOfByte2 = new byte[k];
				    System.arraycopy(arrayOfByte1, 0, arrayOfByte2, 0, k);
				    return arrayOfByte2;
				  }
				}			

相关资源