2023-08-05 20:13:43 +00:00
|
|
|
/*
|
|
|
|
* LMDB Abstraction Layer.
|
|
|
|
* Copyright (C) 2023 Yury Gubich <blue@macaw.me>
|
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2024-12-17 18:03:48 +00:00
|
|
|
#pragma once
|
2023-08-05 20:13:43 +00:00
|
|
|
|
2023-08-07 21:27:44 +00:00
|
|
|
#include <string>
|
|
|
|
|
|
|
|
#include "lmdb.h"
|
2023-08-05 20:13:43 +00:00
|
|
|
#include "base.h"
|
|
|
|
#include "storage.h"
|
2023-10-17 21:06:11 +00:00
|
|
|
#include "transaction.h"
|
2024-12-25 17:19:32 +00:00
|
|
|
#include "cursorcommon.h"
|
2023-08-05 20:13:43 +00:00
|
|
|
|
|
|
|
namespace LMDBAL {
|
|
|
|
|
|
|
|
template <class K, class V>
|
2024-12-25 17:19:32 +00:00
|
|
|
class Cursor : public CursorCommon {
|
2023-08-05 20:13:43 +00:00
|
|
|
friend class Storage<K, V>;
|
2023-10-25 22:18:23 +00:00
|
|
|
public:
|
|
|
|
Cursor();
|
2023-08-05 20:13:43 +00:00
|
|
|
Cursor(Storage<K, V>* parent);
|
2023-10-25 22:18:23 +00:00
|
|
|
Cursor(const Cursor& other) = delete;
|
|
|
|
Cursor(Cursor&& other);
|
2023-08-05 20:13:43 +00:00
|
|
|
~Cursor();
|
|
|
|
|
2023-10-25 22:18:23 +00:00
|
|
|
Cursor& operator = (const Cursor& other) = delete;
|
|
|
|
Cursor& operator = (Cursor&& other);
|
|
|
|
|
|
|
|
void drop();
|
2023-08-07 21:27:44 +00:00
|
|
|
|
2023-10-25 22:18:23 +00:00
|
|
|
std::pair<K, V> first();
|
|
|
|
std::pair<K, V> last();
|
|
|
|
std::pair<K, V> next();
|
|
|
|
std::pair<K, V> prev();
|
2023-08-07 21:27:44 +00:00
|
|
|
std::pair<K, V> current() const;
|
2023-10-25 22:18:23 +00:00
|
|
|
bool set(const K& target);
|
2023-08-07 21:27:44 +00:00
|
|
|
|
2023-10-25 22:18:23 +00:00
|
|
|
void first(K& key, V& value);
|
|
|
|
void last(K& key, V& value);
|
|
|
|
void next(K& key, V& value);
|
|
|
|
void prev(K& key, V& value);
|
2023-08-09 17:41:15 +00:00
|
|
|
void current(K& key, V& value) const;
|
2023-08-05 20:13:43 +00:00
|
|
|
|
|
|
|
private:
|
2023-08-09 17:41:15 +00:00
|
|
|
void operateCursorRead(K& key, V& value, MDB_cursor_op operation, const std::string& methodName, const std::string& operationName) const;
|
2023-08-05 20:13:43 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
#include "cursor.hpp"
|