df0bf6fa5f
DbAccessor: -Guarantees that access to Vertex and Edge is possible only through Vertex::Accessor and Edge::Accessor. -Guarantees that changing Vertex and Edge is possible only using Vertex::Accessor returned by vertex_insert() method and Edge::Accessor returned by edge_insert() method. -Offers CRUD for Vertex and Edge except iterating over all edges. Squashed commit messages: First step in database accessor refactoring done. It's compiling. All tests with exception of integration_querys pass Tests now initialize logging facilities. Refactored accessors. RecordAccessor now has 3 states. From,To,Out,In in there respecive Accessors return unfilled RecordAccessor. Added iterator classes into utils/itearator/.
61 lines
1.1 KiB
C++
61 lines
1.1 KiB
C++
#pragma once
|
|
|
|
#include "utils/option.hpp"
|
|
|
|
namespace iter
|
|
{
|
|
template <class T, class I>
|
|
class Wrap
|
|
{
|
|
|
|
public:
|
|
Wrap() : iter(Option<I>()), value(Option<T>()){};
|
|
|
|
Wrap(I &&iter) : value(iter.next()), iter(Option<I>(std::move(iter))) {}
|
|
|
|
T &operator*()
|
|
{
|
|
assert(value.is_present());
|
|
return value.get();
|
|
}
|
|
|
|
T *operator->()
|
|
{
|
|
assert(value.is_present());
|
|
return &value.get();
|
|
}
|
|
|
|
operator T &()
|
|
{
|
|
assert(value.is_present());
|
|
return value.get();
|
|
}
|
|
|
|
Wrap &operator++()
|
|
{
|
|
assert(iter.is_present());
|
|
value = iter.get().next();
|
|
return (*this);
|
|
}
|
|
|
|
Wrap &operator++(int) { return operator++(); }
|
|
|
|
friend bool operator==(const Wrap &a, const Wrap &b)
|
|
{
|
|
return a.value.is_present() == b.value.is_present();
|
|
}
|
|
|
|
friend bool operator!=(const Wrap &a, const Wrap &b) { return !(a == b); }
|
|
|
|
private:
|
|
Option<I> iter;
|
|
Option<T> value;
|
|
};
|
|
|
|
template <class I>
|
|
auto make_wrap(I &&iter)
|
|
{
|
|
return Wrap<decltype(iter.next().take()), I>(std::move(iter));
|
|
}
|
|
}
|