31 for (
auto needle : needles) {
34 for (
size_t index = 0; index < haystack.
size(); ++index) {
35 if (s[(
uint8_t)haystack[index]]) {
39 return std::string::npos;
46 for (
auto needle : needles) {
49 for (
size_t index = 0; index < haystack.
size(); ++index) {
54 return std::string::npos;
size_t qfind_first_byte_of_byteset(const StringPieceLite haystack, const StringPieceLite needles)
—— Concurrent Priority Queue Implementation ——
bool contains(uint8_t i) const
size_t qfind_first_byte_of_bitset(const StringPieceLite haystack, const StringPieceLite needles)