Oleg Shirokikh Oleg Shirokikh - 1 year ago 62
C++ Question

Efficient way to check if a given string is equivalent to at least one string in the given set of strings

Given a set of strings, say

"String1", "String2",..., "StringN"
, what is the most efficient way in C++ to determine (return
) whether given
string s
matches any of the strings in the above set?

Can Boost.Regex be used for this task?

Answer Source

std::unordered_set would provide the most efficient look-up (amortized constant time).

#include <unordered_set>
#include <string>
#include <cassert>

int main() {
    std::unordered_set<std::string> s = {"Hello", "Goodbye", "Good morning"};
    assert(s.find("Goodbye") != s.end());
    assert(s.find("Good afternoon") == s.end());
    return 0;
Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download