Line data Source code
1 : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : /*************************************************************************
3 : *
4 : * The Contents of this file are made available subject to the terms of
5 : * either of the following licenses
6 : *
7 : * - GNU Lesser General Public License Version 2.1
8 : * - Sun Industry Standards Source License Version 1.1
9 : *
10 : * Sun Microsystems Inc., October, 2000
11 : *
12 : * GNU Lesser General Public License Version 2.1
13 : * =============================================
14 : * Copyright 2000 by Sun Microsystems, Inc.
15 : * 901 San Antonio Road, Palo Alto, CA 94303, USA
16 : *
17 : * This library is free software; you can redistribute it and/or
18 : * modify it under the terms of the GNU Lesser General Public
19 : * License version 2.1, as published by the Free Software Foundation.
20 : *
21 : * This library is distributed in the hope that it will be useful,
22 : * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
24 : * Lesser General Public License for more details.
25 : *
26 : * You should have received a copy of the GNU Lesser General Public
27 : * License along with this library; if not, write to the Free Software
28 : * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
29 : * MA 02111-1307 USA
30 : *
31 : *
32 : * Sun Industry Standards Source License Version 1.1
33 : * =================================================
34 : * The contents of this file are subject to the Sun Industry Standards
35 : * Source License Version 1.1 (the "License"); You may not use this file
36 : * except in compliance with the License. You may obtain a copy of the
37 : * License at http://www.openoffice.org/license.html.
38 : *
39 : * Software provided under this License is provided on an "AS IS" basis,
40 : * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
41 : * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
42 : * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
43 : * See the License for the specific provisions governing your rights and
44 : * obligations concerning the Software.
45 : *
46 : * The Initial Developer of the Original Code is: IBM Corporation
47 : *
48 : * Copyright: 2008 by IBM Corporation
49 : *
50 : * All Rights Reserved.
51 : *
52 : * Contributor(s): _______________________________________
53 : *
54 : *
55 : ************************************************************************/
56 : #ifndef INCLUDED_LOTUSWORDPRO_SOURCE_FILTER_EXPLODE_HXX
57 : #define INCLUDED_LOTUSWORDPRO_SOURCE_FILTER_EXPLODE_HXX
58 :
59 : #include <tools/stream.hxx>
60 :
61 : class HuffmanTreeNode
62 : {
63 : public:
64 : HuffmanTreeNode * left;
65 : HuffmanTreeNode * right;
66 : sal_uInt32 value;
67 :
68 : HuffmanTreeNode(sal_uInt32 value = 0xffffffff, HuffmanTreeNode * left = NULL, HuffmanTreeNode * right = NULL) ;
69 : ~HuffmanTreeNode() ;
70 : HuffmanTreeNode * InsertNode(sal_uInt32 nValue, const sal_Char * pInCode);
71 : HuffmanTreeNode * QueryNode(const sal_Char *pCode);
72 : sal_uInt32 QueryValue(const sal_Char *pCode);
73 : };
74 :
75 : /**
76 : * @brief
77 : * define the function type for input read, output write
78 : */
79 : #define CHUNK 16384
80 : #define MAXWIN 4096 /* maximum window size */
81 : class Decompression
82 : {
83 : public:
84 : Decompression(SvStream * pInStream, SvStream * pOutStream);
85 0 : ~Decompression()
86 : {
87 0 : delete m_Tree1;
88 0 : delete m_Tree2;
89 0 : };
90 : /**
91 : * @brief
92 : * decompress from instream to outstream
93 : */
94 : sal_Int32 explode();
95 : sal_uInt32 ReadBits(sal_uInt16 iCount, sal_uInt32 & nBits) ;
96 : sal_uInt32 Decode(HuffmanTreeNode * pRoot);
97 :
98 : /**
99 : * @brief
100 : * compressed/decompressed stream
101 : */
102 : SvStream *m_pInStream;
103 : SvStream *m_pOutStream;
104 :
105 : sal_uInt32 m_nCurrent4Byte; // bit buffer
106 : sal_uInt32 m_nBitsLeft; // number of bits remained in bit buffer
107 :
108 : sal_uInt8 m_Buffer[CHUNK]; // input byte buffer
109 : sal_uInt8 *m_pBuffer; // pointer to input buffer
110 : sal_uInt32 m_nBytesLeft; // number of bytes remained in byte buffer
111 :
112 : sal_uInt8 m_Output[MAXWIN]; // output byte buffer
113 : sal_uInt32 m_nOutputBufferPos; // pointer to output buffer
114 :
115 : sal_uInt32 m_iArrayOfM[16];
116 :
117 : HuffmanTreeNode *m_Tree1, *m_Tree2;
118 :
119 : void ConstructTree1();
120 : void ConstructTree2();
121 : void fillArray();
122 : void ToString(sal_uInt32 nBits, sal_Char *pChar, sal_uInt32 nLen);
123 : };
124 : #endif
125 :
126 : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|