Protocol Buffers - Google's data interchange format (grpc依赖)
https://developers.google.com/protocol-buffers/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
135 lines
2.4 KiB
135 lines
2.4 KiB
1 year ago
|
// Protocol Buffers - Google's data interchange format
|
||
|
// Copyright 2023 Google LLC. All rights reserved.
|
||
|
//
|
||
1 year ago
|
// 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
|
||
2 years ago
|
|
||
3 months ago
|
#include "google/protobuf/compiler/hpb/keywords.h"
|
||
2 years ago
|
|
||
3 months ago
|
#include <new>
|
||
2 years ago
|
#include <string>
|
||
|
|
||
3 months ago
|
#include "absl/container/flat_hash_set.h"
|
||
|
#include "absl/strings/str_cat.h"
|
||
|
#include "absl/strings/string_view.h"
|
||
2 years ago
|
|
||
3 months ago
|
namespace google::protobuf::hpb_generator {
|
||
|
|
||
|
static const absl::string_view kKeywordList[] = {
|
||
2 years ago
|
//
|
||
|
"NULL",
|
||
|
"alignas",
|
||
|
"alignof",
|
||
|
"and",
|
||
|
"and_eq",
|
||
|
"asm",
|
||
|
"auto",
|
||
|
"bitand",
|
||
|
"bitor",
|
||
|
"bool",
|
||
|
"break",
|
||
|
"case",
|
||
|
"catch",
|
||
|
"char",
|
||
|
"class",
|
||
|
"compl",
|
||
|
"const",
|
||
|
"constexpr",
|
||
|
"const_cast",
|
||
|
"continue",
|
||
|
"decltype",
|
||
|
"default",
|
||
|
"delete",
|
||
|
"do",
|
||
|
"double",
|
||
|
"dynamic_cast",
|
||
|
"else",
|
||
|
"enum",
|
||
|
"explicit",
|
||
|
"export",
|
||
|
"extern",
|
||
|
"false",
|
||
|
"float",
|
||
|
"for",
|
||
|
"friend",
|
||
|
"goto",
|
||
|
"if",
|
||
|
"inline",
|
||
|
"int",
|
||
|
"long",
|
||
|
"mutable",
|
||
|
"namespace",
|
||
|
"new",
|
||
|
"noexcept",
|
||
|
"not",
|
||
|
"not_eq",
|
||
|
"nullptr",
|
||
|
"operator",
|
||
|
"or",
|
||
|
"or_eq",
|
||
|
"private",
|
||
|
"protected",
|
||
|
"public",
|
||
|
"register",
|
||
|
"reinterpret_cast",
|
||
|
"return",
|
||
|
"short",
|
||
|
"signed",
|
||
|
"sizeof",
|
||
|
"static",
|
||
|
"static_assert",
|
||
|
"static_cast",
|
||
|
"struct",
|
||
|
"switch",
|
||
|
"template",
|
||
|
"this",
|
||
|
"thread_local",
|
||
|
"throw",
|
||
|
"true",
|
||
|
"try",
|
||
|
"typedef",
|
||
|
"typeid",
|
||
|
"typename",
|
||
|
"union",
|
||
|
"unsigned",
|
||
|
"using",
|
||
|
"virtual",
|
||
|
"void",
|
||
|
"volatile",
|
||
|
"wchar_t",
|
||
|
"while",
|
||
|
"xor",
|
||
|
"xor_eq",
|
||
|
"char8_t",
|
||
|
"char16_t",
|
||
|
"char32_t",
|
||
|
"concept",
|
||
|
"consteval",
|
||
|
"constinit",
|
||
|
"co_await",
|
||
|
"co_return",
|
||
|
"co_yield",
|
||
|
"requires",
|
||
|
};
|
||
|
|
||
3 months ago
|
static absl::flat_hash_set<std::string>* MakeKeywordsMap() {
|
||
|
auto* result = new absl::flat_hash_set<std::string>();
|
||
2 years ago
|
for (const auto keyword : kKeywordList) {
|
||
|
result->emplace(keyword);
|
||
|
}
|
||
|
return result;
|
||
|
}
|
||
|
|
||
3 months ago
|
static absl::flat_hash_set<std::string>& kKeywords = *MakeKeywordsMap();
|
||
2 years ago
|
|
||
3 months ago
|
std::string ResolveKeywordConflict(absl::string_view name) {
|
||
2 years ago
|
if (kKeywords.count(name) > 0) {
|
||
3 months ago
|
return absl::StrCat(name, "_");
|
||
2 years ago
|
}
|
||
3 months ago
|
return std::string(name);
|
||
2 years ago
|
}
|
||
|
|
||
3 months ago
|
} // namespace protobuf
|
||
|
} // namespace google::hpb_generator
|