chromium/base/substring_set_matcher/substring_set_matcher_unittest.cc

// Copyright 2013 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "base/substring_set_matcher/substring_set_matcher.h"

#include <stddef.h>

#include <set>
#include <string>
#include <vector>

#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"

namespace base {

namespace {

void TestOnePattern(const std::string& test_string,
                    const std::string& pattern,
                    bool is_match) { … }

void TestTwoPatterns(const std::string& test_string,
                     const std::string& pattern_1,
                     const std::string& pattern_2,
                     bool is_match_1,
                     bool is_match_2) { … }

}  // namespace

TEST(SubstringSetMatcherTest, TestMatcher) { … }

TEST(SubstringSetMatcherTest, TestMatcher2) { … }

TEST(SubstringSetMatcherTest, TestMatcher3) { … }

TEST(SubstringSetMatcherTest, TestEmptyMatcher) { … }

// Test a case where we have more than 256 edges from one node
// (the “a” node gets one for each possible ASCII bytes, and then
// one for the output link).
TEST(SubstringSetMatcherTest, LotsOfEdges) { … }

}  // namespace base