开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > Windows编程 > .net编程 > 查看源码
xb0f0f2071b49b1cb.cs
资源名称：Csharp_skin.rar　[点击查看]
上传用户：xlxx0122
上传日期：2015-04-24
资源大小：3904k
文件大小：3k
源码类别：

.net编程

开发平台：

C#

xb0f0f2071b49b1cb.cs：源码内容
  1. namespace Sunisoft.IrisSkin
  2. {
  3.     using System;
  5.     internal class xb0f0f2071b49b1cb
  6.     {
  7.         private int xca3516d7e7bf3e88;
  8.         private int[] xd56734c5eb5c07a0;
  9.         private int xda0cfe0865a46405;
  11.         public xb0f0f2071b49b1cb(int defMaxCodeLen)
  12.         {
  13.             this.xda0cfe0865a46405 = defMaxCodeLen;
  14.         }
  16.         public void Build(int[] CodeLenths, int StartInx, int Count, byte[] ExtraBits, int ExtraOffset)
  17.         {
  18.             int num3;
  19.             int[] numArray = new int[0x10];
  20.             int[] numArray2 = new int[0x10];
  21.             this.xca3516d7e7bf3e88 = 0;
  22.             for (int i = 0; i < Count; i++)
  23.             {
  24.                 num3 = CodeLenths[i + StartInx];
  25.                 if (num3 > this.xca3516d7e7bf3e88)
  26.                 {
  27.                     this.xca3516d7e7bf3e88 = num3;
  28.                 }
  29.                 numArray[num3]++;
  30.             }
  31.             int num5 = x71589e3f55261426.PowerOfTwo[this.xca3516d7e7bf3e88];
  32.             this.xd56734c5eb5c07a0 = new int[num5 * 4];
  33.             int num7 = num5;
  34.             for (int j = 0; j < (num5 * 4); j++)
  35.             {
  36.                 this.xd56734c5eb5c07a0[j] = 0;
  37.             }
  38.             int num2 = 0;
  39.             numArray[0] = 0;
  40.             for (int k = 1; k <= this.xda0cfe0865a46405; k++)
  41.             {
  42.                 num2 = (num2 + numArray[k - 1]) << 1;
  43.                 numArray2[k] = num2;
  44.             }
  45.             int[] numArray3 = this.xd56734c5eb5c07a0;
  46.             for (int m = 0; m < Count; m++)
  47.             {
  48.                 num3 = CodeLenths[m + StartInx];
  49.                 if (num3 != 0)
  50.                 {
  51.                     num2 = numArray2[num3];
  52.                     int num12 = shr(num2 & 0xff00, 8);
  53.                     int index = num2 & 0xff;
  54.                     int num13 = num12;
  55.                     num12 = x71589e3f55261426.ByteRevTable[index];
  56.                     index = x71589e3f55261426.ByteRevTable[num13];
  57.                     num2 = ((num2 - (num2 & 0xffff)) + (num12 << 8)) + index;
  58.                     num2 = shr(num2, 0x10 - num3);
  59.                     int num4 = m + (num3 << 0x10);
  60.                     if (m >= ExtraOffset)
  61.                     {
  62.                         num4 += ExtraBits[m - ExtraOffset] << 0x18;
  63.                     }
  64.                     int num6 = x71589e3f55261426.PowerOfTwo[num3];
  65.                     int num = num2;
  66.                     do
  67.                     {
  68.                         numArray3[num] = num4;
  69.                         num += num6;
  70.                     }
  71.                     while (num < num7);
  72.                     numArray2[num3]++;
  73.                 }
  74.             }
  75.         }
  77.         public int Decode(int lookupBits)
  78.         {
  79.             return this.xd56734c5eb5c07a0[lookupBits];
  80.         }
  82.         public static int shr(int i, int j)
  83.         {
  84.             if (i > 0)
  85.             {
  86.                 return (i >> j);
  87.             }
  88.             return (i >> j);
  89.         }
  91.         public int MaxCodeLen
  92.         {
  93.             get
  94.             {
  95.                 return this.xca3516d7e7bf3e88;
  96.             }
  97.         }
  98.     }
  99. }