⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 mmsencodingutility.java

📁 Messaging- MIDP的是一个彩信客户端
💻 JAVA
字号:
/*
 *  JVending - J2ME MMS Client
 *  Copyright (C) 2004  Shane Isbell
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License as published by the Free Software Foundation; either
 *  version 2.1 of the License, or (at your option) any later version.
 *
 *  This library 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
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

package org.jvending.messaging.impl.util;

/**
 * @author Shane Isbell
 * @version 1.0.0a
 * @created 04/03/27
 */

public class MmsEncodingUtility {

    public static byte[] encodeMultiOctetInteger(long x) {
        byte[] b = new byte[32];
        int i = 0;
          int j = 0;
          do {
                j = (int) (x % 128L);
                if(i != 0)
                    b[i] = (byte) (j - 128);
                else
                    b[i] = (byte) j;
              x = x / 128L;
              if(x == 0L) break;
          } while(i++ < 32);

          byte[] c = new byte[i + 1];
          for(int k = 0; k < i + 1; k++) {
              c[k] = b[i - k];
          }
          return c;
    }

    public static byte[] encodeUintvarInteger(long x) {
	byte[] b = new byte[5];
	int i = 0;
      int j = 0;
      do {
            j = (int) (x % 128L);
            if(i != 0)
                b[i] = (byte) (j - 128);
            else 
                b[i] = (byte) j;
          x = x / 128L;
          if(x == 0L) break;
      } while(i++ < 5);

      byte[] c = new byte[i + 1];
      for(int k = 0; k < i + 1; k++) {
          c[k] = b[i - k];
      }
      return c;
    }
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -