remove non-compiled code

1 files changed, 0 insertions, 134 deletions

diff --git a/lotuswordpro/source/filter/explode.cxx b/lotuswordpro/source/filter/explode.cxx
index c171411fbc67..69c979daf527 100644
--- a/lotuswordpro/source/filter/explode.cxx
+++ b/lotuswordpro/source/filter/explode.cxx
@@ -432,140 +432,6 @@ void Decompression::ConstructTree2()
     {
         m_Tree2->InsertNode(i, Tree2String[i]);
     }
-#if 0
-    m_Tree2 = new HuffmanTreeNode();
-    //Huffman Tree #2
-    //The second huffman code tree contains the distance values. It can be built from the following table:
-    //value (hex) code (binary)
-    //00  11
-    //01  1011
-    //02  1010
-    //03  1001 1
-    //04  1001 0
-    //05  1000 1
-    //06  1000 0
-    //07  0111 11
-    //08  0111 10
-    //09  0111 01
-    //0a  0111 00
-    //0b  0110 11
-    //0c  0110 10
-    //0d  0110 01
-    //0e  0110 00
-    //0f  0101 11
-    m_Tree2->InsertNode(0x0,   "11");
-    m_Tree2->InsertNode(0x1,   "1011");
-    m_Tree2->InsertNode(0x2,   "1010");
-    m_Tree2->InsertNode(0x3,   "10011");
-    m_Tree2->InsertNode(0x4,   "10010");
-    m_Tree2->InsertNode(0x5,   "10001");
-    m_Tree2->InsertNode(0x6,   "10000");
-    m_Tree2->InsertNode(0x7,   "011111");
-    m_Tree2->InsertNode(0x8,   "011110");
-    m_Tree2->InsertNode(0x9,   "011101");
-    m_Tree2->InsertNode(0x0a,  "011100");
-    m_Tree2->InsertNode(0x0b,  "011011");
-    m_Tree2->InsertNode(0x0c,  "011010");
-    m_Tree2->InsertNode(0x0d,  "011001");
-    m_Tree2->InsertNode(0x0e,  "011000");
-    m_Tree2->InsertNode(0x0f,  "010111");
-    //10  0101 10
-    //11  0101 01
-    //12  0101 00
-    //13  0100 11
-    //14  0100 10
-    //15  0100 01
-    //16  0100 001
-    //17  0100 000
-    //18  0011 111
-    //19  0011 110
-    // 1a  0011 101
-    // 1b  0011 100
-    // 1c  0011 011
-    // 1d  0011 010
-    // 1e  0011 001
-    // 1f  0011 000
-    m_Tree2->InsertNode(0x10,   "010110");
-    m_Tree2->InsertNode(0x11,   "010101");
-    m_Tree2->InsertNode(0x12,   "010100");
-    m_Tree2->InsertNode(0x13,   "010011");
-    m_Tree2->InsertNode(0x14,   "010010");
-    m_Tree2->InsertNode(0x15,   "010001");
-    m_Tree2->InsertNode(0x16,   "0100001");
-    m_Tree2->InsertNode(0x17,   "0100000");
-    m_Tree2->InsertNode(0x18,   "0011111");
-    m_Tree2->InsertNode(0x19,   "0011110");
-    m_Tree2->InsertNode(0x1a,   "0011101");
-    m_Tree2->InsertNode(0x1b,   "0011100");
-    m_Tree2->InsertNode(0x1c,   "0011011");
-    m_Tree2->InsertNode(0x1d,   "0011010");
-    m_Tree2->InsertNode(0x1e,   "0011001");
-    m_Tree2->InsertNode(0x1f,   "0011000");
-    //20  0010 111
-    //21  0010 110
-    //22  0010 101
-    //23  0010 100
-    //24  0010 011
-    //25  0010 010
-    //26  0010 001
-    //27  0010 000
-    //28  0001 111
-    //29  0001 110
-    // 2a  0001 101
-    // 2b  0001 100
-    // 2c  0001 011
-    // 2d  0001 010
-    // 2e  0001 001
-    // 2f  0001 000
-    m_Tree2->InsertNode(0x20,   "0010111");
-    m_Tree2->InsertNode(0x21,   "0010110");
-    m_Tree2->InsertNode(0x22,   "0010101");
-    m_Tree2->InsertNode(0x23,   "0010100");
-    m_Tree2->InsertNode(0x24,   "0010011");
-    m_Tree2->InsertNode(0x25,   "0010010");
-    m_Tree2->InsertNode(0x26,   "0010001");
-    m_Tree2->InsertNode(0x27,   "0010000");
-    m_Tree2->InsertNode(0x28,   "0001111");
-    m_Tree2->InsertNode(0x29,   "0001110");
-    m_Tree2->InsertNode(0x2a,   "0001101");
-    m_Tree2->InsertNode(0x2b,   "0001100");
-    m_Tree2->InsertNode(0x2c,   "0001011");
-    m_Tree2->InsertNode(0x2d,   "0001010");
-    m_Tree2->InsertNode(0x2e,   "0001001");
-    m_Tree2->InsertNode(0x2f,   "0001000");
-    //30  0000 1111
-    //31  0000 1110
-    //32  0000 1101
-    //33  0000 1100
-    //34  0000 1011
-    //35  0000 1010
-    //36  0000 1001
-    //37  0000 1000
-    //38  0000 0111
-    //39  0000 0110
-    // 3a  0000 0101
-    // 3b  0000 0100
-    // 3c  0000 0011
-    // 3d  0000 0010
-    // 3e  0000 0001
-    // 3f  0000 0000
-    m_Tree2->InsertNode(0x30,   "00001111");
-    m_Tree2->InsertNode(0x31,   "00001110");
-    m_Tree2->InsertNode(0x32,   "00001101");
-    m_Tree2->InsertNode(0x33,   "00001100");
-    m_Tree2->InsertNode(0x34,   "00001011");
-    m_Tree2->InsertNode(0x35,   "00001010");
-    m_Tree2->InsertNode(0x36,   "00001001");
-    m_Tree2->InsertNode(0x37,   "00001000");
-    m_Tree2->InsertNode(0x38,   "00000111");
-    m_Tree2->InsertNode(0x39,   "00000110");
-    m_Tree2->InsertNode(0x3a,   "00000101");
-    m_Tree2->InsertNode(0x3b,   "00000100");
-    m_Tree2->InsertNode(0x3c,   "00000011");
-    m_Tree2->InsertNode(0x3d,   "00000010");
-    m_Tree2->InsertNode(0x3e,   "00000001");
-    m_Tree2->InsertNode(0x3f,   "00000000");
-#endif
     //where bits should be read from the left to the right.
 }
 /**