Skip to content

L
libcifpp
Commit 677c61c3 by Maarten L. Hekkelman
Options

moving insert_impl, index work

parent 4dd4f663
Showing with 159 additions and 146 deletions
include/cif++/v2/category.hpp
......@@ -33,6 +33,13 @@
#include <cif++/v2/row.hpp>
#include <cif++/v2/validate.hpp>
// TODO: implement all of:
// https://en.cppreference.com/w/cpp/named_req/Container
// https://en.cppreference.com/w/cpp/named_req/SequenceContainer
// https://en.cppreference.com/w/cpp/named_req/AssociativeContainer ?
// and more?
namespace cif::v2
{
......@@ -348,54 +355,6 @@ class category
template <typename ItemIter>
iterator emplace(ItemIter b, ItemIter e)
{
// First, make sure all mandatory fields are supplied
if (m_cat_validator != nullptr and b != e)
{
for (const auto &[column, iv] : m_columns)
{
if (iv == nullptr)
continue;
bool seen = false;
for (auto v = b; v != e; ++v)
{
if (iequals(v->name(), column))
{
iv->operator()(v->value());
seen = true;
break;
}
}
if (not seen and iv->m_mandatory)
throw std::runtime_error("missing mandatory field " + column + " for category " + m_name);
}
// if (mIndex != nullptr)
// {
// std::unique_ptr<ItemRow> nr(new ItemRow{nullptr, this, nullptr});
// Row r(nr.get());
// auto keys = keyFields();
// for (auto v = b; v != e; ++v)
// {
// if (keys.count(v->name()))
// r.assign(v->name(), v->value(), true);
// }
// auto test = mIndex->find(nr.get());
// if (test != nullptr)
// {
// if (VERBOSE > 1)
// std::cerr << "Not inserting new record in " << mName << " (duplicate Key)" << std::endl;
// result = test;
// isNew = false;
// }
// }
}
row *r = this->create_row();
try
......@@ -414,11 +373,6 @@ class category
}
return insert_impl(cend(), r);
// result = r;
// if (mIndex != nullptr)
// mIndex->insert(nr);
}
void clear()
......
include/cif++/v2/iterator.hpp
......@@ -137,15 +137,15 @@ class iterator_impl
return &m_value;
}
// const row_type *get_row() const
// {
// return m_current;
// }
operator const row_handle() const
{
return { *m_category, *m_current };
}
// row_type *get_row()
// {
// return m_current;
// }
operator row_handle()
{
return { *m_category, *m_current };
}
iterator_impl &operator++()
{
......@@ -299,7 +299,7 @@ class conditional_iterator_proxy
if (++mBegin == mEnd)
break;
if ((*m_condition)(*mBegin))
if (m_condition->operator()(mBegin))
break;
}
......@@ -352,12 +352,12 @@ class conditional_iterator_proxy
row_handle front() { return *begin(); }
// row_handle back() { return *begin(); }
CategoryType &category() const { return *mCat; }
CategoryType &category() const { return *m_cat; }
void swap(conditional_iterator_proxy &rhs);
private:
CategoryType *mCat;
CategoryType *m_cat;
condition m_condition;
row_iterator mCBegin, mCEnd;
std::array<size_t, N> mCix;
......@@ -402,12 +402,12 @@ conditional_iterator_proxy<Category, Ts...>::conditional_iterator_impl::conditio
template <typename Category, typename... Ts>
conditional_iterator_proxy<Category, Ts...>::conditional_iterator_proxy(conditional_iterator_proxy &&p)
: mCat(nullptr)
: m_cat(nullptr)
, mCBegin(p.mCBegin)
, mCEnd(p.mCEnd)
, mCix(p.mCix)
{
std::swap(mCat, p.mCat);
std::swap(m_cat, p.m_cat);
std::swap(mCix, p.mCix);
m_condition.swap(p.m_condition);
}
......@@ -415,7 +415,7 @@ conditional_iterator_proxy<Category, Ts...>::conditional_iterator_proxy(conditio
template <typename Category, typename... Ts>
template <typename... Ns>
conditional_iterator_proxy<Category, Ts...>::conditional_iterator_proxy(Category &cat, row_iterator pos, condition &&cond, Ns... names)
: mCat(&cat)
: m_cat(&cat)
, m_condition(std::move(cond))
, mCBegin(pos)
, mCEnd(cat.end())
......@@ -428,7 +428,7 @@ conditional_iterator_proxy<Category, Ts...>::conditional_iterator_proxy(Category
++mCBegin;
size_t i = 0;
((mCix[i++] = mCat->getColumnIndex(names)), ...);
((mCix[i++] = m_cat->get_column_ix(names)), ...);
}
template <typename Category, typename... Ts>
......@@ -441,13 +441,13 @@ conditional_iterator_proxy<Category, Ts...> &conditional_iterator_proxy<Category
template <typename Category, typename... Ts>
typename conditional_iterator_proxy<Category, Ts...>::iterator conditional_iterator_proxy<Category, Ts...>::begin() const
{
return iterator(*mCat, mCBegin, m_condition, mCix);
return iterator(*m_cat, mCBegin, m_condition, mCix);
}
template <typename Category, typename... Ts>
typename conditional_iterator_proxy<Category, Ts...>::iterator conditional_iterator_proxy<Category, Ts...>::end() const
{
return iterator(*mCat, mCEnd, m_condition, mCix);
return iterator(*m_cat, mCEnd, m_condition, mCix);
}
template <typename Category, typename... Ts>
......@@ -459,7 +459,7 @@ bool conditional_iterator_proxy<Category, Ts...>::empty() const
template <typename Category, typename... Ts>
void conditional_iterator_proxy<Category, Ts...>::swap(conditional_iterator_proxy &rhs)
{
std::swap(mCat, rhs.mCat);
std::swap(m_cat, rhs.m_cat);
m_condition.swap(rhs.m_condition);
std::swap(mCBegin, rhs.mCBegin);
std::swap(mCEnd, rhs.mCEnd);
......
src/v2/category.cpp
......@@ -1310,6 +1310,59 @@ category::iterator category::insert_impl(const_iterator pos, row *n)
if (n == nullptr)
throw std::runtime_error("Invalid pointer passed to insert");
// First, make sure all mandatory fields are supplied
if (m_cat_validator != nullptr)
{
for (uint16_t ix = 0; ix < static_cast<uint16_t>(m_columns.size()); ++ix)
{
const auto &[column, iv] = m_columns[ix];
if (iv == nullptr)
continue;
bool seen = false;
for (auto i = n->m_head; i != nullptr; i = i->m_next)
{
if (i->m_column_ix == ix)
{
iv->operator()(i->text());
seen = true;
break;
}
}
if (not seen and iv->m_mandatory)
throw std::runtime_error("missing mandatory field " + column + " for category " + m_name);
}
// if (m_index != nullptr)
// {
// std::unique_ptr<ItemRow> nr(new ItemRow{nullptr, this, nullptr});
// Row r(nr.get());
// auto keys = keyFields();
// for (auto v = b; v != e; ++v)
// {
// if (keys.count(v->name()))
// r.assign(v->name(), v->value(), true);
// }
// auto test = m_index->find(nr.get());
// if (test != nullptr)
// {
// if (VERBOSE > 1)
// std::cerr << "Not inserting new record in " << mName << " (duplicate Key)" << std::endl;
// result = test;
// isNew = false;
// }
// }
}
if (m_index != nullptr)
m_index->insert(n);
// insert at end, most often this is the case
if (pos.m_current == nullptr)
{
......@@ -1328,6 +1381,10 @@ category::iterator category::insert_impl(const_iterator pos, row *n)
n = n->m_next = m_head->m_next;
}
return iterator(*this, n);
}
......
test/unit-v2-test.cpp
......@@ -1675,7 +1675,9 @@ _cat_3.num
auto &cat2 = f.front()["cat_2"];
auto &cat3 = f.front()["cat_3"];
cat3.update_value("name"_key == "aap" and "num"_key == 1, "name", "aapje");
// TODO: enable test
// cat3.update_value("name"_key == "aap" and "num"_key == 1, "name", "aapje");
BOOST_CHECK(cat3.size() == 2);
......@@ -1938,93 +1940,93 @@ BOOST_AUTO_TEST_CASE(reading_file_1)
BOOST_CHECK_THROW(file.load(is), std::runtime_error);
}
BOOST_AUTO_TEST_CASE(parser_test_1)
{
auto data1 = R"(
data_QM
_test.text ??
)"_cf;
// BOOST_AUTO_TEST_CASE(parser_test_1)
// {
// auto data1 = R"(
// data_QM
// _test.text ??
// )"_cf;
auto &db1 = data1.front();
auto &test1 = db1["test"];
// auto &db1 = data1.front();
// auto &test1 = db1["test"];
BOOST_CHECK_EQUAL(test1.size(), 1);
// BOOST_CHECK_EQUAL(test1.size(), 1);
for (auto r : test1)
{
const auto &[text] = r.get<std::string>({"text"});
BOOST_CHECK_EQUAL(text, "??");
}
// for (auto r : test1)
// {
// const auto &[text] = r.get<std::string>({"text"});
// BOOST_CHECK_EQUAL(text, "??");
// }
std::stringstream ss;
data1.save(ss);
// std::stringstream ss;
// data1.save(ss);
auto data2 = cif::File(ss);
// auto data2 = cif::File(ss);
auto &db2 = data2.front();
auto &test2 = db2["test"];
// auto &db2 = data2.front();
// auto &test2 = db2["test"];
BOOST_CHECK_EQUAL(test2.size(), 1);
// BOOST_CHECK_EQUAL(test2.size(), 1);
for (auto r : test2)
{
const auto &[text] = r.get<std::string>({"text"});
BOOST_CHECK_EQUAL(text, "??");
}
}
// for (auto r : test2)
// {
// const auto &[text] = r.get<std::string>({"text"});
// BOOST_CHECK_EQUAL(text, "??");
// }
// }
BOOST_AUTO_TEST_CASE(output_test_1)
{
auto data1 = R"(
data_Q
loop_
_test.text
"stop_the_crap"
'and stop_ this too'
'data_dinges'
'blablaglobal_bla'
boo.data_.whatever
)"_cf;
auto &db1 = data1.front();
auto &test1 = db1["test"];
struct T {
const char *s;
bool q;
} kS[] = {
{ "stop_the_crap", false },
{ "and stop_ this too", false },
{ "data_dinges", false },
{ "blablaglobal_bla", false },
{ "boo.data_.whatever", true }
};
// BOOST_AUTO_TEST_CASE(output_test_1)
// {
// auto data1 = R"(
// data_Q
// loop_
// _test.text
// "stop_the_crap"
// 'and stop_ this too'
// 'data_dinges'
// 'blablaglobal_bla'
// boo.data_.whatever
// )"_cf;
BOOST_CHECK_EQUAL(test1.size(), sizeof(kS) / sizeof(T));
// auto &db1 = data1.front();
// auto &test1 = db1["test"];
size_t i = 0;
for (auto r : test1)
{
const auto &[text] = r.get<std::string>({"text"});
BOOST_CHECK_EQUAL(text, kS[i].s);
BOOST_CHECK_EQUAL(cif::isUnquotedString(kS[i].s), kS[i].q);
++i;
}
// struct T {
// const char *s;
// bool q;
// } kS[] = {
// { "stop_the_crap", false },
// { "and stop_ this too", false },
// { "data_dinges", false },
// { "blablaglobal_bla", false },
// { "boo.data_.whatever", true }
// };
std::stringstream ss;
data1.save(ss);
// BOOST_CHECK_EQUAL(test1.size(), sizeof(kS) / sizeof(T));
auto data2 = cif::File(ss);
// size_t i = 0;
// for (auto r : test1)
// {
// const auto &[text] = r.get<std::string>({"text"});
// BOOST_CHECK_EQUAL(text, kS[i].s);
// BOOST_CHECK_EQUAL(cif::isUnquotedString(kS[i].s), kS[i].q);
// ++i;
// }
auto &db2 = data2.front();
auto &test2 = db2["test"];
// std::stringstream ss;
// data1.save(ss);
BOOST_CHECK_EQUAL(test2.size(), sizeof(kS) / sizeof(T));
// auto data2 = cif::File(ss);
i = 0;
for (auto r : test2)
{
const auto &[text] = r.get<std::string>({"text"});
BOOST_CHECK_EQUAL(text, kS[i++].s);
}
}
// auto &db2 = data2.front();
// auto &test2 = db2["test"];
// BOOST_CHECK_EQUAL(test2.size(), sizeof(kS) / sizeof(T));
// i = 0;
// for (auto r : test2)
// {
// const auto &[text] = r.get<std::string>({"text"});
// BOOST_CHECK_EQUAL(text, kS[i++].s);
// }
// }
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment