Package xbird.util.collections

Examples of xbird.util.collections.CharArrayList

168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
            data[i] = val;
            miss[j] = i;
            j += (val > maxcode) ? 1 : 0; // TODO can't eliminate if-then-else control hazard
        }
        // LOOP2: create patch-list       
        final CharArrayList exceptionList = segment.exceptionList;
        if(j > 0) {
            segment.firstException_ = miss[0];
            prev = miss[j - 1]; // last-patch
            for(int i = 0; i < j; i++) {
                int cur = miss[i];
                exceptionList.add(input[cur]);
                data[prev] = cur - prev - 1; // difference of the two exception
                prev = cur;
            }
        }
View Full Code Here
217
218
219
220
221
222
223
224
225
226
227
228
229
230
        }

        // LOOP2: patch it up
        int firstException = segment.firstException_;
        if(firstException != -1) {
            final CharArrayList exceptionList = segment.exceptionList;
            int cur = code[firstException]; // REVIEWME  exceptionList was empty
            for(int i = 0, next; cur < n; i++, cur = next) {
                output[cur] = exceptionList.get(i);
                next = cur + code[cur] + 1;
            }
            segment.nextException_ = cur - n;
        }
View Full Code Here
71
72
73
74
75
76
77
        public CompressedSegment(int bitwidth) {
            this.bitwidth_ = bitwidth;
            this.maxcode_ = 2 ^ bitwidth;
            this.codesBuf = new BitwiseCodec(4096);
            this.codes = null;
            this.exceptionList = new CharArrayList(64);
        }
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
122
            FastByteArrayInputStream codesIs = new FastByteArrayInputStream(b);
            BitInputStream codesBis = new BitInputStream(codesIs);
            int[] codes = new int[totalEntries];
            unpack(codesBis, bitwidth, codes, totalEntries);
            int exceptions = dis.readShort();
            CharArrayList exceptionList = new CharArrayList(exceptions);
            for(int i = 0; i < exceptions; i++) {
                char c = dis.readChar();
                exceptionList.add(c);
            }
            return new CompressedSegment(totalEntries, bitwidth, firstException, codes, exceptionList);
        }
View Full Code Here
70
71
72
73
74
75
76
        public CompressedSegment(int bitwidth) {
            this.bitwidth_ = bitwidth;
            this.maxcode_ = 2 ^ bitwidth;
            this.codesBuf = new BitwiseCodec(4096);
            this.codes = null;
            this.exceptionList = new CharArrayList(64);
        }
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
            FastByteArrayInputStream codesIs = new FastByteArrayInputStream(b);
            BitInputStream codesBis = new BitInputStream(codesIs);
            int[] codes = new int[totalEntries];
            unpack(codesBis, bitwidth, codes, totalEntries);
            int exceptions = dis.readShort();
            CharArrayList exceptionList = new CharArrayList(exceptions);
            for(int i = 0; i < exceptions; i++) {
                char c = dis.readChar();
                exceptionList.add(c);
            }
            return new CompressedSegment(totalEntries, bitwidth, firstException, codes, exceptionList);
        }
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
            data[i] = val;
            miss[j] = i;
            j += (val > maxcode) ? 1 : 0; // TODO can't eliminate if-then-else control hazard
        }
        // LOOP2: create patch-list       
        final CharArrayList exceptionList = segment.exceptionList;
        if(j > 0) {
            segment.firstException_ = miss[0];
            prev = miss[j - 1]; // last-patch
            for(int i = 0; i < j; i++) {
                int cur = miss[i];
                exceptionList.add(input[cur]);
                data[prev] = cur - prev - 1; // difference of the two exception
                prev = cur;
            }
        }
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
227
228
229
        }

        // LOOP2: patch it up
        int firstException = segment.firstException_;
        if(firstException != -1) {
            final CharArrayList exceptionList = segment.exceptionList;
            int cur = code[firstException]; // REVIEWME  exceptionList was empty
            for(int i = 0, next; cur < n; i++, cur = next) {
                output[cur] = exceptionList.get(i);
                next = cur + code[cur] + 1;
            }
            segment.nextException_ = cur - n;
        }
View Full Code Here
TOP

Related Classes of xbird.util.collections.CharArrayList

  • xbird.util.compress.PFOR
  • xbird.util.compress.PFOR$CompressedSegment
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.