File: RGBCompression.java

package info (click to toggle)
libpixie-java 1%3A1.1.6-5
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 1,076 kB
  • sloc: java: 10,175; xml: 1,579; makefile: 13
file content (323 lines) | stat: -rw-r--r-- 7,441 bytes parent folder | download | duplicates (3)
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
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
/*
 * This program is free software; you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License, version 2.1 as published by the Free Software
 * Foundation.
 *
 * You should have received a copy of the GNU Lesser General Public License along with this
 * program; if not, you can obtain a copy at http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
 * or from the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * This program 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.
 *
 * Copyright (c) 2000 - 2009 Pentaho Corporation, Object Refinery Limited and Contributors.  All rights reserved.
 */

package org.pentaho.reporting.libraries.pixie.wmf.bitmap;

import java.io.IOException;
import java.io.InputStream;

public class RGBCompression extends BitmapCompression
{
  public RGBCompression()
  {
  }

  public int[] decompress(final InputStream in, final GDIPalette palette)
      throws IOException
  {
    final int[] target = new int[getWidth() * getHeight()];

    switch (getBpp())
    {
      case 1:
        fillMono(target, in, palette);
        break;
      case 4:
        fill4Bit(target, in, palette);
        break;
      case 8:
        fill8Bit(target, in, palette);
        break;
      case 16:
        fill16Bit(target, in, palette);
        break;
      case 24:
        fill24Bit(target, in, palette);
        break;
      case 32:
        fill32Bit(target, in, palette);
        break;
    }
    return target;
  }

  /**
   * Cut or padd the string to the given size
   *
   * @param size    the wanted length
   * @param padChar char to use for padding (must be of length()==1!)
   * @return the string with correct lenght, padded with pad if necessary
   */
  public static String forceToSizeLeft(final String str, final int size,
                                       final char padChar)
  {
    if (str != null && str.length() == size)
    {
      return str;
    }

    final StringBuffer tmp;
    if (str == null)
    {
      tmp = new StringBuffer(size);
    }
    else
    {
      tmp = new StringBuffer(str);
    }

    if (tmp.length() > size)
    {
      tmp.setLength(size);
      return tmp.toString();  // do cutting
    }
    else
    {
      final StringBuffer t2 = new StringBuffer(size);

      final int arsize = size - tmp.length();
      final char[] ar = new char[arsize];
      for (int i = 0; i < arsize; i++)
      {
        ar[i] = padChar;
      }
      t2.append(ar);
      t2.append(tmp);
      return t2.toString();
    }
  }

  public void fillMono(final int[] target, final InputStream in, final GDIPalette pal)
      throws IOException
  {
    final int noOfBytes = (int) Math.ceil(target.length / 8);
    if (isTopDown() == false)
    {
      for (int i = noOfBytes - 1; i >= 0; i--)
      {
        final int iByte = readInt(in);
        if (iByte == -1)
        {
          return;
        }


        final int[] data = expandMonocrome(iByte, pal);
        final int left = (target.length - i * 8);
        final int size = Math.min(8, left);

        for (int ij = size - 1; ij >= 0; ij--)
        {
          target[7 - ij + i * 8] = data[ij];
        }
      }
    }
    else
    {
      for (int i = 0; i < noOfBytes; i++)
      {
        final int iByte = readInt(in);
        if (iByte == -1)
        {
          return;
        }


        final int[] data = expandMonocrome(iByte, pal);
        System.arraycopy(data, 0, target, i * 8, 8);
      }
    }
  }

  public void fill4Bit(final int[] target, final InputStream in, final GDIPalette pal)
      throws IOException
  {
    final int noOfBytes = (int) Math.ceil(target.length / 2);

    if (isTopDown() == false)
    {
      for (int i = noOfBytes - 1; i >= 0; i--)
      {
        final int iByte = in.read();
        if (iByte == -1)
        {
          return;
        }

        final int[] data = expand4BitTuple(iByte, pal);
        target[i * 2] = data[1];
        target[i * 2 + 1] = data[0];
      }
    }
    else
    {
      for (int i = 0; i < noOfBytes; i++)
      {
        final int iByte = in.read();
        if (iByte == -1)
        {
          return;
        }

        final int[] data = expand4BitTuple(iByte, pal);
        target[i * 2] = data[0];
        target[i * 2 + 1] = data[1];
      }
    }
  }

  public void fill8Bit(final int[] target, final InputStream in, final GDIPalette pal)
      throws IOException
  {
    final int noOfBytes = target.length;
    if (isTopDown() == false)
    {
      for (int i = noOfBytes - 1; i >= 0; i--)
      {
        final int iByte = in.read();
        if (iByte == -1)
        {
          return;
        }

        target[i] = pal.lookupColor(iByte);
      }
    }
    else
    {
      for (int i = 0; i < noOfBytes; i++)
      {
        final int iByte = in.read();
        if (iByte == -1)
        {
          return;
        }

        target[i] = pal.lookupColor(iByte);
      }
    }
  }

  public void fill16Bit(final int[] target, final InputStream in, final GDIPalette pal)
      throws IOException
  {
    final int noOfBytes = target.length * 2;
    if (isTopDown() == false)
    {
      for (int i = noOfBytes - 1; i >= 0; i--)
      {
        final int iByte = in.read();
        if (iByte == -1)
        {
          return;
        }
        final int iByte2 = in.read();
        if (iByte2 == -1)
        {
          return;
        }

        target[i] = pal.lookupColor((iByte2 << 8) + iByte);
      }
    }
    else
    {
      for (int i = 0; i < noOfBytes; i++)
      {
        final int iByte = in.read();
        if (iByte == -1)
        {
          return;
        }
        final int iByte2 = in.read();
        if (iByte2 == -1)
        {
          return;
        }

        target[i] = pal.lookupColor((iByte2 << 8) + iByte);
      }
    }
  }

  public void fill24Bit(final int[] target, final InputStream in, final GDIPalette pal)
      throws IOException
  {
    final int noOfBytes = target.length * 4;
    if (isTopDown() == false)
    {
      for (int i = noOfBytes - 1; i >= 0; i--)
      {
        target[i] = pal.lookupColor(readInt(in));
      }
    }
    else
    {
      for (int i = 0; i < noOfBytes; i++)
      {
        target[i] = pal.lookupColor(readInt(in));
      }
    }
  }

  public void fill32Bit(final int[] target, final InputStream in, final GDIPalette pal)
      throws IOException
  {
    final int noOfBytes = target.length * 4;
    if (isTopDown() == false)
    {
      for (int i = noOfBytes - 1; i >= 0; i--)
      {
        target[i] = pal.lookupColor(readInt(in));
      }
    }
    else
    {
      for (int i = 0; i < noOfBytes; i++)
      {
        target[i] = pal.lookupColor(readInt(in));
      }
    }
  }

  protected int readInt(final InputStream in)
      throws IOException
  {
    final int iByte = in.read();
    if (iByte == -1)
    {
      return -1;
    }
    final int iByte2 = in.read();
    if (iByte2 == -1)
    {
      return -1;
    }
    final int iByte3 = in.read();
    if (iByte3 == -1)
    {
      return -1;
    }
    final int iByte4 = in.read();
    if (iByte4 == -1)
    {
      return -1;
    }

    return ((iByte4 << 24) + (iByte3 << 16) + (iByte2 << 8) + (iByte));
  }
}