sneedmc/libutil/include/siglist_impl.h

157 lines
3.1 KiB
C
Raw Normal View History

2013-02-13 16:46:39 +00:00
/* Copyright 2013 MultiMC Contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "siglist.h"
template <typename T>
void SigList<T>::append(const T &value)
{
QList<T>::append(value);
2013-02-21 18:10:10 +00:00
onItemAdded(value, QList<T>::length() - 1);
2013-02-13 16:46:39 +00:00
}
template <typename T>
void SigList<T>::prepend(const T &value)
{
QList<T>::prepend(value);
onItemAdded(value, 0);
}
template <typename T>
void SigList<T>::append(const QList<T> &other)
{
2013-02-21 18:10:10 +00:00
int index = QList<T>::length();
2013-02-13 16:46:39 +00:00
QList<T>::append(other);
onItemsAdded(other, index);
}
template <typename T>
void SigList<T>::clear()
{
QList<T>::clear();
onInvalidated();
}
template <typename T>
2013-02-21 18:42:16 +00:00
void SigList<T>::erase(typename QList<T>::iterator pos)
2013-02-13 16:46:39 +00:00
{
T value = *pos;
2013-02-21 18:59:34 +00:00
int index = QList<T>::indexOf(*pos);
2013-02-13 16:46:39 +00:00
QList<T>::erase(pos);
onItemRemoved(value, index);
}
template <typename T>
2013-02-21 18:42:16 +00:00
void SigList<T>::erase(typename QList<T>::iterator first, typename QList<T>::iterator last)
2013-02-13 16:46:39 +00:00
{
QList<T> removedValues;
2013-02-21 18:59:34 +00:00
int firstIndex = QList<T>::indexOf(*first);
2013-02-13 16:46:39 +00:00
2013-02-21 18:59:34 +00:00
for (auto iter = first; iter < last; iter++)
2013-02-13 16:46:39 +00:00
{
removedValues << *iter;
QList<T>::erase(iter);
}
onItemsRemoved(removedValues, firstIndex);
}
template <typename T>
void SigList<T>::insert(int i, const T &t)
{
QList<T>::insert(i, t);
onItemAdded(t, i);
}
template <typename T>
2013-02-21 18:42:16 +00:00
void SigList<T>::insert(typename QList<T>::iterator before, const T &t)
2013-02-13 16:46:39 +00:00
{
QList<T>::insert(before, t);
2013-02-21 18:59:34 +00:00
onItemAdded(t, QList<T>::indexOf(t));
2013-02-13 16:46:39 +00:00
}
template <typename T>
void SigList<T>::move(int from, int to)
{
2013-02-21 18:10:10 +00:00
const T &item = QList<T>::at(from);
2013-02-13 16:46:39 +00:00
QList<T>::move(from, to);
onItemMoved(item, from, to);
}
template <typename T>
int SigList<T>::removeAll(const T &t)
{
int retVal = QList<T>::removeAll(t);
onInvalidated();
return retVal;
}
template <typename T>
bool SigList<T>::removeOne(const T &t)
{
2013-02-21 18:59:34 +00:00
int index = QList<T>::indexOf(t);
2013-02-13 16:46:39 +00:00
if (QList<T>::removeOne(t))
{
onItemRemoved(t, index);
return true;
}
return false;
}
template <typename T>
void SigList<T>::swap(QList<T> &other)
{
QList<T>::swap(other);
onInvalidated();
}
template <typename T>
void SigList<T>::swap(int i, int j)
{
2013-02-21 18:10:10 +00:00
const T &item1 = QList<T>::at(i);
const T &item2 = QList<T>::at(j);
2013-02-13 16:46:39 +00:00
QList<T>::swap(i, j);
onItemMoved(item1, i, j);
onItemMoved(item2, j, i);
}
template <typename T>
T SigList<T>::takeAt(int i)
{
T val = QList<T>::takeAt(i);
onItemRemoved(val, i);
return val;
}
template <typename T>
T SigList<T>::takeFirst()
{
return takeAt(0);
}
template <typename T>
T SigList<T>::takeLast()
{
2013-02-21 18:10:10 +00:00
return takeAt(QList<T>::length() - 1);
2013-02-13 16:46:39 +00:00
}
template <typename T>
QList<T> &SigList<T>::operator =(const QList<T> &other)
{
QList<T>::operator =(other);
onInvalidated();
return *this;
}