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
114
115
116
117
118
119
120
121
122
123
|
/*
* Copyright (C) 2023 Apple, Inc. All rights reserved.
* Copyright (C) 2010-2014 Google, 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. ``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
* 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 "HTMLEntitySearch.h"
#include <numeric>
namespace WebCore {
HTMLEntitySearch::HTMLEntitySearch()
: m_entries(HTMLEntityTable::entries())
{
}
HTMLEntitySearch::CompareResult HTMLEntitySearch::compare(const HTMLEntityTableEntry* entry, char16_t nextCharacter) const
{
char16_t entryNextCharacter;
if (entry->nameLengthExcludingSemicolon < m_currentLength + 1) {
if (!entry->nameIncludesTrailingSemicolon || entry->nameLengthExcludingSemicolon < m_currentLength)
return Before;
entryNextCharacter = ';';
} else
entryNextCharacter = entry->nameCharacters()[m_currentLength];
if (entryNextCharacter == nextCharacter)
return Prefix;
return entryNextCharacter < nextCharacter ? Before : After;
}
const HTMLEntityTableEntry* HTMLEntitySearch::findFirst(char16_t nextCharacter) const
{
auto span = m_entries;
if (span.size() == 1)
return &span.front();
CompareResult result = compare(&span.front(), nextCharacter);
if (result == Prefix)
return &span.front();
if (result == After)
return &span.back();
while (span.size() > 2) {
auto* probe = std::midpoint(&span.front(), &span.back());
result = compare(probe, nextCharacter);
if (result == Before)
span = span.subspan(probe - span.data());
else {
ASSERT(result == After || result == Prefix);
span = span.first(probe - span.data() + 1);
}
}
ASSERT(span.size() == 2);
return &span.back();
}
const HTMLEntityTableEntry* HTMLEntitySearch::findLast(char16_t nextCharacter) const
{
auto span = m_entries;
if (span.size() == 1)
return &span.back();
CompareResult result = compare(&span.back(), nextCharacter);
if (result == Prefix)
return &span.back();
if (result == Before)
return &span.front();
while (span.size() > 2) {
auto* probe = std::midpoint(&span.front(), &span.back());
result = compare(probe, nextCharacter);
if (result == After)
span = span.first(probe - span.data() + 1);
else {
ASSERT(result == Before || result == Prefix);
span = span.subspan(probe - span.data());
}
}
ASSERT(span.size() == 2);
return &span.front();
}
void HTMLEntitySearch::advance(char16_t nextCharacter)
{
ASSERT(isEntityPrefix());
if (!m_currentLength) {
m_entries = HTMLEntityTable::entriesStartingWith(nextCharacter);
if (m_entries.empty())
return;
} else {
auto* first = findFirst(nextCharacter);
m_entries = m_entries.subspan(first - m_entries.data());
auto* last = findLast(nextCharacter);
m_entries = m_entries.first(last - m_entries.data() + 1);
if (first == last && compare(first, nextCharacter) != Prefix)
return fail();
}
++m_currentLength;
if (m_entries[0].nameLength() != m_currentLength)
return;
m_mostRecentMatch = &m_entries.front();
}
}
|
