blob: e5668e4ef25c6891ecabaa829eec1106df640627 (
plain)
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
|
/***************************************************************************
* Copyright (C) 2004 by Jason Kivlighn *
* ([email protected]) *
* *
* 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. *
***************************************************************************/
#ifndef CATEGORYTREE_H
#define CATEGORYTREE_H
#include "element.h"
class CategoryTree
{
public:
CategoryTree( CategoryTree *parent = 0 );
~CategoryTree();
Element category;
CategoryTree *add
( const Element &cat );
void clear();
bool contains( int id ) const;
CategoryTree* find( int id ) const;
CategoryTree *parent() const
{
return m_parent;
}
CategoryTree *firstChild() const
{
return m_child;
}
CategoryTree *nextSibling() const
{
return m_sibling;
}
void takeItem( CategoryTree * );
void insertItem( CategoryTree * );
int count() const { return m_count; }
private:
CategoryTree( const CategoryTree & );
CategoryTree &operator=( const CategoryTree & );
CategoryTree *m_parent;
CategoryTree *m_child;
CategoryTree *m_sibling;
CategoryTree *m_last;
int m_count;
};
#endif
|
