void KstDataObject::replaceDependency(KstDataObjectPtr oldObject, KstDataObjectPtr newObject) {
//
// find all connections from this object to old object
//
for (KstVectorMap::Iterator j = oldObject->outputVectors().begin(); j != oldObject->outputVectors().end(); ++j) {
for (KstVectorMap::Iterator k = _inputVectors.begin(); k != _inputVectors.end(); ++k) {
if (*j == *k) {
// replace input with the output from newObject
_inputVectors[k.key()] = (newObject->outputVectors())[j.key()];
}
}
// also replace dependencies on vector stats
for (KstScalarMap::Iterator k = _inputScalars.begin(); k != _inputScalars.end(); ++k) {
for (ScalarCollection::const_iterator l = (*j)->scalars().begin(); l != (*j)->scalars().end(); ++l) {
if (*l == *k) {
_inputScalars[k.key()] = (((newObject->outputVectors())[j.key()])->scalars())[l.key()];
}
}
}
}
for (KstMatrixMap::Iterator j = oldObject->outputMatrices().begin(); j != oldObject->outputMatrices().end(); ++j) {
for (KstMatrixMap::Iterator k = _inputMatrices.begin(); k != _inputMatrices.end(); ++k) {
if (*j == *k) {
// replace input with the output from newObject
_inputMatrices[k.key()] = (newObject->outputMatrices())[j.key()];
}
}
// also replace dependencies on matrix stats
for (KstScalarMap::Iterator k = _inputScalars.begin(); k != _inputScalars.end(); ++k) {
for (ScalarCollection::const_iterator l=(*j)->scalars().begin(); l != (*j)->scalars().end(); ++l) {
if (*l == *k) {
_inputScalars[k.key()] = (((newObject->outputMatrices())[j.key()])->scalars())[l.key()];
}
}
}
}
for (KstScalarMap::Iterator j = oldObject->outputScalars().begin(); j != oldObject->outputScalars().end(); ++j) {
for (KstScalarMap::Iterator k = _inputScalars.begin(); k != _inputScalars.end(); ++k) {
if (*j == *k) {
// replace input with the output from newObject
_inputScalars[k.key()] = (newObject->outputScalars())[j.key()];
}
}
}
for (KstStringMap::Iterator j = oldObject->outputStrings().begin(); j != oldObject->outputStrings().end(); ++j) {
for (KstStringMap::Iterator k = _inputStrings.begin(); k != _inputStrings.end(); ++k) {
if (*j == *k) {
// replace input with the output from newObject
_inputStrings[k.key()] = (newObject->outputStrings())[j.key()];
}
}
}
}
void KstEquation::replaceDependency(KstDataObjectPtr oldObject, KstDataObjectPtr newObject) {
QString newExp = _equation;
// replace all occurences of outputVectors, outputScalars from oldObject
for (KstVectorMap::Iterator j = oldObject->outputVectors().begin(); j != oldObject->outputVectors().end(); ++j) {
QString oldTag = j.data()->tagName();
QString newTag = ((newObject->outputVectors())[j.key()])->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
for (KstScalarMap::Iterator j = oldObject->outputScalars().begin(); j != oldObject->outputScalars().end(); ++j) {
QString oldTag = j.data()->tagName();
QString newTag = ((newObject->outputScalars())[j.key()])->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
// and dependencies on matrix stats (there won't be matrices themselves in the expression)
for (KstMatrixMap::Iterator j = oldObject->outputMatrices().begin(); j != oldObject->outputMatrices().end(); ++j) {
QDictIterator<KstScalar> scalarDictIter(j.data()->scalars());
for (; scalarDictIter.current(); ++scalarDictIter) {
QString oldTag = scalarDictIter.current()->tagName();
QString newTag = ((((newObject->outputMatrices())[j.key()])->scalars())[scalarDictIter.currentKey()])->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
}
// only replace _inputVectors
for (KstVectorMap::Iterator j = oldObject->outputVectors().begin(); j != oldObject->outputVectors().end(); ++j) {
for (KstVectorMap::Iterator k = _inputVectors.begin(); k != _inputVectors.end(); ++k) {
if (j.data().data() == k.data().data()) {
// replace input with the output from newObject
_inputVectors[k.key()] = (newObject->outputVectors())[j.key()];
}
}
// and dependencies on vector stats
QDictIterator<KstScalar> scalarDictIter(j.data()->scalars());
for (; scalarDictIter.current(); ++scalarDictIter) {
QString oldTag = scalarDictIter.current()->tagName();
QString newTag = ((((newObject->outputVectors())[j.key()])->scalars())[scalarDictIter.currentKey()])->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
}
setEquation(newExp);
}
void EventMonitorEntry::replaceDependency(KstDataObjectPtr oldObject, KstDataObjectPtr newObject) {
QString newExp = _event;
// replace all occurences of outputVectors, outputScalars from oldObject
for (KstVectorMap::ConstIterator j = oldObject->outputVectors().begin(); j != oldObject->outputVectors().end(); ++j) {
const QString oldTag = j.value()->tagName();
const QString newTag = newObject->outputVectors()[j.key()]->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
for (KstScalarMap::ConstIterator j = oldObject->outputScalars().begin(); j != oldObject->outputScalars().end(); ++j) {
const QString oldTag = j.value()->tagName();
const QString newTag = newObject->outputScalars()[j.key()]->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
// and dependencies on vector stats
for (KstVectorMap::ConstIterator j = oldObject->outputVectors().begin(); j != oldObject->outputVectors().end(); ++j) {
const QHash<QString, KstScalar*>& scalarMap(newObject->outputVectors()[j.key()]->scalars());
QHashIterator<QString, KstScalar*> scalarDictIter(j.value()->scalars());
while (scalarDictIter.hasNext()) {
const QString oldTag = scalarDictIter.next().value()->tagName();
const QString newTag = scalarMap[scalarDictIter.key()]->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
}
// and dependencies on matrix stats
for (KstMatrixMap::ConstIterator j = oldObject->outputMatrices().begin(); j != oldObject->outputMatrices().end(); ++j) {
const QHash<QString, KstScalar*>& scalarMap(newObject->outputMatrices()[j.key()]->scalars());
QHashIterator<QString, KstScalar*> scalarDictIter(j.value()->scalars());
while (scalarDictIter.hasNext()) {
const QString oldTag = scalarDictIter.next().value()->tagName();
const QString newTag = scalarMap[scalarDictIter.key()]->tagName();
newExp = newExp.replace("[" + oldTag + "]", "[" + newTag + "]");
}
}
setEvent(newExp);
setDirty();
// events have no _inputVectors
}
KstObjectItem::KstObjectItem(QListView *parent, KstDataObjectPtr x, KstDataManagerI *dm, int localUseCount)
: QObject(), QListViewItem(parent), _rtti(RTTI_OBJ_OBJECT), _tag(x->tag()), _dm(dm) {
assert(x);
_inUse = false;
setText(0, x->tag().tag());
for (KstVectorMap::Iterator i = x->outputVectors().begin();
i != x->outputVectors().end();
++i) {
KstObjectItem *item = new KstObjectItem(this, i.data(), _dm);
connect(item, SIGNAL(updated()), this, SIGNAL(updated()));
}
for (KstMatrixMap::Iterator i = x->outputMatrices().begin();
i != x->outputMatrices().end();
++i) {
KstObjectItem *item = new KstObjectItem(this, i.data(), _dm);
connect(item, SIGNAL(updated()), this, SIGNAL(updated()));
}
x = 0L; // keep the counts in sync
update(false, localUseCount);
}
void KstObjectItem::update(bool recursive, int localUseCount) {
switch (_rtti) {
case RTTI_OBJ_DATA_VECTOR:
{
KST::vectorList.lock().readLock();
KstRVectorPtr x = kst_cast<KstRVector>(*KST::vectorList.findTag(_tag));
KST::vectorList.lock().unlock();
if (x) {
x->readLock();
// getUsage: subtract 1 for KstRVectorPtr x
bool inUse = (x->getUsage() - 1 - localUseCount) > 0;
if (inUse != _inUse) {
_inUse = inUse;
setPixmap(2, inUse ? _dm->yesPixmap() : QPixmap());
}
QString field;
if (inUse) {
field = QString::number(x->length());
} else {
field = "-";
}
if (text(3) != field) {
setText(3, field);
}
field = i18n("%3: %4 [%1..%2]").arg(x->reqStartFrame())
.arg(x->reqStartFrame() + x->reqNumFrames())
.arg(x->filename())
.arg(x->field());
if (text(4) != field) {
setText(4, field);
}
_removable = x->getUsage() == 2;
x->unlock();
}
// Hmmm what happens if this if() fails?? We become inconsistent?
break;
}
case RTTI_OBJ_STATIC_VECTOR:
{
KST::vectorList.lock().readLock();
KstSVectorPtr x = kst_cast<KstSVector>(*KST::vectorList.findTag(_tag));
KST::vectorList.lock().unlock();
if (x) {
x->readLock();
// getUsage: subtract 1 for KstRVectorPtr x
bool inUse = (x->getUsage() - 1 - localUseCount) > 0;
if (inUse != _inUse) {
_inUse = inUse;
setPixmap(2, inUse ? _dm->yesPixmap() : QPixmap());
}
QString field;
if (inUse) {
field = QString::number(x->length());
} else {
field = "-";
}
if (text(3) != field) {
setText(3, field);
}
field = i18n("%1 to %2").arg(x->min()).arg(x->max());
if (text(4) != field) {
setText(4, field);
}
_removable = x->getUsage() == 2;
x->unlock();
}
// Hmmm what happens if this if() fails?? We become inconsistent?
break;
}
case RTTI_OBJ_VECTOR:
{
KST::vectorList.lock().readLock();
KstVectorPtr x = *KST::vectorList.findTag(_tag);
KST::vectorList.lock().unlock();
if (x) {
x->readLock();
// getUsage:
// subtract 1 for KstVectorPtr x
bool inUse = (x->getUsage() - 1 - localUseCount) > 0;
if (inUse != _inUse) {
_inUse = inUse;
setPixmap(2, inUse ? _dm->yesPixmap() : QPixmap());
}
QString field = QString::number(x->length());
if (text(3) != field) {
setText(3, field);
}
field = i18n("[%1..%2]").arg(x->min()).arg(x->max());
if (text(4) != field) {
setText(4, field);
}
x->unlock();
_removable = false;
}
break;
}
case RTTI_OBJ_OBJECT:
{
KST::dataObjectList.lock().readLock();
KstDataObjectPtr x = *KST::dataObjectList.findTag(_tag.tag());
KST::dataObjectList.lock().unlock();
if (x) {
x->readLock();
QString field = x->typeString();
if (text(1) != field) {
setText(1, field);
}
// getUsage:
// subtract 1 for KstDataObjectPtr x
bool inUse = (x->getUsage() - 1 - localUseCount) > 0;
if (inUse != _inUse) {
_inUse = inUse;
setPixmap(2, inUse ? _dm->yesPixmap() : QPixmap());
}
if (x->sampleCount() > 0) {
field = QString::number(x->sampleCount());
if (text(3) != field) {
setText(3, field);
}
} else {
if (text(3) != "-") {
setText(3, "-");
}
}
field = x->propertyString();
if (text(4) != field) {
setText(4, field);
}
if (recursive) {
QPtrStack<QListViewItem> trash;
KstVectorMap vl = x->outputVectors();
KstVectorMap::Iterator vlEnd = vl.end();
for (QListViewItem *i = firstChild(); i; i = i->nextSibling()) {
KstObjectItem *oi = static_cast<KstObjectItem*>(i);
if (vl.findTag(oi->tag().tag()) == vlEnd) {
trash.push(i);
}
}
trash.setAutoDelete(true);
trash.clear();
// get the output vectors
for (KstVectorMap::Iterator p = vl.begin(); p != vlEnd; ++p) {
bool found = false;
QString tn = p.data()->tag().tag();
for (QListViewItem *i = firstChild(); i; i = i->nextSibling()) {
KstObjectItem *oi = static_cast<KstObjectItem*>(i);
if (oi->tag().tag() == tn) {
oi->update();
found = true;
break;
}
}
if (!found) {
KstObjectItem *item = new KstObjectItem(this, p.data(), _dm);
connect(item, SIGNAL(updated()), this, SIGNAL(updated()));
}
}
KstMatrixMap ml = x->outputMatrices();
KstMatrixMap::Iterator mlEnd = ml.end();
// also get the output matrices
for (KstMatrixMap::Iterator p = ml.begin(); p != mlEnd; ++p) {
bool found = false;
QString tn = p.data()->tag().tag();
for (QListViewItem *i = firstChild(); i; i = i->nextSibling()) {
KstObjectItem *oi = static_cast<KstObjectItem*>(i);
if (oi->tag().tag() == tn) {
oi->update();
found = true;
break;
}
}
if (!found) {
KstObjectItem *item = new KstObjectItem(this, p.data(), _dm);
connect(item, SIGNAL(updated()), this, SIGNAL(updated()));
}
}
}
_removable = x->getUsage() == 1;
x->unlock();
}
break;
}
case RTTI_OBJ_DATA_MATRIX:
{
KST::matrixList.lock().readLock();
KstRMatrixPtr x = kst_cast<KstRMatrix>(*KST::matrixList.findTag(_tag));
KST::matrixList.lock().unlock();
if (x) {
x->readLock();
// getUsage: subtract 1 for KstRMatrixPtr x
bool inUse = (x->getUsage() - 1 - localUseCount) > 0;
if (inUse != _inUse) {
_inUse = inUse;
setPixmap(2, inUse ? _dm->yesPixmap() : QPixmap());
}
QString field = QString::number(x->sampleCount());
if (text(3) != field) {
setText(3, field);
}
field = i18n("%1: %2 (%3 by %4)").arg(x->filename()).arg(x->field())
.arg(x->xNumSteps())
.arg(x->yNumSteps());
if (text(4) != field) {
setText(4, field);
}
_removable = x->getUsage() == 2;
x->unlock();
}
break;
}
case RTTI_OBJ_STATIC_MATRIX:
{
KST::matrixList.lock().readLock();
KstSMatrixPtr x = kst_cast<KstSMatrix>(*KST::matrixList.findTag(_tag));
KST::matrixList.lock().unlock();
if (x) {
x->readLock();
// getUsage: subtract 1 for KstRMatrixPtr x
bool inUse = (x->getUsage() - 1 - localUseCount) > 0;
if (inUse != _inUse) {
_inUse = inUse;
setPixmap(2, inUse ? _dm->yesPixmap() : QPixmap());
}
QString field = QString::number(x->sampleCount());
if (text(3) != field) {
setText(3, field);
}
field = i18n("%1 to %2").arg(x->gradZMin()).arg(x->gradZMax());
if (text(4) != field) {
setText(4, field);
}
_removable = x->getUsage() == 2;
x->unlock();
}
break;
}
case RTTI_OBJ_MATRIX:
{
KST::matrixList.lock().readLock();
KstMatrixPtr x = *KST::matrixList.findTag(_tag);
KST::matrixList.lock().unlock();
if (x) {
x->readLock();
// getUsage:
// subtract 1 for KstVectorPtr x
bool inUse = (x->getUsage() - 1 - localUseCount) > 0;
if (inUse != _inUse) {
_inUse = inUse;
setPixmap(2, inUse ? _dm->yesPixmap() : QPixmap());
}
QString field = QString::number(x->sampleCount());
if (text(3) != field) {
setText(3, field);
}
field = i18n("[%1..%2]").arg(x->minValue()).arg(x->maxValue());
if (text(4) != field) {
setText(4, field);
}
x->unlock();
_removable = false;
}
break;
}
default:
assert(0);
}
}