Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
34 lines (27 loc) · 884 Bytes

File metadata and controls

34 lines (27 loc) · 884 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "gtest/gtest.h"
#include <string>
#include <unordered_set>
#include <vector>
namespace {
/// To avoid wasting SymbolIDs, there should be no duplicate strings.
TEST(PredefinedStringsTest, NoDuplicates) {
static const char *kPredefinedStrings[]{
#define STR(name, string) string,
#include "hermes/VM/PredefinedStrings.def"
};
std::unordered_set<std::string> uniqueStrings;
size_t duplicates = 0;
for (auto str : kPredefinedStrings) {
bool isUnique = uniqueStrings.insert(str).second;
duplicates += !isUnique;
EXPECT_TRUE(isUnique) << "Duplicate Predefined String: " << str;
}
EXPECT_EQ(0, duplicates) << duplicates << " duplicates found";
}
} // namespace
Morty Proxy This is a proxified and sanitized view of the page, visit original site.