Add an implimentation of Tuned Boyer-Moore.

While the existing literal string searching algorithm
leveraging memchr is quite fast, in some case more
traditional approaches still make sense. This patch
provides an implimentation of Tuned Boyer-Moore as
laid out in Fast String Searching by Hume & Sunday.
Some refinements to their work were gleened from the
grep source.

See: #408
See: BurntSushi/ripgrep#617

bench/Cargo.toml

@@ -5,7 +5,7 @@ version = "0.1.0"
 authors = ["The Rust Project Developers"]
 license = "MIT/Apache-2.0"
 repository = "https://github.com/rust-lang/regex"
-documentation = "http://doc.rust-lang.org/regex/regex_syntax/index.html"
+documentation = "http://doc.rust-lang.org/regex/regex/index.html"
 homepage = "https://github.com/rust-lang/regex"
 description = "Regex benchmarks for Rust's and other engines."
 build = "build.rs"

src/lib.rs

@@ -514,7 +514,7 @@ another matching engine with fixed memory requirements.
 extern crate aho_corasick;
 extern crate memchr;
 extern crate thread_local;
-#[cfg(test)] extern crate quickcheck;
+#[macro_use] #[cfg(test)] extern crate quickcheck;
 extern crate regex_syntax as syntax;
 #[cfg(feature = "simd-accel")] extern crate simd;
 extern crate utf8_ranges;