/* This file is part of Akregator. Copyright (C) 2004 Frank Osterfeld 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. This program 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. As a special exception, permission is given to link this program with any edition of TQt, and distribute the resulting executable, without including the source code for TQt in the source distribution. */ #include "folder.h" #include "treenode.h" #include #include #include namespace Akregator { class TreeNode::TreeNodePrivate { public: bool doNotify; bool nodeChangeOccurred; bool articleChangeOccurred; TQString title; Folder* parent; uint id; bool signalDestroyedEmitted; }; TreeNode::TreeNode() : TQObject(0, 0), d(new TreeNodePrivate) { d->doNotify = true; d->nodeChangeOccurred = false; d->articleChangeOccurred = false; d->title = ""; d->parent = 0; d->id = 0; d->signalDestroyedEmitted = false; } void TreeNode::emitSignalDestroyed() { if (!d->signalDestroyedEmitted) { emit signalDestroyed(this); d->signalDestroyedEmitted = true; } } TreeNode::~TreeNode() { delete d; d = 0; } const TQString& TreeNode::title() const { return d->title; } void TreeNode::setTitle(const TQString& title) { if (d->title != title) { d->title = title; nodeModified(); } } TreeNode* TreeNode::nextSibling() const { if (!d->parent) return 0; TQValueList children = d->parent->children(); TreeNode* me = (TreeNode*)this; int idx = children.findIndex(me); return idx+1 < children.size() ? *(children.at(idx+1)) : 0L; } TreeNode* TreeNode::prevSibling() const { if (!d->parent) return 0; TQValueList children = d->parent->children(); TreeNode* me = (TreeNode*)this; int idx = children.findIndex(me); return idx > 0 ? *(d->parent->children().at(idx-1)) : 0L; } Folder* TreeNode::parent() const { return d->parent; } void TreeNode::setParent(Folder* parent) { d->parent = parent; } void TreeNode::setNotificationMode(bool doNotify, bool notifyOccurredChanges) { if (doNotify && !d->doNotify) // turned on { d->doNotify = true; if (d->nodeChangeOccurred && notifyOccurredChanges) emit signalChanged(this); if (d->articleChangeOccurred && notifyOccurredChanges) doArticleNotification(); d->nodeChangeOccurred = false; d->articleChangeOccurred = false; } if (!doNotify && d->doNotify) //turned off { d->nodeChangeOccurred = false; d->articleChangeOccurred = false; d->doNotify = false; } } uint TreeNode::id() const { return d->id; } void TreeNode::setId(uint id) { d->id = id; } void TreeNode::nodeModified() { if (d->doNotify) emit signalChanged(this); else d->nodeChangeOccurred = true; } void TreeNode::articlesModified() { if (d->doNotify) doArticleNotification(); else d->articleChangeOccurred = true; } void TreeNode::doArticleNotification() { } } // namespace Akregator #include "treenode.moc"