1 /*
2 * Copyright (C) 2011 Google Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
15 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
16 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
17 * DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
18 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
19 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
20 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
21 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26 #include "config.h"
27 #include "modules/indexeddb/IDBKey.h"
28
29 namespace blink {
30
~IDBKey()31 IDBKey::~IDBKey()
32 {
33 }
34
trace(Visitor * visitor)35 void IDBKey::trace(Visitor* visitor)
36 {
37 visitor->trace(m_array);
38 }
39
isValid() const40 bool IDBKey::isValid() const
41 {
42 if (m_type == InvalidType)
43 return false;
44
45 if (m_type == ArrayType) {
46 for (size_t i = 0; i < m_array.size(); i++) {
47 if (!m_array[i]->isValid())
48 return false;
49 }
50 }
51
52 return true;
53 }
54
55 // Safely compare numbers (signed/unsigned ints/floats/doubles).
56 template <typename T>
compareNumbers(const T & a,const T & b)57 static int compareNumbers(const T& a, const T& b)
58 {
59 if (a < b)
60 return -1;
61 if (b < a)
62 return 1;
63 return 0;
64 }
65
compare(const IDBKey * other) const66 int IDBKey::compare(const IDBKey* other) const
67 {
68 ASSERT(other);
69 if (m_type != other->m_type)
70 return m_type > other->m_type ? -1 : 1;
71
72 switch (m_type) {
73 case ArrayType:
74 for (size_t i = 0; i < m_array.size() && i < other->m_array.size(); ++i) {
75 if (int result = m_array[i]->compare(other->m_array[i].get()))
76 return result;
77 }
78 return compareNumbers(m_array.size(), other->m_array.size());
79 case BinaryType:
80 if (int result = memcmp(m_binary->data(), other->m_binary->data(), std::min(m_binary->size(), other->m_binary->size())))
81 return result < 0 ? -1 : 1;
82 return compareNumbers(m_binary->size(), other->m_binary->size());
83 case StringType:
84 return codePointCompare(m_string, other->m_string);
85 case DateType:
86 case NumberType:
87 return compareNumbers(m_number, other->m_number);
88 case InvalidType:
89 case MinType:
90 ASSERT_NOT_REACHED();
91 return 0;
92 }
93
94 ASSERT_NOT_REACHED();
95 return 0;
96 }
97
isLessThan(const IDBKey * other) const98 bool IDBKey::isLessThan(const IDBKey* other) const
99 {
100 ASSERT(other);
101 return compare(other) == -1;
102 }
103
isEqual(const IDBKey * other) const104 bool IDBKey::isEqual(const IDBKey* other) const
105 {
106 if (!other)
107 return false;
108
109 return !compare(other);
110 }
111
112 } // namespace blink
113