boyermoore.h

多种字符串匹配算法 多种字符串匹配算法

// BoyerMoore.h: interface for the BoyerMoore class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(_BOYERMOORE_H__)
#define _BOYERMOORE_H__

//The Boyer-Moore algorithm is considered as the most efficient 
//string-matching algorithm in usual applications. A simplified 
//version of it or the entire algorithm is often implemented in 
//text editors for the <search> and <substitute> commands.

#include "MatchingString.h"

class BoyerMoore : public MatchingString  
{
public:
	BoyerMoore();
	virtual ~BoyerMoore();

	static void test();
	void search();//char *x, int m, char *y, int n

private:
	void preBmBc(char *x, int m, int bmBc[]);
	void suffixes(char *x, int m, int *suff);
	void preBmGs(char *x, int m, int bmGs[]);
};

#endif // !defined(_BOYERMOORE_H__)