hashirama/goldendict-ng
hashirama/goldendict-ng
0
0
Fork 0
mirror of https://github.com/xiaoyifang/goldendict-ng.git synced 2024-11-27 19:24:08 +00:00
Code Issues Actions 1 Projects Releases Wiki Activity

remove useless code

Browse source
This commit is contained in:
Xiao YiFang 2022-10-11 19:40:06 +08:00
parent 0daf94ffc7
commit 083e7da81c
1 changed files with 0 additions and 48 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

48
btreeidx.cc
View file

@ -22,22 +22,7 @@
// LZO mode is experimental and unsupported. Tests didn't show any substantial // LZO mode is experimental and unsupported. Tests didn't show any substantial
// speed improvements. // speed improvements.
#ifdef __BTREE_USE_LZO
#include <lzo/lzo1x.h>
namespace {
struct __LzoInit
{
__LzoInit()
{
lzo_init();
}
} __lzoInit;
}
#else
#include <zlib.h> #include <zlib.h>
#endif
namespace BtreeIndexing { namespace BtreeIndexing {
@ -492,17 +477,6 @@ void BtreeIndex::readNode( uint32_t offset, vector< char > & out )
idxFile->read( &compressedData.front(), compressedData.size() ); idxFile->read( &compressedData.front(), compressedData.size() );
#ifdef __BTREE_USE_LZO
lzo_uint decompressedLength = out.size();
if ( lzo1x_decompress( &compressedData.front(), compressedData.size(),
(unsigned char *)&out.front(), &decompressedLength, 0 )
!= LZO_E_OK || decompressedLength != out.size() )
throw exFailedToDecompressNode();
#else
unsigned long decompressedLength = out.size(); unsigned long decompressedLength = out.size();
if ( uncompress( (unsigned char *)&out.front(), if ( uncompress( (unsigned char *)&out.front(),
@ -511,7 +485,6 @@ void BtreeIndex::readNode( uint32_t offset, vector< char > & out )
compressedData.size() ) != Z_OK || compressedData.size() ) != Z_OK ||
decompressedLength != out.size() ) decompressedLength != out.size() )
throw exFailedToDecompressNode(); throw exFailedToDecompressNode();
#endif
} }
char const * BtreeIndex::findChainOffsetExactOrPrefix( wstring const & target, char const * BtreeIndex::findChainOffsetExactOrPrefix( wstring const & target,
@ -989,25 +962,6 @@ static uint32_t buildBtreeNode( IndexedWords::const_iterator & nextIndex,
} }
// Save the result. // Save the result.
#ifdef __BTREE_USE_LZO
vector< unsigned char > compressedData( uncompressedData.size() + uncompressedData.size() / 16 + 64 + 3 );
char workMem[ LZO1X_1_MEM_COMPRESS ];
lzo_uint compressedSize;
if ( lzo1x_1_compress( &uncompressedData.front(), uncompressedData.size(),
&compressedData.front(), &compressedSize, workMem )
!= LZO_E_OK )
{
FDPRINTF( stderr, "Failed to compress btree node.\n" );
abort();
}
#else
vector< unsigned char > compressedData( compressBound( uncompressedData.size() ) ); vector< unsigned char > compressedData( compressBound( uncompressedData.size() ) );
unsigned long compressedSize = compressedData.size(); unsigned long compressedSize = compressedData.size();
@ -1019,8 +973,6 @@ static uint32_t buildBtreeNode( IndexedWords::const_iterator & nextIndex,
abort(); abort();
} }
#endif
uint32_t offset = file.tell(); uint32_t offset = file.tell();
file.write< uint32_t >( uncompressedData.size() ); file.write< uint32_t >( uncompressedData.size() );