101 lines
2.9 KiB
C++
101 lines
2.9 KiB
C++
#include "database/db.hpp"
|
|
#include "database/db_accessor.hpp"
|
|
#include "utils/iterator/iterator.hpp"
|
|
|
|
DbAccessor::DbAccessor(Db &db)
|
|
: db_transaction(DbTransaction(db, db.tx_engine.begin()))
|
|
{
|
|
}
|
|
|
|
// VERTEX METHODS
|
|
auto DbAccessor::vertex_access()
|
|
{
|
|
return iter::make_map(
|
|
iter::make_iter(this->db_transaction.db.graph.vertices.access()),
|
|
[&](auto e) -> auto {
|
|
return Vertex::Accessor(&(e->second), db_transaction);
|
|
});
|
|
}
|
|
|
|
Option<const Vertex::Accessor> DbAccessor::vertex_find(const Id &id)
|
|
{
|
|
return this->db_transaction.db.graph.vertices.find(db_transaction, id);
|
|
}
|
|
|
|
Vertex::Accessor DbAccessor::vertex_insert()
|
|
{
|
|
return this->db_transaction.db.graph.vertices.insert(db_transaction);
|
|
}
|
|
|
|
// EDGE METHODS
|
|
|
|
Option<const Edge::Accessor> DbAccessor::edge_find(const Id &id)
|
|
{
|
|
return db_transaction.db.graph.edges.find(db_transaction, id);
|
|
}
|
|
|
|
Edge::Accessor DbAccessor::edge_insert(Vertex::Accessor const &from,
|
|
Vertex::Accessor const &to)
|
|
{
|
|
auto edge_accessor = db_transaction.db.graph.edges.insert(
|
|
db_transaction, from.vlist, to.vlist);
|
|
from.update()->data.out.add(edge_accessor.vlist);
|
|
to.update()->data.in.add(edge_accessor.vlist);
|
|
return edge_accessor;
|
|
}
|
|
|
|
// LABEL METHODS
|
|
const Label &DbAccessor::label_find_or_create(const std::string &name)
|
|
{
|
|
return db_transaction.db.graph.label_store.find_or_create(
|
|
std::forward<const std::string &>(name));
|
|
}
|
|
|
|
bool DbAccessor::label_contains(const std::string &name)
|
|
{
|
|
return db_transaction.db.graph.label_store.contains(
|
|
std::forward<const std::string &>(name));
|
|
}
|
|
|
|
// TYPE METHODS
|
|
const EdgeType &DbAccessor::type_find_or_create(const std::string &name)
|
|
{
|
|
return db_transaction.db.graph.edge_type_store.find_or_create(
|
|
std::forward<const std::string &>(name));
|
|
}
|
|
|
|
bool DbAccessor::type_contains(const std::string &name)
|
|
{
|
|
return db_transaction.db.graph.edge_type_store.contains(
|
|
std::forward<const std::string &>(name));
|
|
}
|
|
|
|
// PROPERTY METHODS
|
|
PropertyFamily &DbAccessor::vertex_property_family_get(const std::string &name)
|
|
{
|
|
return db_transaction.db.graph.vertices.property_family_find_or_create(
|
|
name);
|
|
}
|
|
|
|
PropertyFamily &DbAccessor::edge_property_family_get(const std::string &name)
|
|
{
|
|
return db_transaction.db.graph.edges.property_family_find_or_create(name);
|
|
}
|
|
|
|
// PROPERTY HELPER METHODS
|
|
PropertyFamily::PropertyType::PropertyFamilyKey
|
|
DbAccessor::vertex_property_key(const std::string &name, Type type)
|
|
{
|
|
return vertex_property_family_get(name).get(type).family_key();
|
|
}
|
|
|
|
PropertyFamily::PropertyType::PropertyFamilyKey
|
|
DbAccessor::edge_property_key(const std::string &name, Type type)
|
|
{
|
|
return edge_property_family_get(name).get(type).family_key();
|
|
}
|
|
|
|
// TRANSACTION METHODS
|
|
void DbAccessor::commit() { db_transaction.trans.commit(); }
|
|
void DbAccessor::abort() { db_transaction.trans.abort(); }
|