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
113 lines (92 loc) · 4.92 KB

File metadata and controls

113 lines (92 loc) · 4.92 KB
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
/*
* Copyright (C) 2012-2017 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <wtf/text/AtomString.h>
namespace TestWebKitAPI {
TEST(WTF, AtomStringCreationFromLiteral)
{
AtomString stringWithTemplate("Template Literal", AtomString::ConstructFromLiteral);
ASSERT_EQ(strlen("Template Literal"), stringWithTemplate.length());
ASSERT_TRUE(stringWithTemplate == "Template Literal");
ASSERT_TRUE(stringWithTemplate.string().is8Bit());
const char* programmaticStringData = "Explicit Size Literal";
AtomString programmaticString(programmaticStringData, strlen(programmaticStringData), AtomString::ConstructFromLiteral);
ASSERT_EQ(strlen(programmaticStringData), programmaticString.length());
ASSERT_TRUE(programmaticString.string().is8Bit());
ASSERT_EQ(programmaticStringData, reinterpret_cast<const char*>(programmaticString.string().characters8()));
}
TEST(WTF, AtomStringCreationFromLiteralUniqueness)
{
AtomString string1("Template Literal", AtomString::ConstructFromLiteral);
AtomString string2("Template Literal", AtomString::ConstructFromLiteral);
ASSERT_EQ(string1.impl(), string2.impl());
AtomString string3("Template Literal");
ASSERT_EQ(string1.impl(), string3.impl());
}
TEST(WTF, AtomStringExistingHash)
{
AtomString string1("Template Literal", AtomString::ConstructFromLiteral);
ASSERT_EQ(string1.existingHash(), string1.impl()->existingHash());
AtomString string2;
ASSERT_EQ(string2.existingHash(), 0u);
}
static inline const char* testAtomStringNumber(double number)
{
static char testBuffer[100] = { };
std::strncpy(testBuffer, AtomString::number(number).string().utf8().data(), 99);
return testBuffer;
}
TEST(WTF, AtomStringNumberDouble)
{
using Limits = std::numeric_limits<double>;
EXPECT_STREQ("Infinity", testAtomStringNumber(Limits::infinity()));
EXPECT_STREQ("-Infinity", testAtomStringNumber(-Limits::infinity()));
EXPECT_STREQ("NaN", testAtomStringNumber(-Limits::quiet_NaN()));
EXPECT_STREQ("0", testAtomStringNumber(0));
EXPECT_STREQ("0", testAtomStringNumber(-0));
EXPECT_STREQ("2.2250738585072014e-308", testAtomStringNumber(Limits::min()));
EXPECT_STREQ("-1.7976931348623157e+308", testAtomStringNumber(Limits::lowest()));
EXPECT_STREQ("1.7976931348623157e+308", testAtomStringNumber(Limits::max()));
EXPECT_STREQ("3.141592653589793", testAtomStringNumber(piDouble));
EXPECT_STREQ("3.1415927410125732", testAtomStringNumber(piFloat));
EXPECT_STREQ("1.5707963267948966", testAtomStringNumber(piOverTwoDouble));
EXPECT_STREQ("1.5707963705062866", testAtomStringNumber(piOverTwoFloat));
EXPECT_STREQ("0.7853981633974483", testAtomStringNumber(piOverFourDouble));
EXPECT_STREQ("0.7853981852531433", testAtomStringNumber(piOverFourFloat));
EXPECT_STREQ("2.718281828459045", testAtomStringNumber(2.71828182845904523536028747135266249775724709369995));
EXPECT_STREQ("299792458", testAtomStringNumber(299792458));
EXPECT_STREQ("1.618033988749895", testAtomStringNumber(1.6180339887498948482));
EXPECT_STREQ("1000", testAtomStringNumber(1e3));
EXPECT_STREQ("10000000000", testAtomStringNumber(1e10));
EXPECT_STREQ("100000000000000000000", testAtomStringNumber(1e20));
EXPECT_STREQ("1e+21", testAtomStringNumber(1e21));
EXPECT_STREQ("1e+30", testAtomStringNumber(1e30));
EXPECT_STREQ("1100", testAtomStringNumber(1.1e3));
EXPECT_STREQ("11000000000", testAtomStringNumber(1.1e10));
EXPECT_STREQ("110000000000000000000", testAtomStringNumber(1.1e20));
EXPECT_STREQ("1.1e+21", testAtomStringNumber(1.1e21));
EXPECT_STREQ("1.1e+30", testAtomStringNumber(1.1e30));
}
} // namespace TestWebKitAPI
Morty Proxy This is a proxified and sanitized view of the page, visit original site.