You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
247 lines
4.6 KiB
C++
247 lines
4.6 KiB
C++
5 years ago
|
/*
|
||
|
* Copyright 2020 Michail Vourlakos <mvourlakos@gmail.com>
|
||
|
*
|
||
|
* This file is part of Latte-Dock
|
||
|
*
|
||
|
* Latte-Dock is free software; you can redistribute it and/or
|
||
|
* modify it under the terms of the GNU General Public License as
|
||
|
* published by the Free Software Foundation; either version 2 of
|
||
|
* the License, or (at your option) any later version.
|
||
|
*
|
||
|
* Latte-Dock is distributed in the hope that it will be useful,
|
||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
* GNU General Public License for more details.
|
||
|
*
|
||
|
* You should have received a copy of the GNU General Public License
|
||
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||
|
*
|
||
|
*/
|
||
|
|
||
|
#include "generictable.h"
|
||
|
|
||
|
#include <QDebug>
|
||
|
|
||
|
namespace Latte {
|
||
|
namespace Data {
|
||
|
|
||
|
template <class T>
|
||
|
GenericTable<T>::GenericTable()
|
||
|
{
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
GenericTable<T>::GenericTable(GenericTable<T> &&o)
|
||
|
: m_list(o.m_list)
|
||
|
{
|
||
|
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
GenericTable<T>::GenericTable(const GenericTable<T> &o)
|
||
|
: m_list(o.m_list)
|
||
|
{
|
||
|
|
||
|
}
|
||
|
|
||
|
//! Operators
|
||
|
template <class T>
|
||
|
GenericTable<T> &GenericTable<T>::operator=(const GenericTable<T> &rhs)
|
||
|
{
|
||
|
m_list = rhs.m_list;
|
||
|
|
||
|
return (*this);
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
GenericTable<T> &GenericTable<T>::operator=(GenericTable<T> &&rhs)
|
||
|
{
|
||
|
m_list = rhs.m_list;
|
||
|
return (*this);
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
GenericTable<T> &GenericTable<T>::operator<<(const T &rhs)
|
||
|
{
|
||
|
if (!rhs.id.isEmpty()) {
|
||
|
m_list << rhs;
|
||
|
}
|
||
|
|
||
|
return (*this);
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
bool GenericTable<T>::operator==(const GenericTable<T> &rhs) const
|
||
|
{
|
||
|
if (m_list.count() == 0 && rhs.m_list.count() == 0) {
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
if (m_list.count() != rhs.m_list.count()) {
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
QString id = m_list[i].id;
|
||
|
|
||
|
if (!rhs.containsId(id) || (*this)[id] != rhs[id]){
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
bool GenericTable<T>::operator!=(const GenericTable<T> &rhs) const
|
||
|
{
|
||
|
return !(*this == rhs);
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
T &GenericTable<T>::operator[](const QString &id)
|
||
|
{
|
||
|
int pos{-1};
|
||
|
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
if (m_list[i].id == id){
|
||
|
pos = i;
|
||
|
break;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return m_list[pos];
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
const T GenericTable<T>::operator[](const QString &id) const
|
||
|
{
|
||
|
int pos{-1};
|
||
|
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
if (m_list[i].id == id){
|
||
|
pos = i;
|
||
|
break;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return m_list[pos];
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
T &GenericTable<T>::operator[](const uint &index)
|
||
|
{
|
||
|
return m_list[index];
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
const T GenericTable<T>::operator[](const uint &index) const
|
||
|
{
|
||
|
return m_list[index];
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
GenericTable<T> GenericTable<T>::subtracted(const GenericTable<T> &rhs) const
|
||
|
{
|
||
|
GenericTable<T> subtract;
|
||
|
|
||
|
if ((*this) == rhs) {
|
||
|
return subtract;
|
||
|
}
|
||
|
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
if (!rhs.containsId(m_list[i].id)) {
|
||
|
subtract << m_list[i];
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return subtract;
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
bool GenericTable<T>::containsId(const QString &id) const
|
||
|
{
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
if (m_list[i].id == id){
|
||
|
return true;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
bool GenericTable<T>::containsName(const QString &name) const
|
||
|
{
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
if (m_list[i].name == name){
|
||
|
return true;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
bool GenericTable<T>::rowExists(const int &row) const
|
||
|
{
|
||
|
return (m_list.count()>=0 && row>=0 && row<rowCount());
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
int GenericTable<T>::indexOf(const QString &id) const
|
||
|
{
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
if (m_list[i].id == id){
|
||
|
return i;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return -1;
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
int GenericTable<T>::rowCount() const
|
||
|
{
|
||
|
return m_list.count();
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
QString GenericTable<T>::idForName(const QString &name) const
|
||
|
{
|
||
|
for(int i=0; i<m_list.count(); ++i) {
|
||
|
if (m_list[i].name == name) {
|
||
|
return m_list[i].id;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return QString();
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
void GenericTable<T>::clear()
|
||
|
{
|
||
|
m_list.clear();
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
void GenericTable<T>::remove(const QString &id)
|
||
|
{
|
||
|
const int pos = indexOf(id);
|
||
|
|
||
|
if (pos >= 0) {
|
||
|
m_list.removeAt(pos);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
template <class T>
|
||
|
void GenericTable<T>::remove(const int &row)
|
||
|
{
|
||
|
if (rowExists(row)) {
|
||
|
m_list.removeAt(row);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
}
|
||
|
}
|