Description: 匹配算法，Boyer-Moore-Hospool匹配算法
这个算法在大文件中搜索小pattern有很高效率。
推荐用来代替strstr()
这个实现我没有测过，不过应该不会有大问题。
C++的代码，容易使用：） -matching algorithm, Boyer - Moore-Hospool matching algorithm The algorithm in document search small pattern has a high efficiency. Suggest to replace strstr () I did not realize the test before but there should not be a big problem. C code, easier to use :) Platform: |
Size: 1134 |
Author:彭诗力 |
Hits:
Description: 匹配算法，Boyer-Moore-Hospool匹配算法
这个算法在大文件中搜索小pattern有很高效率。
推荐用来代替strstr()
这个实现我没有测过，不过应该不会有大问题。
C++的代码，容易使用：） -matching algorithm, Boyer- Moore-Hospool matching algorithm The algorithm in document search small pattern has a high efficiency. Suggest to replace strstr () I did not realize the test before but there should not be a big problem. C code, easier to use :) Platform: |
Size: 1024 |
Author:彭诗力 |
Hits:
Description: BM 算法是一个较优的模式匹配算法。一般，如果不考虑模式串的长度，一个具有时间复杂度O(n)的算法应该是最优的了，但是事实不是如此。BM算法可以实现更高效率的模式匹配。分析和实验说明，BM匹配算法对于那些字符集比较大，而模式串中出现的字符比较少的时候，工作效率最快。而且，考虑KMP匹配方式的优化，可以结合KMP匹配和BM匹配，进一步提高效率。
-BM algorithm is a better pattern matching algorithm. General, if we do not consider the length of pattern, a time complexity O (n) algorithm should be optimal, but the fact is not the case. BM algorithm can realize more efficient pattern matching. Analysis and experiments, BM-matching algorithm for those relatively large character set, and the mode string of characters appearing in less time, the efficiency of the fastest. Moreover, consider the KMP matching optimization, you can match the combination of KMP and BM match, and further improve efficiency. Platform: |
Size: 1024 |
Author:Louis |
Hits:
Description: 字符串搜索，采用boyer-moore算法最简单的描述实现，没有添加预处理和改进算法,若是英文搜索，区分大小写-String search, using boyer-moore algorithm described in the simplest implementation, did not add pre-processing and improve the algorithm, if the English search is case-sensitive Platform: |
Size: 3072 |
Author:zhangyi |
Hits:
Description: BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。-BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances, more than 3-5 times the KMP algorithm quickly. Platform: |
Size: 10240 |
Author:jiangjun |
Hits:
Description: BM可以说是继KMP算法之后更加
优秀的字符串匹配算了，BM 是大师Boyer-Moore的算法杰作， 所以称BM算法，
相比KMP算法效率提高了不少，
-BM can be said that after following the KMP algorithm for string matching better forget, BM is the master of the Boyer-Moore algorithm masterpiece, so that BM algorithm KMP algorithm efficiency compared to a lot Platform: |
Size: 1024 |
Author:li shu |
Hits:
Description: Replace the InStr function in Visual Basic 6 with this new faster function with Boyer-Moore Algorithm Platform: |
Size: 2048 |
Author:Zainuddin Nafarin |
Hits:
Description: 使用Boyer-Moore-Horspool-Sunday 算法进行字符串匹配的系列函数-Using the Boyer-Moore-Horspool-Sunday algorithm for string matching a series of functions Platform: |
Size: 1024 |
Author:杜俊卫 |
Hits:
Description: 一种改进的Boyer-Moore的字符串查找算法(Sunday)，比BM算法快3倍以上，尤其适合长串的查找。
本人编写的类CQSearchStr以无符号字符串形式查找，故可广泛用于非ANSI编码的程序。-An improved Boyer-Moore string search algorithm (Sunday), than BM algorithm is more than three times faster, especially for long strings Find. I written the class CQSearchStr to unsigned string find, it can be widely used for non-ANSI encoding program. Platform: |
Size: 2048 |
Author:zheng |
Hits:
Description: 在計算機科學里，Boyer-Moore字元串搜索演算法是一種非常高效的字元串搜索演算法。-In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. Platform: |
Size: 1024 |
Author:王鈞弘 |
Hits:
Description: bm算法是实现程序，c++代码，Vc环境，简单便于理解-bm algorithm is realized in the program, c++ code, Vc environment, simple easy to understand Platform: |
Size: 24576 |
Author:wuxiaojie |
Hits:
Description: Replace the InStr function in Visual Basic 6 with this new faster function with Boyer-Moore Algorithm Platform: |
Size: 2048 |
Author:liao66720 |
Hits:
Description: 在计算机科学里，Boyer-Moore字符串搜索算法是一种非常高效的字符串搜索算法。它由Bob Boyer和J Strother Moore设计于1977年。此算法仅对搜索目标字符串（关键字）进行预处理，而非被搜索的字符串。虽然Boyer-Moore算法的执行时间同样线性依赖于被搜索字符串的大小，但是通常仅为其它算法的一小部分：它不需要对被搜索的字符串中的字符进行逐一比较，而会跳过其中某些部分。通常搜索关键字越长，算法速度越快。它的效率来自于这样的事实：对于每一次失败的匹配尝试，算法都能够使用这些信息来排除尽可能多的无法匹配的位置。(In computer science, Boyer-Moore string search algorithm is a very efficient string searching algorithm. It consists of Bob Boyer and J Strother Moore design in 1977. This algorithm only to search the target string (keywords) pretreatment, instead of a string to be searched. Although the execution time of Boyer-Moore algorithm also depends linearly on the size of the string being searched, but usually only a small part of other algorithms: it does not need to be searched in the character string for each comparison and will skip some. Usually the search key is longer, the faster algorithm. Its efficiency comes from the fact that the algorithm can use as much information as possible to exclude as many non matching positions as possible for each failed matching attempt.) Platform: |
Size: 1024 |
Author:Never give up
|
Hits:
Description: 字符串BM匹配算法，可以尝试利用并行改进算法(The string BM matching algorithm can try to make use of the parallel improvement algorithm) Platform: |
Size: 3651584 |
Author:四维木童 |
Hits:
Search - The Boyer-Moore Algorithm