summaryrefslogtreecommitdiff
path: root/Client/Assets/Scripts/XUtliPoolLib/Ionic/Zlib/Tree.cs
diff options
context:
space:
mode:
authorchai <chaifix@163.com>2021-01-25 14:28:30 +0800
committerchai <chaifix@163.com>2021-01-25 14:28:30 +0800
commit6eb915c129fc90c6f4c82ae097dd6ffad5239efc (patch)
tree7dd2be50edf41f36b60fac84696e731c13afe617 /Client/Assets/Scripts/XUtliPoolLib/Ionic/Zlib/Tree.cs
+scripts
Diffstat (limited to 'Client/Assets/Scripts/XUtliPoolLib/Ionic/Zlib/Tree.cs')
-rw-r--r--Client/Assets/Scripts/XUtliPoolLib/Ionic/Zlib/Tree.cs1184
1 files changed, 1184 insertions, 0 deletions
diff --git a/Client/Assets/Scripts/XUtliPoolLib/Ionic/Zlib/Tree.cs b/Client/Assets/Scripts/XUtliPoolLib/Ionic/Zlib/Tree.cs
new file mode 100644
index 00000000..5f250c1b
--- /dev/null
+++ b/Client/Assets/Scripts/XUtliPoolLib/Ionic/Zlib/Tree.cs
@@ -0,0 +1,1184 @@
+using System;
+
+namespace Ionic.Zlib
+{
+ internal sealed class Tree
+ {
+ private static readonly int HEAP_SIZE = 2 * InternalConstants.L_CODES + 1;
+
+ internal static readonly int[] ExtraLengthBits = new int[]
+ {
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 1,
+ 1,
+ 1,
+ 2,
+ 2,
+ 2,
+ 2,
+ 3,
+ 3,
+ 3,
+ 3,
+ 4,
+ 4,
+ 4,
+ 4,
+ 5,
+ 5,
+ 5,
+ 5,
+ 0
+ };
+
+ internal static readonly int[] ExtraDistanceBits = new int[]
+ {
+ 0,
+ 0,
+ 0,
+ 0,
+ 1,
+ 1,
+ 2,
+ 2,
+ 3,
+ 3,
+ 4,
+ 4,
+ 5,
+ 5,
+ 6,
+ 6,
+ 7,
+ 7,
+ 8,
+ 8,
+ 9,
+ 9,
+ 10,
+ 10,
+ 11,
+ 11,
+ 12,
+ 12,
+ 13,
+ 13
+ };
+
+ internal static readonly int[] extra_blbits = new int[]
+ {
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 0,
+ 2,
+ 3,
+ 7
+ };
+
+ internal static readonly sbyte[] bl_order = new sbyte[]
+ {
+ 16,
+ 17,
+ 18,
+ 0,
+ 8,
+ 7,
+ 9,
+ 6,
+ 10,
+ 5,
+ 11,
+ 4,
+ 12,
+ 3,
+ 13,
+ 2,
+ 14,
+ 1,
+ 15
+ };
+
+ internal const int Buf_size = 16;
+
+ private static readonly sbyte[] _dist_code = new sbyte[]
+ {
+ 0,
+ 1,
+ 2,
+ 3,
+ 4,
+ 4,
+ 5,
+ 5,
+ 6,
+ 6,
+ 6,
+ 6,
+ 7,
+ 7,
+ 7,
+ 7,
+ 8,
+ 8,
+ 8,
+ 8,
+ 8,
+ 8,
+ 8,
+ 8,
+ 9,
+ 9,
+ 9,
+ 9,
+ 9,
+ 9,
+ 9,
+ 9,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 10,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 11,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 12,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 13,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 14,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 15,
+ 0,
+ 0,
+ 16,
+ 17,
+ 18,
+ 18,
+ 19,
+ 19,
+ 20,
+ 20,
+ 20,
+ 20,
+ 21,
+ 21,
+ 21,
+ 21,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 28,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29,
+ 29
+ };
+
+ internal static readonly sbyte[] LengthCode = new sbyte[]
+ {
+ 0,
+ 1,
+ 2,
+ 3,
+ 4,
+ 5,
+ 6,
+ 7,
+ 8,
+ 8,
+ 9,
+ 9,
+ 10,
+ 10,
+ 11,
+ 11,
+ 12,
+ 12,
+ 12,
+ 12,
+ 13,
+ 13,
+ 13,
+ 13,
+ 14,
+ 14,
+ 14,
+ 14,
+ 15,
+ 15,
+ 15,
+ 15,
+ 16,
+ 16,
+ 16,
+ 16,
+ 16,
+ 16,
+ 16,
+ 16,
+ 17,
+ 17,
+ 17,
+ 17,
+ 17,
+ 17,
+ 17,
+ 17,
+ 18,
+ 18,
+ 18,
+ 18,
+ 18,
+ 18,
+ 18,
+ 18,
+ 19,
+ 19,
+ 19,
+ 19,
+ 19,
+ 19,
+ 19,
+ 19,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 20,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 21,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 22,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 23,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 24,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 25,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 26,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 27,
+ 28
+ };
+
+ internal static readonly int[] LengthBase = new int[]
+ {
+ 0,
+ 1,
+ 2,
+ 3,
+ 4,
+ 5,
+ 6,
+ 7,
+ 8,
+ 10,
+ 12,
+ 14,
+ 16,
+ 20,
+ 24,
+ 28,
+ 32,
+ 40,
+ 48,
+ 56,
+ 64,
+ 80,
+ 96,
+ 112,
+ 128,
+ 160,
+ 192,
+ 224,
+ 0
+ };
+
+ internal static readonly int[] DistanceBase = new int[]
+ {
+ 0,
+ 1,
+ 2,
+ 3,
+ 4,
+ 6,
+ 8,
+ 12,
+ 16,
+ 24,
+ 32,
+ 48,
+ 64,
+ 96,
+ 128,
+ 192,
+ 256,
+ 384,
+ 512,
+ 768,
+ 1024,
+ 1536,
+ 2048,
+ 3072,
+ 4096,
+ 6144,
+ 8192,
+ 12288,
+ 16384,
+ 24576
+ };
+
+ internal short[] dyn_tree;
+
+ internal int max_code;
+
+ internal StaticTree staticTree;
+
+ internal static int DistanceCode(int dist)
+ {
+ return (int)((dist < 256) ? Tree._dist_code[dist] : Tree._dist_code[256 + SharedUtils.URShift(dist, 7)]);
+ }
+
+ internal void gen_bitlen(DeflateManager s)
+ {
+ short[] array = this.dyn_tree;
+ short[] treeCodes = this.staticTree.treeCodes;
+ int[] extraBits = this.staticTree.extraBits;
+ int extraBase = this.staticTree.extraBase;
+ int maxLength = this.staticTree.maxLength;
+ int num = 0;
+ for (int i = 0; i <= InternalConstants.MAX_BITS; i++)
+ {
+ s.bl_count[i] = 0;
+ }
+ array[s.heap[s.heap_max] * 2 + 1] = 0;
+ int j;
+ for (j = s.heap_max + 1; j < Tree.HEAP_SIZE; j++)
+ {
+ int k = s.heap[j];
+ int i = (int)(array[(int)(array[k * 2 + 1] * 2 + 1)] + 1);
+ bool flag = i > maxLength;
+ if (flag)
+ {
+ i = maxLength;
+ num++;
+ }
+ array[k * 2 + 1] = (short)i;
+ bool flag2 = k > this.max_code;
+ if (!flag2)
+ {
+ short[] bl_count = s.bl_count;
+ int num2 = i;
+ bl_count[num2] += 1;
+ int num3 = 0;
+ bool flag3 = k >= extraBase;
+ if (flag3)
+ {
+ num3 = extraBits[k - extraBase];
+ }
+ short num4 = array[k * 2];
+ s.opt_len += (int)num4 * (i + num3);
+ bool flag4 = treeCodes != null;
+ if (flag4)
+ {
+ s.static_len += (int)num4 * ((int)treeCodes[k * 2 + 1] + num3);
+ }
+ }
+ }
+ bool flag5 = num == 0;
+ if (!flag5)
+ {
+ do
+ {
+ int i = maxLength - 1;
+ while (s.bl_count[i] == 0)
+ {
+ i--;
+ }
+ short[] bl_count2 = s.bl_count;
+ int num5 = i;
+ bl_count2[num5] -= 1;
+ s.bl_count[i + 1] = (short) ( s.bl_count[i + 1] + 2 );
+ short[] bl_count3 = s.bl_count;
+ int num6 = maxLength;
+ bl_count3[num6] -= 1;
+ num -= 2;
+ }
+ while (num > 0);
+ for (int i = maxLength; i != 0; i--)
+ {
+ int k = (int)s.bl_count[i];
+ while (k != 0)
+ {
+ int num7 = s.heap[--j];
+ bool flag6 = num7 > this.max_code;
+ if (!flag6)
+ {
+ bool flag7 = (int)array[num7 * 2 + 1] != i;
+ if (flag7)
+ {
+ s.opt_len = (int)((long)s.opt_len + ((long)i - (long)array[num7 * 2 + 1]) * (long)array[num7 * 2]);
+ array[num7 * 2 + 1] = (short)i;
+ }
+ k--;
+ }
+ }
+ }
+ }
+ }
+
+ internal void build_tree(DeflateManager s)
+ {
+ short[] array = this.dyn_tree;
+ short[] treeCodes = this.staticTree.treeCodes;
+ int elems = this.staticTree.elems;
+ int num = -1;
+ s.heap_len = 0;
+ s.heap_max = Tree.HEAP_SIZE;
+ int num2;
+ for (int i = 0; i < elems; i++)
+ {
+ bool flag = array[i * 2] != 0;
+ if (flag)
+ {
+ int[] heap = s.heap;
+ num2 = s.heap_len + 1;
+ s.heap_len = num2;
+ num = (heap[num2] = i);
+ s.depth[i] = 0;
+ }
+ else
+ {
+ array[i * 2 + 1] = 0;
+ }
+ }
+ int num3;
+ while (s.heap_len < 2)
+ {
+ int[] heap2 = s.heap;
+ num2 = s.heap_len + 1;
+ s.heap_len = num2;
+ num3 = (heap2[num2] = ((num < 2) ? (++num) : 0));
+ array[num3 * 2] = 1;
+ s.depth[num3] = 0;
+ s.opt_len--;
+ bool flag2 = treeCodes != null;
+ if (flag2)
+ {
+ s.static_len -= (int)treeCodes[num3 * 2 + 1];
+ }
+ }
+ this.max_code = num;
+ for (int i = s.heap_len / 2; i >= 1; i--)
+ {
+ s.pqdownheap(array, i);
+ }
+ num3 = elems;
+ do
+ {
+ int i = s.heap[1];
+ int[] heap3 = s.heap;
+ int num4 = 1;
+ int[] heap4 = s.heap;
+ num2 = s.heap_len;
+ s.heap_len = num2 - 1;
+ heap3[num4] = heap4[num2];
+ s.pqdownheap(array, 1);
+ int num5 = s.heap[1];
+ int[] heap5 = s.heap;
+ num2 = s.heap_max - 1;
+ s.heap_max = num2;
+ heap5[num2] = i;
+ int[] heap6 = s.heap;
+ num2 = s.heap_max - 1;
+ s.heap_max = num2;
+ heap6[num2] = num5;
+ array[num3 * 2] = (short) ( array[i * 2] + array[num5 * 2] );
+ s.depth[num3] = (sbyte)(Math.Max((byte)s.depth[i], (byte)s.depth[num5]) + 1);
+ array[i * 2 + 1] = (array[num5 * 2 + 1] = (short)num3);
+ s.heap[1] = num3++;
+ s.pqdownheap(array, 1);
+ }
+ while (s.heap_len >= 2);
+ int[] heap7 = s.heap;
+ num2 = s.heap_max - 1;
+ s.heap_max = num2;
+ heap7[num2] = s.heap[1];
+ this.gen_bitlen(s);
+ Tree.gen_codes(array, num, s.bl_count);
+ }
+
+ internal static void gen_codes(short[] tree, int max_code, short[] bl_count)
+ {
+ short[] array = new short[InternalConstants.MAX_BITS + 1];
+ short num = 0;
+ for (int i = 1; i <= InternalConstants.MAX_BITS; i++)
+ {
+ num = (array[i] = (short)(num + bl_count[i - 1] << 1));
+ }
+ for (int j = 0; j <= max_code; j++)
+ {
+ int num2 = (int)tree[j * 2 + 1];
+ bool flag = num2 == 0;
+ if (!flag)
+ {
+ int num3 = j * 2;
+ short[] array2 = array;
+ int num4 = num2;
+ short num5 = array2[num4];
+ array2[num4] = (short) ( num5 + 1 );
+ tree[num3] = (short)Tree.bi_reverse((int)num5, num2);
+ }
+ }
+ }
+
+ internal static int bi_reverse(int code, int len)
+ {
+ int num = 0;
+ do
+ {
+ num |= (code & 1);
+ code >>= 1;
+ num <<= 1;
+ }
+ while (--len > 0);
+ return num >> 1;
+ }
+ }
+}
generated by cgit v1.1-26-g67d0 at 2025-05-19 15:27:55 +0000