2017-12-09 20:21:22 +01:00
|
|
|
|
#ifndef PGCONTAINER_H
|
2017-02-12 14:03:42 +01:00
|
|
|
|
#define PGCONTAINER_H
|
|
|
|
|
|
|
2017-12-09 21:46:19 +01:00
|
|
|
|
#include "Pgsql_declare.h"
|
2017-12-12 20:13:53 +01:00
|
|
|
|
#include "Pgsql_Result.h"
|
2017-02-12 14:03:42 +01:00
|
|
|
|
#include <QString>
|
2017-12-09 20:21:22 +01:00
|
|
|
|
#include <memory>
|
2017-02-12 14:03:42 +01:00
|
|
|
|
#include <vector>
|
2017-08-23 13:27:23 +02:00
|
|
|
|
#include <libpq-fe.h>
|
2017-02-12 14:03:42 +01:00
|
|
|
|
|
2017-12-09 21:46:19 +01:00
|
|
|
|
|
2017-12-10 10:35:46 +01:00
|
|
|
|
class PgDatabaseCatalog;
|
2017-02-18 12:05:48 +01:00
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
class IPgContainer {
|
2017-12-09 21:46:19 +01:00
|
|
|
|
public:
|
2018-11-18 19:30:45 +01:00
|
|
|
|
IPgContainer(PgDatabaseCatalog& cat);
|
|
|
|
|
|
virtual ~IPgContainer() = default;
|
2017-12-09 21:46:19 +01:00
|
|
|
|
|
|
|
|
|
|
virtual std::string getLoadQuery() const = 0;
|
|
|
|
|
|
virtual void load(const Pgsql::Result &res) = 0;
|
2018-11-18 19:30:45 +01:00
|
|
|
|
|
|
|
|
|
|
bool minimumVersion(int required_version) const;
|
|
|
|
|
|
protected:
|
|
|
|
|
|
PgDatabaseCatalog& m_catalog;
|
2017-12-09 21:46:19 +01:00
|
|
|
|
};
|
|
|
|
|
|
|
2017-12-12 20:13:53 +01:00
|
|
|
|
template<typename T, typename K=Oid>
|
2018-11-18 19:30:45 +01:00
|
|
|
|
class PgContainer: public IPgContainer {
|
2017-02-12 14:03:42 +01:00
|
|
|
|
public:
|
|
|
|
|
|
using t_Container = std::vector<T>; ///< Do not assume it will stay a vector only expect bidirectional access
|
|
|
|
|
|
|
2018-09-09 18:52:32 +02:00
|
|
|
|
PgContainer() = default;
|
|
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
explicit PgContainer(PgDatabaseCatalog& cat)
|
|
|
|
|
|
: IPgContainer(cat)
|
|
|
|
|
|
{
|
|
|
|
|
|
}
|
2017-12-09 21:46:19 +01:00
|
|
|
|
|
2017-02-12 14:03:42 +01:00
|
|
|
|
typename t_Container::const_iterator begin() const
|
|
|
|
|
|
{
|
|
|
|
|
|
return m_container.begin();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
typename t_Container::const_iterator end() const
|
|
|
|
|
|
{
|
|
|
|
|
|
return m_container.end();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void clear()
|
|
|
|
|
|
{
|
|
|
|
|
|
m_container.clear();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
size_t count() const
|
2017-02-12 14:03:42 +01:00
|
|
|
|
{
|
2018-11-18 19:30:45 +01:00
|
|
|
|
return m_container.size();
|
2017-02-12 14:03:42 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
const T* getByKey(const K &key) const
|
2017-02-12 14:03:42 +01:00
|
|
|
|
{
|
2017-12-12 20:13:53 +01:00
|
|
|
|
auto lb_result = std::lower_bound(m_container.begin(), m_container.end(), key);
|
|
|
|
|
|
if (lb_result != m_container.end() && *lb_result == key)
|
2018-11-18 19:30:45 +01:00
|
|
|
|
return &*lb_result;
|
2017-02-12 14:03:42 +01:00
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
return nullptr;
|
2017-02-12 14:03:42 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
const T* getByName(const QString &name) const
|
2017-02-12 14:03:42 +01:00
|
|
|
|
{
|
|
|
|
|
|
auto find_res = std::find(m_container.begin(), m_container.end(), name);
|
|
|
|
|
|
|
|
|
|
|
|
if (find_res != m_container.end())
|
2018-11-18 19:30:45 +01:00
|
|
|
|
return &*find_res;
|
2017-02-12 14:03:42 +01:00
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
return nullptr;
|
2017-02-12 14:03:42 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
/// Retrieve element by index
|
|
|
|
|
|
///
|
|
|
|
|
|
/// This function throws when idx is out of range
|
|
|
|
|
|
/// otherwise it always returns a valid object.
|
2017-02-12 14:03:42 +01:00
|
|
|
|
const T& getByIdx(int idx) const
|
|
|
|
|
|
{
|
|
|
|
|
|
return m_container.at(idx);
|
|
|
|
|
|
}
|
2017-12-12 20:13:53 +01:00
|
|
|
|
|
|
|
|
|
|
/** Override to implement complete loading logic.
|
|
|
|
|
|
*
|
|
|
|
|
|
* Do not override this function if you only want to implement
|
|
|
|
|
|
* the loading of a single element. Override loadElem instead.
|
|
|
|
|
|
*/
|
|
|
|
|
|
virtual void load(const Pgsql::Result &res) override
|
|
|
|
|
|
{
|
|
|
|
|
|
m_container.clear();
|
|
|
|
|
|
m_container.reserve(res.rows());
|
|
|
|
|
|
for (auto row : res)
|
|
|
|
|
|
m_container.push_back(loadElem(row));
|
|
|
|
|
|
|
|
|
|
|
|
std::sort(m_container.begin(), m_container.end());
|
|
|
|
|
|
}
|
2018-09-09 18:52:32 +02:00
|
|
|
|
|
|
|
|
|
|
// Meant for mocking during testing
|
|
|
|
|
|
void add(const T &elem)
|
|
|
|
|
|
{
|
|
|
|
|
|
m_container.push_back(elem);
|
|
|
|
|
|
std::sort(m_container.begin(), m_container.end());
|
|
|
|
|
|
}
|
2017-02-12 14:03:42 +01:00
|
|
|
|
protected:
|
|
|
|
|
|
t_Container m_container;
|
2017-12-12 20:13:53 +01:00
|
|
|
|
|
|
|
|
|
|
/** Override the implementation for this function to implement loading of single row.
|
|
|
|
|
|
*
|
|
|
|
|
|
* When overriding this function there is no need to override load.
|
|
|
|
|
|
*/
|
2018-11-18 19:30:45 +01:00
|
|
|
|
virtual T loadElem(const Pgsql::Row &) = 0;
|
2017-02-12 14:03:42 +01:00
|
|
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
2018-01-08 20:45:52 +01:00
|
|
|
|
|
|
|
|
|
|
template<typename T, typename K=Oid>
|
2018-11-18 19:30:45 +01:00
|
|
|
|
class PgSPtrContainer: public IPgContainer {
|
2018-01-08 20:45:52 +01:00
|
|
|
|
public:
|
|
|
|
|
|
using t_Elem = std::shared_ptr<T>;
|
|
|
|
|
|
using t_Container = std::vector<t_Elem>; ///< Do not assume it will stay a vector only expect bidirectional access
|
|
|
|
|
|
|
2018-12-25 13:17:04 +01:00
|
|
|
|
explicit PgSPtrContainer(PgDatabaseCatalog& cat)
|
2018-12-24 11:33:24 +01:00
|
|
|
|
: IPgContainer(cat)
|
2018-01-08 20:45:52 +01:00
|
|
|
|
{}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
typename t_Container::const_iterator begin() const
|
|
|
|
|
|
{
|
|
|
|
|
|
return m_container.begin();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
typename t_Container::const_iterator end() const
|
|
|
|
|
|
{
|
|
|
|
|
|
return m_container.end();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void clear()
|
|
|
|
|
|
{
|
|
|
|
|
|
m_container.clear();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int count() const
|
|
|
|
|
|
{
|
2018-12-25 13:17:04 +01:00
|
|
|
|
return static_cast<int>(m_container.size());
|
2018-01-08 20:45:52 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const t_Elem getByKey(const K &key) const
|
|
|
|
|
|
{
|
|
|
|
|
|
auto lb_result = std::lower_bound(m_container.begin(), m_container.end(), key);
|
|
|
|
|
|
if (lb_result != m_container.end() && **lb_result == key)
|
|
|
|
|
|
return *lb_result;
|
|
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
return nullptr;
|
2018-01-08 20:45:52 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const t_Elem getByName(const QString name) const
|
|
|
|
|
|
{
|
|
|
|
|
|
auto find_res = std::find_if(m_container.begin(), m_container.end(),
|
|
|
|
|
|
[name](auto e) -> bool { return *e = name; } );
|
|
|
|
|
|
|
|
|
|
|
|
if (find_res != m_container.end())
|
|
|
|
|
|
return *find_res;
|
|
|
|
|
|
|
2018-11-18 19:30:45 +01:00
|
|
|
|
return nullptr;
|
2018-01-08 20:45:52 +01:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const t_Elem getByIdx(int idx) const
|
|
|
|
|
|
{
|
|
|
|
|
|
return m_container.at(idx);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/** Override to implement complete loading logic.
|
|
|
|
|
|
*
|
|
|
|
|
|
* Do not override this function if you only want to implement
|
|
|
|
|
|
* the loading of a single element. Override loadElem instead.
|
|
|
|
|
|
*/
|
|
|
|
|
|
virtual void load(const Pgsql::Result &res) override
|
|
|
|
|
|
{
|
|
|
|
|
|
m_container.clear();
|
|
|
|
|
|
m_container.reserve(res.rows());
|
|
|
|
|
|
for (auto row : res)
|
|
|
|
|
|
m_container.push_back(loadElem(row));
|
|
|
|
|
|
|
|
|
|
|
|
std::sort(m_container.begin(), m_container.end());
|
|
|
|
|
|
}
|
|
|
|
|
|
protected:
|
|
|
|
|
|
t_Container m_container;
|
|
|
|
|
|
|
|
|
|
|
|
/** Override the implementation for this function to implement loading of single row.
|
|
|
|
|
|
*
|
|
|
|
|
|
* When overriding this function there is no need to override load.
|
|
|
|
|
|
*/
|
|
|
|
|
|
virtual t_Elem loadElem(const Pgsql::Row &) = 0;
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
2017-02-12 14:03:42 +01:00
|
|
|
|
#endif // PGCONTAINER_H
|