1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111
|
/***************************************************************************
Copyright 2008 Frederik Gladhorn <frederik.gladhorn@kdemail.net>
***************************************************************************/
/***************************************************************************
* *
* This program 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. *
* *
***************************************************************************/
#include "keduvocleitnerbox.h"
#include "keduvocexpression.h"
#include <QtCore/QSet>
class KEduVocLeitnerBox::Private
{
public:
// cache the entries
QList<KEduVocExpression*> m_expressions;
// list of translations
QList<KEduVocTranslation*> m_translations;
};
KEduVocLeitnerBox::KEduVocLeitnerBox(const QString& name, KEduVocLeitnerBox *parent)
: KEduVocContainer(name, Leitner, parent), d( new Private )
{
// only one top level and children, this is only a list
Q_ASSERT(!parent || !parent->parent());
}
KEduVocLeitnerBox::~KEduVocLeitnerBox()
{
foreach(KEduVocTranslation* translation, d->m_translations) {
translation->setLeitnerBox(0);
}
delete d;
}
QList<KEduVocExpression*> KEduVocLeitnerBox::entries(EnumEntriesRecursive recursive)
{
Q_UNUSED(recursive)
return d->m_expressions;
}
int KEduVocLeitnerBox::entryCount(EnumEntriesRecursive recursive)
{
Q_UNUSED(recursive)
return d->m_expressions.count();
}
void KEduVocLeitnerBox::addTranslation(KEduVocTranslation* translation)
{
// add to expression - if not already there because another translation of the same word is there.
bool found = false;
foreach(int i, translation->entry()->translationIndices()) {
if (translation->entry()->translation(i)->leitnerBox() == this) {
found = true;
break;
}
}
if (!found) {
d->m_expressions.append(translation->entry());
}
d->m_translations.append( translation );
invalidateChildLessonEntries();
}
void KEduVocLeitnerBox::removeTranslation(KEduVocTranslation* translation)
{
int index = d->m_translations.indexOf(translation);
d->m_translations.removeAt(index);
// no lesson found - this entry is being deleted. remove all its siblings.
if (!translation->entry()->lesson()) {
int index = d->m_expressions.indexOf(translation->entry());
if (index != -1) {
d->m_expressions.removeAt(index);
}
}
// remove from cache
bool found = false;
foreach(int i, translation->entry()->translationIndices()) {
if (translation->entry()->translation(i)->leitnerBox() == this) {
found = true;
break;
}
}
if (!found) {
d->m_expressions.removeAt(d->m_expressions.indexOf(translation->entry()));
}
invalidateChildLessonEntries();
}
KEduVocTranslation * KEduVocLeitnerBox::translation(int row)
{
return d->m_translations.value(row);
}
KEduVocExpression * KEduVocLeitnerBox::entry(int row, EnumEntriesRecursive recursive)
{
Q_UNUSED(recursive)
return entries().value(row);
}
|