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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* Copyright (C) 2010 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 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 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.
*/
#ifndef IDBKeyTree_h
#define IDBKeyTree_h
#if ENABLE(INDEXED_DATABASE)
#include "IDBKey.h"
#include <wtf/AVLTree.h>
#include <wtf/Vector.h>
namespace WebCore {
template <typename ValueType>
class IDBKeyTree : public RefCounted<IDBKeyTree<ValueType> > {
public:
static PassRefPtr<IDBKeyTree> create()
{
return adoptRef(new IDBKeyTree());
}
~IDBKeyTree();
ValueType* get(IDBKey* key);
void put(IDBKey* key, ValueType* value);
void remove(IDBKey* key);
private:
struct TreeNode {
RefPtr<ValueType> value;
RefPtr<IDBKey> key;
TreeNode* less;
TreeNode* greater;
int balanceFactor;
};
struct AVLTreeAbstractor {
typedef TreeNode* handle;
typedef size_t size;
typedef IDBKey* key;
handle get_less(handle h) { return h->less; }
void set_less(handle h, handle lh) { h->less = lh; }
handle get_greater(handle h) { return h->greater; }
void set_greater(handle h, handle gh) { h->greater = gh; }
int get_balance_factor(handle h) { return h->balanceFactor; }
void set_balance_factor(handle h, int bf) { h->balanceFactor = bf; }
static handle null() { return 0; }
int compare_key_key(key va, key vb);
int compare_key_node(key k, handle h) { return compare_key_key(k, h->key.get()); }
int compare_node_node(handle h1, handle h2) { return compare_key_key(h1->key.get(), h2->key.get()); }
};
IDBKeyTree();
typedef WTF::AVLTree<AVLTreeAbstractor> TreeType;
TreeType m_tree;
};
template <typename ValueType>
IDBKeyTree<ValueType>::IDBKeyTree()
{
}
template <typename ValueType>
IDBKeyTree<ValueType>::~IDBKeyTree()
{
typename TreeType::Iterator iter;
iter.start_iter_least(m_tree);
for (; *iter; ++iter)
delete *iter;
m_tree.purge();
}
template <typename ValueType>
int IDBKeyTree<ValueType>::AVLTreeAbstractor::compare_key_key(key va, key vb)
{
if (va->type() != vb->type())
return vb->type() - va->type();
switch (va->type()) {
case IDBKey::NullType:
return 0;
case IDBKey::NumberType:
return vb->number() - va->number();
case IDBKey::StringType:
return codePointCompare(va->string(), vb->string());
// FIXME: Handle dates. Oh, and test this thoroughly.
default:
ASSERT_NOT_REACHED();
return 0;
}
}
template <typename ValueType>
ValueType* IDBKeyTree<ValueType>::get(IDBKey* key)
{
TreeNode* node = m_tree.search(key);
if (!node)
return 0;
return node->value.get();
}
template <typename ValueType>
void IDBKeyTree<ValueType>::put(IDBKey* key, ValueType* value)
{
TreeNode* node = m_tree.search(key);
if (!node) {
node = new TreeNode();
node->key = key;
m_tree.insert(node);
}
node->value = value;
}
template <typename ValueType>
void IDBKeyTree<ValueType>::remove(IDBKey* key)
{
TreeNode* node = m_tree.remove(key);
if (node)
delete node;
}
}
#endif // ENABLE(INDEXED_DATABASE)
#endif // IDBKeyTree_h
|
