1/*
2 * Copyright (C) 2015 Apple 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 * 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.
12 *
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.
24 */
25
26#pragma once
27
28#if ENABLE(INDEXED_DATABASE)
29
30#include "IDBKeyData.h"
31
32namespace WebCore {
33
34class ThreadSafeDataBuffer;
35
36enum class CursorDuplicity;
37
38namespace IDBServer {
39
40class IndexValueEntry {
41 WTF_MAKE_FAST_ALLOCATED;
42public:
43 IndexValueEntry(bool unique);
44 ~IndexValueEntry();
45
46 void addKey(const IDBKeyData&);
47
48 // Returns true if a key was actually removed.
49 bool removeKey(const IDBKeyData&);
50
51 const IDBKeyData* getLowest() const;
52
53 uint64_t getCount() const;
54
55 class Iterator {
56 public:
57 Iterator()
58 {
59 }
60
61 Iterator(IndexValueEntry&);
62 Iterator(IndexValueEntry&, IDBKeyDataSet::iterator);
63 Iterator(IndexValueEntry&, IDBKeyDataSet::reverse_iterator);
64
65 bool isValid() const;
66 void invalidate();
67
68 const IDBKeyData& key() const;
69 const ThreadSafeDataBuffer& value() const;
70
71 Iterator& operator++();
72
73 private:
74 IndexValueEntry* m_entry { nullptr };
75 bool m_forward { true };
76 IDBKeyDataSet::iterator m_forwardIterator;
77 IDBKeyDataSet::reverse_iterator m_reverseIterator;
78 };
79
80 Iterator begin();
81 Iterator reverseBegin(CursorDuplicity);
82
83 // Finds the key, or the next higher record after the key.
84 Iterator find(const IDBKeyData&);
85 // Finds the key, or the next lowest record before the key.
86 Iterator reverseFind(const IDBKeyData&, CursorDuplicity);
87
88 bool unique() const { return m_unique; }
89
90private:
91 union {
92 IDBKeyDataSet* m_orderedKeys;
93 IDBKeyData* m_key;
94 };
95
96 bool m_unique;
97};
98
99} // namespace IDBServer
100} // namespace WebCore
101
102#endif // ENABLE(INDEXED_DATABASE)
103