#include "failure_list_trie_node.h" #include #include #include "absl/status/status.h" #include "absl/strings/match.h" #include "absl/strings/str_cat.h" #include "absl/strings/str_format.h" #include "absl/strings/str_split.h" #include "absl/strings/string_view.h" #include "absl/types/optional.h" namespace google { namespace protobuf { absl::Status FailureListTrieNode::Insert(absl::string_view test_name) { auto result = WalkDownMatch(test_name); if (result.has_value()) { return absl::AlreadyExistsError( absl::StrFormat("Test name %s already exists in the trie FROM %s", test_name, result.value())); } auto sections = absl::StrSplit(test_name, '.'); for (auto section : sections) { if (absl::StrContains(section, '*') && section.length() > 1) { return absl::InvalidArgumentError(absl::StrFormat( "Test name %s contains invalid wildcard(s) (wildcards " "must span the whole of a section)", test_name)); } } InsertImpl(test_name); return absl::OkStatus(); } void FailureListTrieNode::InsertImpl(absl::string_view test_name) { absl::string_view section = test_name.substr(0, test_name.find('.')); // Extracted last section -> no more '.' -> test_name_copy will be equal to // section if (test_name == section) { children_.push_back(std::make_unique(section)); return; } test_name = test_name.substr(section.length() + 1); for (auto& child : children_) { if (child->data_ == section) { return child->InsertImpl(test_name); } } // No match children_.push_back(std::make_unique(section)); children_.back()->InsertImpl(test_name); } absl::optional FailureListTrieNode::WalkDownMatch( absl::string_view test_name) { absl::string_view section = test_name.substr(0, test_name.find('.')); // test_name cannot be overridden absl::string_view to_match; if (section != test_name) { to_match = test_name.substr(section.length() + 1); } for (auto& child : children_) { if (child->data_ == section || child->data_ == "*" || section == "*") { absl::string_view appended = child->data_; // Extracted last section -> no more '.' -> test_name will be // equal to section if (test_name == section) { // Must match all the way to the bottom of the tree if (child->children_.empty()) { return std::string(appended); } } else { auto result = child->WalkDownMatch(to_match); if (result.has_value()) { return absl::StrCat(appended, ".", result.value()); } } } } // No match return absl::nullopt; } } // namespace protobuf } // namespace google