Repository navigation
Expand file tree
/
Copy pathJSONzip.java
More file actions
287 lines (247 loc) · 7.95 KB
/
Copy pathJSONzip.java
File metadata and controls
287 lines (247 loc) · 7.95 KB
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
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
52
53
54
55
56
57
58
59
60
61
62
63
64
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
91
92
93
94
95
96
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
package org.json.zip;
/*
Copyright (c) 2013 JSON.org
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
The Software shall be used for Good, not Evil.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
/**
* JSONzip is a binary-encoded JSON dialect. It is designed to compress the
* messages in a session in bandwidth constrained applications, such as mobile.
*
* JSONzip is adaptive, so with each message seen, it should
* improve its compression. It minimizes JSON's overhead, reducing punctuation
* to a small number of bits. It uses Huffman encoding to reduce the average
* size of characters. It uses caches (or Keeps) to keep recently seen strings
* and values, so repetitive content (such as object keys) can be
* substantially reduced. It uses a character encoding called Kim (Keep it
* minimal) that is smaller than UTF-8 for most East European, African, and
* Asian scripts.
*
* JSONzip tends to reduce most content by about half. If there is a lot of
* recurring information, the reduction can be much more dramatic.
*
* FOR EVALUATION PURPOSES ONLY. THIS PACKAGE HAS NOT YET BEEN TESTED
* ADEQUATELY FOR PRODUCTION USE.
*
* @author JSON.org
* @version 2014-04-21
*/
public abstract class JSONzip implements None, PostMortem {
/**
* Powers of 2.
*/
public static final int[] twos = {
1, 2, 4, 8, 16, 32, 64, 128, 256, 512,
1024, 2048, 4096, 8192, 16384, 32768, 65536
};
/**
* The characters in JSON numbers can be reduced to 4 bits each.
*/
public static final byte[] bcd = {
'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.', '-', '+', 'E'
};
/**
* The number of integers that can be encoded in 4 bits.
*/
public static final long int4 = 16;
/**
* The number of integers that can be encoded in 7 bits.
*/
public static final long int7 = 128;
/**
* The number of integers that can be encoded in 14 bits.
*/
public static final long int14 = 16384;
/**
* The end of string code.
*/
public static final int end = 256;
/**
* The end of number code.
*/
public static final int endOfNumber = bcd.length;
/**
* The maximum substring length when registering many. The registration of
* one substring may be longer.
*/
public static final int maxSubstringLength = 10;
/**
* The minimum substring length.
*/
public static final int minSubstringLength = 3;
/**
* The package supports tracing for debugging.
*/
public static final boolean probe = false;
/**
* The maximum number of substrings added to the substrings keep per
* string.
*/
public static final int substringLimit = 40;
/**
* The value code for an empty object.
*/
public static final int zipEmptyObject = 0;
/**
* The value code for an empty array.
*/
public static final int zipEmptyArray = 1;
/**
* The value code for true.
*/
public static final int zipTrue = 2;
/**
* The value code for false.
*/
public static final int zipFalse = 3;
/**
* The value code for null.
*/
public static final int zipNull = 4;
/**
* The value code for a non-empty object.
*/
public static final int zipObject = 5;
/**
* The value code for an array with a string as its first element.
*/
public static final int zipArrayString = 6;
/**
* The value code for an array with a non-string value as its first element.
*/
public static final int zipArrayValue = 7;
/**
* A Huffman encoder for names.
*/
protected final Huff namehuff;
/**
* A place to keep the names (keys).
*/
protected final MapKeep namekeep;
/**
* A place to keep the strings.
*/
protected final MapKeep stringkeep;
/**
* A Huffman encoder for string values.
*/
protected final Huff substringhuff;
/**
* A place to keep the strings.
*/
protected final TrieKeep substringkeep;
/**
* A place to keep the values.
*/
protected final MapKeep values;
/**
* Initialize the data structures.
*/
protected JSONzip() {
this.namehuff = new Huff(end + 1);
this.namekeep = new MapKeep(9);
this.stringkeep = new MapKeep(11);
this.substringhuff = new Huff(end + 1);
this.substringkeep = new TrieKeep(12);
this.values = new MapKeep(10);
// Increase the weights of the ASCII letters, digits, and special characters
// because they are highly likely to occur more frequently. The weight of each
// character will increase as it is used. The Huffman encoder will tend to
// use fewer bits to encode heavier characters.
this.namehuff.tick(' ', '}');
this.namehuff.tick('a', 'z');
this.namehuff.tick(end);
this.namehuff.tick(end);
this.substringhuff.tick(' ', '}');
this.substringhuff.tick('a', 'z');
this.substringhuff.tick(end);
this.substringhuff.tick(end);
}
/**
*
*/
protected void begin() {
this.namehuff.generate();
this.substringhuff.generate();
}
/**
* Write an end-of-line to the console.
*/
static void log() {
log("\n");
}
/**
* Write an integer to the console.
*
* @param integer
*/
static void log(int integer) {
log(integer + " ");
}
/**
* Write two integers, separated by ':' to the console.
* The second integer is suppressed if it is 1.
*
* @param integer
* @param width
*/
static void log(int integer, int width) {
if (width == 1) {
log(integer);
} else {
log(integer + ":" + width + " ");
}
}
/**
* Write a string to the console.
*
* @param string
*/
static void log(String string) {
System.out.print(string);
}
/**
* Write a character or its code to the console.
*
* @param integer
* @param width
*/
static void logchar(int integer, int width) {
if (integer > ' ' && integer <= '}') {
log("'" + (char) integer + "':" + width + " ");
} else {
log(integer, width);
}
}
/**
* This method is used for testing the implementation of JSONzip. It is not
* suitable for any other purpose. It is used to compare a Compressor and a
* Decompressor, verifying that the data structures that were built during
* zipping and unzipping were the same.
*
* @return true if the structures match.
*/
public boolean postMortem(PostMortem pm) {
JSONzip that = (JSONzip) pm;
return this.namehuff.postMortem(that.namehuff)
&& this.namekeep.postMortem(that.namekeep)
&& this.stringkeep.postMortem(that.stringkeep)
&& this.substringhuff.postMortem(that.substringhuff)
&& this.substringkeep.postMortem(that.substringkeep)
&& this.values.postMortem(that.values);
}
}