0
0
Fork 0
mirror of https://github.com/matrix-construct/construct synced 2024-11-14 14:01:08 +01:00
construct/include/ircd/db/column.h

283 lines
10 KiB
C++

// Matrix Construct
//
// Copyright (C) Matrix Construct Developers, Authors & Contributors
// Copyright (C) 2016-2018 Jason Volk <jason@zemos.net>
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice is present in all copies. The
// full license for this software is available in the LICENSE file.
#pragma once
#define HAVE_IRCD_DB_COLUMN_H
namespace ircd::db
{
struct column;
using columns = vector_view<column>;
using keys = vector_view<const string_view>;
using bufs = vector_view<mutable_buffer>;
// Information about a column
uint32_t id(const column &) noexcept;
const std::string &name(const column &) noexcept;
const descriptor &describe(const column &) noexcept;
std::vector<std::string> files(const column &);
size_t file_count(const column &);
size_t bytes(const column &);
options getopt(const column &);
// Get property data of a db column. R can optionally be uint64_t for some
// values; we typedef that as prop_int for templating purposes. R can also
// be an std::string which we typedef as prop_str. Refer to RocksDB
// documentation for more info.
template<class R = prop_str> R property(const column &, const string_view &name);
template<> prop_str property(const column &, const string_view &name);
template<> prop_int property(const column &, const string_view &name);
template<> prop_map property(const column &, const string_view &name);
// Access to the column's caches (see cache.h interface)
const rocksdb::Cache *cache_compressed(const column &);
const rocksdb::Cache *cache(const column &);
rocksdb::Cache *cache_compressed(column &);
rocksdb::Cache *cache(column &);
// [GET] Tests if key exists
bool has(column &, const string_view &key, const gopts & = {});
bool cached(column &, const string_view &key, const gopts & = {});
bool prefetch(column &, const string_view &key, const gopts & = {});
// [GET] Tests if multiple keys exist in parallel; returns bitset
uint64_t has(const columns &, const keys &, const gopts & = {});
uint64_t has(column &, const keys &, const gopts & = {});
// [GET] Query space usage
size_t bytes(column &, const std::pair<string_view, string_view> &range, const gopts & = {});
size_t bytes_value(column &, const string_view &key, const gopts & = {});
// [GET] Convenience functions to copy data into your buffer.
string_view read(column &, const string_view &key, const mutable_buffer &, const gopts & = {});
std::string read(column &, const string_view &key, const gopts & = {});
// [GET] Nothrow convenience functions to copy data into your buffer; since
// a key can exist with an empty value we must overload on this bool here.
string_view read(column &, const string_view &key, bool &found, const mutable_buffer &, const gopts & = {});
std::string read(column &, const string_view &key, bool &found, const gopts & = {});
// [GET] Parallel copy into your buffers; your mutable_buffer is resized
// tight to the result size. Returns bitset for existential report.
uint64_t read(const columns &, const keys &, const bufs &, const gopts & = {});
uint64_t read(column &, const keys &, const bufs &, const gopts & = {});
// [SET] Write data to the db
void write(column &, const string_view &key, const const_buffer &value, const sopts & = {});
// [SET] Remove data from the db. not_found is never thrown.
void del(column &, const string_view &key, const sopts & = {});
void del(column &, const std::pair<string_view, string_view> &range, const sopts & = {});
// [SET] Other operations
void ingest(column &, const string_view &path);
void setopt(column &, const string_view &key, const string_view &val);
void compact(column &, const std::pair<string_view, string_view> &, const int &to_level = -1, const compactor & = {});
void compact(column &, const std::pair<int, int> &level = {-1, -1}, const compactor & = {});
void sort(column &, const bool &blocking = false, const bool &now = false);
void check(column &);
void drop(column &); // danger
}
/// Columns add the ability to run multiple LevelDB's in synchrony under the same
/// database (directory). Each column is a fully distinct key/value store; they
/// are merely joined for consistency and possible performance advantages for
/// concurrent multi-column lookups of the same key.
///
/// This class is a handle to the real column instance `database::column` because the
/// real column instance has to have a lifetime congruent to the open database. But
/// that makes this object easier to work with, pass around, and construct. It will
/// find the real `database::column` at any time.
///
/// [GET] If the data is not cached, your ircd::context will yield.
///
/// [SET] usually occur without yielding your context because the DB is oriented
/// around write-log appends. It deals with the heavier tasks later in background.
///
/// NOTE that the column and cell structs are type-agnostic. The database is capable of
/// storing binary data in the key or the value for a cell. The string_view will work
/// with both a normal string and binary data, so this class is not a template and
/// offers no conversions at this interface.
///
struct ircd::db::column
{
struct delta;
struct const_iterator_base;
struct const_iterator;
struct const_reverse_iterator;
using key_type = string_view;
using mapped_type = string_view;
using value_type = std::pair<key_type, mapped_type>;
using pointer = value_type *;
using reference = value_type &;
using iterator = const_iterator;
using reverse_iterator = const_reverse_iterator;
using iterator_category = std::bidirectional_iterator_tag;
using difference_type = size_t;
protected:
database::column *c {nullptr};
public:
explicit operator const database &() const;
explicit operator const database::column &() const;
explicit operator const descriptor &() const noexcept;
explicit operator database &();
explicit operator database::column &();
explicit operator bool() const noexcept;
bool operator!() const noexcept;
// [GET] Iterations
const_iterator begin(gopts = {});
const_iterator last(gopts = {});
const_iterator end(gopts = {});
const_reverse_iterator rbegin(gopts = {});
const_reverse_iterator rend(gopts = {});
const_iterator find(const string_view &key, gopts = {});
const_iterator lower_bound(const string_view &key, gopts = {});
const_iterator upper_bound(const string_view &key, gopts = {});
// [GET] Get cell
cell operator[](const string_view &key) const;
// [GET] Perform a get into a closure. This offers a reference to the data with zero-copy.
using view_closure = std::function<void (const string_view &)>;
bool operator()(const string_view &key, std::nothrow_t, const view_closure &func, const gopts & = {});
bool operator()(const string_view &key, std::nothrow_t, const gopts &, const view_closure &func);
void operator()(const string_view &key, const view_closure &func, const gopts & = {});
void operator()(const string_view &key, const gopts &, const view_closure &func);
// [SET] Perform operations in a sequence as a single transaction. No template iterators
// supported yet, just a ContiguousContainer iteration (and derived convenience overloads)
void operator()(const delta *const &begin, const delta *const &end, const sopts & = {});
void operator()(const std::initializer_list<delta> &, const sopts & = {});
void operator()(const sopts &, const std::initializer_list<delta> &);
void operator()(const delta &, const sopts & = {});
column(database::column &c);
column(database &, const string_view &column);
column(database &, const string_view &column, const std::nothrow_t);
column() = default;
};
/// Delta is an element of a transaction. Use column::delta's to atomically
/// commit to multiple keys in the same column. Refer to delta.h for the `enum op`
/// choices. Refer to cell::delta to transact with multiple cells across different
/// columns. Refer to row::delta to transact with entire rows.
///
/// Note, for now, unlike cell::delta and row::delta, the column::delta has
/// no reference to the column in its tuple. This is why these deltas are executed
/// through the member column::operator() and not an overload of db::write().
///
struct ircd::db::column::delta
:std::tuple<op, string_view, string_view>
{
enum
{
OP, KEY, VAL,
};
delta(const string_view &key, const string_view &val, const enum op &op = op::SET)
:std::tuple<enum op, string_view, string_view>{op, key, val}
{}
delta(const enum op &op, const string_view &key, const string_view &val = {})
:std::tuple<enum op, string_view, string_view>{op, key, val}
{}
};
inline
ircd::db::column::column(database::column &c)
:c{&c}
{}
inline void
ircd::db::column::operator()(const delta &delta,
const sopts &sopts)
{
operator()(&delta, &delta + 1, sopts);
}
inline void
ircd::db::column::operator()(const sopts &sopts,
const std::initializer_list<delta> &deltas)
{
operator()(deltas, sopts);
}
inline void
ircd::db::column::operator()(const std::initializer_list<delta> &deltas,
const sopts &sopts)
{
operator()(std::begin(deltas), std::end(deltas), sopts);
}
inline void
ircd::db::column::operator()(const string_view &key,
const gopts &gopts,
const view_closure &func)
{
return operator()(key, func, gopts);
}
inline bool
ircd::db::column::operator()(const string_view &key,
const std::nothrow_t,
const gopts &gopts,
const view_closure &func)
{
return operator()(key, std::nothrow, func, gopts);
}
inline bool
ircd::db::column::operator!()
const noexcept
{
return !bool(*this);
}
inline ircd::db::column::operator
const descriptor &()
const noexcept
{
return describe(*this);
}
inline ircd::db::column::operator
database::column &()
{
return *c;
}
inline ircd::db::column::operator
database &()
{
return database::get(*c);
}
inline ircd::db::column::operator
const database::column &()
const
{
return *c;
}
inline ircd::db::column::operator
const database &()
const
{
return database::get(*c);
}