2 * Copyright (C) 2010 Google, Inc. All Rights Reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include "HTMLEntitySearch.h"
29 #include "HTMLEntityTable.h"
35 const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right)
37 return &left[(right - left) / 2];
42 HTMLEntitySearch::HTMLEntitySearch()
45 , m_mostRecentMatch(0)
46 , m_first(HTMLEntityTable::firstEntry())
47 , m_last(HTMLEntityTable::lastEntry())
51 HTMLEntitySearch::CompareResult HTMLEntitySearch::compare(const HTMLEntityTableEntry* entry, UChar nextCharacter) const
53 if (entry->length < m_currentLength + 1)
55 UChar entryNextCharacter = entry->entity[m_currentLength];
56 if (entryNextCharacter == nextCharacter)
58 return entryNextCharacter < nextCharacter ? Before : After;
61 const HTMLEntityTableEntry* HTMLEntitySearch::findFirst(UChar nextCharacter) const
63 const HTMLEntityTableEntry* left = m_first;
64 const HTMLEntityTableEntry* right = m_last;
67 CompareResult result = compare(left, nextCharacter);
72 while (left + 1 < right) {
73 const HTMLEntityTableEntry* probe = halfway(left, right);
74 result = compare(probe, nextCharacter);
78 ASSERT(result == After || result == Prefix);
82 ASSERT(left + 1 == right);
86 const HTMLEntityTableEntry* HTMLEntitySearch::findLast(UChar nextCharacter) const
88 const HTMLEntityTableEntry* left = m_first;
89 const HTMLEntityTableEntry* right = m_last;
92 CompareResult result = compare(right, nextCharacter);
97 while (left + 1 < right) {
98 const HTMLEntityTableEntry* probe = halfway(left, right);
99 result = compare(probe, nextCharacter);
103 ASSERT(result == Before || result == Prefix);
107 ASSERT(left + 1 == right);
111 void HTMLEntitySearch::advance(UChar nextCharacter)
113 ASSERT(isEntityPrefix());
114 if (!m_currentLength) {
115 m_first = HTMLEntityTable::firstEntryStartingWith(nextCharacter);
116 m_last = HTMLEntityTable::lastEntryStartingWith(nextCharacter);
117 if (!m_first || !m_last)
120 m_first = findFirst(nextCharacter);
121 m_last = findLast(nextCharacter);
122 if (m_first == m_last && compare(m_first, nextCharacter) != Prefix)
126 if (m_first->length != m_currentLength) {
130 m_mostRecentMatch = m_first;
131 m_currentValue = m_mostRecentMatch->value;