]> granicus.if.org Git - taglib/commit
projects / taglib / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 0ffd2e8) | patch
Use linear search instead of the Knuth-Morris-Pratt algorithm in ByteVector::find().
authorTsuda Kageyu <tsuda.kageyu@gmail.com>
Mon, 22 Jun 2015 01:37:20 +0000 (10:37 +0900)
committerTsuda Kageyu <tsuda.kageyu@gmail.com>
Thu, 19 Nov 2015 00:23:19 +0000 (09:23 +0900)
commit3bce77a3591f012d924d001a9fe7d263e797f1a6
treea8b7fec944bdeed5ba92302d0b585fd401fda008tree | snapshot
parent0ffd2e8ab96051d6db3bd8cc6da46fab5754eb20commit | diff
Use linear search instead of the Knuth-Morris-Pratt algorithm in ByteVector::find().
In almost all cases, it handles too small data for KMP to work effectively.
taglib/toolkit/tbytevector.cpp diff | blob | history
Unnamed repository; edit this file 'description' to name the repository.