forked from fastio/1store
-
Notifications
You must be signed in to change notification settings - Fork 0
/
dict.hh
53 lines (52 loc) · 1.74 KB
/
dict.hh
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
/*
* This file is open source software, licensed to you under the terms
* of the Apache License, Version 2.0 (the "License"). See the NOTICE file
* distributed with this work for additional information regarding copyright
* ownership. You may not use this file except in compliance with the License.
*
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
* Copyright (c) 2016-2026, Peng Jian, [email protected]. All rights reserved.
*
*/
#pragma once
#include "core/stream.hh"
#include "core/memory.hh"
#include <boost/intrusive/list.hpp>
#include <boost/intrusive_ptr.hpp>
#include <boost/lexical_cast.hpp>
#include "core/shared_ptr.hh"
#include "core/sharded.hh"
#include "base.hh"
namespace redis {
class item;
class dict_iterator;
using item_ptr = foreign_ptr<boost::intrusive_ptr<item>>;
class dict : public object {
private:
friend class dict_iterator;
struct rep;
rep* _rep;
public:
dict();
virtual ~dict();
int set(const sstring& key, size_t kh, item* val);
int exists(const sstring& key, size_t kh);
item* fetch_raw(const sstring& key, size_t kh);
int replace(const sstring& key, size_t kh, item* val);
int remove(const sstring& key, size_t kh);
size_t size();
item_ptr fetch(const sstring& key, size_t kh);
std::vector<item_ptr> fetch();
std::vector<item_ptr> fetch(const std::unordered_set<sstring>& keys);
};
} // namespace redis