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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
*
* XPLC - Cross-Platform Lightweight Components
* Copyright (C) 2000, Pierre Phaneuf
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*/
#ifndef __XPLC_CATEGORYNODE_H__
#define __XPLC_CATEGORYNODE_H__
#include <string.h>
#include <stdlib.h>
class CategoryEntryNode {
public:
CategoryEntryNode* next;
UUID entry;
char* str;
CategoryEntryNode(const UUID& aUuid,
const char* aStr,
CategoryEntryNode* aNext): next(aNext),
entry(aUuid),
str(aStr ? strdup(aStr) : 0) {
}
~CategoryEntryNode() {
if(next)
delete next;
if(str)
free(str);
}
};
class CategoryNode {
public:
CategoryNode* next;
UUID category;
CategoryEntryNode* entries;
CategoryNode(const UUID& aUuid,
CategoryNode* aNext): next(aNext),
category(aUuid),
entries(0) {
}
~CategoryNode() {
if(entries)
delete entries;
if(next)
delete next;
}
};
#endif /* __XPLC_CATEGORYNODE_H__ */
|
