You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
50 lines
1.6 KiB
50 lines
1.6 KiB
15 years ago
|
/*
|
||
|
|
This file is part of Akregator.
|
||
|
|
|
||
|
|
Copyright (C) 2005 Frank Osterfeld <frank.osterfeld at 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.
|
||
|
|
|
||
|
|
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 Qt, and distribute the resulting executable,
|
||
|
|
without including the source code for Qt in the source distribution.
|
||
|
|
*/
|
||
|
|
#ifndef AKREGATOR_TREENODEVISITOR_H
|
||
|
|
#define AKREGATOR_TREENODEVISITOR_H
|
||
|
|
|
||
|
|
namespace Akregator
|
||
|
|
{
|
||
|
|
|
||
|
|
class TreeNode;
|
||
|
|
class Folder;
|
||
|
|
class Feed;
|
||
|
|
class TagNode;
|
||
|
|
class TagFolder;
|
||
|
|
|
||
|
|
class TreeNodeVisitor
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
virtual bool visit(TreeNode* node);
|
||
|
|
virtual bool visitTreeNode(TreeNode* /*node*/) { return false; }
|
||
|
|
virtual bool visitFolder(Folder* /*node*/) { return false; }
|
||
|
|
virtual bool visitTagFolder(TagFolder* /*node*/) { return false; }
|
||
|
|
virtual bool visitFeed(Feed* /*node*/) { return false; }
|
||
|
|
virtual bool visitTagNode(TagNode* /*node*/) { return false; }
|
||
|
|
};
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|