hashsearch.h

来自「My (so called) HiP compression algorithm」· C头文件 代码 · 共 65 行

/*****************************************************************************

  HashSearch
  ----------

  Class implementing the word prefix based hash search algorithm
  of Jcalg1 of Jeremy Collake

  by yoda

  WWW:      y0da.cjb.net
  E-mail:   [e-mail]

  You are allowed to use this class in your own projects if you keep this
  trademark.

*****************************************************************************/

#pragma once

#include <windows.h>

//
// structures
//
#include <PshPack1.h> // turn on struct 1-byte-alignment
typedef struct _HS_NODE
{
	PBYTE                    Index;
	_HS_NODE                 *Previous;
	_HS_NODE                 *Next;
} HS_NODE, *PHS_NODE, **PPHS_NODE;
#include <PopPack.h>

//
// HashSearch class
//
class HashSearch
{
public:
	HashSearch(void);
	~HashSearch(void);

	void   Dispose();
	BOOL   Assign( PBYTE pbyBuffer, DWORD cbBuffer );
	BOOL   FindLongestMatch(IN  PBYTE pbyWin, IN PBYTE pData, IN DWORD cbData, 
						   IN DWORD cbMin2Match, IN BOOL bAddNode, OUT DWORD &dwDistance, OUT DWORD &dwLength );
	void   UpdateNodesForRange( PBYTE pby, DWORD cb );

private:
//	PBYTE                    m_pbyValidNodes;
	PHS_NODE                 m_pNodes;
	PPHS_NODE                m_pRecentNodes;
	PBYTE                    m_pbyBuff;
	DWORD                    m_cbBuff;
	UINT                     m_iCurrentNode;

	BOOL   FindMatch(IN  PBYTE pbyWin, IN DWORD cbWin, IN PBYTE pData, IN DWORD cbData, 
						   OUT DWORD &dwDistance, OUT DWORD &dwLength );
	BOOL   AddNode( PBYTE pData );
	DWORD  MyMemCmp( PBYTE p1, PBYTE p2, DWORD cbMax );
//	DWORD  MyMemCmp2( PBYTE p1, PBYTE p2, DWORD cbMax );
};

typedef HashSearch *PHashSearch;