|  | // Protocol Buffers - Google's data interchange format | 
|  | // Copyright 2024 Google LLC.  All rights reserved. | 
|  | // | 
|  | // Use of this source code is governed by a BSD-style | 
|  | // license that can be found in the LICENSE file or at | 
|  | // https://developers.google.com/open-source/licenses/bsd | 
|  |  | 
|  | #ifndef GOOGLE_PROTOBUF_CONFORMANCE_FAILURE_LIST_TRIE_NODE_H__ | 
|  | #define GOOGLE_PROTOBUF_CONFORMANCE_FAILURE_LIST_TRIE_NODE_H__ | 
|  |  | 
|  | #include <memory> | 
|  | #include <optional> | 
|  | #include <string> | 
|  | #include <vector> | 
|  |  | 
|  | #include "absl/status/status.h" | 
|  | #include "absl/strings/string_view.h" | 
|  |  | 
|  | namespace google { | 
|  | namespace protobuf { | 
|  |  | 
|  | // Each node represents a section of a test name (divided by '.'). One can | 
|  | // imagine them as prefixes to search for a match. Once we hit a prefix that | 
|  | // doesn't match, we can stop searching. Wildcards matching to any set of | 
|  | // characters are supported. | 
|  | // | 
|  | // This is not a general trie implementation | 
|  | // as pointed out by its name. It is only meant to only be used for conformance | 
|  | // failure lists. | 
|  | // | 
|  | // Example of what the trie might look like in practice: | 
|  | // | 
|  | //                             (root) | 
|  | //                            /      | | 
|  | //                "Recommended"   "Required" | 
|  | //                      /               | | 
|  | //                 "Proto2"             "*" | 
|  | //                 /      |               | | 
|  | //          "JsonInput" "ProtobufInput"  "JsonInput" | 
|  | // | 
|  | // | 
|  | class FailureListTrieNode { | 
|  | public: | 
|  | FailureListTrieNode() : data_("") {} | 
|  | explicit FailureListTrieNode(absl::string_view data) | 
|  | : data_(data), is_test_name_(false) {} | 
|  |  | 
|  | // Will attempt to insert a test name into the trie returning | 
|  | // absl::StatusCode::kAlreadyExists if the test name already exists or | 
|  | // absl::StatusCode::kInvalidArgument if the test name contains invalid | 
|  | // wildcards; otherwise, insertion is successful. | 
|  | absl::Status Insert(absl::string_view test_name); | 
|  |  | 
|  | // Returns what it matched to if it matched anything, otherwise returns | 
|  | // std::nullopt | 
|  | std::optional<std::string> WalkDownMatch(absl::string_view test_name); | 
|  |  | 
|  | private: | 
|  | std::string data_; | 
|  | std::vector<std::unique_ptr<FailureListTrieNode>> children_; | 
|  | bool is_test_name_; | 
|  | void InsertImpl(absl::string_view test_name); | 
|  | }; | 
|  | }  // namespace protobuf | 
|  | }  // namespace google | 
|  |  | 
|  | #endif  // GOOGLE_PROTOBUF_CONFORMANCE_FAILURE_LIST_TRIE_NODE_H__ |