lotuswordpro/source/filter/explode.hxx

   1 /*************************************************************************
   2  *
   3  *  The Contents of this file are made available subject to the terms of
   4  *  either of the following licenses
   5  *
   6  *         - GNU Lesser General Public License Version 2.1
   7  *         - Sun Industry Standards Source License Version 1.1
   8  *
   9  *  Sun Microsystems Inc., October, 2000
  10  *
  11  *  GNU Lesser General Public License Version 2.1
  12  *  =============================================
  13  *  Copyright 2000 by Sun Microsystems, Inc.
  14  *  901 San Antonio Road, Palo Alto, CA 94303, USA
  15  *
  16  *  This library is free software; you can redistribute it and/or
  17  *  modify it under the terms of the GNU Lesser General Public
  18  *  License version 2.1, as published by the Free Software Foundation.
  19  *
  20  *  This library is distributed in the hope that it will be useful,
  21  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  22  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  23  *  Lesser General Public License for more details.
  24  *
  25  *  You should have received a copy of the GNU Lesser General Public
  26  *  License along with this library; if not, write to the Free Software
  27  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,
  28  *  MA  02111-1307  USA
  29  *
  30  *
  31  *  Sun Industry Standards Source License Version 1.1
  32  *  =================================================
  33  *  The contents of this file are subject to the Sun Industry Standards
  34  *  Source License Version 1.1 (the "License"); You may not use this file
  35  *  except in compliance with the License. You may obtain a copy of the
  36  *  License at http://www.openoffice.org/license.html.
  37  *
  38  *  Software provided under this License is provided on an "AS IS" basis,
  39  *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
  40  *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
  41  *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
  42  *  See the License for the specific provisions governing your rights and
  43  *  obligations concerning the Software.
  44  *
  45  *  The Initial Developer of the Original Code is: IBM Corporation
  46  *
  47  *  Copyright: 2008 by IBM Corporation
  48  *
  49  *  All Rights Reserved.
  50  *
  51  *  Contributor(s): _______________________________________
  52  *
  53  *
  54  ************************************************************************/
  55 #ifndef _EXPLODE_HXX_
  56 #define _EXPLODE_HXX_
  57
  58 #include <tools/stream.hxx>
  59
  60 class HuffmanTreeNode
  61 {
  62 public:
  63         HuffmanTreeNode * left;
  64         HuffmanTreeNode * right;
  65         sal_uInt32 value;
  66
  67         HuffmanTreeNode(sal_uInt32 value = 0xffffffff, HuffmanTreeNode * left = NULL, HuffmanTreeNode * right = NULL) ;
  68         ~HuffmanTreeNode() ;
  69         HuffmanTreeNode * InsertNode(sal_uInt32 nValue, const sal_Char * pInCode);
  70         HuffmanTreeNode * QueryNode(const sal_Char *pCode);
  71         sal_uInt32 QueryValue(const sal_Char *pCode);
  72 };
  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         ~Decompression()
  86         {
  87                 delete m_Tree1;
  88                 delete m_Tree2;
  89         };
  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
 118         HuffmanTreeNode *m_Tree1, *m_Tree2;
 119
 120         void ConstructTree1();
 121         void ConstructTree2();
 122         void fillArray();
 123         void ToString(sal_uInt32 nBits, sal_Char *pChar, sal_uInt32 nLen);
 124 };
 125 #endif